{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D6X2QRZNUBQFZLE3KLMUUYSAVW","short_pith_number":"pith:D6X2QRZN","schema_version":"1.0","canonical_sha256":"1fafa8472da0605cac9b52d94a6240adabae022ac4eaf565633274e57d3ad471","source":{"kind":"arxiv","id":"2505.06867","version":1},"attestation_state":"computed","paper":{"title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Geon Choi, Namyoon Lee","submitted_at":"2025-05-11T06:32:29Z","abstract_excerpt":"Deep polar codes are pre-transformed polar codes that employ a multi-layered polar kernel transformation strategy to enhance code performance in short blocklength regimes. However, like conventional polar codes, their block length is constrained to powers of two, as the final transformation layer uses a conventional polar kernel matrix. This paper introduces a novel rate-matching technique for deep polar codes using code extension, particularly effective when the desired code length slightly exceeds a power of two. The key idea is to exploit the layered structure of deep polar codes by concate"},"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":"2505.06867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-11T06:32:29Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"6e46af2e8c88852b3498789f2c828b73ff7d9bcd2e5a8736ab30f35a6b33bf5e","abstract_canon_sha256":"ad389ec1fddf58b26c51dc915e8a65659d58b41b0ed85460eaf7e50263b5a4a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:38.127220Z","signature_b64":"WzdUMRcSlNubSpxfCeXVKAFE7xBcLWqBAeJaGq1AUJqOxVKBKVSMSLByFj1lPUWpYF8mxoV1MR8K+gZ/aEcbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fafa8472da0605cac9b52d94a6240adabae022ac4eaf565633274e57d3ad471","last_reissued_at":"2026-07-05T11:01:38.126782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:38.126782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Matching Deep Polar Codes via Polar Coded Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Geon Choi, Namyoon Lee","submitted_at":"2025-05-11T06:32:29Z","abstract_excerpt":"Deep polar codes are pre-transformed polar codes that employ a multi-layered polar kernel transformation strategy to enhance code performance in short blocklength regimes. However, like conventional polar codes, their block length is constrained to powers of two, as the final transformation layer uses a conventional polar kernel matrix. This paper introduces a novel rate-matching technique for deep polar codes using code extension, particularly effective when the desired code length slightly exceeds a power of two. The key idea is to exploit the layered structure of deep polar codes by concate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06867","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.06867/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.06867","created_at":"2026-07-05T11:01:38.126844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.06867v1","created_at":"2026-07-05T11:01:38.126844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06867","created_at":"2026-07-05T11:01:38.126844+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6X2QRZNUBQF","created_at":"2026-07-05T11:01:38.126844+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6X2QRZNUBQFZLE3","created_at":"2026-07-05T11:01:38.126844+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6X2QRZN","created_at":"2026-07-05T11:01:38.126844+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/D6X2QRZNUBQFZLE3KLMUUYSAVW","json":"https://pith.science/pith/D6X2QRZNUBQFZLE3KLMUUYSAVW.json","graph_json":"https://pith.science/api/pith-number/D6X2QRZNUBQFZLE3KLMUUYSAVW/graph.json","events_json":"https://pith.science/api/pith-number/D6X2QRZNUBQFZLE3KLMUUYSAVW/events.json","paper":"https://pith.science/paper/D6X2QRZN"},"agent_actions":{"view_html":"https://pith.science/pith/D6X2QRZNUBQFZLE3KLMUUYSAVW","download_json":"https://pith.science/pith/D6X2QRZNUBQFZLE3KLMUUYSAVW.json","view_paper":"https://pith.science/paper/D6X2QRZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.06867&json=true","fetch_graph":"https://pith.science/api/pith-number/D6X2QRZNUBQFZLE3KLMUUYSAVW/graph.json","fetch_events":"https://pith.science/api/pith-number/D6X2QRZNUBQFZLE3KLMUUYSAVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6X2QRZNUBQFZLE3KLMUUYSAVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6X2QRZNUBQFZLE3KLMUUYSAVW/action/storage_attestation","attest_author":"https://pith.science/pith/D6X2QRZNUBQFZLE3KLMUUYSAVW/action/author_attestation","sign_citation":"https://pith.science/pith/D6X2QRZNUBQFZLE3KLMUUYSAVW/action/citation_signature","submit_replication":"https://pith.science/pith/D6X2QRZNUBQFZLE3KLMUUYSAVW/action/replication_record"}},"created_at":"2026-07-05T11:01:38.126844+00:00","updated_at":"2026-07-05T11:01:38.126844+00:00"}