{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E3L7FSDXYXCQPJGFVI5SUYJXWP","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":"c40358749b91fe500494747bf30ef51b9b2c0ef52ee72ccf63156ca3fcac4642","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-14T13:12:49Z","title_canon_sha256":"095691c6b937876eac07367f9134694076eb61af802b8c6b9bd2995114c6c3e2"},"schema_version":"1.0","source":{"id":"1806.05524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05524","created_at":"2026-05-18T00:13:14Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05524v1","created_at":"2026-05-18T00:13:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05524","created_at":"2026-05-18T00:13:14Z"},{"alias_kind":"pith_short_12","alias_value":"E3L7FSDXYXCQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E3L7FSDXYXCQPJGF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E3L7FSDX","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:b575d6ad67ae98594a70754a4655a001bd1679a228792e743a143326ecf0f279","target":"graph","created_at":"2026-05-18T00:13:14Z","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":"Low density lattice codes (LDLC) are a family of lattice codes that can be decoded efficiently using a message-passing algorithm. In the original LDLC decoder, the message exchanged between variable nodes and check nodes are continuous functions, which must be approximated in practice. A promising method is Gaussian approximation (GA), where the messages are approximated by Gaussian functions. However, current GA-based decoders share two weaknesses: firstly, the convergence of these approximate decoders is unproven; secondly, the best known decoder requires $O(2^d)$ operations at each variable","authors_text":"Alessia Marelli, Emanuele Viterbo, Rino Micheloni, Shuiyin Liu, Yi Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-14T13:12:49Z","title":"Fast Decoding of Low Density Lattice Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05524","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:ed231a5bcf6e125571745f9410e4e4d7e9c1ad5fe3a8d41d5fa47d90b55a7cb5","target":"record","created_at":"2026-05-18T00:13:14Z","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":"c40358749b91fe500494747bf30ef51b9b2c0ef52ee72ccf63156ca3fcac4642","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-14T13:12:49Z","title_canon_sha256":"095691c6b937876eac07367f9134694076eb61af802b8c6b9bd2995114c6c3e2"},"schema_version":"1.0","source":{"id":"1806.05524","kind":"arxiv","version":1}},"canonical_sha256":"26d7f2c877c5c507a4c5aa3b2a6137b3e4d23b0e2cded55835a4a064573a2ed8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d7f2c877c5c507a4c5aa3b2a6137b3e4d23b0e2cded55835a4a064573a2ed8","first_computed_at":"2026-05-18T00:13:14.949155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:14.949155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2TZJjJxcO7zgOTcrbKThjDsZhW0Z1hjzGf90DpU7IuITubtLPUxpU3XELQ6oJPO/vABfn0hsV5jn0MlDPLHWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:14.949788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed231a5bcf6e125571745f9410e4e4d7e9c1ad5fe3a8d41d5fa47d90b55a7cb5","sha256:b575d6ad67ae98594a70754a4655a001bd1679a228792e743a143326ecf0f279"],"state_sha256":"1291005a6396431b2511edafc496fc8ca2dcaaaba7858f28e6919e972d6ecc7b"}