{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5RYHHBHMPTYLLH5GIPORNU6IK7","short_pith_number":"pith:5RYHHBHM","schema_version":"1.0","canonical_sha256":"ec707384ec7cf0b59fa643dd16d3c857ce259c0a5d65e9f3a6b1c2056ad666de","source":{"kind":"arxiv","id":"1611.01199","version":2},"attestation_state":"computed","paper":{"title":"Capacity-Achieving Rate-Compatible Polar Codes for General Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dennis Hui, Ivana Mari\\'c, Marco Mondelli, S. Hamed Hassani, Song-Nam Hong","submitted_at":"2016-11-03T21:25:26Z","abstract_excerpt":"We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family of channels. The motivation for our extension comes from the fact that in many practical scenarios, e.g., MIMO systems and non-Gaussian interference, the channels cannot be ordered by degradation. The main technical contribution of this paper consists in removing the degradation condition. To do so, we exploit the ideas coming from the construction of univer"},"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":"1611.01199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-03T21:25:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bfb188cba80c96bc9234c98afb5f5b0558e90fc95089b5627b7621c23280da97","abstract_canon_sha256":"b25873f57e07211661ddf5f0e2dc40ab318928552baf8e40c26de2020ef5a5e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:22.512245Z","signature_b64":"OYWdiknlpN4+NRFsi/opL3r14o12HJgDMkAb0uk6tvaj6ujwk+jDof0KEnHgH7VBJ1uhoa5id/cd/oL3ttOLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec707384ec7cf0b59fa643dd16d3c857ce259c0a5d65e9f3a6b1c2056ad666de","last_reissued_at":"2026-05-18T00:52:22.511550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:22.511550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity-Achieving Rate-Compatible Polar Codes for General Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dennis Hui, Ivana Mari\\'c, Marco Mondelli, S. Hamed Hassani, Song-Nam Hong","submitted_at":"2016-11-03T21:25:26Z","abstract_excerpt":"We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family of channels. The motivation for our extension comes from the fact that in many practical scenarios, e.g., MIMO systems and non-Gaussian interference, the channels cannot be ordered by degradation. The main technical contribution of this paper consists in removing the degradation condition. To do so, we exploit the ideas coming from the construction of univer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01199","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.01199","created_at":"2026-05-18T00:52:22.511669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01199v2","created_at":"2026-05-18T00:52:22.511669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01199","created_at":"2026-05-18T00:52:22.511669+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RYHHBHMPTYL","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RYHHBHMPTYLLH5G","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RYHHBHM","created_at":"2026-05-18T12:30:01.593930+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/5RYHHBHMPTYLLH5GIPORNU6IK7","json":"https://pith.science/pith/5RYHHBHMPTYLLH5GIPORNU6IK7.json","graph_json":"https://pith.science/api/pith-number/5RYHHBHMPTYLLH5GIPORNU6IK7/graph.json","events_json":"https://pith.science/api/pith-number/5RYHHBHMPTYLLH5GIPORNU6IK7/events.json","paper":"https://pith.science/paper/5RYHHBHM"},"agent_actions":{"view_html":"https://pith.science/pith/5RYHHBHMPTYLLH5GIPORNU6IK7","download_json":"https://pith.science/pith/5RYHHBHMPTYLLH5GIPORNU6IK7.json","view_paper":"https://pith.science/paper/5RYHHBHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01199&json=true","fetch_graph":"https://pith.science/api/pith-number/5RYHHBHMPTYLLH5GIPORNU6IK7/graph.json","fetch_events":"https://pith.science/api/pith-number/5RYHHBHMPTYLLH5GIPORNU6IK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RYHHBHMPTYLLH5GIPORNU6IK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RYHHBHMPTYLLH5GIPORNU6IK7/action/storage_attestation","attest_author":"https://pith.science/pith/5RYHHBHMPTYLLH5GIPORNU6IK7/action/author_attestation","sign_citation":"https://pith.science/pith/5RYHHBHMPTYLLH5GIPORNU6IK7/action/citation_signature","submit_replication":"https://pith.science/pith/5RYHHBHMPTYLLH5GIPORNU6IK7/action/replication_record"}},"created_at":"2026-05-18T00:52:22.511669+00:00","updated_at":"2026-05-18T00:52:22.511669+00:00"}