{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZKM4BT2GAT3SF3TF3SXOKMGN6H","short_pith_number":"pith:ZKM4BT2G","canonical_record":{"source":{"id":"1008.4210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-25T06:01:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3ba0152d1d277d05f15022ebb923c6b0b5d43a438dc94fdb1b1f887cb151f959","abstract_canon_sha256":"ebed81bc01c8fb2efbbf8aabd14e2df9ade64efe73d0d3692d42889fb5e4ab60"},"schema_version":"1.0"},"canonical_sha256":"ca99c0cf4604f722ee65dcaee530cdf1cf79255ff9063290d08d0f4453069bfc","source":{"kind":"arxiv","id":"1008.4210","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4210","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4210v2","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4210","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZKM4BT2GAT3S","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZKM4BT2GAT3SF3TF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZKM4BT2G","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZKM4BT2GAT3SF3TF3SXOKMGN6H","target":"record","payload":{"canonical_record":{"source":{"id":"1008.4210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-25T06:01:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3ba0152d1d277d05f15022ebb923c6b0b5d43a438dc94fdb1b1f887cb151f959","abstract_canon_sha256":"ebed81bc01c8fb2efbbf8aabd14e2df9ade64efe73d0d3692d42889fb5e4ab60"},"schema_version":"1.0"},"canonical_sha256":"ca99c0cf4604f722ee65dcaee530cdf1cf79255ff9063290d08d0f4453069bfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:06.195998Z","signature_b64":"bqJ+woE0DB0s4bExWX10pfn6Yx2r7D6JLUTZA8oV1xP0gNn4J+jLyQQ2xn2rrjIHni2rW99YTC1J4l3Vnlk0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca99c0cf4604f722ee65dcaee530cdf1cf79255ff9063290d08d0f4453069bfc","last_reissued_at":"2026-05-18T04:24:06.195334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:06.195334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.4210","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-18T04:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwE4yy6Wu7vv/UU93sMxt0491BBTGUIQu6FlkKvCBkHY2eGynunKvPb8XLX4LM8HE3VDtlhgL7nE9hZKaD1OCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:42:49.410166Z"},"content_sha256":"838715e85cc691dfba105fc0982ac2e02654d9565d8049a3a01ee300336e9bfb","schema_version":"1.0","event_id":"sha256:838715e85cc691dfba105fc0982ac2e02654d9565d8049a3a01ee300336e9bfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZKM4BT2GAT3SF3TF3SXOKMGN6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cops and Robber Game with a Fast Robber on Interval, Chordal, and Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Abbas Mehrabian","submitted_at":"2010-08-25T06:01:28Z","abstract_excerpt":"We consider a variant of the Cops and Robber game, introduced by Fomin, Golovach, Kratochvil, 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. We study this game on interval graphs, chordal graphs, planar graphs, and hypercube graphs. Let c_{\\infty}(G) denote the number of cops needed to capture the robber in graph G in this variant. We show that if G is an interval graph, then c_{\\infty}(G) = O(sqrt(|V(G)|)), and we give a polynomial-time 3-approximation algorithm for finding c_{\\inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4210","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-18T04:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTkk2jEnjuEfRPGza29LxO4ele+UonBGnQ2w2X7GDeQ1t8GgHrVYqbr1mVzslYSRAGVMviRZLLCwy/snKjMNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:42:49.410887Z"},"content_sha256":"19c007c663da9a0c7cb2fab1e83744370d39878ff182e4fe8fff628e2ec1c786","schema_version":"1.0","event_id":"sha256:19c007c663da9a0c7cb2fab1e83744370d39878ff182e4fe8fff628e2ec1c786"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKM4BT2GAT3SF3TF3SXOKMGN6H/bundle.json","state_url":"https://pith.science/pith/ZKM4BT2GAT3SF3TF3SXOKMGN6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKM4BT2GAT3SF3TF3SXOKMGN6H/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:42:49Z","links":{"resolver":"https://pith.science/pith/ZKM4BT2GAT3SF3TF3SXOKMGN6H","bundle":"https://pith.science/pith/ZKM4BT2GAT3SF3TF3SXOKMGN6H/bundle.json","state":"https://pith.science/pith/ZKM4BT2GAT3SF3TF3SXOKMGN6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKM4BT2GAT3SF3TF3SXOKMGN6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZKM4BT2GAT3SF3TF3SXOKMGN6H","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":"ebed81bc01c8fb2efbbf8aabd14e2df9ade64efe73d0d3692d42889fb5e4ab60","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-25T06:01:28Z","title_canon_sha256":"3ba0152d1d277d05f15022ebb923c6b0b5d43a438dc94fdb1b1f887cb151f959"},"schema_version":"1.0","source":{"id":"1008.4210","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4210","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4210v2","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4210","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZKM4BT2GAT3S","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZKM4BT2GAT3SF3TF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZKM4BT2G","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:19c007c663da9a0c7cb2fab1e83744370d39878ff182e4fe8fff628e2ec1c786","target":"graph","created_at":"2026-05-18T04:24:06Z","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, introduced by Fomin, Golovach, Kratochvil, 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. We study this game on interval graphs, chordal graphs, planar graphs, and hypercube graphs. Let c_{\\infty}(G) denote the number of cops needed to capture the robber in graph G in this variant. We show that if G is an interval graph, then c_{\\infty}(G) = O(sqrt(|V(G)|)), and we give a polynomial-time 3-approximation algorithm for finding c_{\\inf","authors_text":"Abbas Mehrabian","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-25T06:01:28Z","title":"Cops and Robber Game with a Fast Robber on Interval, Chordal, and Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4210","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:838715e85cc691dfba105fc0982ac2e02654d9565d8049a3a01ee300336e9bfb","target":"record","created_at":"2026-05-18T04:24:06Z","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":"ebed81bc01c8fb2efbbf8aabd14e2df9ade64efe73d0d3692d42889fb5e4ab60","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-25T06:01:28Z","title_canon_sha256":"3ba0152d1d277d05f15022ebb923c6b0b5d43a438dc94fdb1b1f887cb151f959"},"schema_version":"1.0","source":{"id":"1008.4210","kind":"arxiv","version":2}},"canonical_sha256":"ca99c0cf4604f722ee65dcaee530cdf1cf79255ff9063290d08d0f4453069bfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca99c0cf4604f722ee65dcaee530cdf1cf79255ff9063290d08d0f4453069bfc","first_computed_at":"2026-05-18T04:24:06.195334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:06.195334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bqJ+woE0DB0s4bExWX10pfn6Yx2r7D6JLUTZA8oV1xP0gNn4J+jLyQQ2xn2rrjIHni2rW99YTC1J4l3Vnlk0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:06.195998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4210","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:838715e85cc691dfba105fc0982ac2e02654d9565d8049a3a01ee300336e9bfb","sha256:19c007c663da9a0c7cb2fab1e83744370d39878ff182e4fe8fff628e2ec1c786"],"state_sha256":"2612487a7470c8be9ec099553e2d8d5816ba4f4c9ec6324e33b296e0f0ba04f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cj8oXctrJMfG9rfrFi0pPUC+vkIysiyjfBkJWgCSAQ9jeULcSSlOORmcwFzlfS2EJUNBOIzwODAjFwi6HUdYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:42:49.415080Z","bundle_sha256":"8351ce9212e994bd513cbfd8d08a2599eb520b00ecce34c89ac00892e08d1bea"}}