{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N72SYNN5ZUJO2S2I4Q33E3PASF","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":"9ca75db0509206a490570f921752c9a40fe4180aa59239c287a2e5e9e46f583a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-29T23:10:24Z","title_canon_sha256":"b44ab865d7eceefcef8ab3179c0244ad795daf7dd35cf60965ec18a9e874601c"},"schema_version":"1.0","source":{"id":"1908.11478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.11478","created_at":"2026-07-05T00:00:36Z"},{"alias_kind":"arxiv_version","alias_value":"1908.11478v1","created_at":"2026-07-05T00:00:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11478","created_at":"2026-07-05T00:00:36Z"},{"alias_kind":"pith_short_12","alias_value":"N72SYNN5ZUJO","created_at":"2026-07-05T00:00:36Z"},{"alias_kind":"pith_short_16","alias_value":"N72SYNN5ZUJO2S2I","created_at":"2026-07-05T00:00:36Z"},{"alias_kind":"pith_short_8","alias_value":"N72SYNN5","created_at":"2026-07-05T00:00:36Z"}],"graph_snapshots":[{"event_id":"sha256:65983b63d2d4f757078f5a3de5e22f5c2b8d420115ed8f80df4c14c781224ff1","target":"graph","created_at":"2026-07-05T00:00:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.11478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the game of Cops and Robber, a team of cops attempts to capture a robber on a graph $G$. Initially, all cops occupy some vertices in $G$ and the robber occupies another vertex. In each round, a cop can move to one of its neighbors or stay idle, after which the robber does the same. The robber is caught by a cop if the cop lands on the same vertex which is currently occupied by the robber. The minimum number of cops needed to guarantee capture of a robber on $G$ is called the {\\em cop number} of $G$, denoted by $c(G)$. We say a family $\\cal F$ of graphs is {\\em cop-bounded} if there is a con","authors_text":"Mingrui Liu","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-29T23:10:24Z","title":"The Cop Number of Graphs with Forbidden Induced Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11478","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:e06a1f55962fe85200e1b613310ad1677389d7aab6cfde31ccfa6250fd1dae16","target":"record","created_at":"2026-07-05T00:00:36Z","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":"9ca75db0509206a490570f921752c9a40fe4180aa59239c287a2e5e9e46f583a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-29T23:10:24Z","title_canon_sha256":"b44ab865d7eceefcef8ab3179c0244ad795daf7dd35cf60965ec18a9e874601c"},"schema_version":"1.0","source":{"id":"1908.11478","kind":"arxiv","version":1}},"canonical_sha256":"6ff52c35bdcd12ed4b48e437b26de0917bf3f6b400b823105c3b91d71ae4f0fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ff52c35bdcd12ed4b48e437b26de0917bf3f6b400b823105c3b91d71ae4f0fe","first_computed_at":"2026-07-05T00:00:36.992658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:00:36.992658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i7FWOmyyYfq0GlPJEVT8xQdSA3izcd4QRnEgBpxWlbWXDLpt7d7WHB6eEWJP8s40ZC7cCDgrpuisX9d5NZqzCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:00:36.992989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.11478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e06a1f55962fe85200e1b613310ad1677389d7aab6cfde31ccfa6250fd1dae16","sha256:65983b63d2d4f757078f5a3de5e22f5c2b8d420115ed8f80df4c14c781224ff1"],"state_sha256":"60d25f1557a9e70df32c4c87a823f503bbdb4c81526b312cecfa11ea4570bf75"}