{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NPUWZ6AVG7YMLT2I2GSCGIIRTN","short_pith_number":"pith:NPUWZ6AV","schema_version":"1.0","canonical_sha256":"6be96cf81537f0c5cf48d1a42321119b4c6f5a978b923727e87b85b45c18bf3d","source":{"kind":"arxiv","id":"2502.20271","version":1},"attestation_state":"computed","paper":{"title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Finn Orson Koepke","submitted_at":"2025-02-27T16:57:05Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.20271","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-27T16:57:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1dea361b61803d72ee1ed43eef18f186ce2faa912a111bf1db19488591ee9b77","abstract_canon_sha256":"bdee463ab8fc7bc457efb03b3eeefb78210e938376d753eb85cd6754befce239"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:21:11.840369Z","signature_b64":"JwQj6LKVh7mX3Fp/v+Gcp5v0T8GbOABEvgGPL0YNe5zcm8OjjHbRUzAWb1ZMtUou/FdwErnrox8ciM2kMaKSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6be96cf81537f0c5cf48d1a42321119b4c6f5a978b923727e87b85b45c18bf3d","last_reissued_at":"2026-07-05T10:21:11.839846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:21:11.839846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Finn Orson Koepke","submitted_at":"2025-02-27T16:57:05Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.20271","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.20271/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.20271","created_at":"2026-07-05T10:21:11.839905+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.20271v1","created_at":"2026-07-05T10:21:11.839905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.20271","created_at":"2026-07-05T10:21:11.839905+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPUWZ6AVG7YM","created_at":"2026-07-05T10:21:11.839905+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPUWZ6AVG7YMLT2I","created_at":"2026-07-05T10:21:11.839905+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPUWZ6AV","created_at":"2026-07-05T10:21:11.839905+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.13819","citing_title":"4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN","json":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN.json","graph_json":"https://pith.science/api/pith-number/NPUWZ6AVG7YMLT2I2GSCGIIRTN/graph.json","events_json":"https://pith.science/api/pith-number/NPUWZ6AVG7YMLT2I2GSCGIIRTN/events.json","paper":"https://pith.science/paper/NPUWZ6AV"},"agent_actions":{"view_html":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN","download_json":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN.json","view_paper":"https://pith.science/paper/NPUWZ6AV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.20271&json=true","fetch_graph":"https://pith.science/api/pith-number/NPUWZ6AVG7YMLT2I2GSCGIIRTN/graph.json","fetch_events":"https://pith.science/api/pith-number/NPUWZ6AVG7YMLT2I2GSCGIIRTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN/action/storage_attestation","attest_author":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN/action/author_attestation","sign_citation":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN/action/citation_signature","submit_replication":"https://pith.science/pith/NPUWZ6AVG7YMLT2I2GSCGIIRTN/action/replication_record"}},"created_at":"2026-07-05T10:21:11.839905+00:00","updated_at":"2026-07-05T10:21:11.839905+00:00"}