{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IWDWIW7B7HPCZ6VHFGDSHML7RC","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":"8fd57a6c1c800cd9792e74b079597258f8167cc5bb68a0b35a5a0357c08c768b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T19:49:39Z","title_canon_sha256":"91ba92e4060438cd96a4b6cc0277d5d03bf3c63b8232a5951d68145c18411d35"},"schema_version":"1.0","source":{"id":"1801.04299","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04299","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04299v3","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04299","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"IWDWIW7B7HPC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IWDWIW7B7HPCZ6VH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IWDWIW7B","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:57f8e14e48f90f96054aed7f2bc0ed4e52be2c33533b7bedb6d254192914933f","target":"graph","created_at":"2026-05-18T00:19:08Z","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 show that the performance of iterative belief propagation (BP) decoding of polar codes can be enhanced by decoding over different carefully chosen factor graph realizations. With a genie-aided stopping condition, it can achieve the successive cancellation list (SCL) decoding performance which has already been shown to achieve the maximum likelihood (ML) bound provided that the list size is sufficiently large. The proposed decoder is based on different realizations of the polar code factor graph with randomly permuted stages during decoding. Additionally, a different way of visualizing the p","authors_text":"Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T19:49:39Z","title":"Belief Propagation Decoding of Polar Codes on Permuted Factor Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04299","kind":"arxiv","version":3},"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:bb700ec48760d2ba35a8de681cf7db3297a7e903402c1f8a2e52315faa911e0e","target":"record","created_at":"2026-05-18T00:19:08Z","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":"8fd57a6c1c800cd9792e74b079597258f8167cc5bb68a0b35a5a0357c08c768b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T19:49:39Z","title_canon_sha256":"91ba92e4060438cd96a4b6cc0277d5d03bf3c63b8232a5951d68145c18411d35"},"schema_version":"1.0","source":{"id":"1801.04299","kind":"arxiv","version":3}},"canonical_sha256":"4587645be1f9de2cfaa7298723b17f88a649cedf479f188ed1c50363ea2637ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4587645be1f9de2cfaa7298723b17f88a649cedf479f188ed1c50363ea2637ac","first_computed_at":"2026-05-18T00:19:08.402166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:08.402166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GGAB53ZMd1yKoVyvWzbUn2PiwMf4qzHZYah6Q+f3UVnDFjHKcgbh7QNnCuHgM43hiuADgEmXxIDhD+woNu/QDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:08.402858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04299","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb700ec48760d2ba35a8de681cf7db3297a7e903402c1f8a2e52315faa911e0e","sha256:57f8e14e48f90f96054aed7f2bc0ed4e52be2c33533b7bedb6d254192914933f"],"state_sha256":"e6f4939566953ecf18a857d879eec7db86afb67a28aa2d622fe4deb2c7bbb5f8"}