{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OMP56HSSVLKUBZ2BZK27742KGW","short_pith_number":"pith:OMP56HSS","schema_version":"1.0","canonical_sha256":"731fdf1e52aad540e741cab5fff34a359249d65c885c88e7b154c0fe669945f6","source":{"kind":"arxiv","id":"1311.3123","version":1},"attestation_state":"computed","paper":{"title":"Polar Codes for Arbitrary DMCs and Arbitrary MACs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emre Telatar, Rajai Nasser","submitted_at":"2013-11-13T13:24:56Z","abstract_excerpt":"Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with \"usual\" polar codes, the block error probability under successive cancellation decoding is $o(2^{-N^{1/2-\\epsilon}})$, where $N$ is the block length. Encoding and decoding for these codes can be implemented with a complexity of $O(N\\log N)$. It is shown that the same technique can be used to construct polar codes for arbitrary multiple access channels (MAC) by using an appropriate Abelian group structure. Although the symmetric sum capacity is achieved by this co"},"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":"1311.3123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-13T13:24:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3f708d09851e2114a41da9c8bd1e5f1301b3ee4e02967e46235f13f7395b412c","abstract_canon_sha256":"978efe605b566cc39de30bea6a4da19701c1c77f2e709eed29fddeba5bdbad78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.419156Z","signature_b64":"txRVuQq2HRZ8FxJJSG51XwaRRLyrjgd3NKj1pBpri7gFFM8hYtjIgUD0WDFZPN0KdwfaI40jlPHNFyyxWbKOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"731fdf1e52aad540e741cab5fff34a359249d65c885c88e7b154c0fe669945f6","last_reissued_at":"2026-05-18T01:12:25.418815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.418815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar Codes for Arbitrary DMCs and Arbitrary MACs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emre Telatar, Rajai Nasser","submitted_at":"2013-11-13T13:24:56Z","abstract_excerpt":"Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with \"usual\" polar codes, the block error probability under successive cancellation decoding is $o(2^{-N^{1/2-\\epsilon}})$, where $N$ is the block length. Encoding and decoding for these codes can be implemented with a complexity of $O(N\\log N)$. It is shown that the same technique can be used to construct polar codes for arbitrary multiple access channels (MAC) by using an appropriate Abelian group structure. Although the symmetric sum capacity is achieved by this co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3123","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":"1311.3123","created_at":"2026-05-18T01:12:25.418865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3123v1","created_at":"2026-05-18T01:12:25.418865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3123","created_at":"2026-05-18T01:12:25.418865+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMP56HSSVLKU","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMP56HSSVLKUBZ2B","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMP56HSS","created_at":"2026-05-18T12:27:54.935989+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/OMP56HSSVLKUBZ2BZK27742KGW","json":"https://pith.science/pith/OMP56HSSVLKUBZ2BZK27742KGW.json","graph_json":"https://pith.science/api/pith-number/OMP56HSSVLKUBZ2BZK27742KGW/graph.json","events_json":"https://pith.science/api/pith-number/OMP56HSSVLKUBZ2BZK27742KGW/events.json","paper":"https://pith.science/paper/OMP56HSS"},"agent_actions":{"view_html":"https://pith.science/pith/OMP56HSSVLKUBZ2BZK27742KGW","download_json":"https://pith.science/pith/OMP56HSSVLKUBZ2BZK27742KGW.json","view_paper":"https://pith.science/paper/OMP56HSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3123&json=true","fetch_graph":"https://pith.science/api/pith-number/OMP56HSSVLKUBZ2BZK27742KGW/graph.json","fetch_events":"https://pith.science/api/pith-number/OMP56HSSVLKUBZ2BZK27742KGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMP56HSSVLKUBZ2BZK27742KGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMP56HSSVLKUBZ2BZK27742KGW/action/storage_attestation","attest_author":"https://pith.science/pith/OMP56HSSVLKUBZ2BZK27742KGW/action/author_attestation","sign_citation":"https://pith.science/pith/OMP56HSSVLKUBZ2BZK27742KGW/action/citation_signature","submit_replication":"https://pith.science/pith/OMP56HSSVLKUBZ2BZK27742KGW/action/replication_record"}},"created_at":"2026-05-18T01:12:25.418865+00:00","updated_at":"2026-05-18T01:12:25.418865+00:00"}