{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YLRHEWRYPDGOE4RUDFE3H3DRCH","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":"6eb39b5050aa813cde3f1a7686800dc5ef36b2bb239e1cfe6ac327cbb6d3cd56","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-05-20T14:34:23Z","title_canon_sha256":"7df78dbe10e513ffafe21bcea39af6c800be17e06cc64d8c2ac58b7c38651109"},"schema_version":"1.0","source":{"id":"1505.05401","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05401","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05401v2","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05401","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"pith_short_12","alias_value":"YLRHEWRYPDGO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YLRHEWRYPDGOE4RU","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YLRHEWRY","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:9c8185bac72477e10814ff14b0882665b699699943f9c9e360f0f1b81383545d","target":"graph","created_at":"2026-05-18T01:35:22Z","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":"We present an efficient learning algorithm for the problem of training neural networks with discrete synapses, a well-known hard (NP-complete) discrete optimization problem. The algorithm is a variant of the so-called Max-Sum (MS) algorithm. In particular, we show how, for bounded integer weights with $q$ distinct states and independent concave a priori distribution (e.g. $l_{1}$ regularization), the algorithm's time complexity can be made to scale as $O\\left(N\\log N\\right)$ per node update, thus putting it on par with alternative schemes, such as Belief Propagation (BP), without resorting to ","authors_text":"Alfredo Braunstein, Carlo Baldassi","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-05-20T14:34:23Z","title":"A Max-Sum algorithm for training discrete neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05401","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:d28b913e6a2037dae4e142d4ef8758b9e336ed6a46ad03333c546639c89ea96b","target":"record","created_at":"2026-05-18T01:35:22Z","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":"6eb39b5050aa813cde3f1a7686800dc5ef36b2bb239e1cfe6ac327cbb6d3cd56","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-05-20T14:34:23Z","title_canon_sha256":"7df78dbe10e513ffafe21bcea39af6c800be17e06cc64d8c2ac58b7c38651109"},"schema_version":"1.0","source":{"id":"1505.05401","kind":"arxiv","version":2}},"canonical_sha256":"c2e2725a3878cce272341949b3ec7111f812c468b2f8f3d8d0e2b52d7037fdf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2e2725a3878cce272341949b3ec7111f812c468b2f8f3d8d0e2b52d7037fdf8","first_computed_at":"2026-05-18T01:35:22.252654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:22.252654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eNUv5VkrXwEBdLEp9cq+v2PAFmYXrYb5e/jkvBa39ZZGQA6iFzo6O9Ax8D6JqWFj2vhGPNxMtm0lqOjKmUeJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:22.253389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05401","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d28b913e6a2037dae4e142d4ef8758b9e336ed6a46ad03333c546639c89ea96b","sha256:9c8185bac72477e10814ff14b0882665b699699943f9c9e360f0f1b81383545d"],"state_sha256":"5833f3fa57e7bc694b7609172e51de79b5d65cefe3e87814f78a62f938d9fb5b"}