{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KNF5PXKDREI75GLFZOLEBRA6IJ","short_pith_number":"pith:KNF5PXKD","schema_version":"1.0","canonical_sha256":"534bd7dd438911fe9965cb9640c41e4278d3c79b86513ef25b74f97d12d69493","source":{"kind":"arxiv","id":"1204.2577","version":1},"attestation_state":"computed","paper":{"title":"Reduced-Complexity Column-Layered Decoding and Implementation for LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xinmiao Zhang, Zhiqiang Cui, Zhongfeng Wang","submitted_at":"2012-04-11T21:58:52Z","abstract_excerpt":"Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low complexity column-layered decoding schemes and VLSI architectures for multi-Gb/s applications. At first, the Min-Sum algorithm is incorporated into the column-layered decoding. Then algorithmic transformations and judicious approximations are explored to minimize the overall computation complexity. Compared to the original column-layered decoding, the new approach ca"},"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":"1204.2577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T21:58:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ccf45d24b6adfe7861c36db9ac3ba50a659650ea8c658e557e9e6c73bac3dd77","abstract_canon_sha256":"9a5265b426caf08f9b78964d208559fdfa820433a1190787a58e0682b5c51fd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:04.000739Z","signature_b64":"qlVW2+4Fk05nq6uRXUo7CxPBCl9F8bCL4uwrNXfbdS6OcC4w84y8C4s+pJyEmwl9nKJp+xo2S1Tr6pBpb73TCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"534bd7dd438911fe9965cb9640c41e4278d3c79b86513ef25b74f97d12d69493","last_reissued_at":"2026-05-18T03:58:04.000292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:04.000292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduced-Complexity Column-Layered Decoding and Implementation for LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xinmiao Zhang, Zhiqiang Cui, Zhongfeng Wang","submitted_at":"2012-04-11T21:58:52Z","abstract_excerpt":"Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low complexity column-layered decoding schemes and VLSI architectures for multi-Gb/s applications. At first, the Min-Sum algorithm is incorporated into the column-layered decoding. Then algorithmic transformations and judicious approximations are explored to minimize the overall computation complexity. Compared to the original column-layered decoding, the new approach ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2577","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":"1204.2577","created_at":"2026-05-18T03:58:04.000366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2577v1","created_at":"2026-05-18T03:58:04.000366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2577","created_at":"2026-05-18T03:58:04.000366+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNF5PXKDREI7","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNF5PXKDREI75GLF","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNF5PXKD","created_at":"2026-05-18T12:27:11.947152+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/KNF5PXKDREI75GLFZOLEBRA6IJ","json":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ.json","graph_json":"https://pith.science/api/pith-number/KNF5PXKDREI75GLFZOLEBRA6IJ/graph.json","events_json":"https://pith.science/api/pith-number/KNF5PXKDREI75GLFZOLEBRA6IJ/events.json","paper":"https://pith.science/paper/KNF5PXKD"},"agent_actions":{"view_html":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ","download_json":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ.json","view_paper":"https://pith.science/paper/KNF5PXKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2577&json=true","fetch_graph":"https://pith.science/api/pith-number/KNF5PXKDREI75GLFZOLEBRA6IJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KNF5PXKDREI75GLFZOLEBRA6IJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/action/storage_attestation","attest_author":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/action/author_attestation","sign_citation":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/action/citation_signature","submit_replication":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/action/replication_record"}},"created_at":"2026-05-18T03:58:04.000366+00:00","updated_at":"2026-05-18T03:58:04.000366+00:00"}