{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NHOWMVF7OZVP3Q2GTBCREQQKP5","short_pith_number":"pith:NHOWMVF7","schema_version":"1.0","canonical_sha256":"69dd6654bf766afdc346984512420a7f622592b2d8c6e9fd303e972adfb15104","source":{"kind":"arxiv","id":"2209.04655","version":1},"attestation_state":"computed","paper":{"title":"Satisfiability Phase Transtion for Random Quantum 3XOR Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Bene Watts, J. William Helton, Zehong Zhao","submitted_at":"2022-09-10T12:54:53Z","abstract_excerpt":"Recent results showed it was possible to determine if a modest size 3XOR game has a perfect quantum strategy. We build on these and give an explicit polynomial time algorithm which constructs such a perfect strategy or refutes its existence. This new tool lets us numerically study the behavior of randomly generated 3XOR games with large numbers of questions.\n  A key issue is: how common are pseudotelephathy games (games with perfect quantum strategies but no perfect classical strategies)? Our experiments strongly indicate that the probability of a randomly generated game being pseudotelpathic "},"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":"2209.04655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-09-10T12:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"ddab0a58ba03218358680c3f3915ad4d8015efdc563eecbce43dc33717281c42","abstract_canon_sha256":"f54ef1d5cfe3c5d98cdfa3f580d012a35d83776febb9f9fc48ce90144fb9ed80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:21.774338Z","signature_b64":"48biispAtsjO60F1eB/q+3XnbbISn9vIgNh1FBKOr/bRkkTT1yzrr4Id8v3vr2hzJZR2CdBf40qDmCoea2o+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69dd6654bf766afdc346984512420a7f622592b2d8c6e9fd303e972adfb15104","last_reissued_at":"2026-07-05T04:56:21.773994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:21.773994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Satisfiability Phase Transtion for Random Quantum 3XOR Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Bene Watts, J. William Helton, Zehong Zhao","submitted_at":"2022-09-10T12:54:53Z","abstract_excerpt":"Recent results showed it was possible to determine if a modest size 3XOR game has a perfect quantum strategy. We build on these and give an explicit polynomial time algorithm which constructs such a perfect strategy or refutes its existence. This new tool lets us numerically study the behavior of randomly generated 3XOR games with large numbers of questions.\n  A key issue is: how common are pseudotelephathy games (games with perfect quantum strategies but no perfect classical strategies)? Our experiments strongly indicate that the probability of a randomly generated game being pseudotelpathic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.04655","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/2209.04655/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":"2209.04655","created_at":"2026-07-05T04:56:21.774048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.04655v1","created_at":"2026-07-05T04:56:21.774048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.04655","created_at":"2026-07-05T04:56:21.774048+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHOWMVF7OZVP","created_at":"2026-07-05T04:56:21.774048+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHOWMVF7OZVP3Q2G","created_at":"2026-07-05T04:56:21.774048+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHOWMVF7","created_at":"2026-07-05T04:56:21.774048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.01628","citing_title":"The Satisfiability Threshold for K-XOR Games","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5","json":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5.json","graph_json":"https://pith.science/api/pith-number/NHOWMVF7OZVP3Q2GTBCREQQKP5/graph.json","events_json":"https://pith.science/api/pith-number/NHOWMVF7OZVP3Q2GTBCREQQKP5/events.json","paper":"https://pith.science/paper/NHOWMVF7"},"agent_actions":{"view_html":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5","download_json":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5.json","view_paper":"https://pith.science/paper/NHOWMVF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.04655&json=true","fetch_graph":"https://pith.science/api/pith-number/NHOWMVF7OZVP3Q2GTBCREQQKP5/graph.json","fetch_events":"https://pith.science/api/pith-number/NHOWMVF7OZVP3Q2GTBCREQQKP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5/action/storage_attestation","attest_author":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5/action/author_attestation","sign_citation":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5/action/citation_signature","submit_replication":"https://pith.science/pith/NHOWMVF7OZVP3Q2GTBCREQQKP5/action/replication_record"}},"created_at":"2026-07-05T04:56:21.774048+00:00","updated_at":"2026-07-05T04:56:21.774048+00:00"}