{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EIJYLMSSHEITPCN3G2W4VK6KKT","short_pith_number":"pith:EIJYLMSS","canonical_record":{"source":{"id":"1701.05931","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T21:55:03Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"2f8d6677d3dbf7bc5fb531fc144f219c47a344f3f9ede7af4bd3c050a3d5fe53","abstract_canon_sha256":"025bc5f969273bc3227d9bf1db6797b67398a83f3af76e320b9b62ab62d62bc3"},"schema_version":"1.0"},"canonical_sha256":"221385b25239113789bb36adcaabca54fd64e5cfe9c6c851778d5128a02cd591","source":{"kind":"arxiv","id":"1701.05931","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05931","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05931v3","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05931","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"EIJYLMSSHEIT","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIJYLMSSHEITPCN3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIJYLMSS","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EIJYLMSSHEITPCN3G2W4VK6KKT","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05931","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T21:55:03Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"2f8d6677d3dbf7bc5fb531fc144f219c47a344f3f9ede7af4bd3c050a3d5fe53","abstract_canon_sha256":"025bc5f969273bc3227d9bf1db6797b67398a83f3af76e320b9b62ab62d62bc3"},"schema_version":"1.0"},"canonical_sha256":"221385b25239113789bb36adcaabca54fd64e5cfe9c6c851778d5128a02cd591","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.092096Z","signature_b64":"S6rl4wwV8KruoI6CquKHBo4gpRWnoSuaWzvSFeJNTUwSQmQgc6yex0NNHfoCWV4V0Rfl+GPhY8zLK6BPcGdnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"221385b25239113789bb36adcaabca54fd64e5cfe9c6c851778d5128a02cd591","last_reissued_at":"2026-05-18T00:39:18.091490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.091490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05931","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTehVIBNfYXOQBs8auC1VmnF9/J9W70Rs1fIkSSExomAO6qBTQ2VsmvjZG9uPiAldESTse8ci/qQ496+mLy0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:13:15.482348Z"},"content_sha256":"3b2b473b3889b1b1db75cccbefd0321e4cfcae270ec98f0d1172699432c84cf7","schema_version":"1.0","event_id":"sha256:3b2b473b3889b1b1db75cccbefd0321e4cfcae270ec98f0d1172699432c84cf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EIJYLMSSHEITPCN3G2W4VK6KKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Offset Min-Sum Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Loren Lugosch, Warren J. Gross","submitted_at":"2017-01-20T21:55:03Z","abstract_excerpt":"Recently, it was shown that if multiplicative weights are assigned to the edges of a Tanner graph used in belief propagation decoding, it is possible to use deep learning techniques to find values for the weights which improve the error-correction performance of the decoder. Unfortunately, this approach requires many multiplications, which are generally expensive operations. In this paper, we suggest a more hardware-friendly approach in which offset min-sum decoding is augmented with learnable offset parameters. Our method uses no multiplications and has a parameter count less than half that o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05931","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ooBR3lk3SyT4VxzwAFGSL46yo0ZFJtr6qOzfWjV4u9cqO4iHRMhXz615o9L68s50EfH5plOjxoG65SEp3effBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:13:15.483009Z"},"content_sha256":"dab6c34e69b4e30847b4dc81f1bb9016c84d00edf55756e62cd8ac005de5ef9b","schema_version":"1.0","event_id":"sha256:dab6c34e69b4e30847b4dc81f1bb9016c84d00edf55756e62cd8ac005de5ef9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIJYLMSSHEITPCN3G2W4VK6KKT/bundle.json","state_url":"https://pith.science/pith/EIJYLMSSHEITPCN3G2W4VK6KKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIJYLMSSHEITPCN3G2W4VK6KKT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T08:13:15Z","links":{"resolver":"https://pith.science/pith/EIJYLMSSHEITPCN3G2W4VK6KKT","bundle":"https://pith.science/pith/EIJYLMSSHEITPCN3G2W4VK6KKT/bundle.json","state":"https://pith.science/pith/EIJYLMSSHEITPCN3G2W4VK6KKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIJYLMSSHEITPCN3G2W4VK6KKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EIJYLMSSHEITPCN3G2W4VK6KKT","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":"025bc5f969273bc3227d9bf1db6797b67398a83f3af76e320b9b62ab62d62bc3","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T21:55:03Z","title_canon_sha256":"2f8d6677d3dbf7bc5fb531fc144f219c47a344f3f9ede7af4bd3c050a3d5fe53"},"schema_version":"1.0","source":{"id":"1701.05931","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05931","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05931v3","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05931","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"EIJYLMSSHEIT","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIJYLMSSHEITPCN3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIJYLMSS","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:dab6c34e69b4e30847b4dc81f1bb9016c84d00edf55756e62cd8ac005de5ef9b","target":"graph","created_at":"2026-05-18T00:39:18Z","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":"Recently, it was shown that if multiplicative weights are assigned to the edges of a Tanner graph used in belief propagation decoding, it is possible to use deep learning techniques to find values for the weights which improve the error-correction performance of the decoder. Unfortunately, this approach requires many multiplications, which are generally expensive operations. In this paper, we suggest a more hardware-friendly approach in which offset min-sum decoding is augmented with learnable offset parameters. Our method uses no multiplications and has a parameter count less than half that o","authors_text":"Loren Lugosch, Warren J. Gross","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T21:55:03Z","title":"Neural Offset Min-Sum Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05931","kind":"arxiv","version":3},"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:3b2b473b3889b1b1db75cccbefd0321e4cfcae270ec98f0d1172699432c84cf7","target":"record","created_at":"2026-05-18T00:39:18Z","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":"025bc5f969273bc3227d9bf1db6797b67398a83f3af76e320b9b62ab62d62bc3","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T21:55:03Z","title_canon_sha256":"2f8d6677d3dbf7bc5fb531fc144f219c47a344f3f9ede7af4bd3c050a3d5fe53"},"schema_version":"1.0","source":{"id":"1701.05931","kind":"arxiv","version":3}},"canonical_sha256":"221385b25239113789bb36adcaabca54fd64e5cfe9c6c851778d5128a02cd591","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"221385b25239113789bb36adcaabca54fd64e5cfe9c6c851778d5128a02cd591","first_computed_at":"2026-05-18T00:39:18.091490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:18.091490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S6rl4wwV8KruoI6CquKHBo4gpRWnoSuaWzvSFeJNTUwSQmQgc6yex0NNHfoCWV4V0Rfl+GPhY8zLK6BPcGdnBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:18.092096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05931","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b2b473b3889b1b1db75cccbefd0321e4cfcae270ec98f0d1172699432c84cf7","sha256:dab6c34e69b4e30847b4dc81f1bb9016c84d00edf55756e62cd8ac005de5ef9b"],"state_sha256":"b5bbbce1c24e0ce9b19aba80a641e982dee139bccdda224fc6e60273d5ae2acd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3ZaUbdZT7olC2aQ6NIUHtH6mfcmt/8QXimcrf3byZNJkzkeWo6A+BQcSPim0YDcVUuIKOzLEpp1+nUI0ws3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:13:15.486460Z","bundle_sha256":"07e82c400d86ed4d251d883ec3920d60e1db56f149570ce3cb97d53684eb8dc5"}}