{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2IYTSBH34LGUDODPBITANF3XDR","short_pith_number":"pith:2IYTSBH3","schema_version":"1.0","canonical_sha256":"d2313904fbe2cd41b86f0a260697771c516ccf7cf0e4f46b5a79eb064043dde2","source":{"kind":"arxiv","id":"1901.10464","version":1},"attestation_state":"computed","paper":{"title":"Decoder-tailored Polar Code Design Using the Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2019-01-28T22:10:40Z","abstract_excerpt":"We propose a new framework for constructing polar codes (i.e., selecting the frozen bit positions) for arbitrary channels, and tailored to a given decoding algorithm, rather than based on the (not necessarily optimal) assumption of successive cancellation (SC) decoding. The proposed framework is based on the Genetic Algorithm (GenAlg), where populations (i.e., collections) of information sets evolve successively via evolutionary transformations based on their individual error-rate performance. These populations converge towards an information set that fits both the decoding behavior and the de"},"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":"1901.10464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T22:10:40Z","cross_cats_sorted":["cs.AI","math.IT"],"title_canon_sha256":"52ce75916ef449c56d522b033529d2dd0767910489486c42bef160f45d0f3811","abstract_canon_sha256":"63fbd0f2212a1cfb4ba5184c9679a9eb4d12ae9dc6af61e226ad3a21ce6a4c7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:06.846234Z","signature_b64":"JsUxUD/luOCCEFULlt0hllcSj0fTYF6WmJYDcfiXoe1LW8FN29y2hzQIuJAxIp87Ew9Rdet1N+KijXsfITlmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2313904fbe2cd41b86f0a260697771c516ccf7cf0e4f46b5a79eb064043dde2","last_reissued_at":"2026-05-17T23:55:06.845773Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:06.845773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoder-tailored Polar Code Design Using the Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2019-01-28T22:10:40Z","abstract_excerpt":"We propose a new framework for constructing polar codes (i.e., selecting the frozen bit positions) for arbitrary channels, and tailored to a given decoding algorithm, rather than based on the (not necessarily optimal) assumption of successive cancellation (SC) decoding. The proposed framework is based on the Genetic Algorithm (GenAlg), where populations (i.e., collections) of information sets evolve successively via evolutionary transformations based on their individual error-rate performance. These populations converge towards an information set that fits both the decoding behavior and the de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10464","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":"1901.10464","created_at":"2026-05-17T23:55:06.845840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10464v1","created_at":"2026-05-17T23:55:06.845840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10464","created_at":"2026-05-17T23:55:06.845840+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IYTSBH34LGU","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IYTSBH34LGUDODP","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IYTSBH3","created_at":"2026-05-18T12:33:07.085635+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/2IYTSBH34LGUDODPBITANF3XDR","json":"https://pith.science/pith/2IYTSBH34LGUDODPBITANF3XDR.json","graph_json":"https://pith.science/api/pith-number/2IYTSBH34LGUDODPBITANF3XDR/graph.json","events_json":"https://pith.science/api/pith-number/2IYTSBH34LGUDODPBITANF3XDR/events.json","paper":"https://pith.science/paper/2IYTSBH3"},"agent_actions":{"view_html":"https://pith.science/pith/2IYTSBH34LGUDODPBITANF3XDR","download_json":"https://pith.science/pith/2IYTSBH34LGUDODPBITANF3XDR.json","view_paper":"https://pith.science/paper/2IYTSBH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10464&json=true","fetch_graph":"https://pith.science/api/pith-number/2IYTSBH34LGUDODPBITANF3XDR/graph.json","fetch_events":"https://pith.science/api/pith-number/2IYTSBH34LGUDODPBITANF3XDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IYTSBH34LGUDODPBITANF3XDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IYTSBH34LGUDODPBITANF3XDR/action/storage_attestation","attest_author":"https://pith.science/pith/2IYTSBH34LGUDODPBITANF3XDR/action/author_attestation","sign_citation":"https://pith.science/pith/2IYTSBH34LGUDODPBITANF3XDR/action/citation_signature","submit_replication":"https://pith.science/pith/2IYTSBH34LGUDODPBITANF3XDR/action/replication_record"}},"created_at":"2026-05-17T23:55:06.845840+00:00","updated_at":"2026-05-17T23:55:06.845840+00:00"}