{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WP2DOQT46VQKSNUAOGOH43YL7Z","short_pith_number":"pith:WP2DOQT4","schema_version":"1.0","canonical_sha256":"b3f437427cf560a93680719c7e6f0bfe79696cf1d27c8649604a7250288b59c9","source":{"kind":"arxiv","id":"2302.10972","version":3},"attestation_state":"computed","paper":{"title":"Complexity of Maker-Breaker Games on Edge Sets of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Aline Parreau, Eric Duch\\^ene, Fionn Mc Inerney, Milo\\v{s} Stojakovi\\'c, Nacim Oijid, Nicolas Nisse, Valentin Gledel","submitted_at":"2023-02-21T20:10:35Z","abstract_excerpt":"We study the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the $H$-game. Maker wins if she claims the edges of a perfect matching in the first, and a copy of a fixed graph $H$ in the second. We prove that deciding who wins the perfect matching game and the $H$-game is PSPACE-complete, even for the latter in small-diameter graphs if $H$ is a tree. Toward finding the smallest graph $H$ for which the $H$-game is PSPACE-complete, we also prove that such an $H$ of order 51 and size 57 exists.\n  We then give "},"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":"2302.10972","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-02-21T20:10:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2feb8446e61e6fd5056b69889c55c846670d156efe9a8a2908e3ef1868b23dd4","abstract_canon_sha256":"8068dad61f819f84a8f3b0a9ece9e068e486a14f86fcca2ac77e24cf36ef914e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:31.866919Z","signature_b64":"RwVPlGYoB9y0ZpcXluZjWJimBp/R+7DK0uvOFnX7Cc1eWllLsf0DfvumpibNZTmJAx3wbEEzyDf9aOT7UEMtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3f437427cf560a93680719c7e6f0bfe79696cf1d27c8649604a7250288b59c9","last_reissued_at":"2026-07-05T09:35:31.866434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:31.866434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Maker-Breaker Games on Edge Sets of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Aline Parreau, Eric Duch\\^ene, Fionn Mc Inerney, Milo\\v{s} Stojakovi\\'c, Nacim Oijid, Nicolas Nisse, Valentin Gledel","submitted_at":"2023-02-21T20:10:35Z","abstract_excerpt":"We study the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the $H$-game. Maker wins if she claims the edges of a perfect matching in the first, and a copy of a fixed graph $H$ in the second. We prove that deciding who wins the perfect matching game and the $H$-game is PSPACE-complete, even for the latter in small-diameter graphs if $H$ is a tree. Toward finding the smallest graph $H$ for which the $H$-game is PSPACE-complete, we also prove that such an $H$ of order 51 and size 57 exists.\n  We then give "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10972","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/2302.10972/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":"2302.10972","created_at":"2026-07-05T09:35:31.866497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.10972v3","created_at":"2026-07-05T09:35:31.866497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10972","created_at":"2026-07-05T09:35:31.866497+00:00"},{"alias_kind":"pith_short_12","alias_value":"WP2DOQT46VQK","created_at":"2026-07-05T09:35:31.866497+00:00"},{"alias_kind":"pith_short_16","alias_value":"WP2DOQT46VQKSNUA","created_at":"2026-07-05T09:35:31.866497+00:00"},{"alias_kind":"pith_short_8","alias_value":"WP2DOQT4","created_at":"2026-07-05T09:35:31.866497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z","json":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z.json","graph_json":"https://pith.science/api/pith-number/WP2DOQT46VQKSNUAOGOH43YL7Z/graph.json","events_json":"https://pith.science/api/pith-number/WP2DOQT46VQKSNUAOGOH43YL7Z/events.json","paper":"https://pith.science/paper/WP2DOQT4"},"agent_actions":{"view_html":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z","download_json":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z.json","view_paper":"https://pith.science/paper/WP2DOQT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.10972&json=true","fetch_graph":"https://pith.science/api/pith-number/WP2DOQT46VQKSNUAOGOH43YL7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/WP2DOQT46VQKSNUAOGOH43YL7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/action/storage_attestation","attest_author":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/action/author_attestation","sign_citation":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/action/citation_signature","submit_replication":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/action/replication_record"}},"created_at":"2026-07-05T09:35:31.866497+00:00","updated_at":"2026-07-05T09:35:31.866497+00:00"}