{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DRPLBURWXPGBTTBEIDDLC4U6BS","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":"b09a81062321bb02f3374a765bca7e9acb10b7a108486f7ad3b92c91319c4e74","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-03-16T18:01:55Z","title_canon_sha256":"00dee7d8d4b746b7a7aca24d1c1432f2e96ec88a3505e5aec1dc72b459d40a9a"},"schema_version":"1.0","source":{"id":"1703.05769","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05769","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05769v2","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05769","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"DRPLBURWXPGB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRPLBURWXPGBTTBE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRPLBURW","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:e3cf407490b130fa23d4b74493ac95738f056ac5dfda06db5ce6bdff4d120374","target":"graph","created_at":"2026-05-18T00:27:00Z","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":"An ultra-high throughput low-density parity check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to previously reported LDPC decoders in the literature. The decoder benefits from a serial message-transfer approach between the decoding stages to alleviate the well-known routing congestion problem in parallel LDPC decoders. Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of the standard min-sum decoder with look-up tables, which are designed in a way that","authors_text":"Adam Teman, Alexios Balatsoukas-Stimming, Andreas Burg, Christoph Muller, Gerald Matz, Michael Meidlinger, Reza Ghanaatian","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-03-16T18:01:55Z","title":"A 588 Gbps LDPC Decoder Based on Finite-Alphabet Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05769","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:78a107c103d70b8b593bd6f4fd4007b4f36e3eb10b44a3ae2346cfbee695738c","target":"record","created_at":"2026-05-18T00:27:00Z","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":"b09a81062321bb02f3374a765bca7e9acb10b7a108486f7ad3b92c91319c4e74","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-03-16T18:01:55Z","title_canon_sha256":"00dee7d8d4b746b7a7aca24d1c1432f2e96ec88a3505e5aec1dc72b459d40a9a"},"schema_version":"1.0","source":{"id":"1703.05769","kind":"arxiv","version":2}},"canonical_sha256":"1c5eb0d236bbcc19cc2440c6b1729e0cbcf808208effd046ed3327b1edb214dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c5eb0d236bbcc19cc2440c6b1729e0cbcf808208effd046ed3327b1edb214dd","first_computed_at":"2026-05-18T00:27:00.640485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:00.640485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ChWZ/bzxv5dZeCvJJn2L1W4emHNpPuVhgOx5EvV6YjbaLKd3IAVfCoL+enpnDN85WM0JmyZ2Vk7UF8w5R9lHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:00.641108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05769","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78a107c103d70b8b593bd6f4fd4007b4f36e3eb10b44a3ae2346cfbee695738c","sha256:e3cf407490b130fa23d4b74493ac95738f056ac5dfda06db5ce6bdff4d120374"],"state_sha256":"4b660eda03c4f92f618c3f9d63668476b547232655d79bb06fbe36184f014f1b"}