{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DCXLDVEENNBADN2J3R7O4HMSPK","short_pith_number":"pith:DCXLDVEE","schema_version":"1.0","canonical_sha256":"18aeb1d4846b4201b749dc7eee1d927ab47b921272568db3edc3e8aaad2c4bf5","source":{"kind":"arxiv","id":"1701.03880","version":1},"attestation_state":"computed","paper":{"title":"Raptor Codes for Higher-Order Modulation Using a Multi-Edge Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Mahyar Shirvanimoghaddam, Sachini Jayasooriya, Sarah J. Johnson","submitted_at":"2017-01-14T04:18:26Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.03880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-14T04:18:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f30dbadbe1d909554f7a5414ebbe64ae5e74bf9d2b8abb243d75414669a078f8","abstract_canon_sha256":"9ced0946c22a81f36c45e8163ed223bb38da67aed888affbdf58d252c66838e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:48.652910Z","signature_b64":"yYDZaqSJUtY+U4sDnl/AYmuVlLHYPJ8Sz2xdUmoIlMVU4YuaH9zPPesZaH8F2vDDm5TN3a/kCjBxXw/LRUDaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18aeb1d4846b4201b749dc7eee1d927ab47b921272568db3edc3e8aaad2c4bf5","last_reissued_at":"2026-05-18T00:52:48.652214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:48.652214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Raptor Codes for Higher-Order Modulation Using a Multi-Edge Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Mahyar Shirvanimoghaddam, Sachini Jayasooriya, Sarah J. Johnson","submitted_at":"2017-01-14T04:18:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03880","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.03880","created_at":"2026-05-18T00:52:48.652331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03880v1","created_at":"2026-05-18T00:52:48.652331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03880","created_at":"2026-05-18T00:52:48.652331+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCXLDVEENNBA","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCXLDVEENNBADN2J","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCXLDVEE","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK","json":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK.json","graph_json":"https://pith.science/api/pith-number/DCXLDVEENNBADN2J3R7O4HMSPK/graph.json","events_json":"https://pith.science/api/pith-number/DCXLDVEENNBADN2J3R7O4HMSPK/events.json","paper":"https://pith.science/paper/DCXLDVEE"},"agent_actions":{"view_html":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK","download_json":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK.json","view_paper":"https://pith.science/paper/DCXLDVEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03880&json=true","fetch_graph":"https://pith.science/api/pith-number/DCXLDVEENNBADN2J3R7O4HMSPK/graph.json","fetch_events":"https://pith.science/api/pith-number/DCXLDVEENNBADN2J3R7O4HMSPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK/action/storage_attestation","attest_author":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK/action/author_attestation","sign_citation":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK/action/citation_signature","submit_replication":"https://pith.science/pith/DCXLDVEENNBADN2J3R7O4HMSPK/action/replication_record"}},"created_at":"2026-05-18T00:52:48.652331+00:00","updated_at":"2026-05-18T00:52:48.652331+00:00"}