{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YHECHQEJWJH7AAD3LN32S23MG3","short_pith_number":"pith:YHECHQEJ","canonical_record":{"source":{"id":"1008.1865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-11T09:29:38Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"dc7dd7dba944c009017b9647bc9fa490e6a8ed27f16bc4ee6bd9a1482149aa8a","abstract_canon_sha256":"e906b1bd2b7b12a573a8a0cde9290bde725a1b11793b2a53cbe88c7dfd11f05d"},"schema_version":"1.0"},"canonical_sha256":"c1c823c089b24ff0007b5b77a96b6c36f722952586f32e7ec541935e8cfe238f","source":{"kind":"arxiv","id":"1008.1865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1865","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1865v1","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1865","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"YHECHQEJWJH7","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YHECHQEJWJH7AAD3","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YHECHQEJ","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YHECHQEJWJH7AAD3LN32S23MG3","target":"record","payload":{"canonical_record":{"source":{"id":"1008.1865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-11T09:29:38Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"dc7dd7dba944c009017b9647bc9fa490e6a8ed27f16bc4ee6bd9a1482149aa8a","abstract_canon_sha256":"e906b1bd2b7b12a573a8a0cde9290bde725a1b11793b2a53cbe88c7dfd11f05d"},"schema_version":"1.0"},"canonical_sha256":"c1c823c089b24ff0007b5b77a96b6c36f722952586f32e7ec541935e8cfe238f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:21.620508Z","signature_b64":"w8r8SMv1kuQUSa89fJbLgIZ05VDRgCaRdW5cKbkdTB5Xnbc4IUmY1Ij1OC8wS0LufL3tIeA8KuTZzMGY4DPJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1c823c089b24ff0007b5b77a96b6c36f722952586f32e7ec541935e8cfe238f","last_reissued_at":"2026-05-18T03:03:21.620040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:21.620040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.1865","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-18T03:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDDL83ROFfdwsLJGm3xsM8icrsK0J7mdH/1tYRqNyN0nt7WWj0uRT5yktdQ9GKKDbpvXv6T6iHQyzFn38sgqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:00:05.663183Z"},"content_sha256":"e7b1b493d862fb816da563dc58c146028aa85d33f9ec33f4bd2cfae75fc654fc","schema_version":"1.0","event_id":"sha256:e7b1b493d862fb816da563dc58c146028aa85d33f9ec33f4bd2cfae75fc654fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YHECHQEJWJH7AAD3LN32S23MG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hitting time results for Maker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Dan Hefetz, Michael Krivelevich, Sonny Ben-Shimon","submitted_at":"2010-08-11T09:29:38Z","abstract_excerpt":"We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph process that Maker starts having a winning strategy for his final graph to admit some property $\\mP$. We focus on three natural properties for Maker's graph, namely being $k$-vertex-connected, admitting a perfect matching, and being Hamiltonian. We prove the following optimal hitting time results: with high probability Maker wins the $k$-vertex connectivity game exactly at the time the random graph process first reaches m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1865","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-18T03:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/fN8XZW2rnSEBI3h/iMsiBnMeClBnXP/Xo3w5dxRk3l5Cji5rUieXtUcinDqB1qDg/w+u1aKx/KC9e8JlVZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:00:05.663554Z"},"content_sha256":"3fe1f74489fc72e1a0cbb52b373d25c3266205e5bf34acad08092dde725f4cf2","schema_version":"1.0","event_id":"sha256:3fe1f74489fc72e1a0cbb52b373d25c3266205e5bf34acad08092dde725f4cf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHECHQEJWJH7AAD3LN32S23MG3/bundle.json","state_url":"https://pith.science/pith/YHECHQEJWJH7AAD3LN32S23MG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHECHQEJWJH7AAD3LN32S23MG3/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-05-28T06:00:05Z","links":{"resolver":"https://pith.science/pith/YHECHQEJWJH7AAD3LN32S23MG3","bundle":"https://pith.science/pith/YHECHQEJWJH7AAD3LN32S23MG3/bundle.json","state":"https://pith.science/pith/YHECHQEJWJH7AAD3LN32S23MG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHECHQEJWJH7AAD3LN32S23MG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YHECHQEJWJH7AAD3LN32S23MG3","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":"e906b1bd2b7b12a573a8a0cde9290bde725a1b11793b2a53cbe88c7dfd11f05d","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-11T09:29:38Z","title_canon_sha256":"dc7dd7dba944c009017b9647bc9fa490e6a8ed27f16bc4ee6bd9a1482149aa8a"},"schema_version":"1.0","source":{"id":"1008.1865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1865","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1865v1","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1865","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"YHECHQEJWJH7","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YHECHQEJWJH7AAD3","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YHECHQEJ","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:3fe1f74489fc72e1a0cbb52b373d25c3266205e5bf34acad08092dde725f4cf2","target":"graph","created_at":"2026-05-18T03:03:21Z","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 study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph process that Maker starts having a winning strategy for his final graph to admit some property $\\mP$. We focus on three natural properties for Maker's graph, namely being $k$-vertex-connected, admitting a perfect matching, and being Hamiltonian. We prove the following optimal hitting time results: with high probability Maker wins the $k$-vertex connectivity game exactly at the time the random graph process first reaches m","authors_text":"Asaf Ferber, Dan Hefetz, Michael Krivelevich, Sonny Ben-Shimon","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-11T09:29:38Z","title":"Hitting time results for Maker-Breaker games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1865","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:e7b1b493d862fb816da563dc58c146028aa85d33f9ec33f4bd2cfae75fc654fc","target":"record","created_at":"2026-05-18T03:03:21Z","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":"e906b1bd2b7b12a573a8a0cde9290bde725a1b11793b2a53cbe88c7dfd11f05d","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-11T09:29:38Z","title_canon_sha256":"dc7dd7dba944c009017b9647bc9fa490e6a8ed27f16bc4ee6bd9a1482149aa8a"},"schema_version":"1.0","source":{"id":"1008.1865","kind":"arxiv","version":1}},"canonical_sha256":"c1c823c089b24ff0007b5b77a96b6c36f722952586f32e7ec541935e8cfe238f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1c823c089b24ff0007b5b77a96b6c36f722952586f32e7ec541935e8cfe238f","first_computed_at":"2026-05-18T03:03:21.620040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:21.620040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w8r8SMv1kuQUSa89fJbLgIZ05VDRgCaRdW5cKbkdTB5Xnbc4IUmY1Ij1OC8wS0LufL3tIeA8KuTZzMGY4DPJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:21.620508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7b1b493d862fb816da563dc58c146028aa85d33f9ec33f4bd2cfae75fc654fc","sha256:3fe1f74489fc72e1a0cbb52b373d25c3266205e5bf34acad08092dde725f4cf2"],"state_sha256":"71d1d20a3ddd8bd1e07dc0df2d4c68e93691ae48fa372008a64c6e82a3de422a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DR02wyn7k1Z0zvOiCdiTsh3hzRyjdDTbxAaJuMc383K5Jb787zt5aRtB1xA4ryrNV0PQKZqmA55vktw8+netBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:00:05.665604Z","bundle_sha256":"9b5cac8f3a3133231e2b8e6f5369b57fbaeb366ed67d9402c6a244e638692984"}}