{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5YJMQNTXS6S7YG3JUHIHG2Q6YF","short_pith_number":"pith:5YJMQNTX","canonical_record":{"source":{"id":"1603.05273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-16T20:49:30Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"132c0a9b62cf47b15369342e4d5c5eb0a6e395ed9a9f535e46b8a9e20ba26328","abstract_canon_sha256":"ba7ea77abf3fe2f6c189fa4921d2a62661a8c1157cac78ebe9f93f0b139b8e2c"},"schema_version":"1.0"},"canonical_sha256":"ee12c8367797a5fc1b69a1d0736a1ec1705f7f3d1f1dff26407b78d951349782","source":{"kind":"arxiv","id":"1603.05273","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05273","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05273v2","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05273","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"5YJMQNTXS6S7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5YJMQNTXS6S7YG3J","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5YJMQNTX","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5YJMQNTXS6S7YG3JUHIHG2Q6YF","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-16T20:49:30Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"132c0a9b62cf47b15369342e4d5c5eb0a6e395ed9a9f535e46b8a9e20ba26328","abstract_canon_sha256":"ba7ea77abf3fe2f6c189fa4921d2a62661a8c1157cac78ebe9f93f0b139b8e2c"},"schema_version":"1.0"},"canonical_sha256":"ee12c8367797a5fc1b69a1d0736a1ec1705f7f3d1f1dff26407b78d951349782","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:53.821770Z","signature_b64":"h07RM7MtqYB1oSO/EGb8lXbgodPGwSujvAGpJcnnpVdSbLx8GgOS/mUrLrWevUyD7vTj/XAZnlskNw8sb94KCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee12c8367797a5fc1b69a1d0736a1ec1705f7f3d1f1dff26407b78d951349782","last_reissued_at":"2026-05-18T01:07:53.821227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:53.821227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05273","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUVuSpXY6g/8+13dxZ1NVueX+c6seQOF5+8N1ehvrF8CccjTYjARthDp10FMh/XUIhQfWFBpYywQ9n7E6LAaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:27:32.581149Z"},"content_sha256":"c6db6f6d8f55d03a578aaacf36aa3b7b0d7caa40e23cec59307bcb0c0d5473b0","schema_version":"1.0","event_id":"sha256:c6db6f6d8f55d03a578aaacf36aa3b7b0d7caa40e23cec59307bcb0c0d5473b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5YJMQNTXS6S7YG3JUHIHG2Q6YF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Low-Complexity Decoders for Low-Rate Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Claude Thibeault, Gabi Sarkis, Pascal Giard, Warren J. Gross","submitted_at":"2016-03-16T20:49:30Z","abstract_excerpt":"Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better accommodate low-rate codes. More constituent codes are recognized in the updated algorithm and dedicated hardware is added to efficiently decode these new constituent codes. We also alter the polar code construction to further decrease the latency and increase the throughput with little to no noticeable effect on error-correction performance. Rate-fle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05273","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zv+ym4lw4iQ8TfZTxyaFLYsY/x1zbKyInwKtloPA8SvyaXDZO8CLnXsZADPII3M13WdORSYR0zarasHKIgO6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:27:32.581545Z"},"content_sha256":"9ed5e4867a574e0e641526fea2bd31375c0515b81e0739b833c27dc7cbe7ec61","schema_version":"1.0","event_id":"sha256:9ed5e4867a574e0e641526fea2bd31375c0515b81e0739b833c27dc7cbe7ec61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YJMQNTXS6S7YG3JUHIHG2Q6YF/bundle.json","state_url":"https://pith.science/pith/5YJMQNTXS6S7YG3JUHIHG2Q6YF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YJMQNTXS6S7YG3JUHIHG2Q6YF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T12:27:32Z","links":{"resolver":"https://pith.science/pith/5YJMQNTXS6S7YG3JUHIHG2Q6YF","bundle":"https://pith.science/pith/5YJMQNTXS6S7YG3JUHIHG2Q6YF/bundle.json","state":"https://pith.science/pith/5YJMQNTXS6S7YG3JUHIHG2Q6YF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YJMQNTXS6S7YG3JUHIHG2Q6YF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5YJMQNTXS6S7YG3JUHIHG2Q6YF","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":"ba7ea77abf3fe2f6c189fa4921d2a62661a8c1157cac78ebe9f93f0b139b8e2c","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-16T20:49:30Z","title_canon_sha256":"132c0a9b62cf47b15369342e4d5c5eb0a6e395ed9a9f535e46b8a9e20ba26328"},"schema_version":"1.0","source":{"id":"1603.05273","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05273","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05273v2","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05273","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"5YJMQNTXS6S7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5YJMQNTXS6S7YG3J","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5YJMQNTX","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:9ed5e4867a574e0e641526fea2bd31375c0515b81e0739b833c27dc7cbe7ec61","target":"graph","created_at":"2026-05-18T01:07:53Z","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":"Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better accommodate low-rate codes. More constituent codes are recognized in the updated algorithm and dedicated hardware is added to efficiently decode these new constituent codes. We also alter the polar code construction to further decrease the latency and increase the throughput with little to no noticeable effect on error-correction performance. Rate-fle","authors_text":"Alexios Balatsoukas-Stimming, Claude Thibeault, Gabi Sarkis, Pascal Giard, Warren J. Gross","cross_cats":["cs.AR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-16T20:49:30Z","title":"Fast Low-Complexity Decoders for Low-Rate Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05273","kind":"arxiv","version":2},"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:c6db6f6d8f55d03a578aaacf36aa3b7b0d7caa40e23cec59307bcb0c0d5473b0","target":"record","created_at":"2026-05-18T01:07:53Z","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":"ba7ea77abf3fe2f6c189fa4921d2a62661a8c1157cac78ebe9f93f0b139b8e2c","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-16T20:49:30Z","title_canon_sha256":"132c0a9b62cf47b15369342e4d5c5eb0a6e395ed9a9f535e46b8a9e20ba26328"},"schema_version":"1.0","source":{"id":"1603.05273","kind":"arxiv","version":2}},"canonical_sha256":"ee12c8367797a5fc1b69a1d0736a1ec1705f7f3d1f1dff26407b78d951349782","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee12c8367797a5fc1b69a1d0736a1ec1705f7f3d1f1dff26407b78d951349782","first_computed_at":"2026-05-18T01:07:53.821227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:53.821227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h07RM7MtqYB1oSO/EGb8lXbgodPGwSujvAGpJcnnpVdSbLx8GgOS/mUrLrWevUyD7vTj/XAZnlskNw8sb94KCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:53.821770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05273","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6db6f6d8f55d03a578aaacf36aa3b7b0d7caa40e23cec59307bcb0c0d5473b0","sha256:9ed5e4867a574e0e641526fea2bd31375c0515b81e0739b833c27dc7cbe7ec61"],"state_sha256":"c323fc368692bb9e4462cb371df6aea9970a9859915c217115ec445993c106bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mzmePsYaU1Mnt3saRK2orj4d84nCPyimQyWd35hxP2jgh38t283a1EiKQUH6DwY7DeiEzSG9yAK6tMZaRt5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:27:32.583481Z","bundle_sha256":"47bcccaf8c0d5f75165521dd251e566ac89103eca1513d9250f55b82835db551"}}