{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J43XKFKUSQNLLSOHECMROCEXOI","short_pith_number":"pith:J43XKFKU","canonical_record":{"source":{"id":"1811.02053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T22:04:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d9042a1f8c89451c98a39613b77a4bab3d0cf3a8d1c85b9f2a28887f49050f7","abstract_canon_sha256":"485b8c376d521bd1257259ca422cf2c34a4bfa84e27874d5d217d717ec57229c"},"schema_version":"1.0"},"canonical_sha256":"4f37751554941ab5c9c72099170897723a9ab99e9cb5e54f4e48a397c07ceb2a","source":{"kind":"arxiv","id":"1811.02053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02053","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02053v1","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02053","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"J43XKFKUSQNL","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J43XKFKUSQNLLSOH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J43XKFKU","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J43XKFKUSQNLLSOHECMROCEXOI","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T22:04:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d9042a1f8c89451c98a39613b77a4bab3d0cf3a8d1c85b9f2a28887f49050f7","abstract_canon_sha256":"485b8c376d521bd1257259ca422cf2c34a4bfa84e27874d5d217d717ec57229c"},"schema_version":"1.0"},"canonical_sha256":"4f37751554941ab5c9c72099170897723a9ab99e9cb5e54f4e48a397c07ceb2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:25.133166Z","signature_b64":"+bFChaKZ9JgbuBFEB8MaB89plt/Y1a9H/oeAqub183aFCR+O9105u3h7DnnMzHGkKCwmBGUZ1XJ10rHVwHtSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f37751554941ab5c9c72099170897723a9ab99e9cb5e54f4e48a397c07ceb2a","last_reissued_at":"2026-05-18T00:01:25.132768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:25.132768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02053","source_version":1,"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:01:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qeta0rjQo3Nc7wUoSY+xhLSAdNreoA0Kpx+6XcLzZ8pfAOzEA1zcHrolTOj5fpe+7+Aqh45L74kVIIoMBuV/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:00:59.826695Z"},"content_sha256":"99d17dcfac284c43c19c42015233cc2c92d312e38fc8490d610b6b01a926bdc6","schema_version":"1.0","event_id":"sha256:99d17dcfac284c43c19c42015233cc2c92d312e38fc8490d610b6b01a926bdc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J43XKFKUSQNLLSOHECMROCEXOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-based Design for Polar Coded-Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Halim Yanikomeroglu, Hossein Khoshnevis, Ian Marsland","submitted_at":"2018-11-05T22:04:28Z","abstract_excerpt":"Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applications that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive modulation and coding, the throughput is a more important performance metric than the error rate. Polar codes, a new class of FEC codes with simple rate matching, can be optimized efficiently for maximization of the throughput. In this paper, we aim to design HARQ schemes using multilevel polar coded-modulation (MLPCM). Thus, we first develop a method to determine a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02053","kind":"arxiv","version":1},"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:01:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EuAvIysVL6thuPGL4zJeIlgbvx8CpwzLxbRoIkC9IOtqWjwi6U2kI02pC+456Y/EyyOoPUsJePdWzGeLy3tcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:00:59.827484Z"},"content_sha256":"f9b2b3cefac682798c892cc41242d5bf90ff34b2fe654e13257970796a5ddb11","schema_version":"1.0","event_id":"sha256:f9b2b3cefac682798c892cc41242d5bf90ff34b2fe654e13257970796a5ddb11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J43XKFKUSQNLLSOHECMROCEXOI/bundle.json","state_url":"https://pith.science/pith/J43XKFKUSQNLLSOHECMROCEXOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J43XKFKUSQNLLSOHECMROCEXOI/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-31T11:00:59Z","links":{"resolver":"https://pith.science/pith/J43XKFKUSQNLLSOHECMROCEXOI","bundle":"https://pith.science/pith/J43XKFKUSQNLLSOHECMROCEXOI/bundle.json","state":"https://pith.science/pith/J43XKFKUSQNLLSOHECMROCEXOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J43XKFKUSQNLLSOHECMROCEXOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J43XKFKUSQNLLSOHECMROCEXOI","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":"485b8c376d521bd1257259ca422cf2c34a4bfa84e27874d5d217d717ec57229c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T22:04:28Z","title_canon_sha256":"1d9042a1f8c89451c98a39613b77a4bab3d0cf3a8d1c85b9f2a28887f49050f7"},"schema_version":"1.0","source":{"id":"1811.02053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02053","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02053v1","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02053","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"J43XKFKUSQNL","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J43XKFKUSQNLLSOH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J43XKFKU","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:f9b2b3cefac682798c892cc41242d5bf90ff34b2fe654e13257970796a5ddb11","target":"graph","created_at":"2026-05-18T00:01:25Z","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":"Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applications that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive modulation and coding, the throughput is a more important performance metric than the error rate. Polar codes, a new class of FEC codes with simple rate matching, can be optimized efficiently for maximization of the throughput. In this paper, we aim to design HARQ schemes using multilevel polar coded-modulation (MLPCM). Thus, we first develop a method to determine a","authors_text":"Halim Yanikomeroglu, Hossein Khoshnevis, Ian Marsland","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T22:04:28Z","title":"Throughput-based Design for Polar Coded-Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02053","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:99d17dcfac284c43c19c42015233cc2c92d312e38fc8490d610b6b01a926bdc6","target":"record","created_at":"2026-05-18T00:01:25Z","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":"485b8c376d521bd1257259ca422cf2c34a4bfa84e27874d5d217d717ec57229c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-05T22:04:28Z","title_canon_sha256":"1d9042a1f8c89451c98a39613b77a4bab3d0cf3a8d1c85b9f2a28887f49050f7"},"schema_version":"1.0","source":{"id":"1811.02053","kind":"arxiv","version":1}},"canonical_sha256":"4f37751554941ab5c9c72099170897723a9ab99e9cb5e54f4e48a397c07ceb2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f37751554941ab5c9c72099170897723a9ab99e9cb5e54f4e48a397c07ceb2a","first_computed_at":"2026-05-18T00:01:25.132768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:25.132768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+bFChaKZ9JgbuBFEB8MaB89plt/Y1a9H/oeAqub183aFCR+O9105u3h7DnnMzHGkKCwmBGUZ1XJ10rHVwHtSAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:25.133166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99d17dcfac284c43c19c42015233cc2c92d312e38fc8490d610b6b01a926bdc6","sha256:f9b2b3cefac682798c892cc41242d5bf90ff34b2fe654e13257970796a5ddb11"],"state_sha256":"de8320fe6892273396d00ff27f9be48ce71ae03cbb1a018f91be8104f8717c72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OQaR3iOu5Gr+UqnJ693FdrQodBQ8JB1/W2sw3u5x5iAOSoldyFDjuAYpit3EHzd1jRLSsGOIiJuRecdeVJVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:00:59.831681Z","bundle_sha256":"bbc40f343e8494175496b12a20d1fdd5509186b4aba0777729491eb739af2ed5"}}