{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ESFFXTSRI77EWLXBCBT7DRW7BU","short_pith_number":"pith:ESFFXTSR","canonical_record":{"source":{"id":"1105.2851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-13T23:29:29Z","cross_cats_sorted":[],"title_canon_sha256":"73e47ffb4a2f6254d27617b25b953aa0f06278a5458d25a0589cad6bad605dfe","abstract_canon_sha256":"0e3d4d90e827e7e9d153d6f6870aa0659fa5aabde2541baae9936f6fdf02b173"},"schema_version":"1.0"},"canonical_sha256":"248a5bce5147fe4b2ee11067f1c6df0d0babe3d2f573cb0c5906f2dead015e1e","source":{"kind":"arxiv","id":"1105.2851","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2851","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2851v1","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2851","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"ESFFXTSRI77E","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ESFFXTSRI77EWLXB","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ESFFXTSR","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ESFFXTSRI77EWLXBCBT7DRW7BU","target":"record","payload":{"canonical_record":{"source":{"id":"1105.2851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-13T23:29:29Z","cross_cats_sorted":[],"title_canon_sha256":"73e47ffb4a2f6254d27617b25b953aa0f06278a5458d25a0589cad6bad605dfe","abstract_canon_sha256":"0e3d4d90e827e7e9d153d6f6870aa0659fa5aabde2541baae9936f6fdf02b173"},"schema_version":"1.0"},"canonical_sha256":"248a5bce5147fe4b2ee11067f1c6df0d0babe3d2f573cb0c5906f2dead015e1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:19.553094Z","signature_b64":"f1zdHMXFGztFUDGYUDhyTAEspYq7LOm2vH0raFM4NxTBt1/ZGVUApLwEAJuK5eZ5/6RJvs2NLZLw+PHIaIShCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"248a5bce5147fe4b2ee11067f1c6df0d0babe3d2f573cb0c5906f2dead015e1e","last_reissued_at":"2026-05-18T02:56:19.552476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:19.552476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.2851","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-18T02:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElV97ISPpeY0+Mc2WHd9HBI6HRKkX7tSRuVLjgIrVk1Iv4OL++2TaLqqe2cXYk6Sd00T9Iqz7Pu+5/6kB+evCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:33.131780Z"},"content_sha256":"6b1e6d973db97a622f209c50ac2f05a2090fdec1708466a5cb2b64a400a7e3f9","schema_version":"1.0","event_id":"sha256:6b1e6d973db97a622f209c50ac2f05a2090fdec1708466a5cb2b64a400a7e3f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ESFFXTSRI77EWLXBCBT7DRW7BU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Mehrabian","submitted_at":"2011-05-13T23:29:29Z","abstract_excerpt":"We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e. can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. Let c_{infty}(G) denote the number of cops needed to capture the robber in a graph G in this variant. We characterize graphs G with c_{infty}(G)=1, and give an O(|V(G)|^2) algorithm for their detection. We prove a lower bound for c_{infty} of expander graphs, and use it to prove three things. The first is that if np > 4.2 log n then the random graph G = G(n,p) asymptotically almost sure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2851","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-18T02:56:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7T8/MjjYlMujcgy/QI2iTd18Or9DxmhWSiyfRHIOme2kokYynfOxAqtUTzEryfAxrnMxZFgl5GARcQSrhUxUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:33.132483Z"},"content_sha256":"22c84da5ca777079c656490abf90d17e824bc20388587805ffa7c8abb94604b0","schema_version":"1.0","event_id":"sha256:22c84da5ca777079c656490abf90d17e824bc20388587805ffa7c8abb94604b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESFFXTSRI77EWLXBCBT7DRW7BU/bundle.json","state_url":"https://pith.science/pith/ESFFXTSRI77EWLXBCBT7DRW7BU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESFFXTSRI77EWLXBCBT7DRW7BU/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-09T07:16:33Z","links":{"resolver":"https://pith.science/pith/ESFFXTSRI77EWLXBCBT7DRW7BU","bundle":"https://pith.science/pith/ESFFXTSRI77EWLXBCBT7DRW7BU/bundle.json","state":"https://pith.science/pith/ESFFXTSRI77EWLXBCBT7DRW7BU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESFFXTSRI77EWLXBCBT7DRW7BU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ESFFXTSRI77EWLXBCBT7DRW7BU","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":"0e3d4d90e827e7e9d153d6f6870aa0659fa5aabde2541baae9936f6fdf02b173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-13T23:29:29Z","title_canon_sha256":"73e47ffb4a2f6254d27617b25b953aa0f06278a5458d25a0589cad6bad605dfe"},"schema_version":"1.0","source":{"id":"1105.2851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2851","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2851v1","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2851","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"ESFFXTSRI77E","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ESFFXTSRI77EWLXB","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ESFFXTSR","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:22c84da5ca777079c656490abf90d17e824bc20388587805ffa7c8abb94604b0","target":"graph","created_at":"2026-05-18T02:56:19Z","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 consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e. can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. Let c_{infty}(G) denote the number of cops needed to capture the robber in a graph G in this variant. We characterize graphs G with c_{infty}(G)=1, and give an O(|V(G)|^2) algorithm for their detection. We prove a lower bound for c_{infty} of expander graphs, and use it to prove three things. The first is that if np > 4.2 log n then the random graph G = G(n,p) asymptotically almost sure","authors_text":"Abbas Mehrabian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-13T23:29:29Z","title":"Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2851","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:6b1e6d973db97a622f209c50ac2f05a2090fdec1708466a5cb2b64a400a7e3f9","target":"record","created_at":"2026-05-18T02:56:19Z","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":"0e3d4d90e827e7e9d153d6f6870aa0659fa5aabde2541baae9936f6fdf02b173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-13T23:29:29Z","title_canon_sha256":"73e47ffb4a2f6254d27617b25b953aa0f06278a5458d25a0589cad6bad605dfe"},"schema_version":"1.0","source":{"id":"1105.2851","kind":"arxiv","version":1}},"canonical_sha256":"248a5bce5147fe4b2ee11067f1c6df0d0babe3d2f573cb0c5906f2dead015e1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"248a5bce5147fe4b2ee11067f1c6df0d0babe3d2f573cb0c5906f2dead015e1e","first_computed_at":"2026-05-18T02:56:19.552476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:19.552476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f1zdHMXFGztFUDGYUDhyTAEspYq7LOm2vH0raFM4NxTBt1/ZGVUApLwEAJuK5eZ5/6RJvs2NLZLw+PHIaIShCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:19.553094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b1e6d973db97a622f209c50ac2f05a2090fdec1708466a5cb2b64a400a7e3f9","sha256:22c84da5ca777079c656490abf90d17e824bc20388587805ffa7c8abb94604b0"],"state_sha256":"e9f0c4f5ecf9ed1448154a565485342e39033549c0a2e3f9b5bcbbedf1240d28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lngnLZJHQ/yY6iuPoykT9Jh6hq/EKxJtQwa/U2H2WE1wUsrTIpw3gpyQ+ZHT0rHCnyjLx2dWdBUVrSlewORNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:16:33.136408Z","bundle_sha256":"4bef4931c86c9cf35b43d69e46c7ace1dd1515b989a670c7c5736ab7978fa99c"}}