{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ROVKYRXGHILCOUTAYN6F2QFUKW","short_pith_number":"pith:ROVKYRXG","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"},"canonical_sha256":"8baaac46e63a16275260c37c5d40b4558caaade88effa2415ba34cca38b6778d","source":{"kind":"arxiv","id":"1305.4559","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4559","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4559v2","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4559","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"ROVKYRXGHILC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"ROVKYRXGHILCOUTA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"ROVKYRXG","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ROVKYRXGHILCOUTAYN6F2QFUKW","target":"record","payload":{"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"},"canonical_sha256":"8baaac46e63a16275260c37c5d40b4558caaade88effa2415ba34cca38b6778d","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"},"source_kind":"arxiv","source_id":"1305.4559","source_version":2,"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-18T02:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zg7Zh8T0IS/NXkA/LMaX0w1LSlYyzvt0jXg1+znWj8QOnCpVEyk7zVxljuiRSg14BtTS639sUOtw1zE00GKaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:49:44.168738Z"},"content_sha256":"ffd219669a9e5fc340053c6125ab222006caec3edaf715192ed33a9594e9698f","schema_version":"1.0","event_id":"sha256:ffd219669a9e5fc340053c6125ab222006caec3edaf715192ed33a9594e9698f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ROVKYRXGHILCOUTAYN6F2QFUKW","target":"graph","payload":{"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"},"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-18T02:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kkpgYGUzEcncQeoSJYX3aH7+b/Dqt6Hp9czheb9j4txhK2N9shU3O8zr+6NUKzl22vEWHXmxWiHQO4EAb6+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:49:44.169093Z"},"content_sha256":"32790062353e79ffd6915b6f00cb21e717c5debb2d41843329c993dd227ccf61","schema_version":"1.0","event_id":"sha256:32790062353e79ffd6915b6f00cb21e717c5debb2d41843329c993dd227ccf61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/bundle.json","state_url":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/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-06-12T06:49:44Z","links":{"resolver":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW","bundle":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/bundle.json","state":"https://pith.science/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROVKYRXGHILCOUTAYN6F2QFUKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ROVKYRXGHILCOUTAYN6F2QFUKW","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":"88515aadc05cab8a7dcfd99b8b99918a1b15e9dc3967aa83c9fb2e7b1e181bc4","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:42:50Z","title_canon_sha256":"bbc15ecb5a3149dd61169e0547d74fc83f7169dab96fd55310207c9d442459d5"},"schema_version":"1.0","source":{"id":"1305.4559","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4559","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4559v2","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4559","created_at":"2026-05-18T02:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"ROVKYRXGHILC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"ROVKYRXGHILCOUTA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"ROVKYRXG","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:32790062353e79ffd6915b6f00cb21e717c5debb2d41843329c993dd227ccf61","target":"graph","created_at":"2026-05-18T02:38:44Z","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":"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","authors_text":"Natasha Komarov, Peter Winkler","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:42:50Z","title":"Capturing the Drunk Robber on a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4559","kind":"arxiv","version":2},"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:ffd219669a9e5fc340053c6125ab222006caec3edaf715192ed33a9594e9698f","target":"record","created_at":"2026-05-18T02:38:44Z","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":"88515aadc05cab8a7dcfd99b8b99918a1b15e9dc3967aa83c9fb2e7b1e181bc4","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:42:50Z","title_canon_sha256":"bbc15ecb5a3149dd61169e0547d74fc83f7169dab96fd55310207c9d442459d5"},"schema_version":"1.0","source":{"id":"1305.4559","kind":"arxiv","version":2}},"canonical_sha256":"8baaac46e63a16275260c37c5d40b4558caaade88effa2415ba34cca38b6778d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8baaac46e63a16275260c37c5d40b4558caaade88effa2415ba34cca38b6778d","first_computed_at":"2026-05-18T02:38:44.603324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:44.603324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6S8yMKBzFe7A/g6feo5z3tllZDVKBFvrNI2rKMcg1ttcBbggvCdvT8eIP70UoGncye22YP7350L9SSWnYxbECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:44.603723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4559","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffd219669a9e5fc340053c6125ab222006caec3edaf715192ed33a9594e9698f","sha256:32790062353e79ffd6915b6f00cb21e717c5debb2d41843329c993dd227ccf61"],"state_sha256":"c9e508f665d875b287e4bd0a1bd3596347c1aa9c11be7438fdd57717f9a3504a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJORwHZOCq5GltG9HxsPidgvn2HmJaj3YY6IXU5xiScGdFJo/gup/EE9QiyKwsQUb1+2F+B4pClmBhERcowQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:49:44.171358Z","bundle_sha256":"e326c95ba4b97915f0afd6e2a6332b0ec19fb90ffcd5f294c21f50c5a90c55b1"}}