{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WDAQQCSZ2QPYFEXP4T3RT2HDL4","short_pith_number":"pith:WDAQQCSZ","canonical_record":{"source":{"id":"1711.05356","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-14T23:36:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0fbfe3fd2eb6961df62682c6df08e04cf33fc52ffb2bb7e1c072fff22586ee3","abstract_canon_sha256":"f02d54d067a7378ef10f12682310ba7db7e36b7f7207ce54f5690cdeaf92468c"},"schema_version":"1.0"},"canonical_sha256":"b0c1080a59d41f8292efe4f719e8e35f1814573921fb129c89310cbe85d47a4f","source":{"kind":"arxiv","id":"1711.05356","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05356","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05356v4","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05356","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"WDAQQCSZ2QPY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WDAQQCSZ2QPYFEXP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WDAQQCSZ","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WDAQQCSZ2QPYFEXP4T3RT2HDL4","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05356","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-14T23:36:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0fbfe3fd2eb6961df62682c6df08e04cf33fc52ffb2bb7e1c072fff22586ee3","abstract_canon_sha256":"f02d54d067a7378ef10f12682310ba7db7e36b7f7207ce54f5690cdeaf92468c"},"schema_version":"1.0"},"canonical_sha256":"b0c1080a59d41f8292efe4f719e8e35f1814573921fb129c89310cbe85d47a4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:57.764988Z","signature_b64":"u64nB+frPOe+ACN0mTMwR4vaIYBhGdDPQhCQD8GCsXYlx1k6E5a9NWAu/xzGiV4apfMpyeqM2WMA9UfpOqurBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0c1080a59d41f8292efe4f719e8e35f1814573921fb129c89310cbe85d47a4f","last_reissued_at":"2026-05-18T00:11:57.764392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:57.764392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05356","source_version":4,"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-18T00:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cVZBVUKSCLuHV6KxWBjjg6fFKL4LIf+QCILJN1IEj9/43AlKJ9L5W/KFCqd2IBkrkXKt+0NHLftgx/uis8NBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:08:47.075235Z"},"content_sha256":"77c87c150bc5ea402d179ffaa838426e3c9ac336d8ccdf52514a765182d594e1","schema_version":"1.0","event_id":"sha256:77c87c150bc5ea402d179ffaa838426e3c9ac336d8ccdf52514a765182d594e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WDAQQCSZ2QPYFEXP4T3RT2HDL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Construction of Rate-Compatible Punctured Polar (RCPP) Codes Using Hierarchical Puncturing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Min-Oh Jeong, Song-Nam Hong","submitted_at":"2017-11-14T23:36:41Z","abstract_excerpt":"In this paper, we present an efficient method to construct a good rate-compatible punctured polar (RCPP) code. One of the major challenges on the construction of a RCPP code is to design a common information set which is good for all the codes in the family. In the proposed construction, a common information set is simply optimized for the highest-rate punctured polar code in the family and then, this set is updated for each other code by satisfying the condition that information bits are unchanged during retransmissions. This is enabled by presenting a novel hierarchical puncturing and inform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05356","kind":"arxiv","version":4},"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-18T00:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8q5wHTb4rV8netS6Y7lidBQhK4JspoZLTDuKfW3Ifm/StzOWIZOd0w23Qwf3zjPukk4SUEtXmqpQ4HjwjDy4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:08:47.075861Z"},"content_sha256":"44f742b9285e425fde37b91d2c8e64b7166e69c8a936fae78006a423b2f759f1","schema_version":"1.0","event_id":"sha256:44f742b9285e425fde37b91d2c8e64b7166e69c8a936fae78006a423b2f759f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDAQQCSZ2QPYFEXP4T3RT2HDL4/bundle.json","state_url":"https://pith.science/pith/WDAQQCSZ2QPYFEXP4T3RT2HDL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDAQQCSZ2QPYFEXP4T3RT2HDL4/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-05-21T22:08:47Z","links":{"resolver":"https://pith.science/pith/WDAQQCSZ2QPYFEXP4T3RT2HDL4","bundle":"https://pith.science/pith/WDAQQCSZ2QPYFEXP4T3RT2HDL4/bundle.json","state":"https://pith.science/pith/WDAQQCSZ2QPYFEXP4T3RT2HDL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDAQQCSZ2QPYFEXP4T3RT2HDL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WDAQQCSZ2QPYFEXP4T3RT2HDL4","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":"f02d54d067a7378ef10f12682310ba7db7e36b7f7207ce54f5690cdeaf92468c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-14T23:36:41Z","title_canon_sha256":"a0fbfe3fd2eb6961df62682c6df08e04cf33fc52ffb2bb7e1c072fff22586ee3"},"schema_version":"1.0","source":{"id":"1711.05356","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05356","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05356v4","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05356","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"WDAQQCSZ2QPY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WDAQQCSZ2QPYFEXP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WDAQQCSZ","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:44f742b9285e425fde37b91d2c8e64b7166e69c8a936fae78006a423b2f759f1","target":"graph","created_at":"2026-05-18T00:11:57Z","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 present an efficient method to construct a good rate-compatible punctured polar (RCPP) code. One of the major challenges on the construction of a RCPP code is to design a common information set which is good for all the codes in the family. In the proposed construction, a common information set is simply optimized for the highest-rate punctured polar code in the family and then, this set is updated for each other code by satisfying the condition that information bits are unchanged during retransmissions. This is enabled by presenting a novel hierarchical puncturing and inform","authors_text":"Min-Oh Jeong, Song-Nam Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-14T23:36:41Z","title":"An Efficient Construction of Rate-Compatible Punctured Polar (RCPP) Codes Using Hierarchical Puncturing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05356","kind":"arxiv","version":4},"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:77c87c150bc5ea402d179ffaa838426e3c9ac336d8ccdf52514a765182d594e1","target":"record","created_at":"2026-05-18T00:11:57Z","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":"f02d54d067a7378ef10f12682310ba7db7e36b7f7207ce54f5690cdeaf92468c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-14T23:36:41Z","title_canon_sha256":"a0fbfe3fd2eb6961df62682c6df08e04cf33fc52ffb2bb7e1c072fff22586ee3"},"schema_version":"1.0","source":{"id":"1711.05356","kind":"arxiv","version":4}},"canonical_sha256":"b0c1080a59d41f8292efe4f719e8e35f1814573921fb129c89310cbe85d47a4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0c1080a59d41f8292efe4f719e8e35f1814573921fb129c89310cbe85d47a4f","first_computed_at":"2026-05-18T00:11:57.764392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:57.764392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u64nB+frPOe+ACN0mTMwR4vaIYBhGdDPQhCQD8GCsXYlx1k6E5a9NWAu/xzGiV4apfMpyeqM2WMA9UfpOqurBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:57.764988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05356","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77c87c150bc5ea402d179ffaa838426e3c9ac336d8ccdf52514a765182d594e1","sha256:44f742b9285e425fde37b91d2c8e64b7166e69c8a936fae78006a423b2f759f1"],"state_sha256":"fc67a3d6419860b5c649cf8d59413ffc14655e5a4c3ba4b58a168dc43cb35963"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gK+wpIPElBdYupiPWkJ4sa8ZqNLFDZzA7Ds9JUoiKgCYYCx1VNuzBqNSHNtS42MtiMcxYf1/5qXR6dlIVc5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T22:08:47.079938Z","bundle_sha256":"23716c67c2d9c94729a3eca420da36ce0440500fc69dcaa22b3651501d215a17"}}