{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FHJYG7MP6A2MSZKNTKZESXUNR3","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":"05ebea4f660b0d35fddbf33a87a6aaa708fb1a000296efa3eff2863c6b963a3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-08T06:52:03Z","title_canon_sha256":"e288e6d7fad7279117410fb1d1905dba081fe2ab741a24d0a3de46d68a4b3617"},"schema_version":"1.0","source":{"id":"1612.02545","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02545","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02545v3","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02545","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"pith_short_12","alias_value":"FHJYG7MP6A2M","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FHJYG7MP6A2MSZKN","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FHJYG7MP","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:50d1b1a191b081dc97c9f4436dd253492a6dc4b1a16d97d26c8b1145f1794b19","target":"graph","created_at":"2026-05-18T00:34:39Z","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":"This paper proposes a polar code construction scheme that reduces constituent-code supplemented decoding latency. Constituent codes are the sub-codewords with specific patterns. They are used to accelerate the successive cancellation decoding process of polar code without any performance degradation. We modify the traditional construction approach to yield increased number of desirable constituent codes that speeds the decoding process. For (n,k) polar code, instead of directly setting the k best and (n-k) worst bits to the information bits and frozen bits, respectively, we swap the locations ","authors_text":"Gwan Choi, Tiben Che","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-08T06:52:03Z","title":"A Constituent Codes Oriented Code Construction Scheme for Polar Code-Aim to Reduce the Decoding Latency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02545","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:5b1587d52d2e9e24fcbbf815e6045af5c273286ba84c55b2d614b65f7c29ff71","target":"record","created_at":"2026-05-18T00:34:39Z","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":"05ebea4f660b0d35fddbf33a87a6aaa708fb1a000296efa3eff2863c6b963a3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-08T06:52:03Z","title_canon_sha256":"e288e6d7fad7279117410fb1d1905dba081fe2ab741a24d0a3de46d68a4b3617"},"schema_version":"1.0","source":{"id":"1612.02545","kind":"arxiv","version":3}},"canonical_sha256":"29d3837d8ff034c9654d9ab2495e8d8ec7c2216bfa7944006b1bf235612ac71f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29d3837d8ff034c9654d9ab2495e8d8ec7c2216bfa7944006b1bf235612ac71f","first_computed_at":"2026-05-18T00:34:39.127961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:39.127961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HMQyhe6jhDk57nF54NLVlLiqg3e2tD/kANSNoO4uObb834w5bydhjLQgWAGWHJcXwITd0STNxsQoLgMzon/9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:39.128632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02545","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b1587d52d2e9e24fcbbf815e6045af5c273286ba84c55b2d614b65f7c29ff71","sha256:50d1b1a191b081dc97c9f4436dd253492a6dc4b1a16d97d26c8b1145f1794b19"],"state_sha256":"3d7cb90cde2dceb330adf40c309b4a642fc626798769cf7a070eacbc7811b0e4"}