{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5XF4VF5QYSUX345KBHY2U2HGLB","short_pith_number":"pith:5XF4VF5Q","schema_version":"1.0","canonical_sha256":"edcbca97b0c4a97df3aa09f1aa68e658476fd7e06aee71fba1adc9fa239f5c33","source":{"kind":"arxiv","id":"1311.0211","version":2},"attestation_state":"computed","paper":{"title":"Hunter & Mole","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Natasha Komarov, Peter Winkler","submitted_at":"2013-11-01T15:48:41Z","abstract_excerpt":"We consider a variation of a cops and robbers game in which the cop---here referred to as \"hunter\"---is not constrained by the graph but must play in the dark against a \"mole.\" We characterize the graphs---which we will call \"hunter-win\"---on which the hunter can guarantee capture of the mole in bounded time. We also define an optimal hunter strategy (and consequently an upper bound on maximum game time on hunter-win graphs) and note that an optimal hunter strategy need not take advantage of the hunter's unconstrained movement! This game comes from a puzzle of unknown origin which was told to "},"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":"1311.0211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-01T15:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"0b2b8f0bfcf0e2393a5a9539eeb87a60891b042a9983c318d773a60e8b8c677d","abstract_canon_sha256":"bf52ad985b3813918e271f5979884f870830bacf9a5eba5d7fff5f8ac2d28ce9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:56.883006Z","signature_b64":"wM5Ac2kz0nwR0sbkqCNX5ahcRlVGxN2O7C/uJXff5tVEuz1jXjaFG2IQgDOP83T/qj9DPVgOCpUCYYnzg0LPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edcbca97b0c4a97df3aa09f1aa68e658476fd7e06aee71fba1adc9fa239f5c33","last_reissued_at":"2026-05-18T02:51:56.882560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:56.882560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hunter & Mole","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Natasha Komarov, Peter Winkler","submitted_at":"2013-11-01T15:48:41Z","abstract_excerpt":"We consider a variation of a cops and robbers game in which the cop---here referred to as \"hunter\"---is not constrained by the graph but must play in the dark against a \"mole.\" We characterize the graphs---which we will call \"hunter-win\"---on which the hunter can guarantee capture of the mole in bounded time. We also define an optimal hunter strategy (and consequently an upper bound on maximum game time on hunter-win graphs) and note that an optimal hunter strategy need not take advantage of the hunter's unconstrained movement! This game comes from a puzzle of unknown origin which was told to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0211","kind":"arxiv","version":2},"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":"1311.0211","created_at":"2026-05-18T02:51:56.882628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0211v2","created_at":"2026-05-18T02:51:56.882628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0211","created_at":"2026-05-18T02:51:56.882628+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XF4VF5QYSUX","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XF4VF5QYSUX345K","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XF4VF5Q","created_at":"2026-05-18T12:27:34.582898+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/5XF4VF5QYSUX345KBHY2U2HGLB","json":"https://pith.science/pith/5XF4VF5QYSUX345KBHY2U2HGLB.json","graph_json":"https://pith.science/api/pith-number/5XF4VF5QYSUX345KBHY2U2HGLB/graph.json","events_json":"https://pith.science/api/pith-number/5XF4VF5QYSUX345KBHY2U2HGLB/events.json","paper":"https://pith.science/paper/5XF4VF5Q"},"agent_actions":{"view_html":"https://pith.science/pith/5XF4VF5QYSUX345KBHY2U2HGLB","download_json":"https://pith.science/pith/5XF4VF5QYSUX345KBHY2U2HGLB.json","view_paper":"https://pith.science/paper/5XF4VF5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0211&json=true","fetch_graph":"https://pith.science/api/pith-number/5XF4VF5QYSUX345KBHY2U2HGLB/graph.json","fetch_events":"https://pith.science/api/pith-number/5XF4VF5QYSUX345KBHY2U2HGLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XF4VF5QYSUX345KBHY2U2HGLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XF4VF5QYSUX345KBHY2U2HGLB/action/storage_attestation","attest_author":"https://pith.science/pith/5XF4VF5QYSUX345KBHY2U2HGLB/action/author_attestation","sign_citation":"https://pith.science/pith/5XF4VF5QYSUX345KBHY2U2HGLB/action/citation_signature","submit_replication":"https://pith.science/pith/5XF4VF5QYSUX345KBHY2U2HGLB/action/replication_record"}},"created_at":"2026-05-18T02:51:56.882628+00:00","updated_at":"2026-05-18T02:51:56.882628+00:00"}