{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ALDM5L7FLILMWHMLLUCSELIUI5","short_pith_number":"pith:ALDM5L7F","canonical_record":{"source":{"id":"1204.5490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:22:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"50f31439dd8bd450afe139e7f7712ba8c5e6e2bbcdec339a7779953da634249a","abstract_canon_sha256":"b0a92e6577433612cc5c54199e2e93f63f697df2fdf312e7ba13a7dd80478b8c"},"schema_version":"1.0"},"canonical_sha256":"02c6ceafe55a16cb1d8b5d05222d14476a4e233d3f723a7be5012ea65c577199","source":{"kind":"arxiv","id":"1204.5490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5490","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5490v1","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5490","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"ALDM5L7FLILM","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ALDM5L7FLILMWHML","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ALDM5L7F","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ALDM5L7FLILMWHMLLUCSELIUI5","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:22:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"50f31439dd8bd450afe139e7f7712ba8c5e6e2bbcdec339a7779953da634249a","abstract_canon_sha256":"b0a92e6577433612cc5c54199e2e93f63f697df2fdf312e7ba13a7dd80478b8c"},"schema_version":"1.0"},"canonical_sha256":"02c6ceafe55a16cb1d8b5d05222d14476a4e233d3f723a7be5012ea65c577199","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:02.272447Z","signature_b64":"oumIrE87FUemIexLDkxMUKYQJtD6x0yXbd3RfX8RCwfSEdDvYbPD1Bd3xqH57UWllbhlkfgK3JIytGjrz1aYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02c6ceafe55a16cb1d8b5d05222d14476a4e233d3f723a7be5012ea65c577199","last_reissued_at":"2026-05-18T03:57:02.270202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:02.270202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5490","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-18T03:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmETKbhyQiUO+7Yozh5Uj069S/d3T0f5fEJQ5SpU41Ilvqvx/7XCc5cpz1zyBOj9TM/ESn7d9utr0zGoR7hVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:47:57.086932Z"},"content_sha256":"1f8790cf25963e3a7bf0d0aef2ff3e485e059eeda904b96c75fcd53cbc7ec56d","schema_version":"1.0","event_id":"sha256:1f8790cf25963e3a7bf0d0aef2ff3e485e059eeda904b96c75fcd53cbc7ec56d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ALDM5L7FLILMWHMLLUCSELIUI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding a princess in a palace: A pursuit-evasion problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"John R. Britnell, Mark Wildon","submitted_at":"2012-04-24T20:22:05Z","abstract_excerpt":"This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied `Cops and Robbers Game', the prince has no knowledge of the position of the princess; he may, however, visit any single room he wishes on each day. We characterize the graphs for which the prince has a winning strategy, and determine, for each such graph, the minimum number of days the prince requires to guarantee to find the princess."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5490","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-18T03:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4sm85y6ve6SHoTePSvo/QyYrMn3fBCbknLdE7auQuvrp+5fbo71GSgE3dOGVEdcgR/VnVOrwTKoZ3IovuZ0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:47:57.087280Z"},"content_sha256":"188470ab960572b4f113a697966709548050e8f3ba769974acfb9b6de7636774","schema_version":"1.0","event_id":"sha256:188470ab960572b4f113a697966709548050e8f3ba769974acfb9b6de7636774"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/bundle.json","state_url":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALDM5L7FLILMWHMLLUCSELIUI5/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-29T19:47:57Z","links":{"resolver":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5","bundle":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/bundle.json","state":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALDM5L7FLILMWHMLLUCSELIUI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ALDM5L7FLILMWHMLLUCSELIUI5","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":"b0a92e6577433612cc5c54199e2e93f63f697df2fdf312e7ba13a7dd80478b8c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:22:05Z","title_canon_sha256":"50f31439dd8bd450afe139e7f7712ba8c5e6e2bbcdec339a7779953da634249a"},"schema_version":"1.0","source":{"id":"1204.5490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5490","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5490v1","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5490","created_at":"2026-05-18T03:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"ALDM5L7FLILM","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ALDM5L7FLILMWHML","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ALDM5L7F","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:188470ab960572b4f113a697966709548050e8f3ba769974acfb9b6de7636774","target":"graph","created_at":"2026-05-18T03:57:02Z","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":"This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied `Cops and Robbers Game', the prince has no knowledge of the position of the princess; he may, however, visit any single room he wishes on each day. We characterize the graphs for which the prince has a winning strategy, and determine, for each such graph, the minimum number of days the prince requires to guarantee to find the princess.","authors_text":"John R. Britnell, Mark Wildon","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:22:05Z","title":"Finding a princess in a palace: A pursuit-evasion problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5490","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:1f8790cf25963e3a7bf0d0aef2ff3e485e059eeda904b96c75fcd53cbc7ec56d","target":"record","created_at":"2026-05-18T03:57:02Z","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":"b0a92e6577433612cc5c54199e2e93f63f697df2fdf312e7ba13a7dd80478b8c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:22:05Z","title_canon_sha256":"50f31439dd8bd450afe139e7f7712ba8c5e6e2bbcdec339a7779953da634249a"},"schema_version":"1.0","source":{"id":"1204.5490","kind":"arxiv","version":1}},"canonical_sha256":"02c6ceafe55a16cb1d8b5d05222d14476a4e233d3f723a7be5012ea65c577199","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02c6ceafe55a16cb1d8b5d05222d14476a4e233d3f723a7be5012ea65c577199","first_computed_at":"2026-05-18T03:57:02.270202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:02.270202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oumIrE87FUemIexLDkxMUKYQJtD6x0yXbd3RfX8RCwfSEdDvYbPD1Bd3xqH57UWllbhlkfgK3JIytGjrz1aYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:02.272447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f8790cf25963e3a7bf0d0aef2ff3e485e059eeda904b96c75fcd53cbc7ec56d","sha256:188470ab960572b4f113a697966709548050e8f3ba769974acfb9b6de7636774"],"state_sha256":"1efa4f87dbfaa02892a949aff68fc31519c58167170e4e8e85aed77404e3c516"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7pwZcCyQh9sk6IBLZniD03x8GfFFcvC+dOFboY0GUlGkOq0AWrbJjqSv6wy6pmYhuvqA3lP+HT1UQPNrSCpQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:47:57.089742Z","bundle_sha256":"0515f56fb786d16c7406fb133be6a63e816884ffee2792d4c73e9564625f1644"}}