{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZFQFFFG4SKV7N22NZKUJEONZZO","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":"a9667f936a2e73fc1689c2bbe9f98a235f5e443971f187670e923decf1060d3b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T02:37:13Z","title_canon_sha256":"c9ef2c4acdd90655c1905790c63cc43294009a318df748fa4114dad74c27b121"},"schema_version":"1.0","source":{"id":"1801.03616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03616","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03616v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03616","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZFQFFFG4SKV7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZFQFFFG4SKV7N22N","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZFQFFFG4","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:48963f53bb49549d2f9289669b62915292b866c3178c8815262a703e4b34c3ef","target":"graph","created_at":"2026-05-18T00:26:13Z","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":"In this paper, we propose a comprehensive Polar coding solution that integrates reliability calculation, rate matching and parity-check coding. Judging a channel coding design from the industry's viewpoint, there are two primary concerns: (i) low-complexity implementation in application-specific integrated circuit (ASIC), and (ii) superior \\& stable performance under a wide range of code lengths and rates. The former provides cost- \\& power-efficiency which are vital to any commercial system; the latter ensures flexible and robust services. Our design respects both criteria. It demonstrates be","authors_text":"Gongzheng Zhang, Hejia Luo, Huazi Zhang, Jian Wang, Jun Wang, Rong Li, Shengchen Dai, Ying Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T02:37:13Z","title":"Parity-Check Polar Coding for 5G and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03616","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:4989b302f6ae37282092d8c30b818ae96625f1e2fbd41c02dc667ccf1a19cad2","target":"record","created_at":"2026-05-18T00:26:13Z","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":"a9667f936a2e73fc1689c2bbe9f98a235f5e443971f187670e923decf1060d3b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-11T02:37:13Z","title_canon_sha256":"c9ef2c4acdd90655c1905790c63cc43294009a318df748fa4114dad74c27b121"},"schema_version":"1.0","source":{"id":"1801.03616","kind":"arxiv","version":1}},"canonical_sha256":"c9605294dc92abf6eb4dcaa89239b9cbbb2246baef19af5b4a60dd099b838697","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9605294dc92abf6eb4dcaa89239b9cbbb2246baef19af5b4a60dd099b838697","first_computed_at":"2026-05-18T00:26:13.791395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:13.791395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eUsV0m5LoN5tRIZLx+xb2arj4vwOdr5BxbdgykeJDCFp3aVqwDKQqs8lkAe7ExdDAEJbQP/s+uxzOg1xx7mGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:13.791830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4989b302f6ae37282092d8c30b818ae96625f1e2fbd41c02dc667ccf1a19cad2","sha256:48963f53bb49549d2f9289669b62915292b866c3178c8815262a703e4b34c3ef"],"state_sha256":"2e58985977b0ca339a2cda739aa847b6ae2f9702b4c5130e68ef5a378aec455c"}