{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GB4SF76MSOVIWHQHHSFWSBPJWY","short_pith_number":"pith:GB4SF76M","canonical_record":{"source":{"id":"1510.01776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-06T23:00:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4bb85ba5341b8851614231a19fbd3a8dc7fcfe5a70b1f0304d2f47fba22d2500","abstract_canon_sha256":"e832dea65327628ff51e9144623c136acec2dec01a0ba74257d6cafa4a06d892"},"schema_version":"1.0"},"canonical_sha256":"307922ffcc93aa8b1e073c8b6905e9b601fc01c6e1bf27289314c0e96fe92d14","source":{"kind":"arxiv","id":"1510.01776","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01776","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01776v2","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01776","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"GB4SF76MSOVI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GB4SF76MSOVIWHQH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GB4SF76M","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GB4SF76MSOVIWHQHHSFWSBPJWY","target":"record","payload":{"canonical_record":{"source":{"id":"1510.01776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-06T23:00:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4bb85ba5341b8851614231a19fbd3a8dc7fcfe5a70b1f0304d2f47fba22d2500","abstract_canon_sha256":"e832dea65327628ff51e9144623c136acec2dec01a0ba74257d6cafa4a06d892"},"schema_version":"1.0"},"canonical_sha256":"307922ffcc93aa8b1e073c8b6905e9b601fc01c6e1bf27289314c0e96fe92d14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:44.487823Z","signature_b64":"TK95efvWJ6Y0RQbMu9R/VHw4MJjjQhnbgCo9BIeocUMI2zGD/7XN2tTdY0UGW5dlMWPgV+oYUJAZDehSa8KKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307922ffcc93aa8b1e073c8b6905e9b601fc01c6e1bf27289314c0e96fe92d14","last_reissued_at":"2026-05-18T01:21:44.487145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:44.487145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.01776","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:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/nqf6jI4HE/Qa4hQ/K3cxlKiei+S0yxfIDXVA0VSWigyndeucOjHg5GO/IyRBylL9OqAH69RlwiDJIP9Km2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T06:10:19.849557Z"},"content_sha256":"fe4e6fb1f6deb15ecaa483f63906fc6ecbf8baf69038c17267a15cbbb04226d3","schema_version":"1.0","event_id":"sha256:fe4e6fb1f6deb15ecaa483f63906fc6ecbf8baf69038c17267a15cbbb04226d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GB4SF76MSOVIWHQHHSFWSBPJWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity-Achieving Rate-Compatible Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dennis Hui, Ivana Mari\\'c, Song-Nam Hong","submitted_at":"2015-10-06T23:00:02Z","abstract_excerpt":"We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt to channel conditions. The main idea of the construction exploits the common characteristics of polar codes optimized for a sequence of successively degraded channels. The proposed approach allows for an optimized polar code to be used at every transmission thereby achieving capacity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01776","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:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHddJKO02p4JpV05gmTT4NK5j6Dux85efiDH3z/flEi9F2SlSFQkPfwVrVCyXQrNGW6H4R6BcmnxTJWYNY9TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T06:10:19.850207Z"},"content_sha256":"7bc6ca50f302765521aaa0da2578af4b33c964b11d1cd1e637a98ae6ed77dc9d","schema_version":"1.0","event_id":"sha256:7bc6ca50f302765521aaa0da2578af4b33c964b11d1cd1e637a98ae6ed77dc9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB4SF76MSOVIWHQHHSFWSBPJWY/bundle.json","state_url":"https://pith.science/pith/GB4SF76MSOVIWHQHHSFWSBPJWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB4SF76MSOVIWHQHHSFWSBPJWY/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-22T06:10:19Z","links":{"resolver":"https://pith.science/pith/GB4SF76MSOVIWHQHHSFWSBPJWY","bundle":"https://pith.science/pith/GB4SF76MSOVIWHQHHSFWSBPJWY/bundle.json","state":"https://pith.science/pith/GB4SF76MSOVIWHQHHSFWSBPJWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB4SF76MSOVIWHQHHSFWSBPJWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GB4SF76MSOVIWHQHHSFWSBPJWY","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":"e832dea65327628ff51e9144623c136acec2dec01a0ba74257d6cafa4a06d892","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-06T23:00:02Z","title_canon_sha256":"4bb85ba5341b8851614231a19fbd3a8dc7fcfe5a70b1f0304d2f47fba22d2500"},"schema_version":"1.0","source":{"id":"1510.01776","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01776","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01776v2","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01776","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"GB4SF76MSOVI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GB4SF76MSOVIWHQH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GB4SF76M","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:7bc6ca50f302765521aaa0da2578af4b33c964b11d1cd1e637a98ae6ed77dc9d","target":"graph","created_at":"2026-05-18T01:21:44Z","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":"We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt to channel conditions. The main idea of the construction exploits the common characteristics of polar codes optimized for a sequence of successively degraded channels. The proposed approach allows for an optimized polar code to be used at every transmission thereby achieving capacity.","authors_text":"Dennis Hui, Ivana Mari\\'c, Song-Nam Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-06T23:00:02Z","title":"Capacity-Achieving Rate-Compatible Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01776","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:fe4e6fb1f6deb15ecaa483f63906fc6ecbf8baf69038c17267a15cbbb04226d3","target":"record","created_at":"2026-05-18T01:21:44Z","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":"e832dea65327628ff51e9144623c136acec2dec01a0ba74257d6cafa4a06d892","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-06T23:00:02Z","title_canon_sha256":"4bb85ba5341b8851614231a19fbd3a8dc7fcfe5a70b1f0304d2f47fba22d2500"},"schema_version":"1.0","source":{"id":"1510.01776","kind":"arxiv","version":2}},"canonical_sha256":"307922ffcc93aa8b1e073c8b6905e9b601fc01c6e1bf27289314c0e96fe92d14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"307922ffcc93aa8b1e073c8b6905e9b601fc01c6e1bf27289314c0e96fe92d14","first_computed_at":"2026-05-18T01:21:44.487145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:44.487145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TK95efvWJ6Y0RQbMu9R/VHw4MJjjQhnbgCo9BIeocUMI2zGD/7XN2tTdY0UGW5dlMWPgV+oYUJAZDehSa8KKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:44.487823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.01776","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe4e6fb1f6deb15ecaa483f63906fc6ecbf8baf69038c17267a15cbbb04226d3","sha256:7bc6ca50f302765521aaa0da2578af4b33c964b11d1cd1e637a98ae6ed77dc9d"],"state_sha256":"bf7d8197d8c37fcd922605bb98d5da34a1a4425580cf671a4ef985040538f49a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80CC2BeHLdi7EJcmLQpL7LCNKSAyIUf1vTESLAify9ZDBR6Q3eNyLuCMb7R8BK3ZHvFxNoNiLD3y+YI1B3K4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T06:10:19.853719Z","bundle_sha256":"b409777351d8ecff731a5a6e084787f5d8dcb21e4740828f566ae92f9231eed1"}}