Pith. sign in

Paper Citation Record · LEDGER

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval

As of 4 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 1 inbound Pith citation observation for arXiv:2605.05189.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2605.05189 v1

Coverage vector

measured 52 of 52 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-08T16:23:37.393165Z

measured 53 of 53 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-04T06:34:03.388597+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-12T04:13:59.594279Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-05-12T06:31:25.657120Z

Reference resolution

52 of 52 outbound references displayed

  • verified exact11
  • verified fuzzy23
  • unresolved4
  • parse uncertain2
  • malformed identifier0
  • metadata mismatch12

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation effd35aa-24e7-4524-b898-cac0453ca8d2 · outbound

This paper cites an unresolved cited work.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unresolved cited work

Reference 1

Resolution
parse uncertain
raw_fallback, observed 2026-05-26T10:07:09.449634Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:7a0b1730526d1582f5d3c1e72148eea0417a5d9b80a84df2d413dc726b757f83

Observation 6b9f30fd-ad69-4e47-b955-19eea330bd0c · outbound

This paper cites Scaling Laws for Associative Memories.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Scaling Laws for Associative Memories

Reference 2

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T18:16:09.982062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:cefb051a9b6da8bdafafa4a49bd4d4022f985eee43ab33819c20724e350672af

Observation 4c23b168-17e3-4984-a6e7-2d6d183ef263 · outbound

This paper cites Understanding Factual Recall in Transformers via Associative Memories.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Understanding Factual Recall in Transformers via Associative Memories

Reference 3

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T18:16:10.005297Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:176191dc1dbb86f84677fd071a247f572194787a9da24d6e95cbe51a3a4f3aa1

Observation 90d742bf-299f-4abf-88bd-f200b4babff7 · outbound

This paper cites Birth of a Transformer: A Memory Viewpoint.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Birth of a Transformer: A Memory Viewpoint

Reference 4

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T18:16:10.087460Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:c2593895a662a6a48c697589adf676a88103ddd24310b77ac480e9b4693a5d93

Observation 4043c371-ee47-4af6-8152-efe3a5407f4c · outbound

This paper cites Sharp Capacity Scaling of Spectral Optimizers in Learning Associative Memory.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Sharp Capacity Scaling of Spectral Optimizers in Learning Associative Memory

Reference 5

Resolution
verified exact
local_arxiv, observed 2026-05-11T18:16:10.033987Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:fe95b33776d6d570896fd7609ec1313dda18d59986ab6c2fc8c05e2e43a9b241

Observation 97026a0a-e52c-49f0-b6cf-44ca9c43ad88 · outbound

This paper cites 1972 , volume=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval 1972 , volume=

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.456405Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:f8fece63ce7d83259616fbdae7b8ee981522475bd12b7d8e13c7142b3c4044fa

Observation 536dc822-2c09-48b1-8350-68147b13b0e6 · outbound

This paper cites journal=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval journal=

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.439728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:bd81e5f61bf31e89b13816eb2a5b60f17418d59aabfeb192c477297f695747e4

Observation 2b113155-0e8e-4a80-9fd5-9223acf5c350 · outbound

This paper cites year =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval year =

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.446076Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:d1d0f608c852df651de69c43ce30413fb4571977824a2e82611c5e96c7459786

Observation dc350cf4-ba5e-4cf0-83d3-f562e262ad0e · outbound

This paper cites and Kaiser.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval and Kaiser

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.432788Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:783ae7fd3c5a6e64607b23f2cdffb33a99b73f9cb33ff18169da670c99ee6332

Observation 244b94d9-9b16-423a-bc56-dc2354202bce · outbound

This paper cites Key-value memory in the brain.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Key-value memory in the brain

Reference 10

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T18:16:09.946205Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:6259620378fc5ee848037b895c1d321c114dab0c8131cbbf138a71993d289e5c

Observation 3d71dfb7-aef8-40f6-be19-78353bc7d56d · outbound

This paper cites Hopfield Networks is All You Need.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Hopfield Networks is All You Need

Reference 11

Resolution
metadata mismatch
arxiv_id, observed 2026-05-17T05:48:07.671009Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:d39a1c1e8d5dbd61c2b50cea3bd8f3477b035468dc9191800386aff5873549d4

Observation 4999bcbe-892c-498f-8632-96e3a5e8d59a · outbound

This paper cites Do LLMs dream of elephants (when told not to)? Latent concept association and associative memory in transformers.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Do LLMs dream of elephants (when told not to)? Latent concept association and associative memory in transformers

Reference 12

Resolution
verified exact
arxiv_id, observed 2026-05-11T18:16:10.139438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:0cb3dcf315479735f01b312e545416dcf793194eeb86c2b0ffd34c5a12e99bb7

