{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5DEQNPL2NF5ON4PVCZXMEDNE6X","short_pith_number":"pith:5DEQNPL2","schema_version":"1.0","canonical_sha256":"e8c906bd7a697ae6f1f5166ec20da4f5dc521689694c94fe34d51c88dab4d964","source":{"kind":"arxiv","id":"1007.1734","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds for the Cop Number When the Robber is Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Mehrabian","submitted_at":"2010-07-10T17:43:04Z","abstract_excerpt":"We consider a variant of the Cops and Robbers game where the robber can move t edges at a time, and show that in this variant, the cop number of a d-regular graph with girth larger than 2t+2 is Omega(d^t). By the known upper bounds on the order of cages, this implies that the cop number of a connected n-vertex graph can be as large as Omega(n^{2/3}) if t>1, and Omega(n^{4/5}) if t>3. This improves the Omega(n^{(t-3)/(t-2)}) lower bound of Frieze, Krivelevich, and Loh (Variations on Cops and Robbers, J. Graph Theory, 2011) when 1<t<7. We also conjecture a general upper bound O(n^{t/t+1}) for th"},"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":"1007.1734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-10T17:43:04Z","cross_cats_sorted":[],"title_canon_sha256":"393ce07b69e514d6e5217b06de5e988c12e40e5e65741d44c99407cb8bb48b29","abstract_canon_sha256":"cf872db6b51b308a0334a730637500015614313d99896cdbe0722814d9b3a018"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:51.265812Z","signature_b64":"Kq46w5G+DWmUjOqbkezvwmY3WNXj0wYIB7SvjkX/rbM0B8038YxwzXN3f4IRKSsit37xJg28SMcChzlhc/qnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c906bd7a697ae6f1f5166ec20da4f5dc521689694c94fe34d51c88dab4d964","last_reissued_at":"2026-05-18T04:20:51.265104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:51.265104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for the Cop Number When the Robber is Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Mehrabian","submitted_at":"2010-07-10T17:43:04Z","abstract_excerpt":"We consider a variant of the Cops and Robbers game where the robber can move t edges at a time, and show that in this variant, the cop number of a d-regular graph with girth larger than 2t+2 is Omega(d^t). By the known upper bounds on the order of cages, this implies that the cop number of a connected n-vertex graph can be as large as Omega(n^{2/3}) if t>1, and Omega(n^{4/5}) if t>3. This improves the Omega(n^{(t-3)/(t-2)}) lower bound of Frieze, Krivelevich, and Loh (Variations on Cops and Robbers, J. Graph Theory, 2011) when 1<t<7. We also conjecture a general upper bound O(n^{t/t+1}) for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1734","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":"1007.1734","created_at":"2026-05-18T04:20:51.265216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1734v2","created_at":"2026-05-18T04:20:51.265216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1734","created_at":"2026-05-18T04:20:51.265216+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DEQNPL2NF5O","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DEQNPL2NF5ON4PV","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DEQNPL2","created_at":"2026-05-18T12:26:04.259169+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/5DEQNPL2NF5ON4PVCZXMEDNE6X","json":"https://pith.science/pith/5DEQNPL2NF5ON4PVCZXMEDNE6X.json","graph_json":"https://pith.science/api/pith-number/5DEQNPL2NF5ON4PVCZXMEDNE6X/graph.json","events_json":"https://pith.science/api/pith-number/5DEQNPL2NF5ON4PVCZXMEDNE6X/events.json","paper":"https://pith.science/paper/5DEQNPL2"},"agent_actions":{"view_html":"https://pith.science/pith/5DEQNPL2NF5ON4PVCZXMEDNE6X","download_json":"https://pith.science/pith/5DEQNPL2NF5ON4PVCZXMEDNE6X.json","view_paper":"https://pith.science/paper/5DEQNPL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1734&json=true","fetch_graph":"https://pith.science/api/pith-number/5DEQNPL2NF5ON4PVCZXMEDNE6X/graph.json","fetch_events":"https://pith.science/api/pith-number/5DEQNPL2NF5ON4PVCZXMEDNE6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DEQNPL2NF5ON4PVCZXMEDNE6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DEQNPL2NF5ON4PVCZXMEDNE6X/action/storage_attestation","attest_author":"https://pith.science/pith/5DEQNPL2NF5ON4PVCZXMEDNE6X/action/author_attestation","sign_citation":"https://pith.science/pith/5DEQNPL2NF5ON4PVCZXMEDNE6X/action/citation_signature","submit_replication":"https://pith.science/pith/5DEQNPL2NF5ON4PVCZXMEDNE6X/action/replication_record"}},"created_at":"2026-05-18T04:20:51.265216+00:00","updated_at":"2026-05-18T04:20:51.265216+00:00"}