{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QYFIK6IEP6V43WY53KPFGNA3F3","short_pith_number":"pith:QYFIK6IE","schema_version":"1.0","canonical_sha256":"860a8579047fabcddb1dda9e53341b2ef076257a7185215c006a8e337d2e8e29","source":{"kind":"arxiv","id":"2005.08883","version":3},"attestation_state":"computed","paper":{"title":"Quasi-polynomial time algorithms for free quantum games in bounded dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carlo Sparaciari, Hyejung H. Jee, Mario Berta, Omar Fawzi","submitted_at":"2020-05-18T16:55:08Z","abstract_excerpt":"We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a semidefinite program of size $\\exp(\\mathcal{O}\\big(T^{12}(\\log^2(AT)+\\log(Q)\\log(AT))/\\epsilon^2\\big))$ to compute additive $\\epsilon$-approximations on the values of two-player free games with $T\\times T$-dimensional quantum assistance, where $A$ and $Q$ denote the numbers of answers and questions of the game, respectively. For fixed dimension $T$, this scales poly"},"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":"2005.08883","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-18T16:55:08Z","cross_cats_sorted":[],"title_canon_sha256":"46a08c026dae4b8e23cf5e101c98fd26e9932f199f1b79cdabed9b7de6fed571","abstract_canon_sha256":"de52e694a27bf8b3200174059913d66fc6a031bdb25abee594e701ed4bf46838"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:28.332176Z","signature_b64":"G8m51bVuExS12EobdwpXzSttNwD2ZT3V+kooeFH+9AJIkTN+WnEYvxYP1yShAgYE2csaNKZraS1zcto4oMKjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"860a8579047fabcddb1dda9e53341b2ef076257a7185215c006a8e337d2e8e29","last_reissued_at":"2026-07-05T02:54:28.331738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:28.331738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-polynomial time algorithms for free quantum games in bounded dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carlo Sparaciari, Hyejung H. Jee, Mario Berta, Omar Fawzi","submitted_at":"2020-05-18T16:55:08Z","abstract_excerpt":"We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a semidefinite program of size $\\exp(\\mathcal{O}\\big(T^{12}(\\log^2(AT)+\\log(Q)\\log(AT))/\\epsilon^2\\big))$ to compute additive $\\epsilon$-approximations on the values of two-player free games with $T\\times T$-dimensional quantum assistance, where $A$ and $Q$ denote the numbers of answers and questions of the game, respectively. For fixed dimension $T$, this scales poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.08883","kind":"arxiv","version":3},"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/2005.08883/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":"2005.08883","created_at":"2026-07-05T02:54:28.331797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.08883v3","created_at":"2026-07-05T02:54:28.331797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.08883","created_at":"2026-07-05T02:54:28.331797+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYFIK6IEP6V4","created_at":"2026-07-05T02:54:28.331797+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYFIK6IEP6V43WY5","created_at":"2026-07-05T02:54:28.331797+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYFIK6IE","created_at":"2026-07-05T02:54:28.331797+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/QYFIK6IEP6V43WY53KPFGNA3F3","json":"https://pith.science/pith/QYFIK6IEP6V43WY53KPFGNA3F3.json","graph_json":"https://pith.science/api/pith-number/QYFIK6IEP6V43WY53KPFGNA3F3/graph.json","events_json":"https://pith.science/api/pith-number/QYFIK6IEP6V43WY53KPFGNA3F3/events.json","paper":"https://pith.science/paper/QYFIK6IE"},"agent_actions":{"view_html":"https://pith.science/pith/QYFIK6IEP6V43WY53KPFGNA3F3","download_json":"https://pith.science/pith/QYFIK6IEP6V43WY53KPFGNA3F3.json","view_paper":"https://pith.science/paper/QYFIK6IE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.08883&json=true","fetch_graph":"https://pith.science/api/pith-number/QYFIK6IEP6V43WY53KPFGNA3F3/graph.json","fetch_events":"https://pith.science/api/pith-number/QYFIK6IEP6V43WY53KPFGNA3F3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYFIK6IEP6V43WY53KPFGNA3F3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYFIK6IEP6V43WY53KPFGNA3F3/action/storage_attestation","attest_author":"https://pith.science/pith/QYFIK6IEP6V43WY53KPFGNA3F3/action/author_attestation","sign_citation":"https://pith.science/pith/QYFIK6IEP6V43WY53KPFGNA3F3/action/citation_signature","submit_replication":"https://pith.science/pith/QYFIK6IEP6V43WY53KPFGNA3F3/action/replication_record"}},"created_at":"2026-07-05T02:54:28.331797+00:00","updated_at":"2026-07-05T02:54:28.331797+00:00"}