Observation 1ba78d2f-af96-49c7-8b4c-d2bcd4943df9 · outbound

This paper cites 1972 , issn =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval 1972 , issn =

Reference 13

Resolution
verified exact
doi, observed 2026-05-08T20:19:09.990009Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:d2fc34139127f356d5c471d31d9a1c5966ae2807fe783054845b5ccefb0f2b82

Observation 9c2a25c8-168c-48cc-95ea-303f9a1a7f5b · outbound

This paper cites Locating and Editing Factual Associations in.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Locating and Editing Factual Associations in

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.497878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:f7dd0f49c66dac3712721c2092759a8f4c39ceffcd566b63063bed619f740a1f

Observation d7ac6e75-a811-445e-ae31-cb332fa05a0e · outbound

This paper cites Transformer Feed-Forward Layers Are Key-Value Memories.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Transformer Feed-Forward Layers Are Key-Value Memories

Reference 15

Resolution
metadata mismatch
arxiv_id, observed 2026-05-13T23:35:50.837220Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:3cd8d976591a1dcea7a36d4d3e697a846e4c2f8e6e2eb381674fd9592779cb2b

Observation b5ef011f-cd8c-4cf0-9f16-bff5aee9ff80 · outbound

This paper cites Toy Models of Superposition.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Toy Models of Superposition

Reference 16

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T22:44:43.591728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:83d489b1e473997fd4ccfc18a0c3e34318cd675c02cabfec7ba37b20e41c4c8b

Observation 7b637b87-85e6-4f3e-b799-2a8bccc8300e · outbound

This paper cites [Lac23] Daniel Lacker.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval [Lac23] Daniel Lacker

Reference 17

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T18:16:09.997242Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:cdd97bdb36980770e4c47841a71107a65609cbe45e4626ef997bf43c457f03bf

Observation 7d5087d2-6601-4d87-b06c-09063fe1fbfd · outbound

This paper cites Tyrrell and Uryasev, Stanislav , year =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Tyrrell and Uryasev, Stanislav , year =

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.422471Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:48f29e9518f200464db219e2f5839bc3696b78aab666cf8dc7f0af3153b8d498

Observation 768688d5-7bdc-4a60-a9de-f34fc947ba7e · outbound

This paper cites Tyrrell and Uryasev, Stanislav , year =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Tyrrell and Uryasev, Stanislav , year =

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.425786Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:b1ed17940d32fa1ebd5503f6d541f1abd226202715f2f3f1ba506840aa8cc454

Observation 8f564f63-f79f-44d8-9da8-6e284cfac67f · outbound

This paper cites and Lim, Chinghway and Yu, Bin , title =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval and Lim, Chinghway and Yu, Bin , title =

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.429623Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:cb23a6c1f48cb174c90dab28a6dfafa37bc5b75694b29729128970485a14184c

Observation f6f73f50-4e59-4556-b4b8-9c6ef6c1d22c · outbound

This paper cites and El Karoui, Noureddine , title =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval and El Karoui, Noureddine , title =

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.443051Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:662245b4020aa15372762ba0d99a5dd2edda5b9256517a3199fe2bd41828d7b1

Observation c3e0fe83-4063-4a37-aa16-8d317c79d78e · outbound

This paper cites Probability Theory and Related Fields , volume =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Probability Theory and Related Fields , volume =

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.415653Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:464335a2fd535a2dbe02c4e394c631ab50fd1f1501381bd47e879fc1b8163e02

Observation fb2d64d1-8ece-4d73-8f18-df0f65c5e147 · outbound

This paper cites an unresolved cited work.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unresolved cited work

Reference 23

Resolution
parse uncertain
raw_fallback, observed 2026-05-26T10:07:09.409209Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:83809382b67c75c07a30193456ec2213789ba3ea922c23f1f02493b76e6614cd

Observation 1c710cdf-afd4-454a-bf14-3e23ff8ba397 · outbound

This paper cites Foundations and Trends in Theoretical Computer Science , volume =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Foundations and Trends in Theoretical Computer Science , volume =

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.419006Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:e73557a19e908c2ecc965a52ffe932e504f24033cf05f2e9c8a781ce3e77f742

Observation e49209cd-52af-40f3-872f-c704f6f7a2e6 · outbound

This paper cites Proceedings of the 24th International Conference on Machine Learning , pages =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Proceedings of the 24th International Conference on Machine Learning , pages =

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.412285Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:3ef92667cee73343361d9e9e14f384d783d1757654380f0f54c6fdabe5fa1655

Observation 36de966d-e016-4390-9fd4-d20c93e734e7 · outbound

This paper cites 1972 , volume=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval 1972 , volume=

Reference 26

Resolution
verified exact
arxiv_id, observed 2026-05-08T20:19:09.985870Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:5facf513e79b2c0e1624923a3ce0c3308d1501fb44eb33760ba92787876b14bf

