{"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"}