{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3TD3RMTSJVK4GKZ2V337ZNWOZE","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":"1b318343558ad61d711d71ffdb09ca0c869e7dacd059ee077d1006c39af1f971","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-29T15:56:15Z","title_canon_sha256":"380c6300d0fde7ce8c0cc45cc4333ab76510f29ec6256e1f34241e84145d1b38"},"schema_version":"1.0","source":{"id":"1203.6566","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6566","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6566v2","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6566","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"3TD3RMTSJVK4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3TD3RMTSJVK4GKZ2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3TD3RMTS","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:2c403bd294044bdcc9a29244f1365fecacf486b52e5d174fa4d4a46a3a6f510a","target":"graph","created_at":"2026-05-18T00:12:01Z","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":"This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate structured codes with constant column weights 3 and higher. The proposed codes are efficiently encodable and exhibit good structural properties. Experimental results on decoding performance with the sum-product algorithm show that the novel codes offer substantial practical application potential, for instance, in high-speed applications in magnetic recording and ","authors_text":"Alexander Gruner, Michael Huber","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-29T15:56:15Z","title":"New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6566","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:3dfb3f464cde779da66c629144da2e4d17611ab7879663908ac70dbb6a04cffa","target":"record","created_at":"2026-05-18T00:12:01Z","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":"1b318343558ad61d711d71ffdb09ca0c869e7dacd059ee077d1006c39af1f971","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-29T15:56:15Z","title_canon_sha256":"380c6300d0fde7ce8c0cc45cc4333ab76510f29ec6256e1f34241e84145d1b38"},"schema_version":"1.0","source":{"id":"1203.6566","kind":"arxiv","version":2}},"canonical_sha256":"dcc7b8b2724d55c32b3aaef7fcb6cec92bb5d125ac945bd7171b2b0ffd78f51a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcc7b8b2724d55c32b3aaef7fcb6cec92bb5d125ac945bd7171b2b0ffd78f51a","first_computed_at":"2026-05-18T00:12:01.399040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:01.399040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2KkNkrYL5lLEONewQffOJaircsfeduimz1h/c5Evmidpa59cAwTwXeLjxtZfu/6T0ipDN/l0gNu6G7kHYA78AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:01.399504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.6566","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dfb3f464cde779da66c629144da2e4d17611ab7879663908ac70dbb6a04cffa","sha256:2c403bd294044bdcc9a29244f1365fecacf486b52e5d174fa4d4a46a3a6f510a"],"state_sha256":"ae75fcf3175d31b75850883bf1008cdfc075dc3acfe9224b4f0f40f9487df29d"}