{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4DSJFHASXHO4VQKTYFXHRRRT6Y","short_pith_number":"pith:4DSJFHAS","canonical_record":{"source":{"id":"1602.04628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-15T11:07:53Z","cross_cats_sorted":[],"title_canon_sha256":"78ea5ea518dc417e08aaeaca901ee524009129b5545638e4e7fea5d6788952e0","abstract_canon_sha256":"4c2771b3f138ceae7e6fa60cefe71d16e20217b01126700d584123ffb3a76d28"},"schema_version":"1.0"},"canonical_sha256":"e0e4929c12b9ddcac153c16e78c633f616e1c8dcc61ce466de99079b72416af7","source":{"kind":"arxiv","id":"1602.04628","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04628","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04628v2","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04628","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"4DSJFHASXHO4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4DSJFHASXHO4VQKT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4DSJFHAS","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4DSJFHASXHO4VQKTYFXHRRRT6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-15T11:07:53Z","cross_cats_sorted":[],"title_canon_sha256":"78ea5ea518dc417e08aaeaca901ee524009129b5545638e4e7fea5d6788952e0","abstract_canon_sha256":"4c2771b3f138ceae7e6fa60cefe71d16e20217b01126700d584123ffb3a76d28"},"schema_version":"1.0"},"canonical_sha256":"e0e4929c12b9ddcac153c16e78c633f616e1c8dcc61ce466de99079b72416af7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:59.214820Z","signature_b64":"I79NPGfia8VlZZeZRnph2i+WpDjQLkxW5Q+KpYiyguKBxNeaDlup3OYJhW1If3yDMft72ykK4jZ1Vk8KMfDJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e4929c12b9ddcac153c16e78c633f616e1c8dcc61ce466de99079b72416af7","last_reissued_at":"2026-05-18T01:17:59.214051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:59.214051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04628","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-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":"lkd9Ob10v3tr9KsVaLKZMsUFAXzlrbwQaVEyyLojmepI1zgWgcOX+CX5CKJ7TBe4mcgEVZfk3JMn/tgYHEiWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T00:52:46.438757Z"},"content_sha256":"279189ba752a400f083d54f8a6f2ee954654b1ca21562eae8e3b1e0eef391b2f","schema_version":"1.0","event_id":"sha256:279189ba752a400f083d54f8a6f2ee954654b1ca21562eae8e3b1e0eef391b2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4DSJFHASXHO4VQKTYFXHRRRT6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp thresholds for half-random games II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonas Groschwitz, Tibor Szab\\'o","submitted_at":"2016-02-15T11:07:53Z","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 work we focus on the case of Breaker playing randomly and Maker being \"clever\". The reverse scenario is treated in a separate paper. We determine the sharp threshold bias of classical games played on the edge set of the complete graph $K_n$, such as connectivity, perfect matching, Hamiltonicity, and minimum degree-$1$. In all of these games, the threshold is equal to the trivial upper bound implied by the number of edges needed for Maker to o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04628","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-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":"Qok7axrhntjijmRE3VKVxOm/W0elY0LsHHeI8GJS9+hv/lDIP9bw56twa6wcDWVj++iSJgfBamzeAoHXRE1jAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T00:52:46.439437Z"},"content_sha256":"a7e6106644aa93803155c9ca050d0c553b417687899e9d9c3e61418b298bbb96","schema_version":"1.0","event_id":"sha256:a7e6106644aa93803155c9ca050d0c553b417687899e9d9c3e61418b298bbb96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DSJFHASXHO4VQKTYFXHRRRT6Y/bundle.json","state_url":"https://pith.science/pith/4DSJFHASXHO4VQKTYFXHRRRT6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DSJFHASXHO4VQKTYFXHRRRT6Y/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-21T00:52:46Z","links":{"resolver":"https://pith.science/pith/4DSJFHASXHO4VQKTYFXHRRRT6Y","bundle":"https://pith.science/pith/4DSJFHASXHO4VQKTYFXHRRRT6Y/bundle.json","state":"https://pith.science/pith/4DSJFHASXHO4VQKTYFXHRRRT6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DSJFHASXHO4VQKTYFXHRRRT6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4DSJFHASXHO4VQKTYFXHRRRT6Y","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":"4c2771b3f138ceae7e6fa60cefe71d16e20217b01126700d584123ffb3a76d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-15T11:07:53Z","title_canon_sha256":"78ea5ea518dc417e08aaeaca901ee524009129b5545638e4e7fea5d6788952e0"},"schema_version":"1.0","source":{"id":"1602.04628","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04628","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04628v2","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04628","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"4DSJFHASXHO4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4DSJFHASXHO4VQKT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4DSJFHAS","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:a7e6106644aa93803155c9ca050d0c553b417687899e9d9c3e61418b298bbb96","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 work we focus on the case of Breaker playing randomly and Maker being \"clever\". The reverse scenario is treated in a separate paper. We determine the sharp threshold bias of classical games played on the edge set of the complete graph $K_n$, such as connectivity, perfect matching, Hamiltonicity, and minimum degree-$1$. In all of these games, the threshold is equal to the trivial upper bound implied by the number of edges needed for Maker to o","authors_text":"Jonas Groschwitz, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-15T11:07:53Z","title":"Sharp thresholds for half-random games II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04628","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:279189ba752a400f083d54f8a6f2ee954654b1ca21562eae8e3b1e0eef391b2f","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":"4c2771b3f138ceae7e6fa60cefe71d16e20217b01126700d584123ffb3a76d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-15T11:07:53Z","title_canon_sha256":"78ea5ea518dc417e08aaeaca901ee524009129b5545638e4e7fea5d6788952e0"},"schema_version":"1.0","source":{"id":"1602.04628","kind":"arxiv","version":2}},"canonical_sha256":"e0e4929c12b9ddcac153c16e78c633f616e1c8dcc61ce466de99079b72416af7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0e4929c12b9ddcac153c16e78c633f616e1c8dcc61ce466de99079b72416af7","first_computed_at":"2026-05-18T01:17:59.214051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:59.214051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I79NPGfia8VlZZeZRnph2i+WpDjQLkxW5Q+KpYiyguKBxNeaDlup3OYJhW1If3yDMft72ykK4jZ1Vk8KMfDJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:59.214820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04628","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:279189ba752a400f083d54f8a6f2ee954654b1ca21562eae8e3b1e0eef391b2f","sha256:a7e6106644aa93803155c9ca050d0c553b417687899e9d9c3e61418b298bbb96"],"state_sha256":"17c571eda11e893a8253791977008e6583850313a8f525285789c1ad610f82f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UcxV6hdIpMWuxLx200IWfXBraYKOzYbm0J7mcj62FsHCGlTAdZ1g2IUGaoijXdPs/uUHTzq+pEY2HXc6sLIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T00:52:46.442327Z","bundle_sha256":"dd1522a985a5ff46b2a16fcd7ba56c49b606b9e0c812542d9647dee2bb61bc14"}}