{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BSUZZ4LPKDJHCOSORPUQWTTVIC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b797bb105a68a537de2b3537c51f54034d3656ba4273ddac06a8dca1157bfaea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-12T02:05:56Z","title_canon_sha256":"4a7bc0260ee0166b715beadc508ce7095377a84b70d6f67175b038b15eaf1ee3"},"schema_version":"1.0","source":{"id":"1108.2549","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2549","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2549v4","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2549","created_at":"2026-05-18T04:13:54Z"},{"alias_kind":"pith_short_12","alias_value":"BSUZZ4LPKDJH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BSUZZ4LPKDJHCOSO","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BSUZZ4LP","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:fff358b6a6eaf809d6cebd94f4e7a3fdafcbe1b2334216a008bd9b003ad66cd4","target":"graph","created_at":"2026-05-18T04:13:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Cops and robbers is a turn-based pursuit game played on a graph $G$. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number $c(G)$ denotes the minimum number of cops required to catch the robber in finite time. We study the cop number of geometric graphs. For points $x_1, ..., x_n \\in \\R^2$, and $r \\in \\R^+$, the vertex set of the geometric graph $G(x_1, ..., x_n; r)$ is the graph on these $n$ points, with $x_i, x_j$ adjacent when $ \\norm{x_i -x_j} \\leq r$. We prove that $c(G) \\leq 9$ for any connected geometric gr","authors_text":"Alan Frieze, Andrew Beveridge, Andrzej Dudek, Tobias M\\\"uller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-12T02:05:56Z","title":"Cops and Robbers on Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2549","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:939cbf16fdc8bd344c944769ab828fefdd5fc8445adc3c7188f2d73b638a544d","target":"record","created_at":"2026-05-18T04:13:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b797bb105a68a537de2b3537c51f54034d3656ba4273ddac06a8dca1157bfaea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-12T02:05:56Z","title_canon_sha256":"4a7bc0260ee0166b715beadc508ce7095377a84b70d6f67175b038b15eaf1ee3"},"schema_version":"1.0","source":{"id":"1108.2549","kind":"arxiv","version":4}},"canonical_sha256":"0ca99cf16f50d2713a4e8be90b4e75409967af6bcb474bcbabfd3c27de99f6c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ca99cf16f50d2713a4e8be90b4e75409967af6bcb474bcbabfd3c27de99f6c1","first_computed_at":"2026-05-18T04:13:54.951802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:54.951802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gytz+GEHDKleHmLFk5h8OPgYsaPkKmse165Gw7jBdsuRarGlONm+7c0OR8EauGkEYxCAJdNssHGrD8hfMBcmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:54.952354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2549","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:939cbf16fdc8bd344c944769ab828fefdd5fc8445adc3c7188f2d73b638a544d","sha256:fff358b6a6eaf809d6cebd94f4e7a3fdafcbe1b2334216a008bd9b003ad66cd4"],"state_sha256":"07fd3b073005e80a2f8583f1cdc904ba4726ff5ff87f6a213193bd05c89cba4d"}