{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XAIXEYQSFEYX5TCPAV2JLLJVCB","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":"7270a8adeeafc888236d04c9acfef0dd44a675679cec4e8929d9a5e4e3696162","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T00:43:15Z","title_canon_sha256":"12ba72257dabe8168462528b3ecd36fb5db01903cf5755baadae2d92881f6f8c"},"schema_version":"1.0","source":{"id":"1701.07531","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07531","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07531v4","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07531","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"XAIXEYQSFEYX","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XAIXEYQSFEYX5TCP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XAIXEYQS","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:8c9bddf18ee55300353a01b2d06b073391c809f28354976edd2ecc2da14c5fe1","target":"graph","created_at":"2026-05-18T00:42:51Z","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":"Protograph-based Raptor-like low-density parity-check codes (PBRL codes) are a recently proposed family of easily encodable and decodable rate-compatible LDPC (RC-LDPC) codes. These codes have an excellent iterative decoding threshold and performance across all design rates. PBRL codes designed thus far, for both long and short block-lengths, have been based on optimizing the iterative decoding threshold of the protograph of the RC code family at various design rates.\n  In this work, we propose a design method to obtain better quasi-cyclic (QC) RC-LDPC codes with PBRL structure for short block","authors_text":"Dariush Divsalar, Richard D. Wesel, Sudarsan V. S. Ranganathan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T00:43:15Z","title":"Design of Improved Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07531","kind":"arxiv","version":4},"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:70590b6489e7245babd7a7bbd973f8cc43aeed71727b25c837a95622e2e8219b","target":"record","created_at":"2026-05-18T00:42:51Z","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":"7270a8adeeafc888236d04c9acfef0dd44a675679cec4e8929d9a5e4e3696162","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T00:43:15Z","title_canon_sha256":"12ba72257dabe8168462528b3ecd36fb5db01903cf5755baadae2d92881f6f8c"},"schema_version":"1.0","source":{"id":"1701.07531","kind":"arxiv","version":4}},"canonical_sha256":"b81172621229317ecc4f057495ad35107d2f1d22242eb99d3ac28e67f5b368be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b81172621229317ecc4f057495ad35107d2f1d22242eb99d3ac28e67f5b368be","first_computed_at":"2026-05-18T00:42:51.341960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:51.341960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/l40YkJ5ETqDeXbqjQsLfmehAaPpxYsl0c4Iie+ZbAv6n+HDSk0hKKZ/kN47JoBb2jtLAQ86O98mWN8ged7MAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:51.342809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07531","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70590b6489e7245babd7a7bbd973f8cc43aeed71727b25c837a95622e2e8219b","sha256:8c9bddf18ee55300353a01b2d06b073391c809f28354976edd2ecc2da14c5fe1"],"state_sha256":"1af7e0e293324dd597d903a7ed1af41c9227b26555e9df51cf737f2e9686f275"}