{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O4W52MRTNX3Z3AIHE7OLPURTHR","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":"c06abbc587c2574ee0b2fe21b50d5db68e6f581c0bd2c8417c328a7cf829e747","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-05T13:48:39Z","title_canon_sha256":"e28f72a93ff607fad551469aea1e420bdc6be9d88a855fed2e0f36af8674f134"},"schema_version":"1.0","source":{"id":"1612.01352","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01352","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01352v2","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01352","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"O4W52MRTNX3Z","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O4W52MRTNX3Z3AIH","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O4W52MRT","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:68501dab82cd79eef875d2b97449340eb7f8746f2ddbd3d30b877792ff400a13","target":"graph","created_at":"2026-05-18T00:29:01Z","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 the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the corresponding code length is limited to the power of two. In this paper, we establish a systematic framework to design the rate-compatible punctured polar (RCPP) codes with arbitrary code length. A new theoretic tool, called polar spectra, is proposed to count the number of paths on the code tree with the same number of zeros or ones respectively. Furthermore, a spectrum distance SD0 (SD1) and a joint spectrum distance (JSD) are presented as p","authors_text":"Athanasios V. Vasilakos, Jiaru Lin, Jincheng Dai, Kai Chen, Kai Niu, Q. T. Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-05T13:48:39Z","title":"Rate-Compatible Punctured Polar Codes: Optimal Construction Based on Polar Spectra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01352","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:979553735767937dc3dbf1a78800e996c88cc4200e96da2c8c27de3ad9ea42e9","target":"record","created_at":"2026-05-18T00:29:01Z","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":"c06abbc587c2574ee0b2fe21b50d5db68e6f581c0bd2c8417c328a7cf829e747","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-05T13:48:39Z","title_canon_sha256":"e28f72a93ff607fad551469aea1e420bdc6be9d88a855fed2e0f36af8674f134"},"schema_version":"1.0","source":{"id":"1612.01352","kind":"arxiv","version":2}},"canonical_sha256":"772ddd32336df79d810727dcb7d2333c488badda0105a914ca63c9e62c1e61ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"772ddd32336df79d810727dcb7d2333c488badda0105a914ca63c9e62c1e61ff","first_computed_at":"2026-05-18T00:29:01.784959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:01.784959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KiuBR17Rnr04T+A8h/Cvpo2vXEiB9Xxa9HfJzLQ4J6qR9eANZt9ZafS5fG52LHBJQTzsQhMp9cDWc/yk8NaqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:01.785416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01352","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:979553735767937dc3dbf1a78800e996c88cc4200e96da2c8c27de3ad9ea42e9","sha256:68501dab82cd79eef875d2b97449340eb7f8746f2ddbd3d30b877792ff400a13"],"state_sha256":"cf99d48a674f7cc9180abc42bf5cb750a8eb3c5d6caa5b7c60f6810067d42012"}