{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F2KN2PRD3HJUFOO2DPSYRPJXAM","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":"985f97d45f421f4569d59be5beed0b4dfcb5198bf46aae47e2978fba93062296","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-09T01:54:56Z","title_canon_sha256":"4d3b9cc54c86570678b5e92f426efb6d8fed38d31fc2202059b84e4cbcd067e5"},"schema_version":"1.0","source":{"id":"1807.02913","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02913","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02913v2","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02913","created_at":"2026-05-18T00:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"F2KN2PRD3HJU","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F2KN2PRD3HJUFOO2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F2KN2PRD","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:d86ab95aa27efb7877551c04821618fb3b2ee5c82efaf8a12b98767f67b1ff3b","target":"graph","created_at":"2026-05-18T00:05:50Z","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":"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","authors_text":"Amin Sakzad, Daniel Panario, Farzane Amirzade, Mohammad-Reza Sadeghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-09T01:54:56Z","title":"A Neural Network Lattice Decoding Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02913","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:7154f2329ac3a5f739623b877e8daf972188d2bc344e84b4731dc8f3ba63f8f5","target":"record","created_at":"2026-05-18T00:05:50Z","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":"985f97d45f421f4569d59be5beed0b4dfcb5198bf46aae47e2978fba93062296","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-09T01:54:56Z","title_canon_sha256":"4d3b9cc54c86570678b5e92f426efb6d8fed38d31fc2202059b84e4cbcd067e5"},"schema_version":"1.0","source":{"id":"1807.02913","kind":"arxiv","version":2}},"canonical_sha256":"2e94dd3e23d9d342b9da1be588bd37030455b5818a25e2e98fee47c24bb41f9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e94dd3e23d9d342b9da1be588bd37030455b5818a25e2e98fee47c24bb41f9c","first_computed_at":"2026-05-18T00:05:50.491580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:50.491580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/vkB/1TEDHuNxmwskY70s+PXyiUAUxd9Q4J5FvDzlIApVct9MWrWfrFKPSfFz9JGqe48Cud3BjrjapFjEcWyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:50.492392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02913","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7154f2329ac3a5f739623b877e8daf972188d2bc344e84b4731dc8f3ba63f8f5","sha256:d86ab95aa27efb7877551c04821618fb3b2ee5c82efaf8a12b98767f67b1ff3b"],"state_sha256":"aef1ac774186913d5189e9e05e9bfa3a2ec34c02fc6bf867ee357c42e1fe994c"}