{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5KO4AGQF2SDPCHYXN73QJPBJG2","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":"2691509f26e40baa00ab653a4638c5331215248665b0ed719e99a1f8974e2de1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T13:22:03Z","title_canon_sha256":"1e980ff853e3b620fdc23104a55f0e3ff450cbf6d907ed25f36fb9a23c80d7ac"},"schema_version":"1.0","source":{"id":"2607.01294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01294","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01294v1","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01294","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"5KO4AGQF2SDP","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_16","alias_value":"5KO4AGQF2SDPCHYX","created_at":"2026-07-03T00:16:56Z"},{"alias_kind":"pith_short_8","alias_value":"5KO4AGQF","created_at":"2026-07-03T00:16:56Z"}],"graph_snapshots":[{"event_id":"sha256:543fa50dfe0da4cd34271f0103d93da962ddac6d9d223c217bbbbdab4ab923b9","target":"graph","created_at":"2026-07-03T00:16:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.01294/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Maker-Breaker subgraph games are among the most famous combinatorial games. For $n,q\\in\\mathbb{N}$ and a fixed subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. Maker claims one unclaimed edge per round and Breaker may claim up to $q$ edges per round. If Maker is able to claim all edges of a copy of $C$, he wins the game. Otherwise Breaker wins. Bednarska and {\\L}uczak (2000) determined in a landmark work the asymptotics of the treshold bias as $\\Theta(n^{1/m(C)})$ where $m(C)$ is the 2-density of $C$, analysing random strate","authors_text":"Anand Srivastav, Matthias Sowa","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T13:22:03Z","title":"Constructive Winning Breaker Strategies in the Maker-Breaker $C_k$-Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01294","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:66ce79c1c195574248eeff59d5ebe2599918d1ebdcb20cebf2ae73636bee3a0e","target":"record","created_at":"2026-07-03T00:16:56Z","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":"2691509f26e40baa00ab653a4638c5331215248665b0ed719e99a1f8974e2de1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T13:22:03Z","title_canon_sha256":"1e980ff853e3b620fdc23104a55f0e3ff450cbf6d907ed25f36fb9a23c80d7ac"},"schema_version":"1.0","source":{"id":"2607.01294","kind":"arxiv","version":1}},"canonical_sha256":"ea9dc01a05d486f11f176ff704bc29368c93176e8ec7a0cf0273666dc29848c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea9dc01a05d486f11f176ff704bc29368c93176e8ec7a0cf0273666dc29848c7","first_computed_at":"2026-07-03T00:16:56.498511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T00:16:56.498511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+qlVAbY5FR2Lj270d+i8sbo/P6OhQJri/rQjNdD64NOJOAuXZBQXKnHWK29gPErNxcRqvE8qB42PThxrgGgpBw==","signature_status":"signed_v1","signed_at":"2026-07-03T00:16:56.498892Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66ce79c1c195574248eeff59d5ebe2599918d1ebdcb20cebf2ae73636bee3a0e","sha256:543fa50dfe0da4cd34271f0103d93da962ddac6d9d223c217bbbbdab4ab923b9"],"state_sha256":"603b05cda3f059bc7b755ccb140a5da409911634d28c06969f62ebd887ca5fa7"}