{"as_of":"2026-08-15T16:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7d23e7bc28b0c2b052d33b5495d31320e64a2b85c9077ea2c5c963f683648997","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T16:18:40.200429Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2512.14338/citation-record","integrity":"/paper/2512.14338/integrity","json":"/paper/2512.14338/citation-record.json","paper":"/paper/2512.14338"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:35.313771Z","title":"Hopfield","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:35.313771Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:c9b3ee32e9c606e52effd126030392e39414fe9451e1573505b34a8a070a0716","observation_id":"e31939f9-d909-4c98-9374-1d3c7ac4eeb2","resolution":{"observed_at":"2026-08-03T16:18:35.313771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:35.362727Z","title":"The perceptron: a probabilistic model for information storage and organization in the brain","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:35.362727Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:19197550bf7cf3b937d253cb3067a2fdb14ff64facb736185bef98281e34cd63","observation_id":"d6c917eb-ac9a-42ab-bbc4-1ed073b92a53","resolution":{"observed_at":"2026-08-03T16:18:35.362727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:35.429251Z","title":"Non-holographic associative memory.Nature, 222(5197):960–962, 1969","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:35.429251Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:0d26451f40b58a26927c95e5830c9afe65231092a95265a888cffc72dc9a5c51","observation_id":"53a6674a-7f64-4655-92a8-84fce0259cc5","resolution":{"observed_at":"2026-08-03T16:18:35.429251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:35.507229Z","title":"Learning patterns and pattern sequences by self-organizing nets of threshold elements.IEEE Transactions on computers, 100(11):1197–1206, 1972","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:35.507229Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:56a398451982d2ca46cf9ac21cca57fa7fc075ab8481a03c564c794fb50e9be5","observation_id":"b6bc4f3f-ebd8-4623-a896-247c5f5c596f","resolution":{"observed_at":"2026-08-03T16:18:35.507229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:35.565758Z","title":"The existence of persistent states in the brain.Mathematical biosciences, 19(1-2):101–120, 1974","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:35.565758Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:2124236bfeab390b4d19f3d4d00943ea2fb5d0133b1062995c004c72ca1482ee","observation_id":"c7af4ac0-289f-4a0c-b734-0596acf87dcd","resolution":{"observed_at":"2026-08-03T16:18:35.565758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:35.637520Z","title":"Exactly soluble model of a spin glass.Soviet Journal of Low Temperature Physics, 3(6):378–383, 1977","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:35.637520Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:b5b0fecb3902c3e785b4b4e94d1bb30284d6fe765e795953ea4ba3c02f4bcde9","observation_id":"e75d376d-452c-41af-b4d4-ecbfe36e5377","resolution":{"observed_at":"2026-08-03T16:18:35.637520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:35.704143Z","title":"A logical calculus of the ideas immanent in nervous activity.The bulletin of mathematical biophysics, 5:115–133, 1943","venue":null,"work_id":null,"year":1943},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:35.704143Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:db6372f9e6a3c85dec7a4831ff6f55fcdac86125eda3ec43d4709c74319e19e6","observation_id":"75de890a-dacb-4727-b079-e047de11530f","resolution":{"observed_at":"2026-08-03T16:18:35.704143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:35.889671Z","title":"Robust exponential memory in Hopfield networks.The Journal of Mathematical Neuroscience, 8:1–20, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:35.889671Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:6e3d737922fecb09ada9f86e9c862cf623b06cea97b86e3f9b5e0a10d52cd8d2","observation_id":"36c13425-f33d-4157-a060-8f061927373b","resolution":{"observed_at":"2026-08-03T16:18:35.889671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.043752Z","title":"Hidden hypergraphs, error-correcting codes, and critical learning in Hopfield networks.Entropy, 23(11), 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.043752Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:883fa98d963c0e0210a043ce7ea3fc1cd247fbdb88659c3a1a0050af55be5eea","observation_id":"d29f7233-9651-46df-b2ed-bf87bc817d2d","resolution":{"observed_at":"2026-08-03T16:18:36.043752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.089173Z","title":"Efficient and optimal binary Hopfield associative memory storage using minimum probability flow","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.089173Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:78c424d509a0c9736c3ce7934c56ba6c6bc9626d69ea970ee6dae2e017af0095","observation_id":"444d58ae-7448-44bd-8e06-305aa548fbe7","resolution":{"observed_at":"2026-08-03T16:18:36.089173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.166423Z","title":"Finding hidden cliques in linear time with high probability","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.166423Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:046f627145ebd3b2daf8cf662a2d815a92df460278e0238a0bf56ca6ca428ed0","observation_id":"247b2338-cdb8-4930-ae41-21d36117594e","resolution":{"observed_at":"2026-08-03T16:18:36.166423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.225425Z","title":"Storing infinite numbers of patterns in a spin-glass model of neural networks.Physical Review Letters, 55(14):1530, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.225425Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:97203cb417c42325e7f3fc4350d253304c85c3f6c343e18d0a9606d3de6d3491","observation_id":"8ed80bd0-bbe8-46d6-8510-9366308c7ca4","resolution":{"observed_at":"2026-08-03T16:18:36.225425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.328603Z","title":"The space of interactions in neural network models.Journal of Physics A: Mathematical and General, 21(1):257, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.328603Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:0a5b5494ffbcb8edefd5bb926a13b4146ff041973ef68e339ec3f921a3da36d5","observation_id":"4d678da2-80d3-4de8-b969-2bb2f35a8b89","resolution":{"observed_at":"2026-08-03T16:18:36.328603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.426630Z","title":"Storage capacity of memory networks with binary couplings.Journal de Physique, 50(20):3057–3066, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.426630Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:61709d94b3ce6cc7dc942b532bd398bc80489eafa6fc9d16aa53a0d998a84873","observation_id":"3cfdd09f-cb96-41a3-8135-8c4f2e217c3a","resolution":{"observed_at":"2026-08-03T16:18:36.426630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.523581Z","title":"McEliece, Edward C","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.523581Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:647e8fb695295b3ad61ec9de3c0c23527408c554eb056370a8ff75579f3091be","observation_id":"82957488-08f1-4649-97de-5beeb106f68a","resolution":{"observed_at":"2026-08-03T16:18:36.523581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.663430Z","title":"Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition.IEEE Transactions on Electronic Computers, 14(14):326–334, 1965","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.663430Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:c2dd3326fc88b521e9041ac332a6b54b1d6db7d1b2f7caa979242af76e6b50be","observation_id":"f01b1afe-5b55-4de1-8cff-bf9be15e3893","resolution":{"observed_at":"2026-08-03T16:18:36.663430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.795763Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.795763Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:b92524e74c60f96ff4dc5bfed0f34d4d10b812b516a23c5d1dab757f06afe71d","observation_id":"f716227e-1ffd-437a-acb1-83e36de6b43d","resolution":{"observed_at":"2026-08-03T16:18:36.795763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.916344Z","title":"Characteristics of sparsely encoded associative memory.Neural networks, 2(6):451–457, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.916344Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:68d7ecfafe9b33822435736f1d22914b1e0d5eb631c9210dd5257f5d18d95a5c","observation_id":"5e1438e6-6f86-4406-943b-26c89c804f07","resolution":{"observed_at":"2026-08-03T16:18:36.916344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:36.984581Z","title":"Dense associative memory for pattern recognition.Advances in Neural Information Processing Systems (NeurIPS), 29, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:36.984581Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:d710b88cc6b0960ea37e38840ebd3deac04b44d15663f9f629f19127be76e0b1","observation_id":"5eb1d987-5d2f-40f0-8869-1a29008de511","resolution":{"observed_at":"2026-08-03T16:18:36.984581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:37.037105Z","title":"Capacities of multiconnected memory models.Journal de Physique, 49(3):389–395, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:37.037105Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:993c6125931fca4cd94d3c7df5d301e38d2bd97c8456b325876f74e141da857f","observation_id":"f798060e-e0c9-4b9c-9319-ba4ff1932a9b","resolution":{"observed_at":"2026-08-03T16:18:37.037105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:37.114577Z","title":"Hopfield networks is all you need","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:37.114577Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:b054eb42a258231a42d7494e93f397db99a1eae7b178f50ac1c4a868ddb8afbb","observation_id":"8c3fcc58-8ad3-408c-af35-ca4614faeb24","resolution":{"observed_at":"2026-08-03T16:18:37.114577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:37.231838Z","title":"On a model of associative memory with huge storage capacity.Journal of Statistical Physics, 168(2):288–299, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:37.231838Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:286cb0f254adbff85def8daf6a0fae87c7b20c04b68aaf9c446f46610e0a5cde","observation_id":"948ed99d-6eac-4ca0-98cc-01f24f59527a","resolution":{"observed_at":"2026-08-03T16:18:37.231838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:37.350899Z","title":"Generalization in a Hopfield network.Journal de Physique, 51(21):2421–2430, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:37.350899Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:59a36ee05de8cdcbc2248ef8cfd71d40cc456e78bffee24b3770d911710cc414","observation_id":"fe16f47e-6b30-42d8-854d-755d0029e0fa","resolution":{"observed_at":"2026-08-03T16:18:37.350899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16880","last_updated":"2023-04-28T16:09:36Z","snapshot_observed_at":"2026-08-13T12:13:52.544776Z","submitted_at":"2023-03-29T17:39:21Z","title":"Storage and Learning phase transitions in the Random-Features Hopfield Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16880","snapshot_observed_at":"2026-08-03T16:18:37.432905Z","title":"Storage and learning phase transitions in the random-features Hopfield model.arXiv preprint arXiv:2303.16880, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:37.432905Z"},"links":{"cited_paper":"/paper/2303.16880","citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:6b083ffa85b6a0e66491fa545187062a034a2450e7c05b67ebfc58494de4f50f","observation_id":"a4b5ed0e-8ddc-46d6-bfc9-399ebe896c46","resolution":{"observed_at":"2026-08-03T16:18:37.432905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05658","last_updated":"2024-07-08T06:35:13Z","snapshot_observed_at":"2026-08-15T00:34:12.913860Z","submitted_at":"2024-07-08T06:35:13Z","title":"Random Features Hopfield Networks generalize retrieval to previously unseen examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.05658","snapshot_observed_at":"2026-08-03T16:18:37.633196Z","title":"Malatesta, and Matteo Negri","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:37.633196Z"},"links":{"cited_paper":"/paper/2407.05658","citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:4d29aa9d69d71043ef5c28b20a4753e579eb82e1e93635bcf6680a549133bd75","observation_id":"2158145a-4100-437a-84d2-47ac644273e5","resolution":{"observed_at":"2026-08-03T16:18:37.633196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:37.808391Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:37.808391Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:e6eb5b2b4547926c247a140b1c3ea38e9614bf72dcb2c02f42868db32e92bdff","observation_id":"eb9d3bfa-d131-45c5-a958-9e5142aa61ea","resolution":{"observed_at":"2026-08-03T16:18:37.808391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:37.860572Z","title":"A kernel theory of modern data augmentation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:37.860572Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:447496811c9cb0f3e275b64939cba3c32890a620ef47111b01fd58fbfea71764","observation_id":"541972ed-b379-4c58-9598-3f94004ef7f7","resolution":{"observed_at":"2026-08-03T16:18:37.860572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.012577Z","title":"Provably strict generalisation benefit for invariance in kernel ridge regression","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.012577Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:bbe6c0d1060a39ae6048795b874b35225ca3fc7eb8b1fe7d5eef5ede805287ad","observation_id":"8160b1ed-a7f2-4aa3-a2f2-1d7a3ff09cb5","resolution":{"observed_at":"2026-08-03T16:18:38.012577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.076946Z","title":"Gerken and Pan Kessel","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.076946Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:2e24b779d17a0df5f441e2d749331f59ce9073211a6b8261d0b5c82be45f22ad","observation_id":"02ccb55c-d02d-4adb-9dd8-c075df15af59","resolution":{"observed_at":"2026-08-03T16:18:38.076946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06504","last_updated":"2025-01-31T14:56:51Z","snapshot_observed_at":"2026-08-12T23:46:13.593467Z","submitted_at":"2024-06-10T17:43:13Z","title":"Equivariant Neural Tangent Kernels","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06504","snapshot_observed_at":"2026-08-03T16:18:38.179658Z","title":"Klindt, Anne E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.179658Z"},"links":{"cited_paper":"/paper/2406.06504","citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:11b370d31284c459018439cd7ab45435d727a8599e3f1065db51d4da8085abd6","observation_id":"a8189998-2e65-4b73-95e5-4c7ca62dd8d0","resolution":{"observed_at":"2026-08-03T16:18:38.179658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.248393Z","title":"The implicit bias of gradient descent on separable data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.248393Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:782e07eddcb62c203039dafd806161a415d26a92b99cab9a03d04f8f9b00b1fb","observation_id":"03442a54-2261-4434-84f6-8eeb36dcdcf5","resolution":{"observed_at":"2026-08-03T16:18:38.248393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.07300","last_updated":"2019-06-08T13:57:05Z","snapshot_observed_at":"2026-08-14T19:34:29.603750Z","submitted_at":"2018-03-20T08:47:27Z","title":"Risk and parameter convergence of logistic regression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.07300","snapshot_observed_at":"2026-08-03T16:18:38.365132Z","title":"Risk and parameter convergence of logistic regression.arXiv preprint arXiv:1803.07300, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.365132Z"},"links":{"cited_paper":"/paper/1803.07300","citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:6c249a33ad9454c1b475d7aac7e70b98cfa9795e2b40ce5e57d53d1b8bb3f8a1","observation_id":"da3d036f-a3e9-40ce-be0b-3250abb58ee0","resolution":{"observed_at":"2026-08-03T16:18:38.365132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.424184Z","title":"Lee, Suriya Gunasekar, Pedro Henrique Pamplona Savarese, Nathan Srebro, and Daniel Soudry","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.424184Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:2a0c97a1d446ab56522ab01e73a3ea5f77791616c3c475a8468a0dcbb78bd8e7","observation_id":"1fe19287-c502-44a6-b4cd-55eaf86fefa9","resolution":{"observed_at":"2026-08-03T16:18:38.424184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.511090Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.511090Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:dae509bb392c9b4984e7a7d3c06bcb2f26ca01d7851301e09527880e906d3e17","observation_id":"536ac6c3-50f1-4b6b-be44-83de83f54e2f","resolution":{"observed_at":"2026-08-03T16:18:38.511090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.582111Z","title":"Addison-Wesley, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.582111Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:9cf6ceeff4cb68191e996fd6312f4f54a309197c1bb5d8d2fd201dd891a3c13c","observation_id":"f8a5abaa-3333-46d0-90ea-d0ea297b9509","resolution":{"observed_at":"2026-08-03T16:18:38.582111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.651973Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.651973Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:b273ecf63b2e77b67357dcfa11185b7a80b636b7a41a062f3d510949d530f294","observation_id":"be17b37d-8d71-492a-a312-71f8ec403638","resolution":{"observed_at":"2026-08-03T16:18:38.651973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.726737Z","title":"On the limited memory bfgs method for large scale optimization.Mathematical programming, 45(1):503–528, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.726737Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:18808a7f0fd0f2c61640f13c8dab005c80593feae028b98857a85b8812be20b9","observation_id":"1d4724c2-edac-4436-9288-7b14e5b89d43","resolution":{"observed_at":"2026-08-03T16:18:38.726737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.775699Z","title":"Battaglino, and Michael R","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.775699Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:33a4337d548e5b3e265f0fb822411a0a7437287ade0b5fd6641c0f39b90c865e","observation_id":"a6b34f7f-723a-46bd-93ea-4ac9970050a9","resolution":{"observed_at":"2026-08-03T16:18:38.775699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.856530Z","title":"A vector-contraction inequality for rademacher complexities","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.856530Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:ef458e0c8ffbe3702c72f63092042d8c2de6e861eb3abc84290769e3fcc1d6e3","observation_id":"136f4ef5-7f05-49af-84d3-dfb2761845c6","resolution":{"observed_at":"2026-08-03T16:18:38.856530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:38.944644Z","title":"The MIT Press, 2nd edition, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:38.944644Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:867e16e13f1f57157e36bd2de9508588c923d7bc61eea7f107cc2cc577878a93","observation_id":"5e99270f-1d88-410a-a6dd-8256314a42b5","resolution":{"observed_at":"2026-08-03T16:18:38.944644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.018465Z","title":"Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.018465Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:536d7cfa4a5333fad17d50893e95464e5a7b27e9d30b0dd05197ea70f987fff6","observation_id":"7f5ec960-cc9c-405a-8cec-2ec9a02c3e8d","resolution":{"observed_at":"2026-08-03T16:18:39.018465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.090824Z","title":"Cambridge Studies in Advanced Mathematics","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.090824Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:aec6e63bacfd098e5d143c0fecab7f1081d25c6f27e8e3f36d813789af684daa","observation_id":"47a06da0-fc38-4b39-a3bd-fc9c7f881dce","resolution":{"observed_at":"2026-08-03T16:18:39.090824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.196227Z","title":"Hebb.The Organization of Behavior: A Neuropsychological Theory","venue":null,"work_id":null,"year":1949},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.196227Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:df73d0df25a67b1c07299cfc66389ca6cb8b1c27adae02415e538e63b64acc4a","observation_id":"082d84b6-83fa-40ac-a58c-b1dc64bd2206","resolution":{"observed_at":"2026-08-03T16:18:39.196227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.290846Z","title":"Associatron-a model of associative memory.IEEE Transactions on Systems, Man, and Cybernetics, SMC-2(3):380–388, 1972","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.290846Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:9ff096b1622cb9062315d67637d65143d1937e906ff7a893650466f9b7a55e2a","observation_id":"b4dbacb9-c1d9-4476-b8f7-ba55da70e4b7","resolution":{"observed_at":"2026-08-03T16:18:39.290846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.367026Z","title":"Adaptive switching circuits","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.367026Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:62537480dfd4209efba0dcad9bc84a347b8cd4f6b4d3ff6fc3794f3f6251fe4e","observation_id":"b4d058b5-910e-4230-acc1-470fbe1cdd36","resolution":{"observed_at":"2026-08-03T16:18:39.367026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.441516Z","title":"A theory of Pavlovian conditioning.Classical conditioning, Current research and theory, 2:64–69, 1972","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.441516Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:2ece53237d8638f6d7e225a273498fe4ba1a31adddda9dcd096830cc041fdbd7","observation_id":"9382f0f1-9334-40df-9cff-6e4c2516a3c1","resolution":{"observed_at":"2026-08-03T16:18:39.441516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.537391Z","title":"Storage and retrieval capacities of associative memories","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.537391Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:f970af0daa2b9f6bd03f2193506f7f0427ec4a3cb355f8b49d81eb5961a06259","observation_id":"58577b85-1b6c-41b8-897e-95237f42d986","resolution":{"observed_at":"2026-08-03T16:18:39.537391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.655265Z","title":"Collective computational properties of neural networks: New learning mechanisms.Physical Review A, 34(5):4217–4228, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.655265Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:71c046395b5d7d0763642a59e76b21154af3c05569098e62c1f0f82a003ebf44","observation_id":"c29dc22d-1fc8-4752-acb0-8f740af6f682","resolution":{"observed_at":"2026-08-03T16:18:39.655265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.721044Z","title":"Increasing the capacity of a hopfield network without sacrificing functionality","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.721044Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:a317a0766558cc1944225a690c7c282d4388670304792d7400f1071eff4a506d","observation_id":"dfdf3a2e-b789-4430-8720-2d1f332b786e","resolution":{"observed_at":"2026-08-03T16:18:39.721044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.829052Z","title":"Storkey and R","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.829052Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:e1716a5e33faaa5d0cd4c354d79d6ccd83300f97f605c36bd49b1b5be4a25a24","observation_id":"a283b549-ad70-40a5-b679-65a2c463d0bd","resolution":{"observed_at":"2026-08-03T16:18:39.829052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:39.932026Z","title":"Optimum bounds for the distributions of martingales in banach spaces.The Annals of Probability, 22(4):1679–1706, 1994","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:39.932026Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:5b5ed384d55d6020320fd398f3a06028d8f78765973c1dab681099595433b414","observation_id":"60c0f8ee-b219-44e9-a51f-43c762eecc70","resolution":{"observed_at":"2026-08-03T16:18:39.932026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:40.037155Z","title":"Note, as θ∈Ψ(Q n) this implies bi =b π(i) =b j","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:40.037155Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:a3249720ea606c42540ab9f79a3a27116e53d1ccc78571974ad1d8c57d60997b","observation_id":"03d48785-a956-496a-ba63-de95add62a18","resolution":{"observed_at":"2026-08-03T16:18:40.037155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:40.117703Z","title":"Note, and again asθ∈Ψ(Q n), this impliesw ij =w π(i)π(j) =w ab","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:40.117703Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:13670a4bfe30970f5b5c0060bd346072ef0545418d323f99f015bb83a33f4eff","observation_id":"48947c04-099d-4105-8280-1207c39a01fd","resolution":{"observed_at":"2026-08-03T16:18:40.117703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T16:18:40.200429Z","title":"double ascent/descent","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T16:18:40.200429Z"},"links":{"citing_paper":"/paper/2512.14338"},"observation_digest":"sha256:491d93a71ff325c8cb05ec9be3948dc7d993ab50a7b50e0ff4a99a35821c28bb","observation_id":"d3f935c1-4810-41ad-97db-c52360166b1d","resolution":{"observed_at":"2026-08-03T16:18:40.200429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.14338","last_updated":"2026-06-04T10:46:04Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T21:51:36.219261Z","submitted_at":"2025-12-16T12:06:58Z","title":"Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":54},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2512.14338."}