{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:Y4U6JS2SCK7JI5UFDPZPUQJZBV","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":"1ba47ba7d21390be306b536cbf58dc0b7573200d24913aacb8f369457c24a29d","cross_cats_sorted":["cs.CL","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-16T17:52:37Z","title_canon_sha256":"aa4c7031940ca65cfd28ae9a8ea533d9d267004f60a6c8e30a5d154df26fd115"},"schema_version":"1.0","source":{"id":"2008.02217","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02217","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02217v3","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02217","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"Y4U6JS2SCK7J","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y4U6JS2SCK7JI5UF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y4U6JS2S","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:76e881151eec19164fcf0857a0c3f706a9cf4ebe544c5f366e5ecb1a8e6ff557","target":"graph","created_at":"2026-05-17T23:38:14Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The new update rule is equivalent to the attention mechanism used in transformers. This equivalence enables a characterization of the heads of transformer models."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the continuous-state Hopfield dynamics remain stable and useful when inserted as layers inside large-scale gradient-trained networks without introducing new optimization difficulties or losing the claimed exponential capacity."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Modern Hopfield networks store exponentially many patterns, retrieve them in one update, and have an update rule equivalent to transformer attention, enabling new Hopfield layers that improve results on multiple instance learning and drug design tasks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A modern Hopfield network with continuous states has an update rule identical to the attention mechanism in transformers."}],"snapshot_sha256":"df5a9d04f451a58029b1e9fd0662399c2464ad204daa43fb69b8a542cc7fe7e2"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"4f43c03e7ad6d31f44a8ede4cc7a0fae6baaee1ea8543a589d0d3ab30ccfd4f5"},"paper":{"abstract_excerpt":"We introduce a modern Hopfield network with continuous states and a corresponding update rule. The new Hopfield network can store exponentially (with the dimension of the associative space) many patterns, retrieves the pattern with one update, and has exponentially small retrieval errors. It has three types of energy minima (fixed points of the update): (1) global fixed point averaging over all patterns, (2) metastable states averaging over a subset of patterns, and (3) fixed points which store a single pattern. The new update rule is equivalent to the attention mechanism used in transformers.","authors_text":"Bernhard Sch\\\"afl, David Kreil, Geir Kjetil Sandve, G\\\"unter Klambauer, Hubert Ramsauer, Johannes Brandstetter, Johannes Lehner, Lukas Gruber, Markus Holzleitner, Michael Kopp, Michael Widrich, Milena Pavlovi\\'c, Philipp Seidl, Sepp Hochreiter, Thomas Adler, Victor Greiff","cross_cats":["cs.CL","cs.LG","stat.ML"],"headline":"A modern Hopfield network with continuous states has an update rule identical to the attention mechanism in transformers.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-16T17:52:37Z","title":"Hopfield Networks is All You Need"},"references":{"count":300,"internal_anchors":9,"resolved_work":300,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics , series =","work_id":"8891cd09-c3eb-4a49-a352-fb2a2a140b86","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"van den Oord and Y","work_id":"eed854c9-3f89-4de0-83eb-7a3c3ce42be0","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A Simple Framework for Contrastive Learning of Visual Representations , author=. CoRR , volume=","work_id":"126ebef3-deef-4d5f-a06d-39ad99864787","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Advances in Neural Information Processing Systems , pages=","work_id":"6728043f-811c-4eaf-a145-c1e9aa5983e6","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Layer normalization , author=. ArXiv , eprint=","work_id":"36e95ebd-db7d-44bd-ba96-957c6b972c28","year":null}],"snapshot_sha256":"df35e7cb11a16074e15833902468eae4b86d2ec7e4dd0c82b86113fd97744a4d"},"source":{"id":"2008.02217","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-17T05:42:06.521473Z","id":"312fcfdc-3e37-41eb-8fa8-490232bda227","model_set":{"reader":"grok-4.3"},"one_line_summary":"Modern Hopfield networks store exponentially many patterns, retrieve them in one update, and have an update rule equivalent to transformer attention, enabling new Hopfield layers that improve results on multiple instance learning and drug design tasks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A modern Hopfield network with continuous states has an update rule identical to the attention mechanism in transformers.","strongest_claim":"The new update rule is equivalent to the attention mechanism used in transformers. This equivalence enables a characterization of the heads of transformer models.","weakest_assumption":"That the continuous-state Hopfield dynamics remain stable and useful when inserted as layers inside large-scale gradient-trained networks without introducing new optimization difficulties or losing the claimed exponential capacity."}},"verdict_id":"312fcfdc-3e37-41eb-8fa8-490232bda227"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c0545f3c8f69acbf92c6040b947202bff3c4ea92b2ade5d1fcee83ce6e6374c4","target":"record","created_at":"2026-05-17T23:38:14Z","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":"1ba47ba7d21390be306b536cbf58dc0b7573200d24913aacb8f369457c24a29d","cross_cats_sorted":["cs.CL","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-16T17:52:37Z","title_canon_sha256":"aa4c7031940ca65cfd28ae9a8ea533d9d267004f60a6c8e30a5d154df26fd115"},"schema_version":"1.0","source":{"id":"2008.02217","kind":"arxiv","version":3}},"canonical_sha256":"c729e4cb5212be9476851bf2fa41390d6396ba71a78601f5e49c5282ead7108e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c729e4cb5212be9476851bf2fa41390d6396ba71a78601f5e49c5282ead7108e","first_computed_at":"2026-05-17T23:38:14.915710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:14.915710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"30DQMrpkR+M9K4/VQpJn5Ec2+9LM7D59CbzmOeogkhi25smE139MIb5IvEaR8dg4kPx5QOKiVLt7jYKKRajkDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:14.916504Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.02217","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0545f3c8f69acbf92c6040b947202bff3c4ea92b2ade5d1fcee83ce6e6374c4","sha256:76e881151eec19164fcf0857a0c3f706a9cf4ebe544c5f366e5ecb1a8e6ff557"],"state_sha256":"6e027f780f229716ea830c869ddac0dfebaaa524b480fa4fca4f28483b990205"}