{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YWKGFZUFKVY4IZ4CL5PVJVFKQU","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":"a9656f7a78fd69e0de8fefb73561d034f25504f4ca98b105b5f4e563b4bc702a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-12-18T16:23:28Z","title_canon_sha256":"18b459e13faea85a796f9366dfd8170c7a7d22fa45bc92e0151e8a30f610025b"},"schema_version":"1.0","source":{"id":"2512.16722","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.16722","created_at":"2026-05-29T01:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"2512.16722v2","created_at":"2026-05-29T01:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.16722","created_at":"2026-05-29T01:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"YWKGFZUFKVY4","created_at":"2026-05-29T01:05:00Z"},{"alias_kind":"pith_short_16","alias_value":"YWKGFZUFKVY4IZ4C","created_at":"2026-05-29T01:05:00Z"},{"alias_kind":"pith_short_8","alias_value":"YWKGFZUF","created_at":"2026-05-29T01:05:00Z"}],"graph_snapshots":[{"event_id":"sha256:3c20061cfffe9910ac73f7ca19ce9af9c49e14d39cf1e484d20d73508c736075","target":"graph","created_at":"2026-05-29T01:05:00Z","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/2512.16722/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Strong Ramsey game $\\mathcal{R}(B,G)$ is a two player game with players $P_1$ and $P_2$, where $B$ and $G$ are $k$-uniform hypergraphs for some $k \\geq 2$. $G$ is always finite, while $B$ may be infinite. $P_1$ and $P_2$ alternately color uncolored edges $e \\in B$ in their respective color and $P_1$ begins. Whoever completes a monochromatic copy of $G$ in their own color first, wins the game. If no one claims a monochromatic copy of $G$ in a finite number of moves, the game is declared a draw. In this paper, we give an infinite set of 3-uniform hypergraphs $\\{G_t\\}_{t \\geq 3}$, such that $","authors_text":"Henri Ortm\\\"uller, Nathan Bowler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-12-18T16:23:28Z","title":"Drawing strategies in Strong Ramsey games for 3-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.16722","kind":"arxiv","version":2},"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:4badd3e55376e8bb726844811f46bc86f366b562d1678358b21e0081f777bb0c","target":"record","created_at":"2026-05-29T01:05:00Z","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":"a9656f7a78fd69e0de8fefb73561d034f25504f4ca98b105b5f4e563b4bc702a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-12-18T16:23:28Z","title_canon_sha256":"18b459e13faea85a796f9366dfd8170c7a7d22fa45bc92e0151e8a30f610025b"},"schema_version":"1.0","source":{"id":"2512.16722","kind":"arxiv","version":2}},"canonical_sha256":"c59462e6855571c467825f5f54d4aa852e2295562bd54daa2587ea5b5f1f8d0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c59462e6855571c467825f5f54d4aa852e2295562bd54daa2587ea5b5f1f8d0c","first_computed_at":"2026-05-29T01:05:00.108953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:00.108953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VokFrJ/mIwRhORD06A1ED1cD/sgp3f8TbUIjblkCF0yCdnPt2zVLJ6pB+4yavM8RvSTZWoWgglrnQhgPiJRrBg==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:00.109856Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.16722","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4badd3e55376e8bb726844811f46bc86f366b562d1678358b21e0081f777bb0c","sha256:3c20061cfffe9910ac73f7ca19ce9af9c49e14d39cf1e484d20d73508c736075"],"state_sha256":"cdaf490315fdcb07542db7f9d8248c3fd8eae256c4e2e870cc93c167fcf849df"}