{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:L63WLOFKAWIKCZH3JP77UCEYX7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2495f0bc98624fae07428a187245b2a499c7734eda084d5f27b47dec723a08ea","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-19T00:06:35Z","title_canon_sha256":"884dd7596cde651f4c93fef356664865d72388301a7202ff824049f00eac73b2"},"schema_version":"1.0","source":{"id":"1901.06444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06444","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06444v1","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06444","created_at":"2026-05-17T23:55:50Z"},{"alias_kind":"pith_short_12","alias_value":"L63WLOFKAWIK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L63WLOFKAWIKCZH3","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L63WLOFK","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:a9603e4f1fe3fb78018862fccb939b0f7f5dd21e2d5a1d8423e477077892803d","target":"graph","created_at":"2026-05-17T23:55:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a new polar code construction framework (i.e., selecting the frozen bit positions) for the additive white Gaussian noise (AWGN) channel, 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 the decoding beh","authors_text":"Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink","cross_cats":["cs.AI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-19T00:06:35Z","title":"Genetic Algorithm-based Polar Code Construction for the AWGN Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06444","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:531fac2bd388d19bdd75e20bb3f3e18f196f383460edec59eb7f5ff79e472f44","target":"record","created_at":"2026-05-17T23:55:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2495f0bc98624fae07428a187245b2a499c7734eda084d5f27b47dec723a08ea","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-19T00:06:35Z","title_canon_sha256":"884dd7596cde651f4c93fef356664865d72388301a7202ff824049f00eac73b2"},"schema_version":"1.0","source":{"id":"1901.06444","kind":"arxiv","version":1}},"canonical_sha256":"5fb765b8aa0590a164fb4bfffa0898bfccf38727e05d864dc7a6f66d6ea88213","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fb765b8aa0590a164fb4bfffa0898bfccf38727e05d864dc7a6f66d6ea88213","first_computed_at":"2026-05-17T23:55:50.288426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:50.288426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VP+L+9gpWbj6rwL0il1trJy/qLs1z4uafYbxZ6G2OFxRvxWfJikce5hPEzh7x5uD630xn65lkTmINy9VXv3KAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:50.289117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:531fac2bd388d19bdd75e20bb3f3e18f196f383460edec59eb7f5ff79e472f44","sha256:a9603e4f1fe3fb78018862fccb939b0f7f5dd21e2d5a1d8423e477077892803d"],"state_sha256":"3ecedf1839a5389ba8f3a03e9dafcc0dada4055e65b05bbc08a31bce0157f478"}