{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BBPHDJ7FFK3TYUSCC5HIOSTPD2","short_pith_number":"pith:BBPHDJ7F","canonical_record":{"source":{"id":"1602.00413","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-01T07:35:36Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"6617d02913049e8ccb6004336f8b2b65f8d8889185cb94292cb65558a0cf4bef","abstract_canon_sha256":"570ea7c1e50ae4014ba6ee8fe7e6fe432540f54dd34f3b73fdc842843c435a8b"},"schema_version":"1.0"},"canonical_sha256":"085e71a7e52ab73c5242174e874a6f1e96268f21effa4c2512f5b9bd291b84d4","source":{"kind":"arxiv","id":"1602.00413","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00413","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00413v3","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00413","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"BBPHDJ7FFK3T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BBPHDJ7FFK3TYUSC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BBPHDJ7F","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BBPHDJ7FFK3TYUSCC5HIOSTPD2","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00413","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-01T07:35:36Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"6617d02913049e8ccb6004336f8b2b65f8d8889185cb94292cb65558a0cf4bef","abstract_canon_sha256":"570ea7c1e50ae4014ba6ee8fe7e6fe432540f54dd34f3b73fdc842843c435a8b"},"schema_version":"1.0"},"canonical_sha256":"085e71a7e52ab73c5242174e874a6f1e96268f21effa4c2512f5b9bd291b84d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.923616Z","signature_b64":"b36qMKKd6tspXTa3Xwo6cEskBkSg8PzhvOwxufwCea7pZFj8QUix5Dcci82ZP1tYSRZ9wwdA6Q7jV9hXsWLmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"085e71a7e52ab73c5242174e874a6f1e96268f21effa4c2512f5b9bd291b84d4","last_reissued_at":"2026-05-18T00:26:08.922912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.922912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00413","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhPzIT0G6Ei4KMtK7oCh6gpDLt1BCm+TIUy4MSFUdOd96ogjAF3ZpxI5J2G5IWHvb4sCuiUDmJYM+wRjHi6yBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:09:02.834434Z"},"content_sha256":"66226038b8af883f0c4bec72b8bf12d2dc2117bc6c9a4bd708b1aaca18d0acdb","schema_version":"1.0","event_id":"sha256:66226038b8af883f0c4bec72b8bf12d2dc2117bc6c9a4bd708b1aaca18d0acdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BBPHDJ7FFK3TYUSCC5HIOSTPD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Alexei Ashikhmin, Ching-Yi Lai","submitted_at":"2016-02-01T07:35:36Z","abstract_excerpt":"Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive codes, by considering a type of split weight enumerators. After deriving the MacWilliams identities for these split weight enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. In particular, we show that the first linear programming bound improves the Ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00413","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJw2NzAfI63qyr7v8MrUGsimQG9mLqgmnLctxWhORhxSJpmd60RQZAc1xwnGzIOpLKfA3675l0+8rlyUL/RzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:09:02.835022Z"},"content_sha256":"933f0f3ecbf455c3b4e39e5f353e760c61bb48fcbc4195fada677f8cb15fa7a9","schema_version":"1.0","event_id":"sha256:933f0f3ecbf455c3b4e39e5f353e760c61bb48fcbc4195fada677f8cb15fa7a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBPHDJ7FFK3TYUSCC5HIOSTPD2/bundle.json","state_url":"https://pith.science/pith/BBPHDJ7FFK3TYUSCC5HIOSTPD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBPHDJ7FFK3TYUSCC5HIOSTPD2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T22:09:02Z","links":{"resolver":"https://pith.science/pith/BBPHDJ7FFK3TYUSCC5HIOSTPD2","bundle":"https://pith.science/pith/BBPHDJ7FFK3TYUSCC5HIOSTPD2/bundle.json","state":"https://pith.science/pith/BBPHDJ7FFK3TYUSCC5HIOSTPD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBPHDJ7FFK3TYUSCC5HIOSTPD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BBPHDJ7FFK3TYUSCC5HIOSTPD2","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":"570ea7c1e50ae4014ba6ee8fe7e6fe432540f54dd34f3b73fdc842843c435a8b","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-01T07:35:36Z","title_canon_sha256":"6617d02913049e8ccb6004336f8b2b65f8d8889185cb94292cb65558a0cf4bef"},"schema_version":"1.0","source":{"id":"1602.00413","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00413","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00413v3","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00413","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"BBPHDJ7FFK3T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BBPHDJ7FFK3TYUSC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BBPHDJ7F","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:933f0f3ecbf455c3b4e39e5f353e760c61bb48fcbc4195fada677f8cb15fa7a9","target":"graph","created_at":"2026-05-18T00:26:08Z","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"},"paper":{"abstract_excerpt":"Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive codes, by considering a type of split weight enumerators. After deriving the MacWilliams identities for these split weight enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. In particular, we show that the first linear programming bound improves the Ha","authors_text":"Alexei Ashikhmin, Ching-Yi Lai","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-01T07:35:36Z","title":"Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00413","kind":"arxiv","version":3},"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:66226038b8af883f0c4bec72b8bf12d2dc2117bc6c9a4bd708b1aaca18d0acdb","target":"record","created_at":"2026-05-18T00:26:08Z","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":"570ea7c1e50ae4014ba6ee8fe7e6fe432540f54dd34f3b73fdc842843c435a8b","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-01T07:35:36Z","title_canon_sha256":"6617d02913049e8ccb6004336f8b2b65f8d8889185cb94292cb65558a0cf4bef"},"schema_version":"1.0","source":{"id":"1602.00413","kind":"arxiv","version":3}},"canonical_sha256":"085e71a7e52ab73c5242174e874a6f1e96268f21effa4c2512f5b9bd291b84d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"085e71a7e52ab73c5242174e874a6f1e96268f21effa4c2512f5b9bd291b84d4","first_computed_at":"2026-05-18T00:26:08.922912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:08.922912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b36qMKKd6tspXTa3Xwo6cEskBkSg8PzhvOwxufwCea7pZFj8QUix5Dcci82ZP1tYSRZ9wwdA6Q7jV9hXsWLmAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:08.923616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00413","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66226038b8af883f0c4bec72b8bf12d2dc2117bc6c9a4bd708b1aaca18d0acdb","sha256:933f0f3ecbf455c3b4e39e5f353e760c61bb48fcbc4195fada677f8cb15fa7a9"],"state_sha256":"95022690df557f6bbbaaf1ed19344ceea8d69c24b7802eec1c0014d5e9637806"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVI0zagLPqI3VpbIJ9gdHLzhxswta5+zb09PIRA0W+NaoIvuIfMQW4AeUneMXpU12TGGOcp/rKFSS4X0yd5UBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:09:02.839768Z","bundle_sha256":"22c42c3aa1baf1bac0a0887d76c84c73f39c8a8a41ebbaf543cb043e1bb90d90"}}