{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C5566NXVUA6Z3YTFJD6ANV5PH2","short_pith_number":"pith:C5566NXV","canonical_record":{"source":{"id":"1507.06688","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T21:29:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9a321fb7f58286f33c723b4f5cb64cdcf6f22083b74c575e9bed720fe560c8ce","abstract_canon_sha256":"bb01b191df7e58100234a3571de26ee7d96394e756a6800a1a620c827b15ce15"},"schema_version":"1.0"},"canonical_sha256":"177bef36f5a03d9de26548fc06d7af3ea19231b3851f96f459ad085d2fe63a73","source":{"kind":"arxiv","id":"1507.06688","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06688","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06688v4","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06688","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"C5566NXVUA6Z","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C5566NXVUA6Z3YTF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C5566NXV","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C5566NXVUA6Z3YTFJD6ANV5PH2","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06688","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T21:29:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9a321fb7f58286f33c723b4f5cb64cdcf6f22083b74c575e9bed720fe560c8ce","abstract_canon_sha256":"bb01b191df7e58100234a3571de26ee7d96394e756a6800a1a620c827b15ce15"},"schema_version":"1.0"},"canonical_sha256":"177bef36f5a03d9de26548fc06d7af3ea19231b3851f96f459ad085d2fe63a73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:59.836099Z","signature_b64":"5D64tTASu28pbn4CkQA/te4rBHvkVmI+nF1cLC8/5YNCSA4lFC+tutUlOWUw9/idUvIbLgVICi4Kjphf8CBqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"177bef36f5a03d9de26548fc06d7af3ea19231b3851f96f459ad085d2fe63a73","last_reissued_at":"2026-05-18T01:17:59.835277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:59.835277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06688","source_version":4,"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-18T01:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+keD+mgss51fUmXGUv+IsE0XMwSjZ2woQB5L+ZRzea7ZY20RXHD6i7cpX5Svrx/Sp1j9f1RayvxU97rdgmDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:31:16.189685Z"},"content_sha256":"3b06a06f8ab1c0091b5f9c00303ca751e7e4980af77e287e211a54d917a40f89","schema_version":"1.0","event_id":"sha256:3b06a06f8ab1c0091b5f9c00303ca751e7e4980af77e287e211a54d917a40f89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C5566NXVUA6Z3YTFJD6ANV5PH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp thresholds for half-random games I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Jonas Groschwitz, Tibor Szab\\'o","submitted_at":"2015-07-23T21:29:55Z","abstract_excerpt":"We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this paper we consider the scenario when Maker plays randomly and Breaker is \"clever\", and determine the sharp threshold bias of classical graph games, such as connectivity, Hamiltonicity, and minimum degree-$k$. We treat the other case, that is when Breaker plays randomly, in a separate paper. The traditional, deterministic version of these games, with two optimal players playing, are known to obey the so-called probabilistic intuition. That is, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06688","kind":"arxiv","version":4},"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-18T01:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocjClkxDIBf+MxZEr2UAhPDmZAi01v0XHUknY5VLYnyBeh6gVcRrKDzeh1Cyab/fF/02wEMJJWRDChjFH0LdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:31:16.190256Z"},"content_sha256":"a19cc1140a153aee188e6cc08f13f3c819f8036c1bd2a5afafe6f933e3622c49","schema_version":"1.0","event_id":"sha256:a19cc1140a153aee188e6cc08f13f3c819f8036c1bd2a5afafe6f933e3622c49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5566NXVUA6Z3YTFJD6ANV5PH2/bundle.json","state_url":"https://pith.science/pith/C5566NXVUA6Z3YTFJD6ANV5PH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5566NXVUA6Z3YTFJD6ANV5PH2/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-26T23:31:16Z","links":{"resolver":"https://pith.science/pith/C5566NXVUA6Z3YTFJD6ANV5PH2","bundle":"https://pith.science/pith/C5566NXVUA6Z3YTFJD6ANV5PH2/bundle.json","state":"https://pith.science/pith/C5566NXVUA6Z3YTFJD6ANV5PH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5566NXVUA6Z3YTFJD6ANV5PH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C5566NXVUA6Z3YTFJD6ANV5PH2","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":"bb01b191df7e58100234a3571de26ee7d96394e756a6800a1a620c827b15ce15","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T21:29:55Z","title_canon_sha256":"9a321fb7f58286f33c723b4f5cb64cdcf6f22083b74c575e9bed720fe560c8ce"},"schema_version":"1.0","source":{"id":"1507.06688","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06688","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06688v4","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06688","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"C5566NXVUA6Z","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C5566NXVUA6Z3YTF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C5566NXV","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:a19cc1140a153aee188e6cc08f13f3c819f8036c1bd2a5afafe6f933e3622c49","target":"graph","created_at":"2026-05-18T01:17:59Z","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 Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this paper we consider the scenario when Maker plays randomly and Breaker is \"clever\", and determine the sharp threshold bias of classical graph games, such as connectivity, Hamiltonicity, and minimum degree-$k$. We treat the other case, that is when Breaker plays randomly, in a separate paper. The traditional, deterministic version of these games, with two optimal players playing, are known to obey the so-called probabilistic intuition. That is, ","authors_text":"Jonas Groschwitz, Tibor Szab\\'o","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T21:29:55Z","title":"Sharp thresholds for half-random games I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06688","kind":"arxiv","version":4},"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:3b06a06f8ab1c0091b5f9c00303ca751e7e4980af77e287e211a54d917a40f89","target":"record","created_at":"2026-05-18T01:17:59Z","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":"bb01b191df7e58100234a3571de26ee7d96394e756a6800a1a620c827b15ce15","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-23T21:29:55Z","title_canon_sha256":"9a321fb7f58286f33c723b4f5cb64cdcf6f22083b74c575e9bed720fe560c8ce"},"schema_version":"1.0","source":{"id":"1507.06688","kind":"arxiv","version":4}},"canonical_sha256":"177bef36f5a03d9de26548fc06d7af3ea19231b3851f96f459ad085d2fe63a73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"177bef36f5a03d9de26548fc06d7af3ea19231b3851f96f459ad085d2fe63a73","first_computed_at":"2026-05-18T01:17:59.835277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:59.835277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5D64tTASu28pbn4CkQA/te4rBHvkVmI+nF1cLC8/5YNCSA4lFC+tutUlOWUw9/idUvIbLgVICi4Kjphf8CBqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:59.836099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06688","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b06a06f8ab1c0091b5f9c00303ca751e7e4980af77e287e211a54d917a40f89","sha256:a19cc1140a153aee188e6cc08f13f3c819f8036c1bd2a5afafe6f933e3622c49"],"state_sha256":"8dd75b57712ca471bf53a24e6d5a0f6f54bb51a135646e3d5e782441c568ab7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MaLYXh7ZCNRiXHSuf9ZP6RU9kHAvbUooU4DdNAXFx5KuWBkYufLvouvc6gAW1Wu/u1M77c4s68Fx+vbAy+lCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:31:16.194280Z","bundle_sha256":"1a49d9dbdf29426702652ab43e82a9f4984dd4f4cb6c5f7e02ab7e58e7b42a19"}}