{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ROVKYRXGHILCOUTAYN6F2QFUKW","short_pith_number":"pith:ROVKYRXG","schema_version":"1.0","canonical_sha256":"8baaac46e63a16275260c37c5d40b4558caaade88effa2415ba34cca38b6778d","source":{"kind":"arxiv","id":"1305.4559","version":2},"attestation_state":"computed","paper":{"title":"Capturing the Drunk Robber on a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Natasha Komarov, Peter Winkler","submitted_at":"2013-05-20T15:42:50Z","abstract_excerpt":"We show that the expected time for a smart \"cop\" to catch a drunk \"robber\" on an $n$-vertex graph is at most $n + {\\rm o}(n)$. More precisely, let $G$ be a simple, connected, undirected graph with distinguished points $u$ and $v$ among its $n$ vertices. A cop begins at $u$ and a robber at $v$; they move alternately from vertex to adjacent vertex. The robber moves randomly, according to a simple random walk on $G$; the cop sees all and moves as she wishes, with the object of \"capturing\" the robber---that is, occupying the same vertex---in least expected time. We show that the cop succeeds in ex"},"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":"1305.4559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:42:50Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"bbc15ecb5a3149dd61169e0547d74fc83f7169dab96fd55310207c9d442459d5","abstract_canon_sha256":"88515aadc05cab8a7dcfd99b8b99918a1b15e9dc3967aa83c9fb2e7b1e181bc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:44.603723Z","signature_b64":"6S8yMKBzFe7A/g6feo5z3tllZDVKBFvrNI2rKMcg1ttcBbggvCdvT8eIP70UoGncye22YP7350L9SSWnYxbECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8baaac46e63a16275260c37c5d40b4558caaade88effa2415ba34cca38b6778d","last_reissued_at":"2026-05-18T02:38:44.603324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:44.603324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capturing the Drunk Robber on a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Natasha Komarov, Peter Winkler","submitted_at":"2013-05-20T15:42:50Z","abstract_excerpt":"We show that the expected time for a smart \"cop\" to catch a drunk \"robber\" on an $n$-vertex graph is at most $n + {\\rm o}(n)$. More precisely, let $G$ be a simple, connected, undirected graph with distinguished points $u$ and $v$ among its $n$ vertices. A cop begins at $u$ and a robber at $v$; they move alternately from vertex to adjacent vertex. The robber moves randomly, according to a simple random walk on $G$; the cop sees all and moves as she wishes, with the object of \"capturing\" the robber---that is, occupying the same vertex---in least expected time. We show that the cop succeeds in ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4559","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":"1305.4559","created_at":"2026-05-18T02:38:44.603383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4559v2","created_at":"2026-05-18T02:38:44.603383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4559","created_at":"2026-05-18T02:38:44.603383+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROVKYRXGHILC","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROVKYRXGHILCOUTA","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROVKYRXG","created_at":"2026-05-18T12:27:59.945178+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/ROVKYRXGHILCOUTAYN6F2QFUKW","json":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW.json","graph_json":"https://pith.science/api/pith-number/ROVKYRXGHILCOUTAYN6F2QFUKW/graph.json","events_json":"https://pith.science/api/pith-number/ROVKYRXGHILCOUTAYN6F2QFUKW/events.json","paper":"https://pith.science/paper/ROVKYRXG"},"agent_actions":{"view_html":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW","download_json":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW.json","view_paper":"https://pith.science/paper/ROVKYRXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4559&json=true","fetch_graph":"https://pith.science/api/pith-number/ROVKYRXGHILCOUTAYN6F2QFUKW/graph.json","fetch_events":"https://pith.science/api/pith-number/ROVKYRXGHILCOUTAYN6F2QFUKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/action/storage_attestation","attest_author":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/action/author_attestation","sign_citation":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/action/citation_signature","submit_replication":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/action/replication_record"}},"created_at":"2026-05-18T02:38:44.603383+00:00","updated_at":"2026-05-18T02:38:44.603383+00:00"}