{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2JFFXORWHAHYXUTDMSDYY2FVGJ","short_pith_number":"pith:2JFFXORW","schema_version":"1.0","canonical_sha256":"d24a5bba36380f8bd26364878c68b5326fcf288c56adbb6d18404ec5b795144a","source":{"kind":"arxiv","id":"1005.2770","version":3},"attestation_state":"computed","paper":{"title":"Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Eran Hof, Igal Sason, Shlomo Shamai","submitted_at":"2010-05-16T18:53:47Z","abstract_excerpt":"Channel coding over arbitrarily-permuted parallel channels was first studied by Willems et al. (2008). This paper introduces capacity-achieving polar coding schemes for arbitrarily-permuted parallel channels where the component channels are memoryless, binary-input and output-symmetric."},"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":"1005.2770","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-16T18:53:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d2287a8379dee1d867dc687b35187e49805475acdc83f1c112d931f5f20ff93","abstract_canon_sha256":"9473abf1a01e6f46a65405769e6c1ff83239cbb25bd8673f017671f902107421"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:59.545376Z","signature_b64":"1MjrWC02Tl3eMQ7/n1omm/rml8NKuyPXV62Oj/XVKNt08SBNGhjHS/ivqxQ2/gcDSuAQrYM2V2Trah2xKWUwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d24a5bba36380f8bd26364878c68b5326fcf288c56adbb6d18404ec5b795144a","last_reissued_at":"2026-05-18T02:23:59.544650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:59.544650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Eran Hof, Igal Sason, Shlomo Shamai","submitted_at":"2010-05-16T18:53:47Z","abstract_excerpt":"Channel coding over arbitrarily-permuted parallel channels was first studied by Willems et al. (2008). This paper introduces capacity-achieving polar coding schemes for arbitrarily-permuted parallel channels where the component channels are memoryless, binary-input and output-symmetric."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2770","kind":"arxiv","version":3},"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":"1005.2770","created_at":"2026-05-18T02:23:59.544755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.2770v3","created_at":"2026-05-18T02:23:59.544755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2770","created_at":"2026-05-18T02:23:59.544755+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JFFXORWHAHY","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JFFXORWHAHYXUTD","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JFFXORW","created_at":"2026-05-18T12:26:03.138858+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/2JFFXORWHAHYXUTDMSDYY2FVGJ","json":"https://pith.science/pith/2JFFXORWHAHYXUTDMSDYY2FVGJ.json","graph_json":"https://pith.science/api/pith-number/2JFFXORWHAHYXUTDMSDYY2FVGJ/graph.json","events_json":"https://pith.science/api/pith-number/2JFFXORWHAHYXUTDMSDYY2FVGJ/events.json","paper":"https://pith.science/paper/2JFFXORW"},"agent_actions":{"view_html":"https://pith.science/pith/2JFFXORWHAHYXUTDMSDYY2FVGJ","download_json":"https://pith.science/pith/2JFFXORWHAHYXUTDMSDYY2FVGJ.json","view_paper":"https://pith.science/paper/2JFFXORW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.2770&json=true","fetch_graph":"https://pith.science/api/pith-number/2JFFXORWHAHYXUTDMSDYY2FVGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2JFFXORWHAHYXUTDMSDYY2FVGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JFFXORWHAHYXUTDMSDYY2FVGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JFFXORWHAHYXUTDMSDYY2FVGJ/action/storage_attestation","attest_author":"https://pith.science/pith/2JFFXORWHAHYXUTDMSDYY2FVGJ/action/author_attestation","sign_citation":"https://pith.science/pith/2JFFXORWHAHYXUTDMSDYY2FVGJ/action/citation_signature","submit_replication":"https://pith.science/pith/2JFFXORWHAHYXUTDMSDYY2FVGJ/action/replication_record"}},"created_at":"2026-05-18T02:23:59.544755+00:00","updated_at":"2026-05-18T02:23:59.544755+00:00"}