{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N72SYNN5ZUJO2S2I4Q33E3PASF","short_pith_number":"pith:N72SYNN5","schema_version":"1.0","canonical_sha256":"6ff52c35bdcd12ed4b48e437b26de0917bf3f6b400b823105c3b91d71ae4f0fe","source":{"kind":"arxiv","id":"1908.11478","version":1},"attestation_state":"computed","paper":{"title":"The Cop Number of Graphs with Forbidden Induced Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mingrui Liu","submitted_at":"2019-08-29T23:10:24Z","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"},"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":"1908.11478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-29T23:10:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b44ab865d7eceefcef8ab3179c0244ad795daf7dd35cf60965ec18a9e874601c","abstract_canon_sha256":"9ca75db0509206a490570f921752c9a40fe4180aa59239c287a2e5e9e46f583a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:36.992989Z","signature_b64":"i7FWOmyyYfq0GlPJEVT8xQdSA3izcd4QRnEgBpxWlbWXDLpt7d7WHB6eEWJP8s40ZC7cCDgrpuisX9d5NZqzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ff52c35bdcd12ed4b48e437b26de0917bf3f6b400b823105c3b91d71ae4f0fe","last_reissued_at":"2026-07-05T00:00:36.992658Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:36.992658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Cop Number of Graphs with Forbidden Induced Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Mingrui Liu","submitted_at":"2019-08-29T23:10:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11478","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.11478/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.11478","created_at":"2026-07-05T00:00:36.992713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.11478v1","created_at":"2026-07-05T00:00:36.992713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11478","created_at":"2026-07-05T00:00:36.992713+00:00"},{"alias_kind":"pith_short_12","alias_value":"N72SYNN5ZUJO","created_at":"2026-07-05T00:00:36.992713+00:00"},{"alias_kind":"pith_short_16","alias_value":"N72SYNN5ZUJO2S2I","created_at":"2026-07-05T00:00:36.992713+00:00"},{"alias_kind":"pith_short_8","alias_value":"N72SYNN5","created_at":"2026-07-05T00:00:36.992713+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15416","citing_title":"$4K_1$-free graph with the cop number $3$","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF","json":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF.json","graph_json":"https://pith.science/api/pith-number/N72SYNN5ZUJO2S2I4Q33E3PASF/graph.json","events_json":"https://pith.science/api/pith-number/N72SYNN5ZUJO2S2I4Q33E3PASF/events.json","paper":"https://pith.science/paper/N72SYNN5"},"agent_actions":{"view_html":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF","download_json":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF.json","view_paper":"https://pith.science/paper/N72SYNN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.11478&json=true","fetch_graph":"https://pith.science/api/pith-number/N72SYNN5ZUJO2S2I4Q33E3PASF/graph.json","fetch_events":"https://pith.science/api/pith-number/N72SYNN5ZUJO2S2I4Q33E3PASF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF/action/storage_attestation","attest_author":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF/action/author_attestation","sign_citation":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF/action/citation_signature","submit_replication":"https://pith.science/pith/N72SYNN5ZUJO2S2I4Q33E3PASF/action/replication_record"}},"created_at":"2026-07-05T00:00:36.992713+00:00","updated_at":"2026-07-05T00:00:36.992713+00:00"}