{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KGSIVF5UNWKOGSRJZ7EYP2WNCU","short_pith_number":"pith:KGSIVF5U","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"},"canonical_sha256":"51a48a97b46d94e34a29cfc987eacd152e4f3708d11358129ff68611a3da003b","source":{"kind":"arxiv","id":"1605.04664","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KGSIVF5UNWKOGSRJZ7EYP2WNCU","target":"record","payload":{"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"},"canonical_sha256":"51a48a97b46d94e34a29cfc987eacd152e4f3708d11358129ff68611a3da003b","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"},"source_kind":"arxiv","source_id":"1605.04664","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YF4nNcGlWBbpeHCYLDdQnUIuEwZTkpHWH6s8GD3UTVBFWWrgvJSHCfku2RepKn9OlSnL2XAT130n4D3AyjMCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:50:06.781224Z"},"content_sha256":"5a1c7c432f309399410075eb5df494f771b0ae6a6d6cd44b584c78e591ab2c72","schema_version":"1.0","event_id":"sha256:5a1c7c432f309399410075eb5df494f771b0ae6a6d6cd44b584c78e591ab2c72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KGSIVF5UNWKOGSRJZ7EYP2WNCU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+FSADuxJR/ZbIfZ/lXtBn5sReD/H2iHE4zPOTdz3KyJjlalT+D264vr+udr40zBN/iXaOoST0fNh7EfnhhZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:50:06.781591Z"},"content_sha256":"58fcfcc62331ff8d4b9ed6334c23e4846daaa429e62de5cb641d7fd7785135e9","schema_version":"1.0","event_id":"sha256:58fcfcc62331ff8d4b9ed6334c23e4846daaa429e62de5cb641d7fd7785135e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/bundle.json","state_url":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T05:50:06Z","links":{"resolver":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU","bundle":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/bundle.json","state":"https://pith.science/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGSIVF5UNWKOGSRJZ7EYP2WNCU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBfZR+xfrLt1Uo0EO+b3zMjBSfOFOzvgt22WXmjBT1kNy0uxA8L8e8Mw4ZTGcRDON/m7QsSBQNR1giCoCD41DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:50:06.783500Z","bundle_sha256":"0d50401cd033e87ff13d14637112054c05ec5ab5ed198d149446e266ff6cedc9"}}