{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:59:47Z","timestamp":1772197187045,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115789","type":"journal-article","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T07:38:13Z","timestamp":1769672293000},"page":"115789","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["ALL ordinals are cop-robber ordinals"],"prefix":"10.1016","volume":"1068","author":[{"given":"Jorge","family":"Cruz Chapital","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Fl\u00eddr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0817-3777","authenticated-orcid":false,"given":"Maria-Romina","family":"Ivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115789_bib0001","doi-asserted-by":"crossref","unstructured":"R. Nowakowski, P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Math. 431983, pp. 235\u2013239.","DOI":"10.1016\/0012-365X(83)90160-7"},{"key":"10.1016\/j.tcs.2026.115789_bib0002","article-title":"The game of cops and robbers on graphs","author":"Bonato","year":"2011","journal-title":"Am. Math. Soc."},{"key":"10.1016\/j.tcs.2026.115789_bib0003","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tcs.2022.07.023","article-title":"Constructible graphs and pursuit","volume":"930","author":"Ivan","year":"2022","journal-title":"Theor Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115789_bib0004","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1016\/j.disc.2016.12.019","article-title":"Cops and robbers ordinals of cop-win trees","volume":"340","author":"Bonato","year":"2017","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.115789_bib0005","unstructured":"T. Fl\u00eddr, M.-R. Ivan, A Cop-Win Graph wth Maximum Capture Time \u03c9, arXiv: 2507.22276. edition, 2025."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000484?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000484?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:05:58Z","timestamp":1772193958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":5,"alternative-id":["S0304397526000484"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115789","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"ALL ordinals are cop-robber ordinals","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115789","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115789"}}