{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RIJAI2ZCQFPB2IBE4LVFOPHABV","short_pith_number":"pith:RIJAI2ZC","canonical_record":{"source":{"id":"1705.11184","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T17:25:44Z","cross_cats_sorted":[],"title_canon_sha256":"0aa9721c62ae36f44efd3943f1aa52e1ca25e23d3fc940e56274cffaae954b92","abstract_canon_sha256":"4e184cd39f4d526574b7acf633b51cda996d50b298dc141e49cde817d22c0d94"},"schema_version":"1.0"},"canonical_sha256":"8a12046b22815e1d2024e2ea573ce00d5c5168c266b417a555080182d2da4465","source":{"kind":"arxiv","id":"1705.11184","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11184","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11184v3","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11184","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"RIJAI2ZCQFPB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RIJAI2ZCQFPB2IBE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RIJAI2ZC","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RIJAI2ZCQFPB2IBE4LVFOPHABV","target":"record","payload":{"canonical_record":{"source":{"id":"1705.11184","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T17:25:44Z","cross_cats_sorted":[],"title_canon_sha256":"0aa9721c62ae36f44efd3943f1aa52e1ca25e23d3fc940e56274cffaae954b92","abstract_canon_sha256":"4e184cd39f4d526574b7acf633b51cda996d50b298dc141e49cde817d22c0d94"},"schema_version":"1.0"},"canonical_sha256":"8a12046b22815e1d2024e2ea573ce00d5c5168c266b417a555080182d2da4465","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:47.947085Z","signature_b64":"FtlJ8p03da7cSKQgv5rXHxfZqdUFSVQBE1RbpCsElr0POjJnPQAFG5zvcuknVO3KnY+IRRx5meIrTvOaZtGOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a12046b22815e1d2024e2ea573ce00d5c5168c266b417a555080182d2da4465","last_reissued_at":"2026-05-18T00:13:47.946425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:47.946425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.11184","source_version":3,"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:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4GmSjGFuDTQlgdCOFao5q9yoWdZ+gUq11OHdabvhsw81oxBe0APC5pleJfpBIzMdACNtnfrHAO4cr0Iq5D1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T09:17:59.986138Z"},"content_sha256":"6ea421d440d87308b3c0dbc7e2bd4bc1d4742b66acf6481c7ac61bfa26104d91","schema_version":"1.0","event_id":"sha256:6ea421d440d87308b3c0dbc7e2bd4bc1d4742b66acf6481c7ac61bfa26104d91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RIJAI2ZCQFPB2IBE4LVFOPHABV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Cop Number of the One-Cop-Moves Game on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Boting Yang, Ziyuan Gao","submitted_at":"2017-05-31T17:25:44Z","abstract_excerpt":"Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each other's positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11184","kind":"arxiv","version":3},"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:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OLdRoVo68188QBhD4TfhQwU1A+8UuThFOJVVlp8jGNvE0XYbNofPx7eH0eUHyEWQ3HpYFisK2ZffxCdq8PSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T09:17:59.986783Z"},"content_sha256":"01fea58f5886af270ebf046322d10f8cf5882cf39466d8f976281013833a8fca","schema_version":"1.0","event_id":"sha256:01fea58f5886af270ebf046322d10f8cf5882cf39466d8f976281013833a8fca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/bundle.json","state_url":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/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-05-24T09:17:59Z","links":{"resolver":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV","bundle":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/bundle.json","state":"https://pith.science/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIJAI2ZCQFPB2IBE4LVFOPHABV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RIJAI2ZCQFPB2IBE4LVFOPHABV","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":"4e184cd39f4d526574b7acf633b51cda996d50b298dc141e49cde817d22c0d94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T17:25:44Z","title_canon_sha256":"0aa9721c62ae36f44efd3943f1aa52e1ca25e23d3fc940e56274cffaae954b92"},"schema_version":"1.0","source":{"id":"1705.11184","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11184","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11184v3","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11184","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"RIJAI2ZCQFPB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RIJAI2ZCQFPB2IBE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RIJAI2ZC","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:01fea58f5886af270ebf046322d10f8cf5882cf39466d8f976281013833a8fca","target":"graph","created_at":"2026-05-18T00:13:47Z","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":"Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each other's positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game,","authors_text":"Boting Yang, Ziyuan Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T17:25:44Z","title":"The Cop Number of the One-Cop-Moves Game on Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11184","kind":"arxiv","version":3},"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:6ea421d440d87308b3c0dbc7e2bd4bc1d4742b66acf6481c7ac61bfa26104d91","target":"record","created_at":"2026-05-18T00:13:47Z","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":"4e184cd39f4d526574b7acf633b51cda996d50b298dc141e49cde817d22c0d94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T17:25:44Z","title_canon_sha256":"0aa9721c62ae36f44efd3943f1aa52e1ca25e23d3fc940e56274cffaae954b92"},"schema_version":"1.0","source":{"id":"1705.11184","kind":"arxiv","version":3}},"canonical_sha256":"8a12046b22815e1d2024e2ea573ce00d5c5168c266b417a555080182d2da4465","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a12046b22815e1d2024e2ea573ce00d5c5168c266b417a555080182d2da4465","first_computed_at":"2026-05-18T00:13:47.946425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:47.946425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FtlJ8p03da7cSKQgv5rXHxfZqdUFSVQBE1RbpCsElr0POjJnPQAFG5zvcuknVO3KnY+IRRx5meIrTvOaZtGOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:47.947085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.11184","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ea421d440d87308b3c0dbc7e2bd4bc1d4742b66acf6481c7ac61bfa26104d91","sha256:01fea58f5886af270ebf046322d10f8cf5882cf39466d8f976281013833a8fca"],"state_sha256":"99d7ab0feed69052650ef1aceeb415b8c4fe036112458ba0624c6a1d5d9f2860"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Chno94VziPJScvpbLNQViJUzSufsr1X+7wYQHFBn3Wd61fZ9SzCAHtA6uKlYnvXeK9zCgNr35FERaps5K91SBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T09:17:59.990199Z","bundle_sha256":"a3afc76ae18b33ed3efc95dda86b026ec31fb274372957340a48cafbeade50f5"}}