{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AWEBPPUNH7WFVKRQGF4RQNUYOI","short_pith_number":"pith:AWEBPPUN","schema_version":"1.0","canonical_sha256":"058817be8d3fec5aaa303179183698721c02e8cf2fa89865539232f6c02b7aa4","source":{"kind":"arxiv","id":"1706.08379","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.08379","created_at":"2026-05-18T00:12:56.840677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08379v2","created_at":"2026-05-18T00:12:56.840677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08379","created_at":"2026-05-18T00:12:56.840677+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWEBPPUNH7WF","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWEBPPUNH7WFVKRQ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWEBPPUN","created_at":"2026-05-18T12:31:08.081275+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/AWEBPPUNH7WFVKRQGF4RQNUYOI","json":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI.json","graph_json":"https://pith.science/api/pith-number/AWEBPPUNH7WFVKRQGF4RQNUYOI/graph.json","events_json":"https://pith.science/api/pith-number/AWEBPPUNH7WFVKRQGF4RQNUYOI/events.json","paper":"https://pith.science/paper/AWEBPPUN"},"agent_actions":{"view_html":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI","download_json":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI.json","view_paper":"https://pith.science/paper/AWEBPPUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08379&json=true","fetch_graph":"https://pith.science/api/pith-number/AWEBPPUNH7WFVKRQGF4RQNUYOI/graph.json","fetch_events":"https://pith.science/api/pith-number/AWEBPPUNH7WFVKRQGF4RQNUYOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/action/storage_attestation","attest_author":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/action/author_attestation","sign_citation":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/action/citation_signature","submit_replication":"https://pith.science/pith/AWEBPPUNH7WFVKRQGF4RQNUYOI/action/replication_record"}},"created_at":"2026-05-18T00:12:56.840677+00:00","updated_at":"2026-05-18T00:12:56.840677+00:00"}