{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:HZWTVYB7HOJMGAWSHQJQWW4JPI","short_pith_number":"pith:HZWTVYB7","schema_version":"1.0","canonical_sha256":"3e6d3ae03f3b92c302d23c130b5b897a3444aac1dcdf59227b2aa888967cf34f","source":{"kind":"arxiv","id":"0705.0543","version":1},"attestation_state":"computed","paper":{"title":"The Design of Efficiently-Encodable Rate-Compatible LDPC Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Jaehong Kim, Steven W. McLaughlin","submitted_at":"2007-05-03T22:17:51Z","abstract_excerpt":"We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (eIRA) codes for all"},"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":"0705.0543","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-05-03T22:17:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5cb0d66281b4b3040d6722f03d739431f839f4e31b2409b8b6cbe249a53e991","abstract_canon_sha256":"365b7624a01345474b3fdcf4ca364e5e9ed736192fe620afdd6b26e75fe93198"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:02.412194Z","signature_b64":"pfKCNmCdRjwr/y6QXTESIC4i3B4i546PcBW4htUy0NaHorvDWSVM5ec1uPTCx3EFUFOrSANnRbL8r7n63DkIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e6d3ae03f3b92c302d23c130b5b897a3444aac1dcdf59227b2aa888967cf34f","last_reissued_at":"2026-05-18T00:58:02.411683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:02.411683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Design of Efficiently-Encodable Rate-Compatible LDPC Codes","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Jaehong Kim, Steven W. McLaughlin","submitted_at":"2007-05-03T22:17:51Z","abstract_excerpt":"We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (eIRA) codes for all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.0543","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":"0705.0543","created_at":"2026-05-18T00:58:02.411752+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.0543v1","created_at":"2026-05-18T00:58:02.411752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0543","created_at":"2026-05-18T00:58:02.411752+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZWTVYB7HOJM","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZWTVYB7HOJMGAWS","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZWTVYB7","created_at":"2026-05-18T12:25:55.427421+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/HZWTVYB7HOJMGAWSHQJQWW4JPI","json":"https://pith.science/pith/HZWTVYB7HOJMGAWSHQJQWW4JPI.json","graph_json":"https://pith.science/api/pith-number/HZWTVYB7HOJMGAWSHQJQWW4JPI/graph.json","events_json":"https://pith.science/api/pith-number/HZWTVYB7HOJMGAWSHQJQWW4JPI/events.json","paper":"https://pith.science/paper/HZWTVYB7"},"agent_actions":{"view_html":"https://pith.science/pith/HZWTVYB7HOJMGAWSHQJQWW4JPI","download_json":"https://pith.science/pith/HZWTVYB7HOJMGAWSHQJQWW4JPI.json","view_paper":"https://pith.science/paper/HZWTVYB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.0543&json=true","fetch_graph":"https://pith.science/api/pith-number/HZWTVYB7HOJMGAWSHQJQWW4JPI/graph.json","fetch_events":"https://pith.science/api/pith-number/HZWTVYB7HOJMGAWSHQJQWW4JPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZWTVYB7HOJMGAWSHQJQWW4JPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZWTVYB7HOJMGAWSHQJQWW4JPI/action/storage_attestation","attest_author":"https://pith.science/pith/HZWTVYB7HOJMGAWSHQJQWW4JPI/action/author_attestation","sign_citation":"https://pith.science/pith/HZWTVYB7HOJMGAWSHQJQWW4JPI/action/citation_signature","submit_replication":"https://pith.science/pith/HZWTVYB7HOJMGAWSHQJQWW4JPI/action/replication_record"}},"created_at":"2026-05-18T00:58:02.411752+00:00","updated_at":"2026-05-18T00:58:02.411752+00:00"}