{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NPUWZ6AVG7YMLT2I2GSCGIIRTN","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":"bdee463ab8fc7bc457efb03b3eeefb78210e938376d753eb85cd6754befce239","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-27T16:57:05Z","title_canon_sha256":"1dea361b61803d72ee1ed43eef18f186ce2faa912a111bf1db19488591ee9b77"},"schema_version":"1.0","source":{"id":"2502.20271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.20271","created_at":"2026-07-05T10:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"2502.20271v1","created_at":"2026-07-05T10:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.20271","created_at":"2026-07-05T10:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"NPUWZ6AVG7YM","created_at":"2026-07-05T10:21:11Z"},{"alias_kind":"pith_short_16","alias_value":"NPUWZ6AVG7YMLT2I","created_at":"2026-07-05T10:21:11Z"},{"alias_kind":"pith_short_8","alias_value":"NPUWZ6AV","created_at":"2026-07-05T10:21:11Z"}],"graph_snapshots":[{"event_id":"sha256:e6906716d4153d2a183d40e73d367487068143bb041dd7ef4c41f62c5f5657ef","target":"graph","created_at":"2026-07-05T10:21:11Z","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/2502.20271/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $(X, \\mathcal{F})$ be a hypergraph. The Maker-Breaker game on $(X, \\mathcal{F})$ is a combinatorial game between two players, Maker and Breaker. Beginning with Maker, the players take turns claiming vertices from $X$ that have not yet been claimed. Maker wins if she manages to claim all vertices of some hyperedge $F \\in \\mathcal{F}$. Breaker wins if he claims at least one vertex in every hyperedge.\n  M. L. Rahman and Thomas Watson proved in 2021 that, even when only Maker-Breaker games on 6-uniform hypergraphs are considered, the decision problem of determining which player has a winning s","authors_text":"Finn Orson Koepke","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-27T16:57:05Z","title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.20271","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:eac14076f0d3a493dbb84e7398b1162d1dac07089a0f963e40851016da955149","target":"record","created_at":"2026-07-05T10:21:11Z","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":"bdee463ab8fc7bc457efb03b3eeefb78210e938376d753eb85cd6754befce239","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-27T16:57:05Z","title_canon_sha256":"1dea361b61803d72ee1ed43eef18f186ce2faa912a111bf1db19488591ee9b77"},"schema_version":"1.0","source":{"id":"2502.20271","kind":"arxiv","version":1}},"canonical_sha256":"6be96cf81537f0c5cf48d1a42321119b4c6f5a978b923727e87b85b45c18bf3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6be96cf81537f0c5cf48d1a42321119b4c6f5a978b923727e87b85b45c18bf3d","first_computed_at":"2026-07-05T10:21:11.839846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:21:11.839846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JwQj6LKVh7mX3Fp/v+Gcp5v0T8GbOABEvgGPL0YNe5zcm8OjjHbRUzAWb1ZMtUou/FdwErnrox8ciM2kMaKSDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:21:11.840369Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.20271","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eac14076f0d3a493dbb84e7398b1162d1dac07089a0f963e40851016da955149","sha256:e6906716d4153d2a183d40e73d367487068143bb041dd7ef4c41f62c5f5657ef"],"state_sha256":"e62d80c6cecb4157f6d350788d23e9c14a0a601cb0b31972b06d20659f1b415f"}