{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DAHLNFH52AN6WOEPSK3W7ZZ75V","short_pith_number":"pith:DAHLNFH5","schema_version":"1.0","canonical_sha256":"180eb694fdd01beb388f92b76fe73fed5029a5e6104f47714459d8d02a9f3ba9","source":{"kind":"arxiv","id":"1607.05647","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.05647","created_at":"2026-05-18T01:08:45.248389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05647v2","created_at":"2026-05-18T01:08:45.248389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05647","created_at":"2026-05-18T01:08:45.248389+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAHLNFH52AN6","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAHLNFH52AN6WOEP","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAHLNFH5","created_at":"2026-05-18T12:30:09.641336+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/DAHLNFH52AN6WOEPSK3W7ZZ75V","json":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V.json","graph_json":"https://pith.science/api/pith-number/DAHLNFH52AN6WOEPSK3W7ZZ75V/graph.json","events_json":"https://pith.science/api/pith-number/DAHLNFH52AN6WOEPSK3W7ZZ75V/events.json","paper":"https://pith.science/paper/DAHLNFH5"},"agent_actions":{"view_html":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V","download_json":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V.json","view_paper":"https://pith.science/paper/DAHLNFH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05647&json=true","fetch_graph":"https://pith.science/api/pith-number/DAHLNFH52AN6WOEPSK3W7ZZ75V/graph.json","fetch_events":"https://pith.science/api/pith-number/DAHLNFH52AN6WOEPSK3W7ZZ75V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/action/storage_attestation","attest_author":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/action/author_attestation","sign_citation":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/action/citation_signature","submit_replication":"https://pith.science/pith/DAHLNFH52AN6WOEPSK3W7ZZ75V/action/replication_record"}},"created_at":"2026-05-18T01:08:45.248389+00:00","updated_at":"2026-05-18T01:08:45.248389+00:00"}