{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3LORP6IVNE2WE76L5I56NT5X2L","short_pith_number":"pith:3LORP6IV","schema_version":"1.0","canonical_sha256":"dadd17f9156935627fcbea3be6cfb7d2ef51e700aa6fcd6e4c4b72379a1e45ed","source":{"kind":"arxiv","id":"2505.06322","version":2},"attestation_state":"computed","paper":{"title":"Quantum strategies, error bounds, optimality, and duality gaps for multiplayer XOR, $\\mathrm{XOR}^{*}$, compiled XOR, $\\mathrm{XOR}^{*}$, and strong parallel repetiton of XOR, $\\mathrm{XOR}^{*}$, and FFL games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"quant-ph","authors_text":"Pete Rigas","submitted_at":"2025-05-09T03:47:41Z","abstract_excerpt":"We characterize exact, and approximate, optimality of games that players can interact with using quantum strategies. In comparison to a previous work of the author, arXiv: 2311.12887, which applied a 2016 framework due to Ostrev for constructing error bounds beyond CHSH and XOR games, in addition to the existence of well-posed semidefinite programs for determining primal feasible solutions, along with quantum-classical duality gaps, it continues to remain of interest to further develop the construction of error bounds, and related objects, to game-theoretic settings with several participants. "},"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.06322","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-09T03:47:41Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"4aab8df25e7758e5d0eaf8a9264c4a2ee6ed72ac40980f575f24d4935a212e20","abstract_canon_sha256":"98b4549d0d25dc7603f2672c9d848ef0e4da864f997aa6b61b0fd099d0b8e666"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:29.953677Z","signature_b64":"En3SbByDLuFoPFMaL1aWgCryuzL5YQmTodbmDatmlq1cpyFThvsgdbDGDxrvhRnbEEOIY3sJz3YgnvuG4bD7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dadd17f9156935627fcbea3be6cfb7d2ef51e700aa6fcd6e4c4b72379a1e45ed","last_reissued_at":"2026-07-05T11:27:29.953167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:29.953167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum strategies, error bounds, optimality, and duality gaps for multiplayer XOR, $\\mathrm{XOR}^{*}$, compiled XOR, $\\mathrm{XOR}^{*}$, and strong parallel repetiton of XOR, $\\mathrm{XOR}^{*}$, and FFL games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"quant-ph","authors_text":"Pete Rigas","submitted_at":"2025-05-09T03:47:41Z","abstract_excerpt":"We characterize exact, and approximate, optimality of games that players can interact with using quantum strategies. In comparison to a previous work of the author, arXiv: 2311.12887, which applied a 2016 framework due to Ostrev for constructing error bounds beyond CHSH and XOR games, in addition to the existence of well-posed semidefinite programs for determining primal feasible solutions, along with quantum-classical duality gaps, it continues to remain of interest to further develop the construction of error bounds, and related objects, to game-theoretic settings with several participants. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06322","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/2505.06322/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.06322","created_at":"2026-07-05T11:27:29.953222+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.06322v2","created_at":"2026-07-05T11:27:29.953222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06322","created_at":"2026-07-05T11:27:29.953222+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LORP6IVNE2W","created_at":"2026-07-05T11:27:29.953222+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LORP6IVNE2WE76L","created_at":"2026-07-05T11:27:29.953222+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LORP6IV","created_at":"2026-07-05T11:27:29.953222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08259","citing_title":"Multiplayer parallel repetition without dependency-breaking and anchoring variables: monotonic, concave amplification","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L","json":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L.json","graph_json":"https://pith.science/api/pith-number/3LORP6IVNE2WE76L5I56NT5X2L/graph.json","events_json":"https://pith.science/api/pith-number/3LORP6IVNE2WE76L5I56NT5X2L/events.json","paper":"https://pith.science/paper/3LORP6IV"},"agent_actions":{"view_html":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L","download_json":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L.json","view_paper":"https://pith.science/paper/3LORP6IV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.06322&json=true","fetch_graph":"https://pith.science/api/pith-number/3LORP6IVNE2WE76L5I56NT5X2L/graph.json","fetch_events":"https://pith.science/api/pith-number/3LORP6IVNE2WE76L5I56NT5X2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L/action/storage_attestation","attest_author":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L/action/author_attestation","sign_citation":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L/action/citation_signature","submit_replication":"https://pith.science/pith/3LORP6IVNE2WE76L5I56NT5X2L/action/replication_record"}},"created_at":"2026-07-05T11:27:29.953222+00:00","updated_at":"2026-07-05T11:27:29.953222+00:00"}