{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Z7X47WG2E2LHLVDZXJ7UFG5GFF","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":"bca40a1c85861125d1373645652e9596a5ea6d506b22ee4d857d7bea39dc5d52","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-25T18:24:55Z","title_canon_sha256":"2de4baa87cc1b67d527f1f5265f0b33e10b55a91fecc9d36a1219dc2fa53ad08"},"schema_version":"1.0","source":{"id":"1901.09011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09011","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09011v1","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09011","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"Z7X47WG2E2LH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z7X47WG2E2LHLVDZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z7X47WG2","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:e4a0e7eab64254a58bdb7623fea71b2f69c22e11c70b1c46da8e6d35a9be157f","target":"graph","created_at":"2026-05-17T23:55:30Z","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 provide a sublinear bound on the cop throttling number of a connected graph. Related to the graph searching game Cops and Robbers, the cop throttling number, written $\\mathrm{th}_c(G)$, is given by $\\mathrm{th}_c(G)=\\min_k\\{k+\\mathrm{capt}_k(G)\\}$, in which $\\mathrm{capt}_k(G)$ is the $k$-capture time, or the length of a game of Cops and Robbers with $k$ cops on the graph $G$, assuming both players play optimally.\n  No general sublinear bound was known on the cop throttling number of a connected graph. Towards a question asked by Breen et al., we prove that $\\mathrm{th}_c(G)\\leq \\frac{(2+o(","authors_text":"Anthony Bonato, Sean English","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-25T18:24:55Z","title":"A Sublinear Bound on the Cop Throttling Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09011","kind":"arxiv","version":1},"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:adf570b420339c09ebc41abd0d683eb0695036c8b9b69a4ffa40390b8f04bf23","target":"record","created_at":"2026-05-17T23:55:30Z","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":"bca40a1c85861125d1373645652e9596a5ea6d506b22ee4d857d7bea39dc5d52","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-25T18:24:55Z","title_canon_sha256":"2de4baa87cc1b67d527f1f5265f0b33e10b55a91fecc9d36a1219dc2fa53ad08"},"schema_version":"1.0","source":{"id":"1901.09011","kind":"arxiv","version":1}},"canonical_sha256":"cfefcfd8da269675d479ba7f429ba62950d8b52e196d6a375737dbfe73989719","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfefcfd8da269675d479ba7f429ba62950d8b52e196d6a375737dbfe73989719","first_computed_at":"2026-05-17T23:55:30.967068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:30.967068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GoieLhV3o6Pxk3Rdi3eMWimyqflboEZ6K2gw/lAC9DxJRxGIai5RXlWMHpWX2viKGgTZvXtdhmGMNqKZBOO+Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:30.967452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adf570b420339c09ebc41abd0d683eb0695036c8b9b69a4ffa40390b8f04bf23","sha256:e4a0e7eab64254a58bdb7623fea71b2f69c22e11c70b1c46da8e6d35a9be157f"],"state_sha256":"2e21a691abb73466ad47e2eda37dede62ccae4b9296deb16cb68a9d9cf40b866"}