pith. the verified trust layer for science. sign in
Pith Number

pith:Y4U6JS2S

pith:2020:Y4U6JS2SCK7JI5UFDPZPUQJZBV
not attested not anchored not stored refs resolved

Hopfield Networks is All You Need

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

A modern Hopfield network with continuous states has an update rule identical to the attention mechanism in transformers.

arxiv:2008.02217 v3 · 2020-07-16 · cs.NE · cs.CL · cs.LG · stat.ML

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{Y4U6JS2SCK7JI5UFDPZPUQJZBV}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

References

300 extracted · 300 resolved · 9 Pith anchors

[1] Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics , series =
[2] van den Oord and Y
[3] A Simple Framework for Contrastive Learning of Visual Representations , author=. CoRR , volume=
[4] Advances in Neural Information Processing Systems , pages=
[5] Layer normalization , author=. ArXiv , eprint=

Formal links

3 machine-checked theorem links

Cited by

23 papers in Pith

Receipt and verification
First computed 2026-05-17T23:38:14.915710Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

c729e4cb5212be9476851bf2fa41390d6396ba71a78601f5e49c5282ead7108e

Aliases

arxiv: 2008.02217 · arxiv_version: 2008.02217v3 · doi: 10.48550/arxiv.2008.02217 · pith_short_12: Y4U6JS2SCK7J · pith_short_16: Y4U6JS2SCK7JI5UF · pith_short_8: Y4U6JS2S
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/Y4U6JS2SCK7JI5UFDPZPUQJZBV \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: c729e4cb5212be9476851bf2fa41390d6396ba71a78601f5e49c5282ead7108e
Canonical record JSON
{
  "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
  }
}