{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AVSEEU4H52CZRFK23IABW5YHOY","short_pith_number":"pith:AVSEEU4H","schema_version":"1.0","canonical_sha256":"0564425387ee8598955ada001b77077626ca3d97b9c0b2482c83fb3925a20e99","source":{"kind":"arxiv","id":"1107.1563","version":1},"attestation_state":"computed","paper":{"title":"Designing Nonlinear Turbo Codes with a Target Ones Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bike Xie, Jiadong Wang, Richard Wesel, Thomas Courtade, Tsung-Yi Chen","submitted_at":"2011-07-08T06:05:55Z","abstract_excerpt":"Certain binary asymmetric channels, such as Z-channels in which one of the two crossover probabilities is zero, demand optimal ones densities different from 50%. Some broadcast channels, such as broadcast binary symmetric channels (BBSC) where each component channel is a binary symmetric channel, also require a non-uniform input distribution due to the superposition coding scheme, which is known to achieve the boundary of capacity region. This paper presents a systematic technique for designing nonlinear turbo codes that are able to support ones densities different from 50%. To demonstrate the"},"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":"1107.1563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-08T06:05:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b1fd247176731b19e6495da7b23516dd2eb251b06867fe68e9aa0b1d0aa10483","abstract_canon_sha256":"e27472a88284a52c23b4c8e46afbce5dda9e092174746ac8215c359777e3e3f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:35.398350Z","signature_b64":"7H2XLdpPgdyYhy9SfYdqO8r4cbt/NQpouf82WT2dPJQJ0p60OguBr3DlKmvEINncHAcFtC5fBsP1WE1NVeRbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0564425387ee8598955ada001b77077626ca3d97b9c0b2482c83fb3925a20e99","last_reissued_at":"2026-05-18T04:18:35.397894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:35.397894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Nonlinear Turbo Codes with a Target Ones Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bike Xie, Jiadong Wang, Richard Wesel, Thomas Courtade, Tsung-Yi Chen","submitted_at":"2011-07-08T06:05:55Z","abstract_excerpt":"Certain binary asymmetric channels, such as Z-channels in which one of the two crossover probabilities is zero, demand optimal ones densities different from 50%. Some broadcast channels, such as broadcast binary symmetric channels (BBSC) where each component channel is a binary symmetric channel, also require a non-uniform input distribution due to the superposition coding scheme, which is known to achieve the boundary of capacity region. This paper presents a systematic technique for designing nonlinear turbo codes that are able to support ones densities different from 50%. To demonstrate the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1563","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":"1107.1563","created_at":"2026-05-18T04:18:35.397955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1563v1","created_at":"2026-05-18T04:18:35.397955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1563","created_at":"2026-05-18T04:18:35.397955+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVSEEU4H52CZ","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVSEEU4H52CZRFK2","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVSEEU4H","created_at":"2026-05-18T12:26:24.575870+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/AVSEEU4H52CZRFK23IABW5YHOY","json":"https://pith.science/pith/AVSEEU4H52CZRFK23IABW5YHOY.json","graph_json":"https://pith.science/api/pith-number/AVSEEU4H52CZRFK23IABW5YHOY/graph.json","events_json":"https://pith.science/api/pith-number/AVSEEU4H52CZRFK23IABW5YHOY/events.json","paper":"https://pith.science/paper/AVSEEU4H"},"agent_actions":{"view_html":"https://pith.science/pith/AVSEEU4H52CZRFK23IABW5YHOY","download_json":"https://pith.science/pith/AVSEEU4H52CZRFK23IABW5YHOY.json","view_paper":"https://pith.science/paper/AVSEEU4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1563&json=true","fetch_graph":"https://pith.science/api/pith-number/AVSEEU4H52CZRFK23IABW5YHOY/graph.json","fetch_events":"https://pith.science/api/pith-number/AVSEEU4H52CZRFK23IABW5YHOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVSEEU4H52CZRFK23IABW5YHOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVSEEU4H52CZRFK23IABW5YHOY/action/storage_attestation","attest_author":"https://pith.science/pith/AVSEEU4H52CZRFK23IABW5YHOY/action/author_attestation","sign_citation":"https://pith.science/pith/AVSEEU4H52CZRFK23IABW5YHOY/action/citation_signature","submit_replication":"https://pith.science/pith/AVSEEU4H52CZRFK23IABW5YHOY/action/replication_record"}},"created_at":"2026-05-18T04:18:35.397955+00:00","updated_at":"2026-05-18T04:18:35.397955+00:00"}