{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WKORVCNKUVT4UPSCKROHTJWJC7","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":"62e4d1f94a4902b60433eef05818eedb5bc0f9e8470fda4fe9152d821d54e936","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-19T17:36:18Z","title_canon_sha256":"5aa29f831ab361fbf4c06165a044229dda35c356d74f7e9054a58417bb43dada"},"schema_version":"1.0","source":{"id":"1812.08106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08106","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08106v1","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08106","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"WKORVCNKUVT4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WKORVCNKUVT4UPSC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WKORVCNK","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:b5e2623bdb2df9a5a944dc77450704e9b95980efd808b9b557f7811a174ae38c","target":"graph","created_at":"2026-05-17T23:57:54Z","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":"A pruned variant of polar coding is reinvented for all binary erasure channels. For small $\\varepsilon>0$, we construct codes with block length $\\varepsilon^{-5}$, code rate $\\text{Capacity}-\\varepsilon$, error probability $\\varepsilon$, and encoding and decoding time complexity $O(N\\log|\\log\\varepsilon|)$ per block, equivalently $O(\\log|\\log\\varepsilon|)$ per information bit (Propositions 5 to 8).\n  This result also follows if one applies systematic polar coding [Ar{\\i}kan 10.1109/LCOMM.2011.061611.110862] with simplified successive cancelation decoding [Alamdar-Yazdi-Kschischang 10.1109/LCOM","authors_text":"Hsin-Po Wang, Iwan Duursma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-19T17:36:18Z","title":"Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08106","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:d0b23da418df160c9d09ef0be75d8d89d0d2f7ae617809ad9600ee4a677c4573","target":"record","created_at":"2026-05-17T23:57:54Z","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":"62e4d1f94a4902b60433eef05818eedb5bc0f9e8470fda4fe9152d821d54e936","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-19T17:36:18Z","title_canon_sha256":"5aa29f831ab361fbf4c06165a044229dda35c356d74f7e9054a58417bb43dada"},"schema_version":"1.0","source":{"id":"1812.08106","kind":"arxiv","version":1}},"canonical_sha256":"b29d1a89aaa567ca3e42545c79a6c917fc8d628ecadc2e7a92ed652007f437a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b29d1a89aaa567ca3e42545c79a6c917fc8d628ecadc2e7a92ed652007f437a8","first_computed_at":"2026-05-17T23:57:54.852366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:54.852366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i3W19XVjHYQPX8ax2R6BtKFDmSVb1dQM5aP3XEO4K8gVpo57sQCW4kTWstHyxNEDYnm8QZHLmYgadZgLZDp6Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:54.852946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0b23da418df160c9d09ef0be75d8d89d0d2f7ae617809ad9600ee4a677c4573","sha256:b5e2623bdb2df9a5a944dc77450704e9b95980efd808b9b557f7811a174ae38c"],"state_sha256":"3cd54aa56f32b6632a12603a5faba32dadf1e6dd84ef3e15eab605cd07426981"}