{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ALDM5L7FLILMWHMLLUCSELIUI5","short_pith_number":"pith:ALDM5L7F","schema_version":"1.0","canonical_sha256":"02c6ceafe55a16cb1d8b5d05222d14476a4e233d3f723a7be5012ea65c577199","source":{"kind":"arxiv","id":"1204.5490","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.5490","created_at":"2026-05-18T03:57:02.270305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5490v1","created_at":"2026-05-18T03:57:02.270305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5490","created_at":"2026-05-18T03:57:02.270305+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALDM5L7FLILM","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALDM5L7FLILMWHML","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALDM5L7F","created_at":"2026-05-18T12:26:58.693483+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/ALDM5L7FLILMWHMLLUCSELIUI5","json":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5.json","graph_json":"https://pith.science/api/pith-number/ALDM5L7FLILMWHMLLUCSELIUI5/graph.json","events_json":"https://pith.science/api/pith-number/ALDM5L7FLILMWHMLLUCSELIUI5/events.json","paper":"https://pith.science/paper/ALDM5L7F"},"agent_actions":{"view_html":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5","download_json":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5.json","view_paper":"https://pith.science/paper/ALDM5L7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5490&json=true","fetch_graph":"https://pith.science/api/pith-number/ALDM5L7FLILMWHMLLUCSELIUI5/graph.json","fetch_events":"https://pith.science/api/pith-number/ALDM5L7FLILMWHMLLUCSELIUI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/action/storage_attestation","attest_author":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/action/author_attestation","sign_citation":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/action/citation_signature","submit_replication":"https://pith.science/pith/ALDM5L7FLILMWHMLLUCSELIUI5/action/replication_record"}},"created_at":"2026-05-18T03:57:02.270305+00:00","updated_at":"2026-05-18T03:57:02.270305+00:00"}