{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VXMG55XPP2I3ZVPE6LXQBMSY67","short_pith_number":"pith:VXMG55XP","schema_version":"1.0","canonical_sha256":"add86ef6ef7e91bcd5e4f2ef00b258f7c20c8e87ea698839ca027c92726baef8","source":{"kind":"arxiv","id":"2505.01628","version":1},"attestation_state":"computed","paper":{"title":"The Satisfiability Threshold for K-XOR Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jared A. Hughes, J. William Helton","submitted_at":"2025-05-02T23:33:38Z","abstract_excerpt":"A $K$-XORGAME system corresponds to a $K$-XORSAT system with the additional restriction that the variables divide uniformly into $K$ blocks. This forms a system of $m$ equations with $K n$ unknowns over $\\mathbb{Z}_2$, and a perfect strategy corresponds to a solution to these equations. Equivalently, such equations correspond to colorings of a $K$-uniform $K$-partite hypergraph. This paper proves that the satisfiability threshold of $m/n$ for $K$-XORGAME problems exists and equals the satisfiability threshold for $K$-XORSAT."},"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":"2505.01628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-02T23:33:38Z","cross_cats_sorted":[],"title_canon_sha256":"cc4f1465f4c60b910a600c2fb8bfe55df3e5f0a596b0257e3127717b9a257536","abstract_canon_sha256":"9a62a5b30e0d96ad228f17340ab15956cbffbbea7d0bd9e0f034bc38e98b76fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:01.035156Z","signature_b64":"Ei+TgD860/ea5qYGv5ttmj27+dn5wdSeMTXUte1bIejwOQveEZ+mH5cTgkyPBNYGKuH7MZXywMNzlD7b0KukCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add86ef6ef7e91bcd5e4f2ef00b258f7c20c8e87ea698839ca027c92726baef8","last_reissued_at":"2026-07-05T10:58:01.034575Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:01.034575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Satisfiability Threshold for K-XOR Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jared A. Hughes, J. William Helton","submitted_at":"2025-05-02T23:33:38Z","abstract_excerpt":"A $K$-XORGAME system corresponds to a $K$-XORSAT system with the additional restriction that the variables divide uniformly into $K$ blocks. This forms a system of $m$ equations with $K n$ unknowns over $\\mathbb{Z}_2$, and a perfect strategy corresponds to a solution to these equations. Equivalently, such equations correspond to colorings of a $K$-uniform $K$-partite hypergraph. This paper proves that the satisfiability threshold of $m/n$ for $K$-XORGAME problems exists and equals the satisfiability threshold for $K$-XORSAT."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01628","kind":"arxiv","version":1},"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/2505.01628/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":"2505.01628","created_at":"2026-07-05T10:58:01.034633+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.01628v1","created_at":"2026-07-05T10:58:01.034633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01628","created_at":"2026-07-05T10:58:01.034633+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXMG55XPP2I3","created_at":"2026-07-05T10:58:01.034633+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXMG55XPP2I3ZVPE","created_at":"2026-07-05T10:58:01.034633+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXMG55XP","created_at":"2026-07-05T10:58:01.034633+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/VXMG55XPP2I3ZVPE6LXQBMSY67","json":"https://pith.science/pith/VXMG55XPP2I3ZVPE6LXQBMSY67.json","graph_json":"https://pith.science/api/pith-number/VXMG55XPP2I3ZVPE6LXQBMSY67/graph.json","events_json":"https://pith.science/api/pith-number/VXMG55XPP2I3ZVPE6LXQBMSY67/events.json","paper":"https://pith.science/paper/VXMG55XP"},"agent_actions":{"view_html":"https://pith.science/pith/VXMG55XPP2I3ZVPE6LXQBMSY67","download_json":"https://pith.science/pith/VXMG55XPP2I3ZVPE6LXQBMSY67.json","view_paper":"https://pith.science/paper/VXMG55XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.01628&json=true","fetch_graph":"https://pith.science/api/pith-number/VXMG55XPP2I3ZVPE6LXQBMSY67/graph.json","fetch_events":"https://pith.science/api/pith-number/VXMG55XPP2I3ZVPE6LXQBMSY67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXMG55XPP2I3ZVPE6LXQBMSY67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXMG55XPP2I3ZVPE6LXQBMSY67/action/storage_attestation","attest_author":"https://pith.science/pith/VXMG55XPP2I3ZVPE6LXQBMSY67/action/author_attestation","sign_citation":"https://pith.science/pith/VXMG55XPP2I3ZVPE6LXQBMSY67/action/citation_signature","submit_replication":"https://pith.science/pith/VXMG55XPP2I3ZVPE6LXQBMSY67/action/replication_record"}},"created_at":"2026-07-05T10:58:01.034633+00:00","updated_at":"2026-07-05T10:58:01.034633+00:00"}