{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RIJAI2ZCQFPB2IBE4LVFOPHABV","short_pith_number":"pith:RIJAI2ZC","schema_version":"1.0","canonical_sha256":"8a12046b22815e1d2024e2ea573ce00d5c5168c266b417a555080182d2da4465","source":{"kind":"arxiv","id":"1705.11184","version":3},"attestation_state":"computed","paper":{"title":"The Cop Number of the One-Cop-Moves Game on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Boting Yang, Ziyuan Gao","submitted_at":"2017-05-31T17:25:44Z","abstract_excerpt":"Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each other's positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.11184","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T17:25:44Z","cross_cats_sorted":[],"title_canon_sha256":"0aa9721c62ae36f44efd3943f1aa52e1ca25e23d3fc940e56274cffaae954b92","abstract_canon_sha256":"4e184cd39f4d526574b7acf633b51cda996d50b298dc141e49cde817d22c0d94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:47.947085Z","signature_b64":"FtlJ8p03da7cSKQgv5rXHxfZqdUFSVQBE1RbpCsElr0POjJnPQAFG5zvcuknVO3KnY+IRRx5meIrTvOaZtGOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a12046b22815e1d2024e2ea573ce00d5c5168c266b417a555080182d2da4465","last_reissued_at":"2026-05-18T00:13:47.946425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:47.946425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Cop Number of the One-Cop-Moves Game on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Boting Yang, Ziyuan Gao","submitted_at":"2017-05-31T17:25:44Z","abstract_excerpt":"Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each other's positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11184","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.11184","created_at":"2026-05-18T00:13:47.946538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.11184v3","created_at":"2026-05-18T00:13:47.946538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11184","created_at":"2026-05-18T00:13:47.946538+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIJAI2ZCQFPB","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIJAI2ZCQFPB2IBE","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIJAI2ZC","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV","json":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV.json","graph_json":"https://pith.science/api/pith-number/RIJAI2ZCQFPB2IBE4LVFOPHABV/graph.json","events_json":"https://pith.science/api/pith-number/RIJAI2ZCQFPB2IBE4LVFOPHABV/events.json","paper":"https://pith.science/paper/RIJAI2ZC"},"agent_actions":{"view_html":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV","download_json":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV.json","view_paper":"https://pith.science/paper/RIJAI2ZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.11184&json=true","fetch_graph":"https://pith.science/api/pith-number/RIJAI2ZCQFPB2IBE4LVFOPHABV/graph.json","fetch_events":"https://pith.science/api/pith-number/RIJAI2ZCQFPB2IBE4LVFOPHABV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/action/storage_attestation","attest_author":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/action/author_attestation","sign_citation":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/action/citation_signature","submit_replication":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/action/replication_record"}},"created_at":"2026-05-18T00:13:47.946538+00:00","updated_at":"2026-05-18T00:13:47.946538+00:00"}