{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KNF5PXKDREI75GLFZOLEBRA6IJ","short_pith_number":"pith:KNF5PXKD","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"},"canonical_sha256":"534bd7dd438911fe9965cb9640c41e4278d3c79b86513ef25b74f97d12d69493","source":{"kind":"arxiv","id":"1204.2577","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2577","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2577v1","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2577","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"pith_short_12","alias_value":"KNF5PXKDREI7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KNF5PXKDREI75GLF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KNF5PXKD","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KNF5PXKDREI75GLFZOLEBRA6IJ","target":"record","payload":{"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"},"canonical_sha256":"534bd7dd438911fe9965cb9640c41e4278d3c79b86513ef25b74f97d12d69493","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"},"source_kind":"arxiv","source_id":"1204.2577","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:58:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u05aFkXRqzMFd219zyd92VKXnpSTAbihSK4uwoSzrHRfFKODDN5Jx33PgYrdJPi2Ah9vRG4BzXpHgCGAJETEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:07:41.003119Z"},"content_sha256":"859592fe9d527bc425aa591e0838c2b2e5d1c84b99a81c7e76db5437370a72d1","schema_version":"1.0","event_id":"sha256:859592fe9d527bc425aa591e0838c2b2e5d1c84b99a81c7e76db5437370a72d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KNF5PXKDREI75GLFZOLEBRA6IJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:58:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPhDu0X5qls6lkeCua4UxKXGeibFiwKPAP63epDCkqONQR+Q53OcPoxO5IR1LANN/yU8jvhoijyaZLmMdBB9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:07:41.003818Z"},"content_sha256":"8242e6b539f584185acf1ad2a9a59ca5d338e11c0c4815a7a66d14c772a540d9","schema_version":"1.0","event_id":"sha256:8242e6b539f584185acf1ad2a9a59ca5d338e11c0c4815a7a66d14c772a540d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/bundle.json","state_url":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T06:07:41Z","links":{"resolver":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ","bundle":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/bundle.json","state":"https://pith.science/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNF5PXKDREI75GLFZOLEBRA6IJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KNF5PXKDREI75GLFZOLEBRA6IJ","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":"9a5265b426caf08f9b78964d208559fdfa820433a1190787a58e0682b5c51fd0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T21:58:52Z","title_canon_sha256":"ccf45d24b6adfe7861c36db9ac3ba50a659650ea8c658e557e9e6c73bac3dd77"},"schema_version":"1.0","source":{"id":"1204.2577","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2577","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2577v1","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2577","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"pith_short_12","alias_value":"KNF5PXKDREI7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KNF5PXKDREI75GLF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KNF5PXKD","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:8242e6b539f584185acf1ad2a9a59ca5d338e11c0c4815a7a66d14c772a540d9","target":"graph","created_at":"2026-05-18T03:58:04Z","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":"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","authors_text":"Xinmiao Zhang, Zhiqiang Cui, Zhongfeng Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T21:58:52Z","title":"Reduced-Complexity Column-Layered Decoding and Implementation for LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2577","kind":"arxiv","version":1},"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:859592fe9d527bc425aa591e0838c2b2e5d1c84b99a81c7e76db5437370a72d1","target":"record","created_at":"2026-05-18T03:58:04Z","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":"9a5265b426caf08f9b78964d208559fdfa820433a1190787a58e0682b5c51fd0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-11T21:58:52Z","title_canon_sha256":"ccf45d24b6adfe7861c36db9ac3ba50a659650ea8c658e557e9e6c73bac3dd77"},"schema_version":"1.0","source":{"id":"1204.2577","kind":"arxiv","version":1}},"canonical_sha256":"534bd7dd438911fe9965cb9640c41e4278d3c79b86513ef25b74f97d12d69493","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"534bd7dd438911fe9965cb9640c41e4278d3c79b86513ef25b74f97d12d69493","first_computed_at":"2026-05-18T03:58:04.000292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:04.000292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qlVW2+4Fk05nq6uRXUo7CxPBCl9F8bCL4uwrNXfbdS6OcC4w84y8C4s+pJyEmwl9nKJp+xo2S1Tr6pBpb73TCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:04.000739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2577","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:859592fe9d527bc425aa591e0838c2b2e5d1c84b99a81c7e76db5437370a72d1","sha256:8242e6b539f584185acf1ad2a9a59ca5d338e11c0c4815a7a66d14c772a540d9"],"state_sha256":"ae7ab0faec169a03d6b16d3ad3075aa178a65359b516c029c4e9acfbdb59666c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NxAgHxVmWS3Sb8pkp9CLL5ErgETjG9asfiUF0e0gs/t5GhBVD+bgnAOkWJ+14WfoKedAntDsoBW7xDSfr2uDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:07:41.007246Z","bundle_sha256":"50ce0fa3bfc89ab83b71f3d23fa0126e37579a316034cc0899c573b9337e4c0a"}}