{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MZGN5PPNIRDKTD7T7EOQZWLUSY","short_pith_number":"pith:MZGN5PPN","schema_version":"1.0","canonical_sha256":"664cdebded4446a98ff3f91d0cd974962d8fb006bd4848e6301b52dbbe44301d","source":{"kind":"arxiv","id":"2209.12819","version":3},"attestation_state":"computed","paper":{"title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Florian Galliot, Isabelle Sivignon, Sylvain Gravier","submitted_at":"2022-09-26T16:26:40Z","abstract_excerpt":"In the Maker-Breaker positional game, Maker and Breaker take turns picking vertices of a hypergraph $H$, and Maker wins if and only if she possesses all the vertices of some edge of $H$. Deciding the outcome (i.e. which player has a winning strategy) is PSPACE-complete even when restricted to 5-uniform hypergraphs (Koepke, 2025). On hypergraphs of rank 3, a structural characterization of the outcome and a polynomial-time algorithm have been obtained for two subcases: one by Kutz (2005), the other by Rahman and Watson (2020) who conjectured that their result should generalize to all hypergraphs"},"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":"2209.12819","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-09-26T16:26:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8e1cc5502fc9d21ac9b72f01ea3f098b8222653a1bee07ddc8e157c37288db66","abstract_canon_sha256":"386722357d9e925eb753f7c5fc4e5c4a5c88c118c5c3f871a9b60a62736df1a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:19.305929Z","signature_b64":"Odyry92Br8nzF6j/pfRAx+bycyJ2ENmsdxXMDo1ukapdvmv1S0gcy9kVA0ZN1wKPgEyaJ7xD6rW/RQqHrfRMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"664cdebded4446a98ff3f91d0cd974962d8fb006bd4848e6301b52dbbe44301d","last_reissued_at":"2026-07-05T10:38:19.305465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:19.305465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Florian Galliot, Isabelle Sivignon, Sylvain Gravier","submitted_at":"2022-09-26T16:26:40Z","abstract_excerpt":"In the Maker-Breaker positional game, Maker and Breaker take turns picking vertices of a hypergraph $H$, and Maker wins if and only if she possesses all the vertices of some edge of $H$. Deciding the outcome (i.e. which player has a winning strategy) is PSPACE-complete even when restricted to 5-uniform hypergraphs (Koepke, 2025). On hypergraphs of rank 3, a structural characterization of the outcome and a polynomial-time algorithm have been obtained for two subcases: one by Kutz (2005), the other by Rahman and Watson (2020) who conjectured that their result should generalize to all hypergraphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12819","kind":"arxiv","version":3},"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/2209.12819/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":"2209.12819","created_at":"2026-07-05T10:38:19.305523+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.12819v3","created_at":"2026-07-05T10:38:19.305523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12819","created_at":"2026-07-05T10:38:19.305523+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZGN5PPNIRDK","created_at":"2026-07-05T10:38:19.305523+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZGN5PPNIRDKTD7T","created_at":"2026-07-05T10:38:19.305523+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZGN5PPN","created_at":"2026-07-05T10:38:19.305523+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.13819","citing_title":"4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY","json":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY.json","graph_json":"https://pith.science/api/pith-number/MZGN5PPNIRDKTD7T7EOQZWLUSY/graph.json","events_json":"https://pith.science/api/pith-number/MZGN5PPNIRDKTD7T7EOQZWLUSY/events.json","paper":"https://pith.science/paper/MZGN5PPN"},"agent_actions":{"view_html":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY","download_json":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY.json","view_paper":"https://pith.science/paper/MZGN5PPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.12819&json=true","fetch_graph":"https://pith.science/api/pith-number/MZGN5PPNIRDKTD7T7EOQZWLUSY/graph.json","fetch_events":"https://pith.science/api/pith-number/MZGN5PPNIRDKTD7T7EOQZWLUSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/action/storage_attestation","attest_author":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/action/author_attestation","sign_citation":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/action/citation_signature","submit_replication":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/action/replication_record"}},"created_at":"2026-07-05T10:38:19.305523+00:00","updated_at":"2026-07-05T10:38:19.305523+00:00"}