{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WP2DOQT46VQKSNUAOGOH43YL7Z","short_pith_number":"pith:WP2DOQT4","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"},"canonical_sha256":"b3f437427cf560a93680719c7e6f0bfe79696cf1d27c8649604a7250288b59c9","source":{"kind":"arxiv","id":"2302.10972","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.10972","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"arxiv_version","alias_value":"2302.10972v3","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10972","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"pith_short_12","alias_value":"WP2DOQT46VQK","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"pith_short_16","alias_value":"WP2DOQT46VQKSNUA","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"pith_short_8","alias_value":"WP2DOQT4","created_at":"2026-07-05T09:35:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WP2DOQT46VQKSNUAOGOH43YL7Z","target":"record","payload":{"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"},"canonical_sha256":"b3f437427cf560a93680719c7e6f0bfe79696cf1d27c8649604a7250288b59c9","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"},"source_kind":"arxiv","source_id":"2302.10972","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:35:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfSJM2BeJfp9+XT7DiKtAGfuolR5wt4foi7TXzn3nk5ppsbCwS99uvke4fJavN0s2JcCbq5iDwl90QiPtJJbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T04:11:17.166269Z"},"content_sha256":"b5d5be207a92346da58d791fe79ab68bf9694d88b0df1c2074e1b0d1e208dc17","schema_version":"1.0","event_id":"sha256:b5d5be207a92346da58d791fe79ab68bf9694d88b0df1c2074e1b0d1e208dc17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WP2DOQT46VQKSNUAOGOH43YL7Z","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:35:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7Dsn8xUJrG6GG/+iAU1oh6DpNUEDVKiSJ8hly/0nYRG6HPO5JtWl88PKB0q4P/UnbKyXP/tnr2xPoQvhr+RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T04:11:17.169281Z"},"content_sha256":"213d1cde74910a346b50637efa315239aae78d317d8388c2b3cca6d91955ee4b","schema_version":"1.0","event_id":"sha256:213d1cde74910a346b50637efa315239aae78d317d8388c2b3cca6d91955ee4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/bundle.json","state_url":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T04:11:17Z","links":{"resolver":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z","bundle":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/bundle.json","state":"https://pith.science/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WP2DOQT46VQKSNUAOGOH43YL7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WP2DOQT46VQKSNUAOGOH43YL7Z","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":"8068dad61f819f84a8f3b0a9ece9e068e486a14f86fcca2ac77e24cf36ef914e","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-02-21T20:10:35Z","title_canon_sha256":"2feb8446e61e6fd5056b69889c55c846670d156efe9a8a2908e3ef1868b23dd4"},"schema_version":"1.0","source":{"id":"2302.10972","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.10972","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"arxiv_version","alias_value":"2302.10972v3","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10972","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"pith_short_12","alias_value":"WP2DOQT46VQK","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"pith_short_16","alias_value":"WP2DOQT46VQKSNUA","created_at":"2026-07-05T09:35:31Z"},{"alias_kind":"pith_short_8","alias_value":"WP2DOQT4","created_at":"2026-07-05T09:35:31Z"}],"graph_snapshots":[{"event_id":"sha256:213d1cde74910a346b50637efa315239aae78d317d8388c2b3cca6d91955ee4b","target":"graph","created_at":"2026-07-05T09:35:31Z","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/2302.10972/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Aline Parreau, Eric Duch\\^ene, Fionn Mc Inerney, Milo\\v{s} Stojakovi\\'c, Nacim Oijid, Nicolas Nisse, Valentin Gledel","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-02-21T20:10:35Z","title":"Complexity of Maker-Breaker Games on Edge Sets of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10972","kind":"arxiv","version":3},"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:b5d5be207a92346da58d791fe79ab68bf9694d88b0df1c2074e1b0d1e208dc17","target":"record","created_at":"2026-07-05T09:35:31Z","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":"8068dad61f819f84a8f3b0a9ece9e068e486a14f86fcca2ac77e24cf36ef914e","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-02-21T20:10:35Z","title_canon_sha256":"2feb8446e61e6fd5056b69889c55c846670d156efe9a8a2908e3ef1868b23dd4"},"schema_version":"1.0","source":{"id":"2302.10972","kind":"arxiv","version":3}},"canonical_sha256":"b3f437427cf560a93680719c7e6f0bfe79696cf1d27c8649604a7250288b59c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3f437427cf560a93680719c7e6f0bfe79696cf1d27c8649604a7250288b59c9","first_computed_at":"2026-07-05T09:35:31.866434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:35:31.866434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RwVPlGYoB9y0ZpcXluZjWJimBp/R+7DK0uvOFnX7Cc1eWllLsf0DfvumpibNZTmJAx3wbEEzyDf9aOT7UEMtBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:35:31.866919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.10972","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5d5be207a92346da58d791fe79ab68bf9694d88b0df1c2074e1b0d1e208dc17","sha256:213d1cde74910a346b50637efa315239aae78d317d8388c2b3cca6d91955ee4b"],"state_sha256":"115ffffb8e4d6a9f2c4e4d3f3eae1b6e77546eb11900a1db58ce2bc210bf5604"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btcC9M2Ztb1yN3GiA4GEmm5JiiQichYEOIZidVdOKgHX0H0koYSOanQMm4s/v0hw9LfwlkiMeHNWhMizG45oAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T04:11:17.187974Z","bundle_sha256":"51fc669b29b17da898cafcf867b2466e5a01d7f496982f9a48f7bc199ae297ea"}}