{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3HRYTTU5NIIUE44RFMHBCVU4KK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e365359c7c2719807992c33b4aad761d2667c0b6cf2c11369d5061c822e93906","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T18:00:07Z","title_canon_sha256":"5598ba4c33f1b091d0e679455953c5e7f511ba1e7881ac7b00b6e5b68a34a735"},"schema_version":"1.0","source":{"id":"2408.10323","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10323","created_at":"2026-07-05T12:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10323v2","created_at":"2026-07-05T12:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10323","created_at":"2026-07-05T12:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"3HRYTTU5NIIU","created_at":"2026-07-05T12:07:54Z"},{"alias_kind":"pith_short_16","alias_value":"3HRYTTU5NIIUE44R","created_at":"2026-07-05T12:07:54Z"},{"alias_kind":"pith_short_8","alias_value":"3HRYTTU5","created_at":"2026-07-05T12:07:54Z"}],"graph_snapshots":[{"event_id":"sha256:420079e7ffdff67e118e3d19857cf253ae06f0fe4668cd84fec7d6f4df2e6ed9","target":"graph","created_at":"2026-07-05T12:07:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.10323/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\\!(n, K, {\\delta})\\!)_2$ code exists if and only if every level of the hierarchy is feasible. It is not limited to stabilizer codes and thus is applicable generally. While the machinery is formally dimension-free, we restrict it to qubit codes through quasi-Clifford algebras. We derive the quantum analog of a range of classical results: first, from an intermediate level a Lov\\'asz boun","authors_text":"Andrew Nemec, Felix Huber, Gerard Angl\\`es Munn\\'e","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T18:00:07Z","title":"SDP bounds on quantum codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10323","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:259fe537dc64afa99e6f710b47409325109fb1bfbc98f6a1cfe55eb3e21c95a7","target":"record","created_at":"2026-07-05T12:07:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e365359c7c2719807992c33b4aad761d2667c0b6cf2c11369d5061c822e93906","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-19T18:00:07Z","title_canon_sha256":"5598ba4c33f1b091d0e679455953c5e7f511ba1e7881ac7b00b6e5b68a34a735"},"schema_version":"1.0","source":{"id":"2408.10323","kind":"arxiv","version":2}},"canonical_sha256":"d9e389ce9d6a114273912b0e11569c52b3c00573ddf896bbea4ec7a92b50a3b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9e389ce9d6a114273912b0e11569c52b3c00573ddf896bbea4ec7a92b50a3b4","first_computed_at":"2026-07-05T12:07:54.551523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:07:54.551523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pYeeWsqzP2FkjobAuBX6sWkAnR41vRb6MfEBuUvAOH8tTcGt30bkjlsf4n22JkZbpPMnVLIHR49FviHX1LKnAA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:07:54.552183Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.10323","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:259fe537dc64afa99e6f710b47409325109fb1bfbc98f6a1cfe55eb3e21c95a7","sha256:420079e7ffdff67e118e3d19857cf253ae06f0fe4668cd84fec7d6f4df2e6ed9"],"state_sha256":"ad1e94955e90fdc67e9eddacd4257eee32f9e2275c118ba5c587998baa95ce1b"}