{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DCXLDVEENNBADN2J3R7O4HMSPK","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":"9ced0946c22a81f36c45e8163ed223bb38da67aed888affbdf58d252c66838e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-14T04:18:26Z","title_canon_sha256":"f30dbadbe1d909554f7a5414ebbe64ae5e74bf9d2b8abb243d75414669a078f8"},"schema_version":"1.0","source":{"id":"1701.03880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03880","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03880v1","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03880","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"DCXLDVEENNBA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DCXLDVEENNBADN2J","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DCXLDVEE","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:f6f8331d8bac8f349908c78689497bcf18c146dbabd03b951160486edd3b4911","target":"graph","created_at":"2026-05-18T00:52:48Z","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 represent Raptor codes as multi-edge type low-density parity-check (MET-LDPC) codes, which gives a general framework to design them for higher-order modulation using MET density evolution. We then propose an efficient Raptor code design method for higher-order modulation, where we design distinct degree distributions for distinct bit levels. We consider a joint decoding scheme based on belief propagation for Raptor codes and also derive an exact expression for the stability condition. In several examples, we demonstrate that the higher-order modulated Raptor codes designed us","authors_text":"Lawrence Ong, Mahyar Shirvanimoghaddam, Sachini Jayasooriya, Sarah J. Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-14T04:18:26Z","title":"Raptor Codes for Higher-Order Modulation Using a Multi-Edge Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03880","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:24eb6120fc55b5b8596a17af81587d84ee0236ba0c503b0ebb0e9151b1412468","target":"record","created_at":"2026-05-18T00:52:48Z","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":"9ced0946c22a81f36c45e8163ed223bb38da67aed888affbdf58d252c66838e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-14T04:18:26Z","title_canon_sha256":"f30dbadbe1d909554f7a5414ebbe64ae5e74bf9d2b8abb243d75414669a078f8"},"schema_version":"1.0","source":{"id":"1701.03880","kind":"arxiv","version":1}},"canonical_sha256":"18aeb1d4846b4201b749dc7eee1d927ab47b921272568db3edc3e8aaad2c4bf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18aeb1d4846b4201b749dc7eee1d927ab47b921272568db3edc3e8aaad2c4bf5","first_computed_at":"2026-05-18T00:52:48.652214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:48.652214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yYDZaqSJUtY+U4sDnl/AYmuVlLHYPJ8Sz2xdUmoIlMVU4YuaH9zPPesZaH8F2vDDm5TN3a/kCjBxXw/LRUDaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:48.652910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24eb6120fc55b5b8596a17af81587d84ee0236ba0c503b0ebb0e9151b1412468","sha256:f6f8331d8bac8f349908c78689497bcf18c146dbabd03b951160486edd3b4911"],"state_sha256":"91aabb9289f651365e75472c9848ff73f4a4e5e4e1fbad46766c04c4ef1cbfc5"}