{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MZGN5PPNIRDKTD7T7EOQZWLUSY","short_pith_number":"pith:MZGN5PPN","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"},"canonical_sha256":"664cdebded4446a98ff3f91d0cd974962d8fb006bd4848e6301b52dbbe44301d","source":{"kind":"arxiv","id":"2209.12819","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.12819","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"2209.12819v3","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12819","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"MZGN5PPNIRDK","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"pith_short_16","alias_value":"MZGN5PPNIRDKTD7T","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"pith_short_8","alias_value":"MZGN5PPN","created_at":"2026-07-05T10:38:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MZGN5PPNIRDKTD7T7EOQZWLUSY","target":"record","payload":{"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"},"canonical_sha256":"664cdebded4446a98ff3f91d0cd974962d8fb006bd4848e6301b52dbbe44301d","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"},"source_kind":"arxiv","source_id":"2209.12819","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-05T10:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hj0B/lYucfFcIUT88MoW/38QXLsEVcCbNio7xEjaEpF7dRsPMB+na7Ucz2I88BZmx3v4XToroxquyZlcPsCpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:48:03.123746Z"},"content_sha256":"9e6b3172f69a79fdd312e1e9d61af10897eefe38e2a052bc3e9ad7a27097d1e2","schema_version":"1.0","event_id":"sha256:9e6b3172f69a79fdd312e1e9d61af10897eefe38e2a052bc3e9ad7a27097d1e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MZGN5PPNIRDKTD7T7EOQZWLUSY","target":"graph","payload":{"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"},"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-05T10:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOrsKwlflKryXmV5jfp/SS8vHozNyDDncDj1N1u8tETcCbmGxKqIiT3klF4dN9Vie9BiCbz29u1FAF0owjLKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:48:03.124087Z"},"content_sha256":"4c1f73ad56d03d62972ed7029d0f640a46a0f4b820361fae527a2e1067de5dc9","schema_version":"1.0","event_id":"sha256:4c1f73ad56d03d62972ed7029d0f640a46a0f4b820361fae527a2e1067de5dc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/bundle.json","state_url":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/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-23T10:48:03Z","links":{"resolver":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY","bundle":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/bundle.json","state":"https://pith.science/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZGN5PPNIRDKTD7T7EOQZWLUSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MZGN5PPNIRDKTD7T7EOQZWLUSY","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":"386722357d9e925eb753f7c5fc4e5c4a5c88c118c5c3f871a9b60a62736df1a0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-09-26T16:26:40Z","title_canon_sha256":"8e1cc5502fc9d21ac9b72f01ea3f098b8222653a1bee07ddc8e157c37288db66"},"schema_version":"1.0","source":{"id":"2209.12819","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.12819","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"2209.12819v3","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12819","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"MZGN5PPNIRDK","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"pith_short_16","alias_value":"MZGN5PPNIRDKTD7T","created_at":"2026-07-05T10:38:19Z"},{"alias_kind":"pith_short_8","alias_value":"MZGN5PPN","created_at":"2026-07-05T10:38:19Z"}],"graph_snapshots":[{"event_id":"sha256:4c1f73ad56d03d62972ed7029d0f640a46a0f4b820361fae527a2e1067de5dc9","target":"graph","created_at":"2026-07-05T10:38:19Z","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/2209.12819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Florian Galliot, Isabelle Sivignon, Sylvain Gravier","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-09-26T16:26:40Z","title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12819","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:9e6b3172f69a79fdd312e1e9d61af10897eefe38e2a052bc3e9ad7a27097d1e2","target":"record","created_at":"2026-07-05T10:38:19Z","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":"386722357d9e925eb753f7c5fc4e5c4a5c88c118c5c3f871a9b60a62736df1a0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-09-26T16:26:40Z","title_canon_sha256":"8e1cc5502fc9d21ac9b72f01ea3f098b8222653a1bee07ddc8e157c37288db66"},"schema_version":"1.0","source":{"id":"2209.12819","kind":"arxiv","version":3}},"canonical_sha256":"664cdebded4446a98ff3f91d0cd974962d8fb006bd4848e6301b52dbbe44301d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"664cdebded4446a98ff3f91d0cd974962d8fb006bd4848e6301b52dbbe44301d","first_computed_at":"2026-07-05T10:38:19.305465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:38:19.305465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Odyry92Br8nzF6j/pfRAx+bycyJ2ENmsdxXMDo1ukapdvmv1S0gcy9kVA0ZN1wKPgEyaJ7xD6rW/RQqHrfRMAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:38:19.305929Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.12819","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e6b3172f69a79fdd312e1e9d61af10897eefe38e2a052bc3e9ad7a27097d1e2","sha256:4c1f73ad56d03d62972ed7029d0f640a46a0f4b820361fae527a2e1067de5dc9"],"state_sha256":"9c1c49f8f0b5719d8da309716d189f94ead227bbdac02de82f0ea7cd8711d143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ip0GsgXIutX+fR0O+4qk6uoCsXJEOuF72F6dxI6NTG0p+gKztrb7b4oAycLarRsTzbuDrhHVw/dXOCgIEUGADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T10:48:03.128054Z","bundle_sha256":"cce3bee1679c83d19be4a9526ab0d8e0e3494adc2290cf5efddf9c4242030f98"}}