Observation a1394f65-c01d-4b6b-b279-49119e439689 · outbound

This paper cites an unresolved cited work.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unresolved cited work

Reference 27

Resolution
unresolved
raw_fallback, observed 2026-05-26T10:07:09.436254Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:ce6636d3d081cfe0bdf51352b0ef8bdb782f1a719748b620a166a16cb2fd4bd4

Observation f2357003-c3dc-4793-9743-0999ff3653cd · outbound

This paper cites an unresolved cited work.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unresolved cited work

Reference 28

Resolution
unresolved
raw_fallback, observed 2026-05-26T10:07:09.460109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:a691449820b878232557350f8d00d160388a5f9dcac09f51243fdfe62a0e00df

Observation 40c94373-bb27-4d33-b4b2-59ccb304c8da · outbound

This paper cites Gardner , title =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Gardner , title =

Reference 29

Resolution
verified exact
doi, observed 2026-05-08T20:19:09.969494Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:2caa25afe933acb17330dcd7b405f6b7daf33193e94698dbed17835c9c681dfa

Observation 690e6774-a46f-4ded-933a-1d2763a274d1 · outbound

This paper cites title=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval title=

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.483443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:95b1a1e5b9088e61dfbfc17947e7d393c197f0390de246cec439996f973512c4

Observation 251e17e8-dfc3-404d-b08a-a89745a2724b · outbound

This paper cites Gardner , title=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Gardner , title=

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.501338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:a3e0bb1205a6a4dbffff1d2a79b6381e3d1e2ae2d6c7edd5c02028214c318c2a

Observation f6173546-b373-4fd1-b917-0728fbdefb0f · outbound

This paper cites Neural Turing Machines.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Neural Turing Machines

Reference 32

Resolution
metadata mismatch
arxiv_id, observed 2026-05-13T07:34:44.411886Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:12d7154ebf83b661fdadfb94a02aed18e9e7440aa2c84406135ca2db74789c3c

Observation 85f14ea2-7bf2-485a-a6aa-32d3c7526fd2 · outbound

This paper cites Memory Networks.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Memory Networks

Reference 33

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T18:16:09.988795Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:7dfe8f8db8470b62e9927f544bdc7c55240e3b1d778c75393a9c62651db0404c

Observation e51c7ab3-bfe2-4b42-854a-11bc39137eee · outbound

This paper cites Dense Associative Memory for Pattern Recognition.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Dense Associative Memory for Pattern Recognition

Reference 34

Resolution
verified exact
arxiv_id, observed 2026-07-04T21:50:43.575477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:19d9398bfa464cc31bd3350f3914154913b045dd47ba8196abb0c9ff0c6ebe20

Observation 81a2b5e3-34ed-42d2-b6dd-504d568d5fb1 · outbound

This paper cites Advances in Neural Information Processing Systems , year=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Advances in Neural Information Processing Systems , year=

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.505271Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:3f33d4acd95d34c7ba96f2f084478b440c5383459a422bcddcdc92c64bbde9c6

Observation a82d48ab-f1ae-422c-84b8-198958ed622b · outbound

This paper cites Universal Hopfield Networks: A General Framework for Single-Shot Associative Memory Models.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Universal Hopfield Networks: A General Framework for Single-Shot Associative Memory Models

Reference 36

Resolution
verified exact
arxiv_id, observed 2026-05-11T18:16:09.907049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:dc0da5993a2f84f98bfeb55df02c9b8ebc0c9df36fd9a4ef3df1899345b8e20f

Observation c8b17a7a-e22b-4e42-bde3-aab89807ec82 · outbound

This paper cites Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Laws

Reference 37

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T18:16:09.968352Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:58ad8654d6ae3be560800398d60f21ec1b97a07e77fca9ed554cbf4e904bdd5e

Observation 5a4c6742-2a1a-4c55-9321-5472a12b08d7 · outbound

This paper cites Physical Review Letters , publisher=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Physical Review Letters , publisher=

Reference 38

Resolution
verified exact
doi, observed 2026-05-08T20:19:09.974044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:9452ca913f49f693e95ec5a705ed7e16caa7ed6ebd301d6de63ab6d907a16c72

Observation 6682463b-b491-4b85-8cfb-e827b819d1c1 · outbound

This paper cites Frontiers in Computational Neuroscience , year =.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Frontiers in Computational Neuroscience , year =

Reference 39

Resolution
verified exact
arxiv_id, observed 2026-05-08T20:19:09.966137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:9b689ae5c6fad09217639efd6efcfb57a3bfbf8df9a6cbfbd57d8cbdf87c381f

Observation d945925d-d64b-4a43-bf56-7c46ae8e673f · outbound

