{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IJNMA3JDWS2EQMGK5E3322G63Z","short_pith_number":"pith:IJNMA3JD","schema_version":"1.0","canonical_sha256":"425ac06d23b4b44830cae937bd68dede7d22f6c8a6e27ab4e6e619d36af213c7","source":{"kind":"arxiv","id":"1710.11352","version":1},"attestation_state":"computed","paper":{"title":"Variations of the cop and robber game on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Carl Joshua Quines, Espen Slettnes, Jesse Geneson, Shen-Fu Tsai","submitted_at":"2017-10-31T07:20:12Z","abstract_excerpt":"We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric called the cop and killer game. We prove for all $c < 1$ that almost all random graphs are stalemate for the cop and killer game, where each edge occurs with probability $p$ such that $\\frac{1}{n^{c}} \\le p \\le 1-\\frac{1}{n^{c}}$. We prove that a graph can be killer-win if and only if it has exactly $k\\ge 3$ triangles or none at all. We prove that graphs with multiple cycles longer than triangles permit cop-win and kil"},"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":"1710.11352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-31T07:20:12Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"d73991c4cffec2c89dca1cb1f887c2d8e6e9cf934add5bddfd7886f1906ae827","abstract_canon_sha256":"8b366d6dc1752e76278bd411d0444f445493af4f94f8220013a52a923181ada0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:44.141019Z","signature_b64":"dBblUduxP5MN7dWO+p48mWut9PT6Qh2k3H2Y+qKB5o+4FzHpEv/MD3Y2QM1fUWWDP1fyS4ecr0UIGhDiDJ9TBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"425ac06d23b4b44830cae937bd68dede7d22f6c8a6e27ab4e6e619d36af213c7","last_reissued_at":"2026-05-18T00:31:44.140306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:44.140306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variations of the cop and robber game on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Carl Joshua Quines, Espen Slettnes, Jesse Geneson, Shen-Fu Tsai","submitted_at":"2017-10-31T07:20:12Z","abstract_excerpt":"We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric called the cop and killer game. We prove for all $c < 1$ that almost all random graphs are stalemate for the cop and killer game, where each edge occurs with probability $p$ such that $\\frac{1}{n^{c}} \\le p \\le 1-\\frac{1}{n^{c}}$. We prove that a graph can be killer-win if and only if it has exactly $k\\ge 3$ triangles or none at all. We prove that graphs with multiple cycles longer than triangles permit cop-win and kil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11352","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":""},"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":"1710.11352","created_at":"2026-05-18T00:31:44.140432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11352v1","created_at":"2026-05-18T00:31:44.140432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11352","created_at":"2026-05-18T00:31:44.140432+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJNMA3JDWS2E","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJNMA3JDWS2EQMGK","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJNMA3JD","created_at":"2026-05-18T12:31:21.493067+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/IJNMA3JDWS2EQMGK5E3322G63Z","json":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z.json","graph_json":"https://pith.science/api/pith-number/IJNMA3JDWS2EQMGK5E3322G63Z/graph.json","events_json":"https://pith.science/api/pith-number/IJNMA3JDWS2EQMGK5E3322G63Z/events.json","paper":"https://pith.science/paper/IJNMA3JD"},"agent_actions":{"view_html":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z","download_json":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z.json","view_paper":"https://pith.science/paper/IJNMA3JD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11352&json=true","fetch_graph":"https://pith.science/api/pith-number/IJNMA3JDWS2EQMGK5E3322G63Z/graph.json","fetch_events":"https://pith.science/api/pith-number/IJNMA3JDWS2EQMGK5E3322G63Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/action/storage_attestation","attest_author":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/action/author_attestation","sign_citation":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/action/citation_signature","submit_replication":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/action/replication_record"}},"created_at":"2026-05-18T00:31:44.140432+00:00","updated_at":"2026-05-18T00:31:44.140432+00:00"}