{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K5LQJ5P2TDZLA3N7HUUYJOFFBA","short_pith_number":"pith:K5LQJ5P2","schema_version":"1.0","canonical_sha256":"575704f5fa98f2b06dbf3d2984b8a50804bd5470ea5398835256aec730b898e1","source":{"kind":"arxiv","id":"1712.07728","version":2},"attestation_state":"computed","paper":{"title":"Throttling for the game of Cops and Robbers on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Brimkov, Carolyn Reinhart, Jane Breen, Joshua Carlson, K.E. Perry, Leslie Hogben","submitted_at":"2017-12-20T22:11:36Z","abstract_excerpt":"We consider the cop-throttling number of a graph $G$ for the game of Cops and Robbers, which is defined to be the minimum of $(k + \\text{capt}_k(G))$, where $k$ is the number of cops and $\\text{capt}_k(G)$ is the minimum number of rounds needed for $k$ cops to capture the robber on $G$ over all possible games. We provide some tools for bounding the cop-throttling number, including showing that the positive semidefinite (PSD) throttling number, a variant of zero forcing throttling, is an upper bound for the cop-throttling number. We also characterize graphs having low cop-throttling number and "},"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":"1712.07728","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-20T22:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"8a9ea938e2f5b835976fbe8c7d4cb632fb82c8e1eb20c1e7b9fa4b8950f393e5","abstract_canon_sha256":"b2a1fdbe579e8232af0bac2bc464950a4b413df626b63a648bca4fc223cd0dc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.035119Z","signature_b64":"eNnO3O0M6Q0bJx2/R4K0YXp9758VSfTYDLW/QccqMdmHST9bXeWA3jutJXCnABBSgxvuvRRNNh0X3M4Nqex6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"575704f5fa98f2b06dbf3d2984b8a50804bd5470ea5398835256aec730b898e1","last_reissued_at":"2026-05-18T00:22:39.034604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.034604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throttling for the game of Cops and Robbers on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Brimkov, Carolyn Reinhart, Jane Breen, Joshua Carlson, K.E. Perry, Leslie Hogben","submitted_at":"2017-12-20T22:11:36Z","abstract_excerpt":"We consider the cop-throttling number of a graph $G$ for the game of Cops and Robbers, which is defined to be the minimum of $(k + \\text{capt}_k(G))$, where $k$ is the number of cops and $\\text{capt}_k(G)$ is the minimum number of rounds needed for $k$ cops to capture the robber on $G$ over all possible games. We provide some tools for bounding the cop-throttling number, including showing that the positive semidefinite (PSD) throttling number, a variant of zero forcing throttling, is an upper bound for the cop-throttling number. We also characterize graphs having low cop-throttling number and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07728","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":"1712.07728","created_at":"2026-05-18T00:22:39.034690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07728v2","created_at":"2026-05-18T00:22:39.034690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07728","created_at":"2026-05-18T00:22:39.034690+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5LQJ5P2TDZL","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5LQJ5P2TDZLA3N7","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5LQJ5P2","created_at":"2026-05-18T12:31:24.725408+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/K5LQJ5P2TDZLA3N7HUUYJOFFBA","json":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA.json","graph_json":"https://pith.science/api/pith-number/K5LQJ5P2TDZLA3N7HUUYJOFFBA/graph.json","events_json":"https://pith.science/api/pith-number/K5LQJ5P2TDZLA3N7HUUYJOFFBA/events.json","paper":"https://pith.science/paper/K5LQJ5P2"},"agent_actions":{"view_html":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA","download_json":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA.json","view_paper":"https://pith.science/paper/K5LQJ5P2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07728&json=true","fetch_graph":"https://pith.science/api/pith-number/K5LQJ5P2TDZLA3N7HUUYJOFFBA/graph.json","fetch_events":"https://pith.science/api/pith-number/K5LQJ5P2TDZLA3N7HUUYJOFFBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/action/storage_attestation","attest_author":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/action/author_attestation","sign_citation":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/action/citation_signature","submit_replication":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/action/replication_record"}},"created_at":"2026-05-18T00:22:39.034690+00:00","updated_at":"2026-05-18T00:22:39.034690+00:00"}