{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IJNMA3JDWS2EQMGK5E3322G63Z","short_pith_number":"pith:IJNMA3JD","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"},"canonical_sha256":"425ac06d23b4b44830cae937bd68dede7d22f6c8a6e27ab4e6e619d36af213c7","source":{"kind":"arxiv","id":"1710.11352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11352","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11352v1","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11352","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"IJNMA3JDWS2E","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IJNMA3JDWS2EQMGK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IJNMA3JD","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IJNMA3JDWS2EQMGK5E3322G63Z","target":"record","payload":{"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"},"canonical_sha256":"425ac06d23b4b44830cae937bd68dede7d22f6c8a6e27ab4e6e619d36af213c7","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"},"source_kind":"arxiv","source_id":"1710.11352","source_version":1,"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:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gw21pPmL9ykFbapNnVhN7YhXBBBcTnPAmhGZOTavP+xeDsrYUnSmPUiQyLI8/j5GekkoGPxZFK0mSyCwhhRYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:39:06.485813Z"},"content_sha256":"8757d0af11edcdf90701b6e1062a8e9ba6ee43761f4cfb37b91675a5c943a5ce","schema_version":"1.0","event_id":"sha256:8757d0af11edcdf90701b6e1062a8e9ba6ee43761f4cfb37b91675a5c943a5ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IJNMA3JDWS2EQMGK5E3322G63Z","target":"graph","payload":{"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"},"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:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRZ66Vl9fOo26i4yKe7z8j4PgnlT4gdSjtWtU7niZPwdSpKAj5fJBnnvr4OwxnwT2BtJfzZTUVPTDJAIXBSWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:39:06.486410Z"},"content_sha256":"30f523c7782b98d78fb03286cbb35bbba533c677f3e8267bb559a364c144e982","schema_version":"1.0","event_id":"sha256:30f523c7782b98d78fb03286cbb35bbba533c677f3e8267bb559a364c144e982"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/bundle.json","state_url":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJNMA3JDWS2EQMGK5E3322G63Z/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-06-08T18:39:06Z","links":{"resolver":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z","bundle":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/bundle.json","state":"https://pith.science/pith/IJNMA3JDWS2EQMGK5E3322G63Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJNMA3JDWS2EQMGK5E3322G63Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IJNMA3JDWS2EQMGK5E3322G63Z","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":"8b366d6dc1752e76278bd411d0444f445493af4f94f8220013a52a923181ada0","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-31T07:20:12Z","title_canon_sha256":"d73991c4cffec2c89dca1cb1f887c2d8e6e9cf934add5bddfd7886f1906ae827"},"schema_version":"1.0","source":{"id":"1710.11352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11352","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11352v1","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11352","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"IJNMA3JDWS2E","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IJNMA3JDWS2EQMGK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IJNMA3JD","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:30f523c7782b98d78fb03286cbb35bbba533c677f3e8267bb559a364c144e982","target":"graph","created_at":"2026-05-18T00:31:44Z","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 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","authors_text":"Carl Joshua Quines, Espen Slettnes, Jesse Geneson, Shen-Fu Tsai","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-31T07:20:12Z","title":"Variations of the cop and robber game on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11352","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:8757d0af11edcdf90701b6e1062a8e9ba6ee43761f4cfb37b91675a5c943a5ce","target":"record","created_at":"2026-05-18T00:31:44Z","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":"8b366d6dc1752e76278bd411d0444f445493af4f94f8220013a52a923181ada0","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-31T07:20:12Z","title_canon_sha256":"d73991c4cffec2c89dca1cb1f887c2d8e6e9cf934add5bddfd7886f1906ae827"},"schema_version":"1.0","source":{"id":"1710.11352","kind":"arxiv","version":1}},"canonical_sha256":"425ac06d23b4b44830cae937bd68dede7d22f6c8a6e27ab4e6e619d36af213c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"425ac06d23b4b44830cae937bd68dede7d22f6c8a6e27ab4e6e619d36af213c7","first_computed_at":"2026-05-18T00:31:44.140306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:44.140306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dBblUduxP5MN7dWO+p48mWut9PT6Qh2k3H2Y+qKB5o+4FzHpEv/MD3Y2QM1fUWWDP1fyS4ecr0UIGhDiDJ9TBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:44.141019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8757d0af11edcdf90701b6e1062a8e9ba6ee43761f4cfb37b91675a5c943a5ce","sha256:30f523c7782b98d78fb03286cbb35bbba533c677f3e8267bb559a364c144e982"],"state_sha256":"90fd3c94f4c47b0f9e64b46b2179aed7164b11a11b0a058300a1365849e253ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hPrtoXad2O+DAFZnIBWVOdycaRjmSOTNGw3+ccbC9JP8FH05CJSUwGiD90cs404KfZVKt81Nfk9DnqxG/27Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:39:06.489461Z","bundle_sha256":"3db3ef1dbc3fd1b9cba5bf3cd3e68c5df0200b5cfbd5ad514ba40206a6dc862f"}}