{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AWEBPPUNH7WFVKRQGF4RQNUYOI","short_pith_number":"pith:AWEBPPUN","canonical_record":{"source":{"id":"1706.08379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T14:02:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4724fcf2fd99ba824e191b54542b053722c01c19cfd4acfffbd4df23fd854ad5","abstract_canon_sha256":"a4ec0c935acb29691cf6cf0a1eccf642a7fcc4b71a90911d40e3ac8902668d57"},"schema_version":"1.0"},"canonical_sha256":"058817be8d3fec5aaa303179183698721c02e8cf2fa89865539232f6c02b7aa4","source":{"kind":"arxiv","id":"1706.08379","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08379","created_at":"2026-05-18T00:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08379v2","created_at":"2026-05-18T00:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08379","created_at":"2026-05-18T00:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"AWEBPPUNH7WF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AWEBPPUNH7WFVKRQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AWEBPPUN","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AWEBPPUNH7WFVKRQGF4RQNUYOI","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T14:02:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4724fcf2fd99ba824e191b54542b053722c01c19cfd4acfffbd4df23fd854ad5","abstract_canon_sha256":"a4ec0c935acb29691cf6cf0a1eccf642a7fcc4b71a90911d40e3ac8902668d57"},"schema_version":"1.0"},"canonical_sha256":"058817be8d3fec5aaa303179183698721c02e8cf2fa89865539232f6c02b7aa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:56.841252Z","signature_b64":"Fb87BK7jCIBMOtrZq7yATix715YAVq+KJ+1ZRUxmpTyyD0REo6nF9oOU1NZJZX2SH+Ri2Uk2dpsJaiTsx+fpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"058817be8d3fec5aaa303179183698721c02e8cf2fa89865539232f6c02b7aa4","last_reissued_at":"2026-05-18T00:12:56.840565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:56.840565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08379","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lO5hkqOPPSgMZJ8WZ10jvrBhyFmSWnTmwW3yHeIMig3jZC3lLt8VvEqatuTOYst696TgQ3clk9e4H4U8ImRXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:45:15.753836Z"},"content_sha256":"9a627faf2316d7006f3f73721b78389a2f728753cdb0857e8e42234c66447a87","schema_version":"1.0","event_id":"sha256:9a627faf2316d7006f3f73721b78389a2f728753cdb0857e8e42234c66447a87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AWEBPPUNH7WFVKRQGF4RQNUYOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the length of a game of Cops and Robbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"William B. Kinnersley","submitted_at":"2017-06-26T14:02:53Z","abstract_excerpt":"In the game of Cops and Robbers, a team of cops attempts to capture a robber on a graph $G$. All players occupy vertices of $G$. The game operates in rounds; in each round the cops move to neighboring vertices, after which the robber does the same. The minimum number of cops needed to guarantee capture of a robber on $G$ is the cop number of $G$, denoted $c(G)$, and the minimum number of rounds needed for them to do so is the capture time. It has long been known that the capture time of an $n$-vertex graph with cop number $k$ is $O(n^{k+1})$. More recently, Bonato, Golovach, Hahn, and Kratochv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08379","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fPOkX7yJ7TTiBkzKEKilXPvezQIot+HdKhsQ+a4Nf9S8etddME9KBOxzHKe1w/9IURZXih77gLs382mL/1LmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:45:15.754480Z"},"content_sha256":"679e05eaa959a99310b92d95d91585b8ba4069578299c63f94a8f0ea93bb5e91","schema_version":"1.0","event_id":"sha256:679e05eaa959a99310b92d95d91585b8ba4069578299c63f94a8f0ea93bb5e91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/bundle.json","state_url":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T16:45:15Z","links":{"resolver":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI","bundle":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/bundle.json","state":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AWEBPPUNH7WFVKRQGF4RQNUYOI","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":"a4ec0c935acb29691cf6cf0a1eccf642a7fcc4b71a90911d40e3ac8902668d57","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T14:02:53Z","title_canon_sha256":"4724fcf2fd99ba824e191b54542b053722c01c19cfd4acfffbd4df23fd854ad5"},"schema_version":"1.0","source":{"id":"1706.08379","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08379","created_at":"2026-05-18T00:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08379v2","created_at":"2026-05-18T00:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08379","created_at":"2026-05-18T00:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"AWEBPPUNH7WF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AWEBPPUNH7WFVKRQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AWEBPPUN","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:679e05eaa959a99310b92d95d91585b8ba4069578299c63f94a8f0ea93bb5e91","target":"graph","created_at":"2026-05-18T00:12:56Z","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 Cops and Robbers, a team of cops attempts to capture a robber on a graph $G$. All players occupy vertices of $G$. The game operates in rounds; in each round the cops move to neighboring vertices, after which the robber does the same. The minimum number of cops needed to guarantee capture of a robber on $G$ is the cop number of $G$, denoted $c(G)$, and the minimum number of rounds needed for them to do so is the capture time. It has long been known that the capture time of an $n$-vertex graph with cop number $k$ is $O(n^{k+1})$. More recently, Bonato, Golovach, Hahn, and Kratochv","authors_text":"William B. Kinnersley","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T14:02:53Z","title":"Bounds on the length of a game of Cops and Robbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08379","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:9a627faf2316d7006f3f73721b78389a2f728753cdb0857e8e42234c66447a87","target":"record","created_at":"2026-05-18T00:12:56Z","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":"a4ec0c935acb29691cf6cf0a1eccf642a7fcc4b71a90911d40e3ac8902668d57","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T14:02:53Z","title_canon_sha256":"4724fcf2fd99ba824e191b54542b053722c01c19cfd4acfffbd4df23fd854ad5"},"schema_version":"1.0","source":{"id":"1706.08379","kind":"arxiv","version":2}},"canonical_sha256":"058817be8d3fec5aaa303179183698721c02e8cf2fa89865539232f6c02b7aa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"058817be8d3fec5aaa303179183698721c02e8cf2fa89865539232f6c02b7aa4","first_computed_at":"2026-05-18T00:12:56.840565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:56.840565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fb87BK7jCIBMOtrZq7yATix715YAVq+KJ+1ZRUxmpTyyD0REo6nF9oOU1NZJZX2SH+Ri2Uk2dpsJaiTsx+fpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:56.841252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08379","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a627faf2316d7006f3f73721b78389a2f728753cdb0857e8e42234c66447a87","sha256:679e05eaa959a99310b92d95d91585b8ba4069578299c63f94a8f0ea93bb5e91"],"state_sha256":"313c15669800ea464caa0ea0812d482173913a0286483a1234635308c40017af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UhKgbF2KRZFLBQrO6qd7X5z8QQXpvGuGnfTFmaALTCn3lrYeuqFVTDLesQEUkRa9wf84eS8KTJonRxojh+GMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:45:15.757909Z","bundle_sha256":"d272757625e28f8ffb4c4a3ee484ff3e059abc813deb9c1a065e1fe5e08a041f"}}