{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WMXRRYSDSYOTT7VPJRUD3KNF5M","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":"9fb76d0e8891009cbc1158ff726825fef9c1339e17e2aa891fedc368441287b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-04T17:53:29Z","title_canon_sha256":"5d2c3154aa23075f201d11e5be20d6b20cd5def107f1ca3c7457d217dbe492e3"},"schema_version":"1.0","source":{"id":"1110.0768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0768","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0768v2","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0768","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"WMXRRYSDSYOT","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WMXRRYSDSYOTT7VP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WMXRRYSD","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:c8ddba5c8e270d8633d5711585eb41724018d0637d6eb9645788774f25dd4b42","target":"graph","created_at":"2026-05-18T03:58:51Z","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":"In the game of \\emph{cops and robbers} on a graph $G = (V,E)$, $k$ cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber's turn, he moves similarly. The cops win if there is some time at which a cop is at the same vertex as the robber. Otherwise, the robber wins. The minimum number of cops required to catch the robber is called the \\emph{cop number} of $G$, and is denoted $c(G)$. Let $m_k$ be the minimum order of a connected graph satisfying $c(G) \\geq k$. Recently, Baird and Bonato determined via computer search that $m_3=10$ ","authors_text":"Aaron Maurer, Andrew Beveridge, John McCauley, Paolo Codenotti, Silviya Valeva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-04T17:53:29Z","title":"The Petersen graph is the smallest 3-cop-win graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0768","kind":"arxiv","version":2},"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:922eb0e924297bbd165ab0ebf7114232f662281225a22fe1f49792f99da089cc","target":"record","created_at":"2026-05-18T03:58:51Z","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":"9fb76d0e8891009cbc1158ff726825fef9c1339e17e2aa891fedc368441287b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-04T17:53:29Z","title_canon_sha256":"5d2c3154aa23075f201d11e5be20d6b20cd5def107f1ca3c7457d217dbe492e3"},"schema_version":"1.0","source":{"id":"1110.0768","kind":"arxiv","version":2}},"canonical_sha256":"b32f18e243961d39feaf4c683da9a5eb2af6db83636770c27139d4969149d2d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b32f18e243961d39feaf4c683da9a5eb2af6db83636770c27139d4969149d2d0","first_computed_at":"2026-05-18T03:58:51.211255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:51.211255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"08A8fGH9m7yeMWn/0MaTtS20QyPyb9lVwr2EMli8eFdxbc/LqfwFUb820aAFg75jfr+sin7smdt8gV7I0dRfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:51.211801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:922eb0e924297bbd165ab0ebf7114232f662281225a22fe1f49792f99da089cc","sha256:c8ddba5c8e270d8633d5711585eb41724018d0637d6eb9645788774f25dd4b42"],"state_sha256":"f94baaf7ce7db8d71ffdeb2dfe6669549a31ec29536e7af3f72831da303d388e"}