{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YH3ZQJ3KP4E34F6BKRCGMHUWTX","short_pith_number":"pith:YH3ZQJ3K","schema_version":"1.0","canonical_sha256":"c1f798276a7f09be17c15444661e969de450a7642133aa0477e284f9e2ae4ceb","source":{"kind":"arxiv","id":"1302.5166","version":1},"attestation_state":"computed","paper":{"title":"Rate-Compatible Short-Length Protograph LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria Nosratinia, Dariush Divsalar, Thuy Van Nguyen","submitted_at":"2013-02-21T03:08:33Z","abstract_excerpt":"This paper produces a rate-compatible protograph LDPC code at 1k information blocklength with superior performance in both waterfall and error floor regions. The design of such codes has proved difficult in the past because the constraints imposed by structured design (protographs), rate-compatibility, as well as small block length, are not easily satisfied together. For example, as the block length decreases, the predominance of decoding threshold as the main parameter in coding design is reduced, thus complicating the search for good codes. Our rate-compatible protograph codes have rates ran"},"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":"1302.5166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-21T03:08:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"09ac23c061d9c4a8d938e47573895628e05c199130b755a640061151bbb3442b","abstract_canon_sha256":"d7a95c25381e5432b0b381507ee693f3a75b492271303e49d6ed9e6e258810be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:59.518568Z","signature_b64":"Y1oZZ/beqxtRUp6s0PXmgjLPeGV9/AMMVYV49Gx+SpNByfjSdYEH3/Aw/xZ5xRJMy1Si02cd1kc6p0WtomQeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1f798276a7f09be17c15444661e969de450a7642133aa0477e284f9e2ae4ceb","last_reissued_at":"2026-05-18T03:32:59.517784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:59.517784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Compatible Short-Length Protograph LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria Nosratinia, Dariush Divsalar, Thuy Van Nguyen","submitted_at":"2013-02-21T03:08:33Z","abstract_excerpt":"This paper produces a rate-compatible protograph LDPC code at 1k information blocklength with superior performance in both waterfall and error floor regions. The design of such codes has proved difficult in the past because the constraints imposed by structured design (protographs), rate-compatibility, as well as small block length, are not easily satisfied together. For example, as the block length decreases, the predominance of decoding threshold as the main parameter in coding design is reduced, thus complicating the search for good codes. Our rate-compatible protograph codes have rates ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5166","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":"1302.5166","created_at":"2026-05-18T03:32:59.517913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5166v1","created_at":"2026-05-18T03:32:59.517913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5166","created_at":"2026-05-18T03:32:59.517913+00:00"},{"alias_kind":"pith_short_12","alias_value":"YH3ZQJ3KP4E3","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YH3ZQJ3KP4E34F6B","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YH3ZQJ3K","created_at":"2026-05-18T12:28:06.772260+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/YH3ZQJ3KP4E34F6BKRCGMHUWTX","json":"https://pith.science/pith/YH3ZQJ3KP4E34F6BKRCGMHUWTX.json","graph_json":"https://pith.science/api/pith-number/YH3ZQJ3KP4E34F6BKRCGMHUWTX/graph.json","events_json":"https://pith.science/api/pith-number/YH3ZQJ3KP4E34F6BKRCGMHUWTX/events.json","paper":"https://pith.science/paper/YH3ZQJ3K"},"agent_actions":{"view_html":"https://pith.science/pith/YH3ZQJ3KP4E34F6BKRCGMHUWTX","download_json":"https://pith.science/pith/YH3ZQJ3KP4E34F6BKRCGMHUWTX.json","view_paper":"https://pith.science/paper/YH3ZQJ3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5166&json=true","fetch_graph":"https://pith.science/api/pith-number/YH3ZQJ3KP4E34F6BKRCGMHUWTX/graph.json","fetch_events":"https://pith.science/api/pith-number/YH3ZQJ3KP4E34F6BKRCGMHUWTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YH3ZQJ3KP4E34F6BKRCGMHUWTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YH3ZQJ3KP4E34F6BKRCGMHUWTX/action/storage_attestation","attest_author":"https://pith.science/pith/YH3ZQJ3KP4E34F6BKRCGMHUWTX/action/author_attestation","sign_citation":"https://pith.science/pith/YH3ZQJ3KP4E34F6BKRCGMHUWTX/action/citation_signature","submit_replication":"https://pith.science/pith/YH3ZQJ3KP4E34F6BKRCGMHUWTX/action/replication_record"}},"created_at":"2026-05-18T03:32:59.517913+00:00","updated_at":"2026-05-18T03:32:59.517913+00:00"}