{"as_of":"2026-08-07T18:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e69a4c6054ee576ad1fcbfe7bad3adc292079993968db9cb6472f5daa36f1704","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T02:04:12.183555Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.29336/citation-record","integrity":"/paper/2606.29336/integrity","json":"/paper/2606.29336/citation-record.json","paper":"/paper/2606.29336"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Ranking tournaments","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:72878777ac6f083dd5392672335ad7a983d2beaeca61714a64e15565c8681e4e","observation_id":"e71d1b1c-ff2a-4cdb-88b1-4cb540ae3902","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Fast F A ST","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:4e92e0692f1356355371418735c22fbb749a60c2782cd640f5daca8e2ad32233","observation_id":"67731672-5437-4049-9055-6324a9a37aa0","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Tournaments a nd semicomplete digraphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:367f53ebc939a3e6be5bf2624df3f3777b2b01bf5d7838a574b8702f32f0b64e","observation_id":"d6c5bcb4-2362-4fa4-a169-e992c9fc5f39","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:129e5400f04ff508aa80ffc5d6e0ce7562a9222eeaa861a4dc5195b0d1057d4d","observation_id":"d98d16d2-3e10-40ac-a3c9-933114acc354","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"A polynomial algorithm for the 2-path problem for semicomplete digraphs","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:e2df459cb57f59832ab065bb19867b58afcdefd5f86de49017f08d6239255a31","observation_id":"fabccff4-1180-4e3a-8e14-a95d7b451370","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"DAG-width and par- ity games","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:e9f9c35d50870976f94b0c583dbf60531ac2292d348d2a47714272ab1c641558","observation_id":"90ef56ec-cb76-42ba-9756-a356e166d4c9","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"The minimum feedback arc set problem is NP-hard for tournaments","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:b93ea004e802e2a0b486fbdbe54c3b5dbbe4ec7a388b094bb4bbbf7aad338e4a","observation_id":"19fe90bd-a8fd-4eaa-87f5-89e34711c41d","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"A fixed-parameter algorithm for the directed feedback vertex set problem","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:46f498acef8dda8ff0ee4a86156ef7716fd54641edf11ec8c0efa5b2570b0a1b","observation_id":"1c5bab44-152b-448e-bb3e-df7a81174d25","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Computing slater rankings using simi larities among candidates","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:781582e7eba093b3dd7fa272f12673f0aaec9f18743d10e5173b93e9d3127906","observation_id":"90bc810a-0745-463b-92aa-89f29e851364","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Makowsky, and Udi Rotics","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:8794a81cd34134f51823bc268414ffc6fd8a4d35f9836cbafd78bc33842c78ff","observation_id":"9484c9b2-505d-41cd-9407-ab8e0f0718f1","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Upper bounds to the clique width of graphs","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:f4c069ed0eee895831f3e5f19e9d32a7de499dd2b30ac4530e14778810bd0328","observation_id":"bde9c9ff-b051-4e79-a3ef-6ec4b9e0f491","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":null,"venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:a9b113509c56f84afad71e8d3eae8d7cf73b493f51d8d95b7ac4c27b8383c1cb","observation_id":"b89a5fb9-1667-417e-806c-ba1cfac98e9d","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Fomin and Micha/suppress l Pilipczuk","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:3c92066271d3766239b607ba1aa351f764b51ae924a828b53de65acbadb5aedf","observation_id":"cf065ef3-068f-4857-a5c7-8165fee69b3b","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Fomin and Micha/suppress l Pilipczuk","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:31d7a7e7e1f07af47df0e7c44b0f24c240a546edd79cf432ccc695f0a27cad27","observation_id":"20ea5825-7fc2-48ae-96a0-9bce64cadaf5","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Tournament pathwi dth and topological containment","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:de08a32458dc5c5edf5ac3d9913a32f6f3b41a98285902853e284189fbdb2948","observation_id":"e6fb587a-62c3-4855-8164-b4b39fd69ebd","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Digraph width measures in parameterized algor ithmics","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:165f79bca701b034167427a1f25bf8baf7eec6803f9e094d7ce76343e4a34315","observation_id":"94222e14-f4aa-498f-841c-a275547fab41","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Are there any good digraph width measures? J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:61d7c6542824c92fc31b36cb702c81ef95ca0a7fd504d5863772f85601e48fa8","observation_id":"3a0718de-ae91-4c8a-880c-31fc3b96945b","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Giannopoulou, Paul Hunter, and Dimitrios M","venue":null,"work_id":null,"year":2089},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:7fd86938ba541dbef4a6536ac5055c71f46ab42ebc8a96c13268022dafc307f3","observation_id":"81d2573f-aa86-4f0c-aa06-e5d23c8b758c","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Digraph complexity measures and appli cations in formal language theory","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:1a8628968bab842e0db374492e1f4b6b3487fd134bd05f3cdac82bf4f933920c","observation_id":"eaba4f30-c50e-447c-989f-dea1a18f7c32","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Ac yclic coloring parameterized by directed clique-width","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:66f4c00a778289d4a7eb645b3a5d89a068aaf34e9cbdfa7314dfcc2ad16b5417","observation_id":"f69b40c6-e5e6-4658-9886-d3aef0ea8cf9","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Directed width parameters on semicomplete digraphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:8329145b3d2dda548b83434d70936d0e64d96610c08eb3a5db9c08fd9f1e4487","observation_id":"08a82cbe-bc03-4a04-8bcf-dbf734eb381f","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.11814","last_updated":"2025-07-16T00:24:53Z","snapshot_observed_at":"2026-08-06T16:58:46.996726Z","submitted_at":"2025-07-16T00:24:53Z","title":"Unavoidable butterfly minors in digraphs of large cycle rank","version":1},"cited_work":{"arxiv_id":"2507.11814","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.11814","snapshot_observed_at":"2026-06-30T02:54:10.867711Z","title":"Unavoidable butterfly minors in digraphs of large cycle rank","venue":null,"work_id":"4aa42c2a-97d6-4222-a645-923d37f8f29f","year":2025},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"cited_paper":"/paper/2507.11814","citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:315c9571abaa5cc529ccfbde7980d0af41600fd7982e49cf5f5f4d43179ce2ec","observation_id":"12d7ab00-096d-4624-a38e-279531677820","resolution":{"observed_at":"2026-06-30T02:54:10.869719Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Digraph measures: Ke lly decompositions, games, and orderings","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:b96ae963ef5da9a1914352420521e51df6b620dc10ebd52c1013bb24abdc5e17","observation_id":"327d88c2-1873-4750-8ae9-0f19b114b0f0","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:d76fedae7c93c5818c38b9d76e5cf3bef230529cd4acf5b591e766c36af6d690","observation_id":"a08697f0-17b0-4908-8510-ac6590ec1568","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Seymour, and Robi n Thomas","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:42a2341a287460ac7492e365030d25ca44edee29d184970dc7d90b9e379ca724","observation_id":"7b8df709-002d-4a54-bea1-307cdfc10c9f","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"The rank-wid th of edge-coloured graphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:f0c8c66139b47159535254bf27d592a85243145650274e23ce7f09d73d4c82f0","observation_id":"c526a837-3499-43bd-bbbd-83385fefdfa8","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Reducibility among combinatorial probl ems (1972)","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:be40d50d51eb4d9832cedfd3eaa3755ce5cd0dff72fd85d48424ea5292e476a2","observation_id":"17e248f0-06f2-4a5b-8cc8-95180cb7eb5b","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Digraphs of bounded width","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:2ce52bd4f9cf547acf43a2c446d8c7f60a4ec302f55d3ec914690f12f469ca2e","observation_id":"77e0f6d4-d905-4fbf-a212-281aace32b20","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"The loop complexity of regular even ts","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:6bfe925a7c01d80d78213137812d53356792019b900bbd348eaa7367aac51a8c","observation_id":"e5bb722d-7994-42cb-94d6-cec43cb3049c","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Sub-exponential time parameterized algorithms for graph layout problems on digr aphs with bounded independence number","venue":null,"work_id":null,"year":2065},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:7814c032017b97322d3db15607fffd8bde0d9caad52f3d7e58420ea752db261d","observation_id":"6d6db91c-032b-4c4c-9900-c61e489fecd1","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Tree -depth, subgraph coloring and homo- morphism bounds","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:d9e4b10d03f717ebd68efd26d51f036d5c3f399898e90cc8a642d2a56ef16b7c","observation_id":"af1a9b86-edfa-42b8-8d7c-3876f2bccf83","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Sparsity, volume 28 of Algorithms and Combinatorics","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:bd41b4975971251dce3aedc1e39016d0c841a1a7e8f63ec5a833d6028d643bb7","observation_id":"5ef4acb6-d9f2-4273-bd7a-6d01af856944","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"DAG-width—connectivity measure for directed graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:9b021239998f90fa3bb29cea22d86164559bc030903d7ca84f64947697370810","observation_id":"adc5ea14-f16d-4ad2-afc2-acc5756603e0","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:ad9d5d878f84a59669c38d2165062efc42ac0b8d34766966b516e7716c953cd3","observation_id":"91d29fd1-a846-4f64-b11b-5b62f6fa3b9b","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04166","last_updated":"2025-01-07T22:27:31Z","snapshot_observed_at":"2026-08-07T07:39:32.603815Z","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic","version":1},"cited_work":{"arxiv_id":"2501.04166","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.04166","snapshot_observed_at":"2026-06-30T02:54:10.871277Z","title":"Graph classes through the lens of logic","venue":null,"work_id":"43bc5c2e-a0f8-409e-8ad0-f4e64dbb17f9","year":2025},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"cited_paper":"/paper/2501.04166","citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:798e5179c56645022a63859da8537ecb8ec10ad7ab3c097ce44af5f9cbc0e7f8","observation_id":"6061886a-d972-4262-9508-775be2a3f0a3","resolution":{"observed_at":"2026-06-30T02:54:10.873176Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"A faster parameterized algorithm for treedepth","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:a05f1af5d7db18fe3a9e46d79cbe01fd57cac34ead945e036967cc238b8d2778","observation_id":"c5983f74-dced-4919-b44d-4150e9d8d84a","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:41b7b413e4fe2f6b6d517c61851746d1c6cfa74573cfe8e0dbd57a4d77a1a745","observation_id":"0d27d217-a943-4558-90cf-8464a0a04713","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Parameter ized algorithms for directed modular width","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:311fed38afc78478bc09c7ffad7525d5063d1ca2f57d65ea3a25307fa41841b9","observation_id":"dfe7d69b-5506-4036-b6f8-54633c8fccb3","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:04:12.183555Z","title":"Depth-first search and linear graph algo rithms","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:ee5a31d4e767921568395436cfb18bac9c358ce1e23ef78b752246accfdb1499","observation_id":"0adca739-a06c-4f5e-94f4-fa8dc9ce22bf","resolution":{"observed_at":"2026-06-30T02:04:12.183555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2606.29336."}