{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K5LQJ5P2TDZLA3N7HUUYJOFFBA","short_pith_number":"pith:K5LQJ5P2","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"},"canonical_sha256":"575704f5fa98f2b06dbf3d2984b8a50804bd5470ea5398835256aec730b898e1","source":{"kind":"arxiv","id":"1712.07728","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07728","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07728v2","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07728","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"K5LQJ5P2TDZL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K5LQJ5P2TDZLA3N7","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K5LQJ5P2","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K5LQJ5P2TDZLA3N7HUUYJOFFBA","target":"record","payload":{"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"},"canonical_sha256":"575704f5fa98f2b06dbf3d2984b8a50804bd5470ea5398835256aec730b898e1","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"},"source_kind":"arxiv","source_id":"1712.07728","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:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itoWwEYNHDsO+owHIzm0zTiOTLJs2qIPzc6d4DrSjAzlriEgc623v/4Ibffj9GucTgcNJT/hGJX1oMyQNWU1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:14.285507Z"},"content_sha256":"0891ebbaed7349fcdf03dbff4411a05cd3b9cfd19e85a9864e67967e4d3f7501","schema_version":"1.0","event_id":"sha256:0891ebbaed7349fcdf03dbff4411a05cd3b9cfd19e85a9864e67967e4d3f7501"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K5LQJ5P2TDZLA3N7HUUYJOFFBA","target":"graph","payload":{"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"},"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:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cUgalbrS8Fk8nfpbydpGu244dqf1maLH4EiEq1Lrf2w+2cX9iPzEUw4ShfPui2BjtcHjeuZd49C9zIsgYitDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:14.286100Z"},"content_sha256":"0ba830b324c1ec9ad7ea0a925c77f48cabec1e1b078c0dd9988160d403c3d4b9","schema_version":"1.0","event_id":"sha256:0ba830b324c1ec9ad7ea0a925c77f48cabec1e1b078c0dd9988160d403c3d4b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/bundle.json","state_url":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/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-05-27T23:18:14Z","links":{"resolver":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA","bundle":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/bundle.json","state":"https://pith.science/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5LQJ5P2TDZLA3N7HUUYJOFFBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K5LQJ5P2TDZLA3N7HUUYJOFFBA","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":"b2a1fdbe579e8232af0bac2bc464950a4b413df626b63a648bca4fc223cd0dc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-20T22:11:36Z","title_canon_sha256":"8a9ea938e2f5b835976fbe8c7d4cb632fb82c8e1eb20c1e7b9fa4b8950f393e5"},"schema_version":"1.0","source":{"id":"1712.07728","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07728","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07728v2","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07728","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"K5LQJ5P2TDZL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K5LQJ5P2TDZLA3N7","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K5LQJ5P2","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:0ba830b324c1ec9ad7ea0a925c77f48cabec1e1b078c0dd9988160d403c3d4b9","target":"graph","created_at":"2026-05-18T00:22:39Z","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":"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 ","authors_text":"Boris Brimkov, Carolyn Reinhart, Jane Breen, Joshua Carlson, K.E. Perry, Leslie Hogben","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-20T22:11:36Z","title":"Throttling for the game of Cops and Robbers on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07728","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:0891ebbaed7349fcdf03dbff4411a05cd3b9cfd19e85a9864e67967e4d3f7501","target":"record","created_at":"2026-05-18T00:22:39Z","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":"b2a1fdbe579e8232af0bac2bc464950a4b413df626b63a648bca4fc223cd0dc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-20T22:11:36Z","title_canon_sha256":"8a9ea938e2f5b835976fbe8c7d4cb632fb82c8e1eb20c1e7b9fa4b8950f393e5"},"schema_version":"1.0","source":{"id":"1712.07728","kind":"arxiv","version":2}},"canonical_sha256":"575704f5fa98f2b06dbf3d2984b8a50804bd5470ea5398835256aec730b898e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"575704f5fa98f2b06dbf3d2984b8a50804bd5470ea5398835256aec730b898e1","first_computed_at":"2026-05-18T00:22:39.034604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:39.034604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eNnO3O0M6Q0bJx2/R4K0YXp9758VSfTYDLW/QccqMdmHST9bXeWA3jutJXCnABBSgxvuvRRNNh0X3M4Nqex6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:39.035119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07728","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0891ebbaed7349fcdf03dbff4411a05cd3b9cfd19e85a9864e67967e4d3f7501","sha256:0ba830b324c1ec9ad7ea0a925c77f48cabec1e1b078c0dd9988160d403c3d4b9"],"state_sha256":"324a0ef6a63182284096e15b384a73b33dff9dd1241a9558cfd093ea6d4d93cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AU+uw1Zxjkl4PPPClPPWacJ8JB55UKjP/B62W0S/g/mpoNKwT7xIzGzu/N/LueO/+R3zMRlHhkxx6xA1H+QBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:18:14.289225Z","bundle_sha256":"56355a095df390b4790a9cb80780cdede5a51a4699543e8649656394bed2e3e3"}}