{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z6SJ2A5BMEBHOUYYNIE3VXGG2C","short_pith_number":"pith:Z6SJ2A5B","schema_version":"1.0","canonical_sha256":"cfa49d03a161027753186a09badcc6d0836ad5289ef5e099f890fb0f66d61b4a","source":{"kind":"arxiv","id":"1708.09696","version":2},"attestation_state":"computed","paper":{"title":"Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"David de Laat, Monique Laurent, Sander Gribling","submitted_at":"2017-08-31T13:07:11Z","abstract_excerpt":"In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive sem"},"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":"1708.09696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-31T13:07:11Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"3d9b181baac5687e18812c2c1ce6292bc347c99d5c14c3ca4b0585310057e598","abstract_canon_sha256":"b9d3ef702910d3632be6742459a9af10e106d7defe8f38391bd2c6fe372ebb97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:29.053638Z","signature_b64":"Zb1MJ6cup6Hqhjw+FI5mAKoPh743wf36zW0IVSxGwAS/9sjmL0w8O/TmnAM907Ftybe8LWheMintYo9XF8PdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfa49d03a161027753186a09badcc6d0836ad5289ef5e099f890fb0f66d61b4a","last_reissued_at":"2026-05-18T00:26:29.053082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:29.053082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"David de Laat, Monique Laurent, Sander Gribling","submitted_at":"2017-08-31T13:07:11Z","abstract_excerpt":"In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive sem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09696","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":""},"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":"1708.09696","created_at":"2026-05-18T00:26:29.053183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09696v2","created_at":"2026-05-18T00:26:29.053183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09696","created_at":"2026-05-18T00:26:29.053183+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6SJ2A5BMEBH","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6SJ2A5BMEBHOUYY","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6SJ2A5B","created_at":"2026-05-18T12:31:59.375834+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/Z6SJ2A5BMEBHOUYYNIE3VXGG2C","json":"https://pith.science/pith/Z6SJ2A5BMEBHOUYYNIE3VXGG2C.json","graph_json":"https://pith.science/api/pith-number/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/graph.json","events_json":"https://pith.science/api/pith-number/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/events.json","paper":"https://pith.science/paper/Z6SJ2A5B"},"agent_actions":{"view_html":"https://pith.science/pith/Z6SJ2A5BMEBHOUYYNIE3VXGG2C","download_json":"https://pith.science/pith/Z6SJ2A5BMEBHOUYYNIE3VXGG2C.json","view_paper":"https://pith.science/paper/Z6SJ2A5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09696&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/action/storage_attestation","attest_author":"https://pith.science/pith/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/action/author_attestation","sign_citation":"https://pith.science/pith/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/action/citation_signature","submit_replication":"https://pith.science/pith/Z6SJ2A5BMEBHOUYYNIE3VXGG2C/action/replication_record"}},"created_at":"2026-05-18T00:26:29.053183+00:00","updated_at":"2026-05-18T00:26:29.053183+00:00"}