{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DAHLNFH52AN6WOEPSK3W7ZZ75V","short_pith_number":"pith:DAHLNFH5","canonical_record":{"source":{"id":"1607.05647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-19T16:11:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"814ee2c267573ef7db12eea639fed7c23163840d1d19bc58bd3b488463b9e612","abstract_canon_sha256":"bf78cba5505c1b73bacf1e2839d910d18205b3fb6bd2829e4f4f2c98a7f91df6"},"schema_version":"1.0"},"canonical_sha256":"180eb694fdd01beb388f92b76fe73fed5029a5e6104f47714459d8d02a9f3ba9","source":{"kind":"arxiv","id":"1607.05647","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05647","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05647v2","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05647","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"DAHLNFH52AN6","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"DAHLNFH52AN6WOEP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"DAHLNFH5","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DAHLNFH52AN6WOEPSK3W7ZZ75V","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-19T16:11:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"814ee2c267573ef7db12eea639fed7c23163840d1d19bc58bd3b488463b9e612","abstract_canon_sha256":"bf78cba5505c1b73bacf1e2839d910d18205b3fb6bd2829e4f4f2c98a7f91df6"},"schema_version":"1.0"},"canonical_sha256":"180eb694fdd01beb388f92b76fe73fed5029a5e6104f47714459d8d02a9f3ba9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:45.248847Z","signature_b64":"r+lPrgEJadZ8/+NmDVnDvI5SvMEUT+Ixrd/tdCi6cMpjqj2XNS3JNI7xBE9gDvWZDDA5SWpoUCNv2BQ9VxR0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"180eb694fdd01beb388f92b76fe73fed5029a5e6104f47714459d8d02a9f3ba9","last_reissued_at":"2026-05-18T01:08:45.248277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:45.248277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05647","source_version":2,"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:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6wsXqOcFLKNcDlDF4eCRHWyHvigrlsGR+iwltu9ZjzoTb8Eu7m6LgiAvTKh4MbROx4BVXIS68/i1EQUC7p7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:12:51.344763Z"},"content_sha256":"4e0618c934019700d24b024fcbefd86c7ffc3939b215750ec2a9eedfd1ccd56c","schema_version":"1.0","event_id":"sha256:4e0618c934019700d24b024fcbefd86c7ffc3939b215750ec2a9eedfd1ccd56c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DAHLNFH52AN6WOEPSK3W7ZZ75V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of LDPC Codes using Multipath EMD Strategies and Progressive Edge Growth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"C. T. Healy, R. C. de Lamare","submitted_at":"2016-07-19T16:11:26Z","abstract_excerpt":"Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor arises from the loss of independence of messages passed under iterative graph-based decoding. In this paper, the error floor performance of short block length codes is improved by use of a novel candidate selection metric in code graph construction. The proposed Multipath EMD approach avoids harmful structures in the graph by evaluating certain properties of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05647","kind":"arxiv","version":2},"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:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1ktT2ntF8mGQl36RpS7YiBQZECDfK1RbszK2Sx/IS/62nLWA/yYdZoN+7V+HFu3ArsJKDBpZyTyLQzD5RSPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:12:51.345503Z"},"content_sha256":"f709c31a84e114914ac63683168f031f903fd4fe12634ffa8d278bb2c80b8ec8","schema_version":"1.0","event_id":"sha256:f709c31a84e114914ac63683168f031f903fd4fe12634ffa8d278bb2c80b8ec8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/bundle.json","state_url":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/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-08T03:12:51Z","links":{"resolver":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V","bundle":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/bundle.json","state":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DAHLNFH52AN6WOEPSK3W7ZZ75V","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":"bf78cba5505c1b73bacf1e2839d910d18205b3fb6bd2829e4f4f2c98a7f91df6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-19T16:11:26Z","title_canon_sha256":"814ee2c267573ef7db12eea639fed7c23163840d1d19bc58bd3b488463b9e612"},"schema_version":"1.0","source":{"id":"1607.05647","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05647","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05647v2","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05647","created_at":"2026-05-18T01:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"DAHLNFH52AN6","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"DAHLNFH52AN6WOEP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"DAHLNFH5","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:f709c31a84e114914ac63683168f031f903fd4fe12634ffa8d278bb2c80b8ec8","target":"graph","created_at":"2026-05-18T01:08:45Z","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":"Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor arises from the loss of independence of messages passed under iterative graph-based decoding. In this paper, the error floor performance of short block length codes is improved by use of a novel candidate selection metric in code graph construction. The proposed Multipath EMD approach avoids harmful structures in the graph by evaluating certain properties of the","authors_text":"C. T. Healy, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-19T16:11:26Z","title":"Design of LDPC Codes using Multipath EMD Strategies and Progressive Edge Growth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05647","kind":"arxiv","version":2},"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:4e0618c934019700d24b024fcbefd86c7ffc3939b215750ec2a9eedfd1ccd56c","target":"record","created_at":"2026-05-18T01:08:45Z","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":"bf78cba5505c1b73bacf1e2839d910d18205b3fb6bd2829e4f4f2c98a7f91df6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-19T16:11:26Z","title_canon_sha256":"814ee2c267573ef7db12eea639fed7c23163840d1d19bc58bd3b488463b9e612"},"schema_version":"1.0","source":{"id":"1607.05647","kind":"arxiv","version":2}},"canonical_sha256":"180eb694fdd01beb388f92b76fe73fed5029a5e6104f47714459d8d02a9f3ba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"180eb694fdd01beb388f92b76fe73fed5029a5e6104f47714459d8d02a9f3ba9","first_computed_at":"2026-05-18T01:08:45.248277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:45.248277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r+lPrgEJadZ8/+NmDVnDvI5SvMEUT+Ixrd/tdCi6cMpjqj2XNS3JNI7xBE9gDvWZDDA5SWpoUCNv2BQ9VxR0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:45.248847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05647","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e0618c934019700d24b024fcbefd86c7ffc3939b215750ec2a9eedfd1ccd56c","sha256:f709c31a84e114914ac63683168f031f903fd4fe12634ffa8d278bb2c80b8ec8"],"state_sha256":"70d2fdc678845680142b0d87bd5eb653cc73f7d81e7d65f28b0876f6f04f8a15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRlhJW+g+3LwcXU/escd2KjzvhrnQs1DcC0sbJwJ5hivPiau1JMxhcxNg2hrdJlKniPkRTnDAvKTpS28d23OAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:12:51.349056Z","bundle_sha256":"c2d2010e992d20077db2ec9d1fdaebfee09db64945cfa390c718dad0294ea47c"}}