{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YWKGFZUFKVY4IZ4CL5PVJVFKQU","short_pith_number":"pith:YWKGFZUF","schema_version":"1.0","canonical_sha256":"c59462e6855571c467825f5f54d4aa852e2295562bd54daa2587ea5b5f1f8d0c","source":{"kind":"arxiv","id":"2512.16722","version":2},"attestation_state":"computed","paper":{"title":"Drawing strategies in Strong Ramsey games for 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henri Ortm\\\"uller, Nathan Bowler","submitted_at":"2025-12-18T16:23:28Z","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 $"},"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":"2512.16722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-12-18T16:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"18b459e13faea85a796f9366dfd8170c7a7d22fa45bc92e0151e8a30f610025b","abstract_canon_sha256":"a9656f7a78fd69e0de8fefb73561d034f25504f4ca98b105b5f4e563b4bc702a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:00.109856Z","signature_b64":"VokFrJ/mIwRhORD06A1ED1cD/sgp3f8TbUIjblkCF0yCdnPt2zVLJ6pB+4yavM8RvSTZWoWgglrnQhgPiJRrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c59462e6855571c467825f5f54d4aa852e2295562bd54daa2587ea5b5f1f8d0c","last_reissued_at":"2026-05-29T01:05:00.108953Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:00.108953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing strategies in Strong Ramsey games for 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henri Ortm\\\"uller, Nathan Bowler","submitted_at":"2025-12-18T16:23:28Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.16722","kind":"arxiv","version":2},"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/2512.16722/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":"2512.16722","created_at":"2026-05-29T01:05:00.109077+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.16722v2","created_at":"2026-05-29T01:05:00.109077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.16722","created_at":"2026-05-29T01:05:00.109077+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWKGFZUFKVY4","created_at":"2026-05-29T01:05:00.109077+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWKGFZUFKVY4IZ4C","created_at":"2026-05-29T01:05:00.109077+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWKGFZUF","created_at":"2026-05-29T01:05:00.109077+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/YWKGFZUFKVY4IZ4CL5PVJVFKQU","json":"https://pith.science/pith/YWKGFZUFKVY4IZ4CL5PVJVFKQU.json","graph_json":"https://pith.science/api/pith-number/YWKGFZUFKVY4IZ4CL5PVJVFKQU/graph.json","events_json":"https://pith.science/api/pith-number/YWKGFZUFKVY4IZ4CL5PVJVFKQU/events.json","paper":"https://pith.science/paper/YWKGFZUF"},"agent_actions":{"view_html":"https://pith.science/pith/YWKGFZUFKVY4IZ4CL5PVJVFKQU","download_json":"https://pith.science/pith/YWKGFZUFKVY4IZ4CL5PVJVFKQU.json","view_paper":"https://pith.science/paper/YWKGFZUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.16722&json=true","fetch_graph":"https://pith.science/api/pith-number/YWKGFZUFKVY4IZ4CL5PVJVFKQU/graph.json","fetch_events":"https://pith.science/api/pith-number/YWKGFZUFKVY4IZ4CL5PVJVFKQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWKGFZUFKVY4IZ4CL5PVJVFKQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWKGFZUFKVY4IZ4CL5PVJVFKQU/action/storage_attestation","attest_author":"https://pith.science/pith/YWKGFZUFKVY4IZ4CL5PVJVFKQU/action/author_attestation","sign_citation":"https://pith.science/pith/YWKGFZUFKVY4IZ4CL5PVJVFKQU/action/citation_signature","submit_replication":"https://pith.science/pith/YWKGFZUFKVY4IZ4CL5PVJVFKQU/action/replication_record"}},"created_at":"2026-05-29T01:05:00.109077+00:00","updated_at":"2026-05-29T01:05:00.109077+00:00"}