{"as_of":"2026-08-11T17:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca01f20a97107f8b1323243981907a138913eada7d3ecb2a5d04f262fa87546d","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-11T06:34:44.6726+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-08-09T23:11:42.730804Z","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:1930791114b8bc718488444b800f98b0445e1ce3af9901f49c45d271b9e69ef5","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-08-09T23:11:42.730804Z","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:7844f82610f2cc5ee7b4d14d79d3816209bbb318cae36165947db2a8e6c67d50","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-08-09T23:11:42.730804Z","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:dceaff82a4b0489f99b081f52597d628584993ba52bda78ebd3921c375b9f707","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-08-09T23:11:42.730804Z","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:785c248c03fb3cefe6ef417940241a95e09bbc00364b5933bd697430dd6e8d95","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-08-09T23:11:42.730804Z","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:f2771461383faaf779636e775cbbc3a26c9884c67fe9d52f3c39233e80df8fb6","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-08-09T23:11:42.730804Z","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:9081b7b16acf584d11540f35131c0162c1077504bacae6b56f94148e53db26a5","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-08-09T23:11:42.730804Z","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:ce1cc66bda5e4831a4f5ee737f9faa5f4b74864429f77096a7216183ed4e3a74","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-08-09T23:11:42.730804Z","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:c53982e5282a08b04718b0aeb192c1b35fb909aee3f3b3cf6df4bf201eeae70c","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-08-09T23:11:42.730804Z","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:8c634e9654ee1a1ecc3bc3f8a1415467836f27d126a7b74fcfb0d8906eb7b00e","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-08-09T23:11:42.730804Z","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:417feff0a4498d5b2d3c58500f2d21c10316e8f96fbf5b5615b7d5262923374a","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-08-09T23:11:42.730804Z","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:74acb7466bd39656fb7bdaed895920a316bb8f6985417cc9a35e7a50e00a8554","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-08-09T23:11:42.730804Z","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:da3ca8050d651dcdf58b6f184b8fe0fd07d6101b61957a9010467308d8a9b36f","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-08-09T23:11:42.730804Z","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:be397c27fb3344648b1334791d7fb54ce5a84989d571ea5f19b9fe1562b10550","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-08-09T23:11:42.730804Z","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:b472ed220556b76c548fdc05bb7345d5c7dbcb8c52515ef5cf2aff574dd08b9f","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-08-09T23:11:42.730804Z","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:6bea038055818e1fdfbf5efaec4b22e800fced1a51ed3136c10db90ff983bea1","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-08-09T23:11:42.730804Z","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:e445e8c79dae8817d6d7c810a53395964aa3bc84a503171f644c6f6508f021f7","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-08-09T23:11:42.730804Z","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:c0546b5a49351b268b26122d58acb420a74c05c70709d68633374130abb8e093","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-08-09T23:11:42.730804Z","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:c7a9e9b6c524a1cf9267c6af55c3876aecfc2bd699d5a888f9580475f9050ab5","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-08-09T23:11:42.730804Z","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:9d0289474513bfa332c633ab49c2092baa73a0992b9806d176519a61f24f6140","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-08-09T23:11:42.730804Z","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:2aa65e5bdeb39168209419479fe76083726c8d7c10b3a61d749a18d5e0f77edf","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-08-09T23:11:42.730804Z","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:cf2c671ea6165b79ad7233dcc36eb4fce68f656b978ca020264dbc87f298e9c2","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-09T23:11:18.085784Z","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-08-09T23:11:42.730804Z","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:15a7f7888a5ced06776108bf4caef3b91098554594e573e592893002b7736fe0","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-09T23:11:42.730804Z","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:e9eeacdcfec788b313f6598eb14a8ef74a701be9df713ac46cc6d65e31249c59","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-08-09T23:11:42.730804Z","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:4fbec252b89c6816e5eac96dffaa8421254a93b2b066f5eee81e38ee7f1866ef","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-08-09T23:11:42.730804Z","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:0547eb48fb2a66f79d220d4efdb5a784fd241710fa0df70fbd0bd541b7a88c26","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-08-09T23:11:42.730804Z","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:71db9be73e5218b533489edee60c4cadb325f6fb9dd1d56575aab42891640c8d","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-08-09T23:11:42.730804Z","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:7944f73ed9752ac673755624572e1cfbec4386e3ba11750b32d6f59635837c2f","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-08-09T23:11:42.730804Z","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:0547f3ed805b7536e803b5af1e322d76aea94f78bcc00da42ce2442795793894","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-08-09T23:11:42.730804Z","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:ee787d3f8a96ef20eab7dc6beaf5f68ff0cdabe19cfa3da46efc6fd8f48f3bb6","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-08-09T23:11:42.730804Z","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:b1fefe338def8abed67990cc5764baaa8679faef5e3dc8d53b25986028bf3f5c","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-08-09T23:11:42.730804Z","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:9059a7233904dcc9b8bf74a2a2b4dd0328547a27fb3afd8aaa8a67bab5b5cfbe","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-08-09T23:11:42.730804Z","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:25c8079516ed1cc0836737b812b6d07217fb7ce7db2970dc00541c0bb2342e10","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-08-09T23:11:42.730804Z","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:4fcb30fc00fccbd644ebcbcd109bc1ef2e7ba95f62c45cbc6b5705bd4c07395b","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-08-09T23:11:42.730804Z","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:c961d2cb3d02963e022cb21301d0aba8c1eabb33b675847114e26bfb8fac0b13","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-10T21:37:39.742442Z","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-08-09T23:11:42.730804Z","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:8e9a8b881482ce7015233062b30460c71d28f7cdc8784b3c312c0ab7d74235b9","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-08-09T23:11:42.730804Z","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:92b550198f6fa4c9a0c56b59d853545dad4d5a4b7903cb2feb19f4bef7586c1f","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-08-09T23:11:42.730804Z","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:b254ec982a4d9fa1254fe94f2235cb118c723b3d7ae3d4dedbfcd38e9a40b8e1","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-08-09T23:11:42.730804Z","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:0627c44af4ec5a9f2b786f0be18c9b1077907f75b99089b910e34c852dbec93b","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-08-09T23:11:42.730804Z","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:965a7c7866e9950817677e5575ff0de3279ad03a88fbbef5ae040a13e7c0db03","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-08-09T23:11:42.730804Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2606.29336."}