{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KGSIVF5UNWKOGSRJZ7EYP2WNCU","short_pith_number":"pith:KGSIVF5U","schema_version":"1.0","canonical_sha256":"51a48a97b46d94e34a29cfc987eacd152e4f3708d11358129ff68611a3da003b","source":{"kind":"arxiv","id":"1605.04664","version":1},"attestation_state":"computed","paper":{"title":"A Joint Optimization Technique for Multi-Edge Type LDPC Codes","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":"2016-05-16T06:48:45Z","abstract_excerpt":"This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees. This joint optimization is particularly important for MET-LDPC codes as it is not clear a priori which structures will be good. Using several examples, we demonstrate that the MET-LDPC codes designed by the proposed joint optimization algorithm exhibit improved decod"},"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":"1605.04664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-16T06:48:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4e4339218aa9e651c9d5a390e4248e9f4632629510af7d5259708b31f600d186","abstract_canon_sha256":"8fca0388820206786ab36cbbe7f1d1ac044107e946d4ee32588747937e3b1511"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:46.591352Z","signature_b64":"LcMZI0tnXRrHpxH+nPALr1Rx2vTzZFGJdd9OxCjyvLJHrk8R5Mt/de/8tadiRd2Y4YfZ5zqs/4x54ufm0vGFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51a48a97b46d94e34a29cfc987eacd152e4f3708d11358129ff68611a3da003b","last_reissued_at":"2026-05-18T01:14:46.590641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:46.590641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Joint Optimization Technique for Multi-Edge Type LDPC Codes","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":"2016-05-16T06:48:45Z","abstract_excerpt":"This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees. This joint optimization is particularly important for MET-LDPC codes as it is not clear a priori which structures will be good. Using several examples, we demonstrate that the MET-LDPC codes designed by the proposed joint optimization algorithm exhibit improved decod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04664","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":"1605.04664","created_at":"2026-05-18T01:14:46.590763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04664v1","created_at":"2026-05-18T01:14:46.590763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04664","created_at":"2026-05-18T01:14:46.590763+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGSIVF5UNWKO","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGSIVF5UNWKOGSRJ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGSIVF5U","created_at":"2026-05-18T12:30:25.849896+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/KGSIVF5UNWKOGSRJZ7EYP2WNCU","json":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU.json","graph_json":"https://pith.science/api/pith-number/KGSIVF5UNWKOGSRJZ7EYP2WNCU/graph.json","events_json":"https://pith.science/api/pith-number/KGSIVF5UNWKOGSRJZ7EYP2WNCU/events.json","paper":"https://pith.science/paper/KGSIVF5U"},"agent_actions":{"view_html":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU","download_json":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU.json","view_paper":"https://pith.science/paper/KGSIVF5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04664&json=true","fetch_graph":"https://pith.science/api/pith-number/KGSIVF5UNWKOGSRJZ7EYP2WNCU/graph.json","fetch_events":"https://pith.science/api/pith-number/KGSIVF5UNWKOGSRJZ7EYP2WNCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/action/storage_attestation","attest_author":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/action/author_attestation","sign_citation":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/action/citation_signature","submit_replication":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/action/replication_record"}},"created_at":"2026-05-18T01:14:46.590763+00:00","updated_at":"2026-05-18T01:14:46.590763+00:00"}