{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JCSGYCJ62MRER5TXK5RRWIN7R6","short_pith_number":"pith:JCSGYCJ6","canonical_record":{"source":{"id":"1210.7618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T10:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"1bf4819df69f614218c3a6dfcbb1d24ca9cac816b7c6393f9333ea4113e2d4c0","abstract_canon_sha256":"1e998b5828732e52f1eeca44eb9ed2b41cf753145cad3e5c6bd4820083dc8315"},"schema_version":"1.0"},"canonical_sha256":"48a46c093ed32248f67757631b21bf8fa44dfae86469a88529b6d382866eb300","source":{"kind":"arxiv","id":"1210.7618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7618","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7618v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7618","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"JCSGYCJ62MRE","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JCSGYCJ62MRER5TX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JCSGYCJ6","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JCSGYCJ62MRER5TXK5RRWIN7R6","target":"record","payload":{"canonical_record":{"source":{"id":"1210.7618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T10:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"1bf4819df69f614218c3a6dfcbb1d24ca9cac816b7c6393f9333ea4113e2d4c0","abstract_canon_sha256":"1e998b5828732e52f1eeca44eb9ed2b41cf753145cad3e5c6bd4820083dc8315"},"schema_version":"1.0"},"canonical_sha256":"48a46c093ed32248f67757631b21bf8fa44dfae86469a88529b6d382866eb300","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:09.338277Z","signature_b64":"ycByWrZtKbCtkxh6CYr8xLAjhKhrC3ewvjOrCOzLXo9PbLZ1mpr8pZ16AjFAbaTDa9fH4+kKResG+XVZpuohBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48a46c093ed32248f67757631b21bf8fa44dfae86469a88529b6d382866eb300","last_reissued_at":"2026-05-18T03:42:09.337497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:09.337497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.7618","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xAnByeBrSW67SoVmrIN50eSzK13l10+I+Te1qQbrfm6VRHg352jlnAk29YK0N2coesPgmXPKC8eW1HmiX4YAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:48:47.489389Z"},"content_sha256":"848cee8f6bcbb144b3c5e355f9d42869d30060482f3be7e3270d39f10e3df3a6","schema_version":"1.0","event_id":"sha256:848cee8f6bcbb144b3c5e355f9d42869d30060482f3be7e3270d39f10e3df3a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JCSGYCJ62MRER5TXK5RRWIN7R6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Biased Games On Random Boards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alon Naor, Asaf Ferber, Michael Krivelevich, Roman Glebov","submitted_at":"2012-10-29T10:59:33Z","abstract_excerpt":"In this paper we analyze biased Maker-Breaker games and Avoider-Enforcer games, both played on the edge set of a random board $G\\sim \\gnp$. In Maker-Breaker games there are two players, denoted by Maker and Breaker. In each round, Maker claims one previously unclaimed edge of $G$ and Breaker responds by claiming $b$ previously unclaimed edges. We consider the Hamiltonicity game, the perfect matching game and the $k$-vertex-connectivity game, where Maker's goal is to build a graph which possesses the relevant property. Avoider-Enforcer games are the reverse analogue of Maker-Breaker games with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7618","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTOqDvacZRUsN2HhSmtSJ+CRxTChslfx9oLbAHSWSyPfAOGS+9qP6A+6ATrwO5R2VccZIjmzVkHQUfKt0HRGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:48:47.490058Z"},"content_sha256":"71d02412f3d7541edbb108d66a4ddf34312c96aee7a810d688f9161a46659d56","schema_version":"1.0","event_id":"sha256:71d02412f3d7541edbb108d66a4ddf34312c96aee7a810d688f9161a46659d56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCSGYCJ62MRER5TXK5RRWIN7R6/bundle.json","state_url":"https://pith.science/pith/JCSGYCJ62MRER5TXK5RRWIN7R6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCSGYCJ62MRER5TXK5RRWIN7R6/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-28T23:48:47Z","links":{"resolver":"https://pith.science/pith/JCSGYCJ62MRER5TXK5RRWIN7R6","bundle":"https://pith.science/pith/JCSGYCJ62MRER5TXK5RRWIN7R6/bundle.json","state":"https://pith.science/pith/JCSGYCJ62MRER5TXK5RRWIN7R6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCSGYCJ62MRER5TXK5RRWIN7R6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JCSGYCJ62MRER5TXK5RRWIN7R6","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":"1e998b5828732e52f1eeca44eb9ed2b41cf753145cad3e5c6bd4820083dc8315","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T10:59:33Z","title_canon_sha256":"1bf4819df69f614218c3a6dfcbb1d24ca9cac816b7c6393f9333ea4113e2d4c0"},"schema_version":"1.0","source":{"id":"1210.7618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7618","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7618v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7618","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"JCSGYCJ62MRE","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JCSGYCJ62MRER5TX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JCSGYCJ6","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:71d02412f3d7541edbb108d66a4ddf34312c96aee7a810d688f9161a46659d56","target":"graph","created_at":"2026-05-18T03:42:09Z","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":"In this paper we analyze biased Maker-Breaker games and Avoider-Enforcer games, both played on the edge set of a random board $G\\sim \\gnp$. In Maker-Breaker games there are two players, denoted by Maker and Breaker. In each round, Maker claims one previously unclaimed edge of $G$ and Breaker responds by claiming $b$ previously unclaimed edges. We consider the Hamiltonicity game, the perfect matching game and the $k$-vertex-connectivity game, where Maker's goal is to build a graph which possesses the relevant property. Avoider-Enforcer games are the reverse analogue of Maker-Breaker games with ","authors_text":"Alon Naor, Asaf Ferber, Michael Krivelevich, Roman Glebov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T10:59:33Z","title":"Biased Games On Random Boards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7618","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:848cee8f6bcbb144b3c5e355f9d42869d30060482f3be7e3270d39f10e3df3a6","target":"record","created_at":"2026-05-18T03:42:09Z","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":"1e998b5828732e52f1eeca44eb9ed2b41cf753145cad3e5c6bd4820083dc8315","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-29T10:59:33Z","title_canon_sha256":"1bf4819df69f614218c3a6dfcbb1d24ca9cac816b7c6393f9333ea4113e2d4c0"},"schema_version":"1.0","source":{"id":"1210.7618","kind":"arxiv","version":1}},"canonical_sha256":"48a46c093ed32248f67757631b21bf8fa44dfae86469a88529b6d382866eb300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48a46c093ed32248f67757631b21bf8fa44dfae86469a88529b6d382866eb300","first_computed_at":"2026-05-18T03:42:09.337497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:09.337497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ycByWrZtKbCtkxh6CYr8xLAjhKhrC3ewvjOrCOzLXo9PbLZ1mpr8pZ16AjFAbaTDa9fH4+kKResG+XVZpuohBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:09.338277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:848cee8f6bcbb144b3c5e355f9d42869d30060482f3be7e3270d39f10e3df3a6","sha256:71d02412f3d7541edbb108d66a4ddf34312c96aee7a810d688f9161a46659d56"],"state_sha256":"c7a8bb9b7428e12cfc60f0101965c49a10c49bbade3bdf9c22beadaceb87e7f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0t/FcmxoCWx32zw/GDOaWi29Z3Co0M2vH2d+oAcdMiAZtK+fU6oVvRak3WTGBdnf++isr4UVl6ZelF8mYEdCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:48:47.493397Z","bundle_sha256":"f6885b70bb4605081dd258d0bda1b25cfe717cbcecfde06f6cfbef077712bacb"}}