{"as_of":"2026-08-19T20:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf4e0d316d8a451b0e750278923f13309c039e389ef3188c628dbe7812e2bc2a","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:09:08.343854Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2509.10941/citation-record","integrity":"/paper/2509.10941/integrity","json":"/paper/2509.10941/citation-record.json","paper":"/paper/2509.10941"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.715359Z","title":"Aigner and M","venue":null,"work_id":"c98f6a37-de87-4774-8dd0-79812e373c1b","year":1984},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.242039Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:30f6249ec5f5e82df93735b0af3385369a1a33e5e565af1431dbedda614d229e","observation_id":"0b0d3750-271c-4c17-8a47-87b43f5aad37","resolution":{"observed_at":"2026-08-15T16:09:08.719711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.700949Z","title":null,"venue":null,"work_id":"308023b1-1fca-4df6-874e-ba8507774365","year":1986},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.247287Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:c6b1a60e2b1a2e24e08a778f8c5f07573298cd7761555030d2dfbdd9703bf526","observation_id":"b2053a0d-134d-4626-92ad-fbc1d9081cd2","resolution":{"observed_at":"2026-08-15T16:09:08.705553Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.686027Z","title":"Baird, A","venue":null,"work_id":"da1eacd7-ae3e-4318-8eae-ce095a9de87e","year":2014},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.252081Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:954229d8e8a635b1d0bd65596283f17b34f9292703b931d534e1f791576e558e","observation_id":"e8d157de-9da9-46e1-9b14-90440ec54c04","resolution":{"observed_at":"2026-08-15T16:09:08.690436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.670773Z","title":"Bonato and R","venue":null,"work_id":"0fffa531-89b7-4612-89b3-7168095df724","year":2011},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.257020Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:31438c6d57a7e4461b2e83f63316a1fe0de430c87ab131bb582ac0862ac46b38","observation_id":"3b672c65-6390-4db9-bb3e-3ffe22dd328d","resolution":{"observed_at":"2026-08-15T16:09:08.675834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15416","last_updated":"2025-05-21T12:00:32Z","snapshot_observed_at":"2026-08-19T09:00:59.431670Z","submitted_at":"2025-05-21T12:00:32Z","title":"$4K_1$-free graph with the cop number $3$","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15416","snapshot_observed_at":"2026-08-15T16:09:08.261913Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.261913Z"},"links":{"cited_paper":"/paper/2505.15416","citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:28cb19f2b5377b5e3eddf91fe5700bcc22d7a10b720720f02e9c4bd14e3be8ae","observation_id":"08feb5cc-2b3c-48ae-9e84-5e6db06b376c","resolution":{"observed_at":"2026-08-15T16:09:08.261913Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.654738Z","title":"Chudnovsky, S","venue":null,"work_id":"1a4c5d0d-65fb-45a1-8c76-3ebfcb916600","year":2024},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.266741Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:4fc5bffaac20c0dad39c5f29b70c82470fd4de3a998d1c7451f1fcb8fb91adf2","observation_id":"acaa9ef4-8677-4786-9ab5-93a419054f3d","resolution":{"observed_at":"2026-08-15T16:09:08.659723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.14321","last_updated":"2025-07-18T18:50:02Z","snapshot_observed_at":"2026-08-15T03:14:59.814317Z","submitted_at":"2025-07-18T18:50:02Z","title":"Cops and Robbers, Clique Covers, and Induced Cycles","version":1},"cited_work":{"arxiv_id":"2507.14321","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.14321","snapshot_observed_at":"2026-08-15T16:09:08.421085Z","title":"Cops and Robbers, Clique Covers, and Induced Cycles","venue":"math.CO","work_id":"0cd01484-0950-4785-bd1a-2a920cd12d03","year":2025},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.271703Z"},"links":{"cited_paper":"/paper/2507.14321","citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:e9a9dd4c691bcefe6ae15e4553d7a9a189382f56ff8bbbb16f3378cc75b8a86f","observation_id":"14581bc1-4ff5-4695-916b-2e149a621007","resolution":{"observed_at":"2026-08-15T16:09:08.426622Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.639746Z","title":null,"venue":null,"work_id":"d9231658-022c-464f-8e73-e7acc6a1b5b6","year":2023},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.276864Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:bb1a6c4cb5e0c9640957591b38f08dda149558fcae2e8cf21d78c620aef55e93","observation_id":"0c50bbdf-bc2d-4993-a356-b4e9c368b939","resolution":{"observed_at":"2026-08-15T16:09:08.643853Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.622101Z","title":"Joret, M","venue":null,"work_id":"2d02995c-dfa2-42a2-80e3-21d268230550","year":2010},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.281683Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:8455c26be69b46804ddac7a192212f9de796279eee41d361c2e2cc82070f9285","observation_id":"c44d3841-347d-411b-ac91-05e1b164aa5a","resolution":{"observed_at":"2026-08-15T16:09:08.628729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.605586Z","title":"Kenter, E","venue":null,"work_id":"1edfeb4e-5377-4891-8398-56651191489b","year":2025},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.286676Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:09c6337382427d89ef0845aba66eee25af7e262a3eaaf07ddb6a08a0b9a3732d","observation_id":"b5bdb7e2-2734-4f59-90e5-1f50d3cd70f7","resolution":{"observed_at":"2026-08-15T16:09:08.610161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.11478","last_updated":"2019-08-29T23:10:24Z","snapshot_observed_at":"2026-08-14T10:12:04.122104Z","submitted_at":"2019-08-29T23:10:24Z","title":"The Cop Number of Graphs with Forbidden Induced Subgraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.11478","snapshot_observed_at":"2026-08-15T16:09:08.291443Z","title":null,"venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.291443Z"},"links":{"cited_paper":"/paper/1908.11478","citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:1e5cd9d5caaae800125a611412cdfeaa4b98f94bc4ea3224f86b924488418c59","observation_id":"ac438e3f-73a9-417d-848d-7e59c4da12b1","resolution":{"observed_at":"2026-08-15T16:09:08.291443Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.591572Z","title":"Lu and X","venue":null,"work_id":"2773ab1a-1909-4b12-8a21-ad884f112289","year":2012},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.296901Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:95f232435b5a00460f9886f484ea9b8f766be9e6cfc41b48761450ea21b8e677","observation_id":"e9e9dfe9-e692-4c11-a27c-798d8a5e7089","resolution":{"observed_at":"2026-08-15T16:09:08.595845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.576662Z","title":"Masjoody and L","venue":null,"work_id":"15227fd9-1218-4630-a659-7e92260a5569","year":2020},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.301259Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:9c5a940a20c5d129512c71bd32a155f626ee4f5e8732bc3288fc29a2e7c978a3","observation_id":"68c09242-1d81-403c-b0ed-8f6700210a2a","resolution":{"observed_at":"2026-08-15T16:09:08.580831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.560089Z","title":"Nowakowski and P","venue":null,"work_id":"56f58fc4-99d4-4e64-a296-4e821fc0d85a","year":1983},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.305967Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:3ca0fac9effcac146e7ce951e7e5a602fd2cfe72b5d8f765c71533481ce4bc12","observation_id":"bacfd809-eee6-44d3-ad66-0950c80c90b6","resolution":{"observed_at":"2026-08-15T16:09:08.566281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.541637Z","title":null,"venue":null,"work_id":"52ae4520-15f2-41eb-b3fa-aa0cc41195da","year":2023},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.309966Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:691f52288e6eab94542956666c6c2b50b3c50b1ad9113b24a2dd739424af2a8f","observation_id":"fdcdca1f-6442-4f4c-b251-38a87904bccb","resolution":{"observed_at":"2026-08-15T16:09:08.548287Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-15T16:09:08.314977Z","title":"Quilliot","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.314977Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:bcb98bbec5adbdf307fe83feb79e6bd2b8c08b9f2fb405f70631144fed3bef75","observation_id":"223b24ed-02d7-45bd-b8b4-3ff4501fcab4","resolution":{"observed_at":"2026-08-15T16:09:08.314977Z","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-08-15T16:09:08.318674Z","title":"Sivaraman","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.318674Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:ddc027d675d23e7b43bd0d9a5524df9863047a7964f5e9a4bd0fb0e6695695e0","observation_id":"f2558abf-51ca-4e74-aa8b-f07d67f5632f","resolution":{"observed_at":"2026-08-15T16:09:08.318674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.11484","last_updated":"2019-03-27T15:23:25Z","snapshot_observed_at":"2026-08-14T16:55:56.139416Z","submitted_at":"2019-03-27T15:23:25Z","title":"Cop number of $2K_2$-free graphs","version":1},"cited_work":{"arxiv_id":"1903.11484","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.11484","snapshot_observed_at":"2026-08-15T16:09:08.381374Z","title":"Cop number of $2K_2$-free graphs","venue":"math.CO","work_id":"95d8b3d4-be62-4281-859d-ff9c83ef0b8a","year":2019},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.325388Z"},"links":{"cited_paper":"/paper/1903.11484","citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:7856dfffbc267f95b7bb47e2b94145c28d9a7e2fb197c656302d637fffdde81c","observation_id":"dffa4f7e-2af4-4202-aa1c-e4515521872a","resolution":{"observed_at":"2026-08-15T16:09:08.387381Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.504105Z","title":"Turcotte","venue":null,"work_id":"073f1707-013b-4e14-be35-f58ff662b3ec","year":2022},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.330141Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:be05c64918043dc6dbe5ccaf9ad39b3da264d2b03c71e52b93f35934d31c9dc4","observation_id":"ed1daa8a-5eec-4dd4-909a-bcaa02fca174","resolution":{"observed_at":"2026-08-15T16:09:08.509120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.489188Z","title":"Turcotte and S","venue":null,"work_id":"0176f566-2e59-41b5-9294-5e7773e65c94","year":2021},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.334414Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:2f438f04c21a3427a0f78b39d9f3216b7e4261ca5f973b528a9bd5e6675d62e7","observation_id":"1af632b1-3045-43fc-a733-6af92c663792","resolution":{"observed_at":"2026-08-15T16:09:08.493530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.473264Z","title":null,"venue":null,"work_id":"13d7a026-a8a9-47af-92b2-fa5419baf7d2","year":2015},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.339297Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:4b7ec13a62fed995ca09b222f7fddb6400436653bde47ac1b2dca68757e9c5f3","observation_id":"dd3ef3f6-e337-451b-a0de-85d28e51372b","resolution":{"observed_at":"2026-08-15T16:09:08.478297Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:09:08.455040Z","title":null,"venue":null,"work_id":"c637982f-391e-4ccd-80e8-0db3e686ca85","year":2001},"citing_paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:09:08.343854Z"},"links":{"citing_paper":"/paper/2509.10941"},"observation_digest":"sha256:e5b0015278bd29fdea7a35e5c2b66fd0335b394beca3ba7b0e8b5285cac84e47","observation_id":"174c8be4-85ea-461a-b04a-7c67976efe1d","resolution":{"observed_at":"2026-08-15T16:09:08.460785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.10941","last_updated":"2025-09-13T18:47:14Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-19T17:35:28.209837Z","submitted_at":"2025-09-13T18:47:14Z","title":"Cops and Robbers on Graphs with Path Constraints"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":22},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2509.10941."}