{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KGSIVF5UNWKOGSRJZ7EYP2WNCU","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":"8fca0388820206786ab36cbbe7f1d1ac044107e946d4ee32588747937e3b1511","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-16T06:48:45Z","title_canon_sha256":"4e4339218aa9e651c9d5a390e4248e9f4632629510af7d5259708b31f600d186"},"schema_version":"1.0","source":{"id":"1605.04664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04664","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04664v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04664","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"KGSIVF5UNWKO","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KGSIVF5UNWKOGSRJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KGSIVF5U","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:58fcfcc62331ff8d4b9ed6334c23e4846daaa429e62de5cb641d7fd7785135e9","target":"graph","created_at":"2026-05-18T01:14:46Z","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":"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","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":"2016-05-16T06:48:45Z","title":"A Joint Optimization Technique for Multi-Edge Type LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04664","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:5a1c7c432f309399410075eb5df494f771b0ae6a6d6cd44b584c78e591ab2c72","target":"record","created_at":"2026-05-18T01:14:46Z","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":"8fca0388820206786ab36cbbe7f1d1ac044107e946d4ee32588747937e3b1511","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-16T06:48:45Z","title_canon_sha256":"4e4339218aa9e651c9d5a390e4248e9f4632629510af7d5259708b31f600d186"},"schema_version":"1.0","source":{"id":"1605.04664","kind":"arxiv","version":1}},"canonical_sha256":"51a48a97b46d94e34a29cfc987eacd152e4f3708d11358129ff68611a3da003b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51a48a97b46d94e34a29cfc987eacd152e4f3708d11358129ff68611a3da003b","first_computed_at":"2026-05-18T01:14:46.590641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:46.590641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LcMZI0tnXRrHpxH+nPALr1Rx2vTzZFGJdd9OxCjyvLJHrk8R5Mt/de/8tadiRd2Y4YfZ5zqs/4x54ufm0vGFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:46.591352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a1c7c432f309399410075eb5df494f771b0ae6a6d6cd44b584c78e591ab2c72","sha256:58fcfcc62331ff8d4b9ed6334c23e4846daaa429e62de5cb641d7fd7785135e9"],"state_sha256":"8883a04ec023bc9124fc68852fbfd12b2ed36c5c1a646caed33c3a01a485f39e"}