{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:E3L7FSDXYXCQPJGFVI5SUYJXWP","short_pith_number":"pith:E3L7FSDX","schema_version":"1.0","canonical_sha256":"26d7f2c877c5c507a4c5aa3b2a6137b3e4d23b0e2cded55835a4a064573a2ed8","source":{"kind":"arxiv","id":"1806.05524","version":1},"attestation_state":"computed","paper":{"title":"Fast Decoding of Low Density Lattice Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alessia Marelli, Emanuele Viterbo, Rino Micheloni, Shuiyin Liu, Yi Hong","submitted_at":"2018-06-14T13:12:49Z","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"},"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":"1806.05524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-14T13:12:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"095691c6b937876eac07367f9134694076eb61af802b8c6b9bd2995114c6c3e2","abstract_canon_sha256":"c40358749b91fe500494747bf30ef51b9b2c0ef52ee72ccf63156ca3fcac4642"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:14.949788Z","signature_b64":"2TZJjJxcO7zgOTcrbKThjDsZhW0Z1hjzGf90DpU7IuITubtLPUxpU3XELQ6oJPO/vABfn0hsV5jn0MlDPLHWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d7f2c877c5c507a4c5aa3b2a6137b3e4d23b0e2cded55835a4a064573a2ed8","last_reissued_at":"2026-05-18T00:13:14.949155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:14.949155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Decoding of Low Density Lattice Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alessia Marelli, Emanuele Viterbo, Rino Micheloni, Shuiyin Liu, Yi Hong","submitted_at":"2018-06-14T13:12:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05524","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":"1806.05524","created_at":"2026-05-18T00:13:14.949240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05524v1","created_at":"2026-05-18T00:13:14.949240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05524","created_at":"2026-05-18T00:13:14.949240+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3L7FSDXYXCQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3L7FSDXYXCQPJGF","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3L7FSDX","created_at":"2026-05-18T12:32:19.392346+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/E3L7FSDXYXCQPJGFVI5SUYJXWP","json":"https://pith.science/pith/E3L7FSDXYXCQPJGFVI5SUYJXWP.json","graph_json":"https://pith.science/api/pith-number/E3L7FSDXYXCQPJGFVI5SUYJXWP/graph.json","events_json":"https://pith.science/api/pith-number/E3L7FSDXYXCQPJGFVI5SUYJXWP/events.json","paper":"https://pith.science/paper/E3L7FSDX"},"agent_actions":{"view_html":"https://pith.science/pith/E3L7FSDXYXCQPJGFVI5SUYJXWP","download_json":"https://pith.science/pith/E3L7FSDXYXCQPJGFVI5SUYJXWP.json","view_paper":"https://pith.science/paper/E3L7FSDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05524&json=true","fetch_graph":"https://pith.science/api/pith-number/E3L7FSDXYXCQPJGFVI5SUYJXWP/graph.json","fetch_events":"https://pith.science/api/pith-number/E3L7FSDXYXCQPJGFVI5SUYJXWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3L7FSDXYXCQPJGFVI5SUYJXWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3L7FSDXYXCQPJGFVI5SUYJXWP/action/storage_attestation","attest_author":"https://pith.science/pith/E3L7FSDXYXCQPJGFVI5SUYJXWP/action/author_attestation","sign_citation":"https://pith.science/pith/E3L7FSDXYXCQPJGFVI5SUYJXWP/action/citation_signature","submit_replication":"https://pith.science/pith/E3L7FSDXYXCQPJGFVI5SUYJXWP/action/replication_record"}},"created_at":"2026-05-18T00:13:14.949240+00:00","updated_at":"2026-05-18T00:13:14.949240+00:00"}