This paper cites IEEE Transactions on Information Theory , year=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval IEEE Transactions on Information Theory , year=

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.476794Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:4cc857425470ca9345b2af01803d52a412c72cec8f1d7a873e3e221a30f11193

Observation 3fd43785-8a34-4790-9fac-b5e766f7b680 · outbound

This paper cites 2603.15923 , archivePrefix=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval 2603.15923 , archivePrefix=

Reference 41

Resolution
verified exact
arxiv_id, observed 2026-05-11T18:16:10.145530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:4ba72cdccc893ce71239046ccaed4eccc264463e012837c3db699dd226aac809

Observation ce51becf-2590-428c-8a2e-43ea8d5254bd · outbound

This paper cites The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression

Reference 42

Resolution
verified exact
arxiv_id, observed 2026-07-04T22:43:44.669896Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:18a597b4ab9256268b768535ce7c41916818db7c2147728a9dd65bc1d1a5a05b

Observation e6c7dc7e-e906-4b59-8f39-ef5249d2d269 · outbound

This paper cites Proceedings of the National Academy of Sciences , year=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Proceedings of the National Academy of Sciences , year=

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.480254Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:42f1c9c4708f6212e188cf9187d940f67df5718bffd5952567795fe5f3643292

Observation 0b21fd58-4507-4323-a226-2161d24ced6f · outbound

This paper cites Proceedings of the National Academy of Sciences , year=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Proceedings of the National Academy of Sciences , year=

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.486596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:94735b98b026009ffa85798b9c7f52a8bae78b8a155dd5464e8038218f09ab5c

Observation e0d4248a-5298-4a41-8e2b-e1b58dc184c0 · outbound

This paper cites and Zdeborov.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval and Zdeborov

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.493591Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:19c9322c74df4c3d906340e8d428f804423d98da08dff047f207e7f8496ba394

Observation 713ff5c1-3a15-4c6e-b1bd-3f388b0369a0 · outbound

This paper cites International conference on machine learning , pages=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval International conference on machine learning , pages=

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.473428Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:0fd9c7c6255189082e1b25d50952203ba4ab37b3d550f308e486b3bae1f8667b

Observation 64cd932e-b9f1-48c3-b178-762813e8b388 · outbound

This paper cites Learning Associative Memories with Gradient Descent.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Learning Associative Memories with Gradient Descent

Reference 47

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T18:16:10.107695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:41c36d86b49bd806f0531706a9af03a20bb56622abdbdb7da5ac3f8423960cec

Observation 7d67fc30-f793-4c2a-99c3-7917b902bd15 · outbound

This paper cites an unresolved cited work.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unresolved cited work

Reference 48

Resolution
unresolved
raw_fallback, observed 2026-05-26T10:07:09.467004Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:4d3f9c3440a3cad5538d571b6fe83eb4b09c295e7bdd5720f4f38dfb2439499f

Observation ec1ca4ac-590d-436e-9e0f-05d1d321accd · outbound

This paper cites 1973 , volume=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval 1973 , volume=

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.470229Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:67bf7bbd3ccf000dd2e70ae8801948f822fdf41214641116f246c5a47c010ef4

Observation 606bd394-6abc-4038-b946-0003f15cfdab · outbound

This paper cites journal=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval journal=

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.490125Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:dc34c8675b53f095ad81bea4fae2b894cd7c88d5b8c14d7ff35e8f9775655d36

Observation 20d4f791-e372-4e46-b222-3cf7425d83ed · outbound

This paper cites an unresolved cited work.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unresolved cited work

Reference 51

Resolution
unresolved
raw_fallback, observed 2026-05-26T10:07:09.463847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:4e440bdba51d861a62ee76122c6d0b4a70eae9f4f6e7a6e8eee29418696597ca

Observation 0ae4cf97-23b9-40f6-bcb5-607187610ea7 · outbound

This paper cites Journal of Statistical Physics , volume=.

Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Journal of Statistical Physics , volume=

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-05-26T10:07:09.452979Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=arxiv_source observed=2026-05-08T16:23:37.393165Z digest=sha256:43728094d0148102d0920614ef4d0d2d83f198486618a22c39d937d54d5e9397

Pith citing papers

Observation 28919e21-68a3-449c-912f-8e3770ef527e · inbound

Factual recall in linear associative memories: sharp asymptotics and mechanistic insights cites this paper.

Factual recall in linear associative memories: sharp asymptotics and mechanistic insights Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval

Reference 28

Resolution
verified exact
local_arxiv, observed 2026-05-12T06:31:25.660164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

source=pdf_text observed=2026-05-12T04:13:59.594279Z digest=sha256:07a7363ce790968da325e261036ea34d435ce501b40300657cfc777e624ccbf6