{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F2KN2PRD3HJUFOO2DPSYRPJXAM","short_pith_number":"pith:F2KN2PRD","schema_version":"1.0","canonical_sha256":"2e94dd3e23d9d342b9da1be588bd37030455b5818a25e2e98fee47c24bb41f9c","source":{"kind":"arxiv","id":"1807.02913","version":2},"attestation_state":"computed","paper":{"title":"A Neural Network Lattice Decoding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Sakzad, Daniel Panario, Farzane Amirzade, Mohammad-Reza Sadeghi","submitted_at":"2018-07-09T01:54:56Z","abstract_excerpt":"Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such as sum-product or min-sum algorithms in which the weight of each edge is set to $1$, in the neural network decoding algorithms, the weight of every edge depends on its impact in the transmitted codeword. In this paper, we provide a novel \\emph{feed-forward neural network lattice decoding algorithm} suitable to decode lattices constructed based on Construction A, whose underlying codes have HDPC matrices. We first est"},"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":"1807.02913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-09T01:54:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4d3b9cc54c86570678b5e92f426efb6d8fed38d31fc2202059b84e4cbcd067e5","abstract_canon_sha256":"985f97d45f421f4569d59be5beed0b4dfcb5198bf46aae47e2978fba93062296"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:50.492392Z","signature_b64":"/vkB/1TEDHuNxmwskY70s+PXyiUAUxd9Q4J5FvDzlIApVct9MWrWfrFKPSfFz9JGqe48Cud3BjrjapFjEcWyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e94dd3e23d9d342b9da1be588bd37030455b5818a25e2e98fee47c24bb41f9c","last_reissued_at":"2026-05-18T00:05:50.491580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:50.491580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Neural Network Lattice Decoding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Sakzad, Daniel Panario, Farzane Amirzade, Mohammad-Reza Sadeghi","submitted_at":"2018-07-09T01:54:56Z","abstract_excerpt":"Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such as sum-product or min-sum algorithms in which the weight of each edge is set to $1$, in the neural network decoding algorithms, the weight of every edge depends on its impact in the transmitted codeword. In this paper, we provide a novel \\emph{feed-forward neural network lattice decoding algorithm} suitable to decode lattices constructed based on Construction A, whose underlying codes have HDPC matrices. We first est"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02913","kind":"arxiv","version":2},"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":"1807.02913","created_at":"2026-05-18T00:05:50.491709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02913v2","created_at":"2026-05-18T00:05:50.491709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02913","created_at":"2026-05-18T00:05:50.491709+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2KN2PRD3HJU","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2KN2PRD3HJUFOO2","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2KN2PRD","created_at":"2026-05-18T12:32:22.470017+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/F2KN2PRD3HJUFOO2DPSYRPJXAM","json":"https://pith.science/pith/F2KN2PRD3HJUFOO2DPSYRPJXAM.json","graph_json":"https://pith.science/api/pith-number/F2KN2PRD3HJUFOO2DPSYRPJXAM/graph.json","events_json":"https://pith.science/api/pith-number/F2KN2PRD3HJUFOO2DPSYRPJXAM/events.json","paper":"https://pith.science/paper/F2KN2PRD"},"agent_actions":{"view_html":"https://pith.science/pith/F2KN2PRD3HJUFOO2DPSYRPJXAM","download_json":"https://pith.science/pith/F2KN2PRD3HJUFOO2DPSYRPJXAM.json","view_paper":"https://pith.science/paper/F2KN2PRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02913&json=true","fetch_graph":"https://pith.science/api/pith-number/F2KN2PRD3HJUFOO2DPSYRPJXAM/graph.json","fetch_events":"https://pith.science/api/pith-number/F2KN2PRD3HJUFOO2DPSYRPJXAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2KN2PRD3HJUFOO2DPSYRPJXAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2KN2PRD3HJUFOO2DPSYRPJXAM/action/storage_attestation","attest_author":"https://pith.science/pith/F2KN2PRD3HJUFOO2DPSYRPJXAM/action/author_attestation","sign_citation":"https://pith.science/pith/F2KN2PRD3HJUFOO2DPSYRPJXAM/action/citation_signature","submit_replication":"https://pith.science/pith/F2KN2PRD3HJUFOO2DPSYRPJXAM/action/replication_record"}},"created_at":"2026-05-18T00:05:50.491709+00:00","updated_at":"2026-05-18T00:05:50.491709+00:00"}