{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FS7KEZASXXRD2QOM257QOF6MRX","short_pith_number":"pith:FS7KEZAS","schema_version":"1.0","canonical_sha256":"2cbea26412bde23d41ccd77f0717cc8dcf212beb3d1b8057f737a38a5e89b2c0","source":{"kind":"arxiv","id":"1211.6697","version":1},"attestation_state":"computed","paper":{"title":"Refinement of the Sphere-Packing Bound: Asymmetric Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner, Yucel Altug","submitted_at":"2012-11-28T18:38:50Z","abstract_excerpt":"We provide a refinement of the sphere-packing bound for constant composition codes over asymmetric discrete memoryless channels that improves the pre-factor in front of the exponential term. The order of our pre-factor is $\\Omega(N^{-1/2(1+\\epsilon + \\rho_{R}^{\\ast})})$ for any $\\epsilon >0$, where $\\rho_{R}^{\\ast}$ is the maximum absolute-value subdifferential of the sphere-packing exponent at rate $R$ and $N$ is the blocklength."},"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":"1211.6697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-28T18:38:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b10922e657ad964d0efd8c2989f323bb95350e8fb590e133218d90783dacabcd","abstract_canon_sha256":"80a69294a6511fcc066c3ece9d2e6705e6ce96651e3b79532f83c43194892a90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:44.021356Z","signature_b64":"rgeV4qQmfWh/QuWZ0OWjV/7YBIClTpJNV+U0+EdL8fvVeWtfOLbAz4xLEX6h95fDidkBjPYWGJ7f+OVQL+V9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cbea26412bde23d41ccd77f0717cc8dcf212beb3d1b8057f737a38a5e89b2c0","last_reissued_at":"2026-05-18T03:39:44.020918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:44.020918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refinement of the Sphere-Packing Bound: Asymmetric Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner, Yucel Altug","submitted_at":"2012-11-28T18:38:50Z","abstract_excerpt":"We provide a refinement of the sphere-packing bound for constant composition codes over asymmetric discrete memoryless channels that improves the pre-factor in front of the exponential term. The order of our pre-factor is $\\Omega(N^{-1/2(1+\\epsilon + \\rho_{R}^{\\ast})})$ for any $\\epsilon >0$, where $\\rho_{R}^{\\ast}$ is the maximum absolute-value subdifferential of the sphere-packing exponent at rate $R$ and $N$ is the blocklength."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6697","kind":"arxiv","version":1},"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":"1211.6697","created_at":"2026-05-18T03:39:44.020986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6697v1","created_at":"2026-05-18T03:39:44.020986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6697","created_at":"2026-05-18T03:39:44.020986+00:00"},{"alias_kind":"pith_short_12","alias_value":"FS7KEZASXXRD","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FS7KEZASXXRD2QOM","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FS7KEZAS","created_at":"2026-05-18T12:27:06.952714+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/FS7KEZASXXRD2QOM257QOF6MRX","json":"https://pith.science/pith/FS7KEZASXXRD2QOM257QOF6MRX.json","graph_json":"https://pith.science/api/pith-number/FS7KEZASXXRD2QOM257QOF6MRX/graph.json","events_json":"https://pith.science/api/pith-number/FS7KEZASXXRD2QOM257QOF6MRX/events.json","paper":"https://pith.science/paper/FS7KEZAS"},"agent_actions":{"view_html":"https://pith.science/pith/FS7KEZASXXRD2QOM257QOF6MRX","download_json":"https://pith.science/pith/FS7KEZASXXRD2QOM257QOF6MRX.json","view_paper":"https://pith.science/paper/FS7KEZAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6697&json=true","fetch_graph":"https://pith.science/api/pith-number/FS7KEZASXXRD2QOM257QOF6MRX/graph.json","fetch_events":"https://pith.science/api/pith-number/FS7KEZASXXRD2QOM257QOF6MRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FS7KEZASXXRD2QOM257QOF6MRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FS7KEZASXXRD2QOM257QOF6MRX/action/storage_attestation","attest_author":"https://pith.science/pith/FS7KEZASXXRD2QOM257QOF6MRX/action/author_attestation","sign_citation":"https://pith.science/pith/FS7KEZASXXRD2QOM257QOF6MRX/action/citation_signature","submit_replication":"https://pith.science/pith/FS7KEZASXXRD2QOM257QOF6MRX/action/replication_record"}},"created_at":"2026-05-18T03:39:44.020986+00:00","updated_at":"2026-05-18T03:39:44.020986+00:00"}