{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ULIWR7B5F3E3UIARX5MUCSBAY3","short_pith_number":"pith:ULIWR7B5","canonical_record":{"source":{"id":"1107.1844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T08:32:20Z","cross_cats_sorted":[],"title_canon_sha256":"f7c32b4f98fe1d74085e86d15c6585e34c55b44d483d3f75413fc8c5f818e7bf","abstract_canon_sha256":"95b39dc1fcdeb2b0730998c56617aee48712f3953a3fe2163dd01025d97650d4"},"schema_version":"1.0"},"canonical_sha256":"a2d168fc3d2ec9ba2011bf59414820c6f166a0ae99c129cb3192a47533d008a5","source":{"kind":"arxiv","id":"1107.1844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1844","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1844v1","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1844","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"ULIWR7B5F3E3","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"ULIWR7B5F3E3UIAR","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"ULIWR7B5","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ULIWR7B5F3E3UIARX5MUCSBAY3","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T08:32:20Z","cross_cats_sorted":[],"title_canon_sha256":"f7c32b4f98fe1d74085e86d15c6585e34c55b44d483d3f75413fc8c5f818e7bf","abstract_canon_sha256":"95b39dc1fcdeb2b0730998c56617aee48712f3953a3fe2163dd01025d97650d4"},"schema_version":"1.0"},"canonical_sha256":"a2d168fc3d2ec9ba2011bf59414820c6f166a0ae99c129cb3192a47533d008a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:34.050084Z","signature_b64":"LTLh5VOaaGPE8hDmprVBnGogEP5251L01IBmnPO3cedh2c7/AGdh23qMCJ09jyhR71pteCSQD0SpZULXGg0vCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2d168fc3d2ec9ba2011bf59414820c6f166a0ae99c129cb3192a47533d008a5","last_reissued_at":"2026-05-18T04:18:34.049645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:34.049645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1844","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-18T04:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxV+drAOSQ4LWF62YM0txGZmqnYAvLqXAO6O9fTLS+fTXf/baCM0M+QTt0YLfaF4v/lPRlPujZ7vNF68wcmnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:39:06.897673Z"},"content_sha256":"ee3b0da0b9a7f35ff4ed62eae91024d90d9c94625f825156a64fd40191dd0ad6","schema_version":"1.0","event_id":"sha256:ee3b0da0b9a7f35ff4ed62eae91024d90d9c94625f825156a64fd40191dd0ad6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ULIWR7B5F3E3UIARX5MUCSBAY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Biased orientation games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Ido Ben-Eliezer, Michael Krivelevich","submitted_at":"2011-07-10T08:32:20Z","abstract_excerpt":"We study biased {\\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker wins if the tournament has some property $\\mathcal P$ and Breaker wins otherwise.\n  We provide bounds on the bias that is required for a Maker's win and for a Breaker's win in three different games. In the first game Maker wins if the obtained tournament has a cycle. The second game is Hamiltonicity, where Maker wins if the obtained tournament contains a Hami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1844","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-18T04:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WRXIUqs0DlVZIhhXbWQx+8K3m4Xz0zzbvMCZxOZ2IoKLXNeWlfFUFNOFp76Owoq35YEy3U20lDyO5vjPLQ2GBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:39:06.898029Z"},"content_sha256":"03c1d501e1eb8a88aa51c96c10f5e61ba1bdcc71e897fd177a4c00a10a82d773","schema_version":"1.0","event_id":"sha256:03c1d501e1eb8a88aa51c96c10f5e61ba1bdcc71e897fd177a4c00a10a82d773"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULIWR7B5F3E3UIARX5MUCSBAY3/bundle.json","state_url":"https://pith.science/pith/ULIWR7B5F3E3UIARX5MUCSBAY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULIWR7B5F3E3UIARX5MUCSBAY3/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-30T15:39:06Z","links":{"resolver":"https://pith.science/pith/ULIWR7B5F3E3UIARX5MUCSBAY3","bundle":"https://pith.science/pith/ULIWR7B5F3E3UIARX5MUCSBAY3/bundle.json","state":"https://pith.science/pith/ULIWR7B5F3E3UIARX5MUCSBAY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULIWR7B5F3E3UIARX5MUCSBAY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ULIWR7B5F3E3UIARX5MUCSBAY3","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":"95b39dc1fcdeb2b0730998c56617aee48712f3953a3fe2163dd01025d97650d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T08:32:20Z","title_canon_sha256":"f7c32b4f98fe1d74085e86d15c6585e34c55b44d483d3f75413fc8c5f818e7bf"},"schema_version":"1.0","source":{"id":"1107.1844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1844","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1844v1","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1844","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"ULIWR7B5F3E3","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"ULIWR7B5F3E3UIAR","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"ULIWR7B5","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:03c1d501e1eb8a88aa51c96c10f5e61ba1bdcc71e897fd177a4c00a10a82d773","target":"graph","created_at":"2026-05-18T04:18:34Z","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 biased {\\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker wins if the tournament has some property $\\mathcal P$ and Breaker wins otherwise.\n  We provide bounds on the bias that is required for a Maker's win and for a Breaker's win in three different games. In the first game Maker wins if the obtained tournament has a cycle. The second game is Hamiltonicity, where Maker wins if the obtained tournament contains a Hami","authors_text":"Benny Sudakov, Ido Ben-Eliezer, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T08:32:20Z","title":"Biased orientation games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1844","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:ee3b0da0b9a7f35ff4ed62eae91024d90d9c94625f825156a64fd40191dd0ad6","target":"record","created_at":"2026-05-18T04:18:34Z","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":"95b39dc1fcdeb2b0730998c56617aee48712f3953a3fe2163dd01025d97650d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T08:32:20Z","title_canon_sha256":"f7c32b4f98fe1d74085e86d15c6585e34c55b44d483d3f75413fc8c5f818e7bf"},"schema_version":"1.0","source":{"id":"1107.1844","kind":"arxiv","version":1}},"canonical_sha256":"a2d168fc3d2ec9ba2011bf59414820c6f166a0ae99c129cb3192a47533d008a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2d168fc3d2ec9ba2011bf59414820c6f166a0ae99c129cb3192a47533d008a5","first_computed_at":"2026-05-18T04:18:34.049645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:34.049645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LTLh5VOaaGPE8hDmprVBnGogEP5251L01IBmnPO3cedh2c7/AGdh23qMCJ09jyhR71pteCSQD0SpZULXGg0vCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:34.050084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee3b0da0b9a7f35ff4ed62eae91024d90d9c94625f825156a64fd40191dd0ad6","sha256:03c1d501e1eb8a88aa51c96c10f5e61ba1bdcc71e897fd177a4c00a10a82d773"],"state_sha256":"f3556037ee079252cd7cbe379fd390aab77ccc99883be659f0041fefb368e32a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvRr1xKStt0FtW8nO9bVyz6EaGpa5uKkiXpg9KQ+2yfTgcf96ZKQyMimYUyNHgii9fQAOQsBSY+zqxZMiuPLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:39:06.900268Z","bundle_sha256":"ed3e8b00b457eb866747258e09b321140eec13d06b0aef70fa7f51bc57e96549"}}