{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5KEMEIXQ67SCJMES2YMV4YBVPS","short_pith_number":"pith:5KEMEIXQ","canonical_record":{"source":{"id":"1701.02957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-11T12:59:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b88d8008201edd9e270c174ae79d69d17b5173f17228bd5996ae5b4a6d1b1c9a","abstract_canon_sha256":"e5d22fa53b882f572b37f2e82632f5d794675a0b15e5cf978d38dc929ff5885d"},"schema_version":"1.0"},"canonical_sha256":"ea88c222f0f7e424b092d6195e60357c899505dd99375d9fbbf208e979bcebac","source":{"kind":"arxiv","id":"1701.02957","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02957","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02957v2","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02957","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"5KEMEIXQ67SC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5KEMEIXQ67SCJMES","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5KEMEIXQ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5KEMEIXQ67SCJMES2YMV4YBVPS","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-11T12:59:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b88d8008201edd9e270c174ae79d69d17b5173f17228bd5996ae5b4a6d1b1c9a","abstract_canon_sha256":"e5d22fa53b882f572b37f2e82632f5d794675a0b15e5cf978d38dc929ff5885d"},"schema_version":"1.0"},"canonical_sha256":"ea88c222f0f7e424b092d6195e60357c899505dd99375d9fbbf208e979bcebac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:48.995999Z","signature_b64":"G1Oa7B5iUpJnI+2LWVLPot/ZuoBtiGN6JW2gFQdu6DtmErOBDZ45iYIdSIiT/9pInOFbQLYIpQP72UohuuHnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea88c222f0f7e424b092d6195e60357c899505dd99375d9fbbf208e979bcebac","last_reissued_at":"2026-05-18T00:52:48.995359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:48.995359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02957","source_version":2,"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:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XKUijpm+s43KRUzvJlkME/tbU4jXaXKf9EwIT5gdCYYzMqSPxaxb02OOX9hIamo8fBBDxP+tWS9OG8WfBXJCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:30:41.230375Z"},"content_sha256":"b4936b6cc57886c7b0573ad545c0cf29ecd101ca0c999274fcc92f4db32baaf7","schema_version":"1.0","event_id":"sha256:b4936b6cc57886c7b0573ad545c0cf29ecd101ca0c999274fcc92f4db32baaf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5KEMEIXQ67SCJMES2YMV4YBVPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sphere-Packing Bound for Symmetric Classical-Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Hao-Chung Cheng, Marco Tomamichel, Min-Hsiu Hsieh","submitted_at":"2017-01-11T12:59:53Z","abstract_excerpt":"We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of the subexponential to the polynomial. The established pre-factor is essentially optimal because it matches the best known random coding upper bound in the classical case. Our approaches rely on a sharp concentration inequality in strong large deviation theory and crucial properties of the error-exponent function."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02957","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"},"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:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUBMR+twkS+c+RjdSMUESlg499NXhJnex1ijoIai0MQf1fI1DJFR5Kvpn6bFKq+Pbyk+E5RX8nASYJHHEatEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:30:41.230733Z"},"content_sha256":"610884bdde97323a51197ca62d6fb51b302692d6602ce41bf2f40253554029af","schema_version":"1.0","event_id":"sha256:610884bdde97323a51197ca62d6fb51b302692d6602ce41bf2f40253554029af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KEMEIXQ67SCJMES2YMV4YBVPS/bundle.json","state_url":"https://pith.science/pith/5KEMEIXQ67SCJMES2YMV4YBVPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KEMEIXQ67SCJMES2YMV4YBVPS/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-06-01T23:30:41Z","links":{"resolver":"https://pith.science/pith/5KEMEIXQ67SCJMES2YMV4YBVPS","bundle":"https://pith.science/pith/5KEMEIXQ67SCJMES2YMV4YBVPS/bundle.json","state":"https://pith.science/pith/5KEMEIXQ67SCJMES2YMV4YBVPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KEMEIXQ67SCJMES2YMV4YBVPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5KEMEIXQ67SCJMES2YMV4YBVPS","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":"e5d22fa53b882f572b37f2e82632f5d794675a0b15e5cf978d38dc929ff5885d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-11T12:59:53Z","title_canon_sha256":"b88d8008201edd9e270c174ae79d69d17b5173f17228bd5996ae5b4a6d1b1c9a"},"schema_version":"1.0","source":{"id":"1701.02957","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02957","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02957v2","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02957","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"5KEMEIXQ67SC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5KEMEIXQ67SCJMES","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5KEMEIXQ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:610884bdde97323a51197ca62d6fb51b302692d6602ce41bf2f40253554029af","target":"graph","created_at":"2026-05-18T00:52:48Z","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":"We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of the subexponential to the polynomial. The established pre-factor is essentially optimal because it matches the best known random coding upper bound in the classical case. Our approaches rely on a sharp concentration inequality in strong large deviation theory and crucial properties of the error-exponent function.","authors_text":"Hao-Chung Cheng, Marco Tomamichel, Min-Hsiu Hsieh","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-11T12:59:53Z","title":"Sphere-Packing Bound for Symmetric Classical-Quantum Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02957","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:b4936b6cc57886c7b0573ad545c0cf29ecd101ca0c999274fcc92f4db32baaf7","target":"record","created_at":"2026-05-18T00:52:48Z","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":"e5d22fa53b882f572b37f2e82632f5d794675a0b15e5cf978d38dc929ff5885d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-11T12:59:53Z","title_canon_sha256":"b88d8008201edd9e270c174ae79d69d17b5173f17228bd5996ae5b4a6d1b1c9a"},"schema_version":"1.0","source":{"id":"1701.02957","kind":"arxiv","version":2}},"canonical_sha256":"ea88c222f0f7e424b092d6195e60357c899505dd99375d9fbbf208e979bcebac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea88c222f0f7e424b092d6195e60357c899505dd99375d9fbbf208e979bcebac","first_computed_at":"2026-05-18T00:52:48.995359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:48.995359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G1Oa7B5iUpJnI+2LWVLPot/ZuoBtiGN6JW2gFQdu6DtmErOBDZ45iYIdSIiT/9pInOFbQLYIpQP72UohuuHnAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:48.995999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02957","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4936b6cc57886c7b0573ad545c0cf29ecd101ca0c999274fcc92f4db32baaf7","sha256:610884bdde97323a51197ca62d6fb51b302692d6602ce41bf2f40253554029af"],"state_sha256":"a8337fbb8c115c891e7eb5eb35af8bfd4e79a467fc56d9555ae78a0f11c26c8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQZZahdtHuIyvnQDhjZ5PT9pS4h7PhlmjakV/oVJ9DwFQqmvpY/gPkG6cxoN+d52j8nfFEIHvQ7mchLKKfMWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:30:41.232759Z","bundle_sha256":"0d347d488a892b370eafdd0f732d9d56503dc6ad3ed5e226d172bec1e37283ff"}}