{"as_of":"2026-08-10T17:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:283d44fdb6175d3784f3746d66b69838f92c5ae0aa7c63174fadbbf6edef6e1f","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-10T06:31:04.303077+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-09T08:33:10.894235Z","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:9da09a7295948eff40be5d2fbd1dcd55986b0b19d7d709c2facd16bb5032d8a5","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-09T08:33:10.894235Z","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:2b51b9a908b7be60dd13f5ed7dc96131884a7da4f59c08fcbaa0ad4219dba6bf","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-09T08:33:10.894235Z","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:cb368a8a8d701beccd57dc008ed06bd546a7cb6f3485b3f10934c82992d87c2e","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-09T08:33:10.894235Z","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:da92cb3b81f2d0b409dddb478c2ec0b93dcf17e35d72ba8b4993d044caeadbf2","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-09T08:33:10.894235Z","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:6b7cfb31b177de30baaa55e77fb852662293cca01ef6300a9fc71ec27f8a7d38","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-09T08:33:10.894235Z","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:1dfe3560a1155b6466882abdfbbcadcfd28123d20292cd3c3a60ca54a8cdd151","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-09T08:33:10.894235Z","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:4c8380674748b79515840c37b3c279e3ddb400f3f1c887f58ef97deca6672ab6","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-09T08:33:10.894235Z","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:697cd65d56a99aa5bf2550061bf488725dc119a78f4991a815af7d5583539c11","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-09T08:33:10.894235Z","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:6fbf24a4e0e0a369143f67ec91a2a14d9b259e8f59587da5284da66feabdbb59","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-09T08:33:10.894235Z","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:c1c1ae68cee2f5c6a1ba822d382c0d09f7a3365f8fa8a4164149c2684f4a518c","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-09T08:33:10.894235Z","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:453d1ea107ffdf7960a570dc9fe1191830842678ecd1c10232a3dcc03c547c3e","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-09T08:33:10.894235Z","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:b88e348ce3495486346020334c510ade46cd4224d340001fd40cb97f8113efa3","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-09T08:33:10.894235Z","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:1463c16597d698bcb0115aac9d8b9f4b895ee33a47a6f4c36d8fec751cecfac2","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-09T08:33:10.894235Z","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:0c72ac24cec10afa83aaa0cb60c7bd5539da145d2875e0494738a01b65e678d2","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-09T08:33:10.894235Z","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:3c5ad5e9ee7c7f571945e8be0ccd99435def74762982c8589ea7fd0afff6a5b6","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-09T08:33:10.894235Z","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:7a13ac957a352ddcb37d05559a95a5c595a8b6f07b03f8d531d7e6c23c393881","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-09T08:33:10.894235Z","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:3e7ef7452d1f16d6f11b154c84807df18bd43e17ad6cd6d2c7c2e2c63af0f750","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-09T08:33:10.894235Z","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:b615f15f9794b329de9af0aafac1a135d7d3d9d5b23a8638096505247b41fefc","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-09T08:33:10.894235Z","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:b2d4b3e080b81dd2bcee7f988c0a38c05a985bd8022de3afb65b1084203edd5c","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-09T08:33:10.894235Z","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:e63ba241424d6b489b981b6ddf5f3655e0343cf3ba7c5905fbbe8adf164e5b76","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-09T08:33:10.894235Z","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:1e92582ec4884a56703f99473feaeb16f3dd8702917d805271d01c4d637f4023","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-09T08:33:10.894235Z","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:63208f288ef26eb495885bb5a6e53fc8cdf6fdaa3e01f5c62d939b43f0a6852b","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-09T08:33:10.894235Z","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:44ff6edc89e2ccbfd85efbcd40f076a4918532e4c2b708fff3c6dd0169274fc5","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-07-06T15:09:40.923270Z","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-09T08:33:10.894235Z","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:d4dff9f5db27e8efb5bc9aae8f1633f0bca1b2b49485f150b0c7a9e89c3beb4a","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-08T12:20:10.987824Z","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-09T08:33:10.894235Z","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:efb8d029b4aed0d345db4a5c5bf0ccaa9e89c6b28aca2f5bfec467724786facf","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-09T08:33:10.894235Z","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:b5b5e2ccb890fcf1cda7754bdbc60711116ba4d8a521deefc2a704e93d962370","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-09T08:33:10.894235Z","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:f540bdd0a7421688a1e7a6b52cc754292e61df99da4f7cf5bf51b1ee70d12ee0","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-09T08:33:10.894235Z","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:9dd6a436ce61b8f98d73772343fa6db7e341e713f9d43b8e354bead9b936f91f","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-09T08:33:10.894235Z","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:aeba590ecb3ba38a4ca271d49f5a436ffa50d47964617380cb8ab5b974468943","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-07-06T18:28:20.634381Z","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-09T08:33:10.894235Z","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:8e0f1482868b77c310460966605fcdab8c0de47aab5deb584174f6c2874f71a8","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-09T08:33:10.894235Z","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:4ea1d2d8bc4ef658b5c859a9c7acdf00129e7b349fe09d93ea0a19702f4bc080","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-10T12:34:19.641462Z","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-09T08:33:10.894235Z","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:112826da0027c44b0d4de740f5dfa878c7bc1d45c23cd94042f35f74d643868a","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-09T08:33:10.894235Z","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:d8888730a8932702f8b0d898b9cff057db164551473a5bb78563026cf1db92b3","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-09T08:33:10.894235Z","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:fae63b9b160b845388802c579481fb05f609a993bd4dab55d3a151e67c1e7a63","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-09T08:33:10.894235Z","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:2b5d3e2f28d84db68efa4955eea9cd2826b930deee6a29137acf921d611c4300","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-09T08:33:10.894235Z","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:36c0cec350f37aaf1ec3d824cc9b8e1ce69906c873c459d54b6b040b2f9dee60","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-09T08:33:10.894235Z","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:44c3acd2660b65349af018eac28650e25c7e4f95d1fa53169e3b11da24248ba4","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-09T08:33:10.894235Z","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:59d4b5cca4236aec39f4e264648f0c202f3b75d1316c3a43de9ca09ba5872d09","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-09T08:33:10.894235Z","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:0e8a356dca0887fdc59671ebc6608278f656570084fc52975dc30f9336469392","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-09T08:33:10.894235Z","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:ece814adc857e8b48a4844a28430766677b9b32630aea7653609306e38f7c767","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-09T08:33:10.894235Z","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:d55c11e7bda2c14e77ec01a6684f66cee020e77e421691d62f855b4e312f5c61","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-09T08:33:10.894235Z","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:371501431a85b985d744a7344bc9e630007aa5b5bebd23c8e6d24c5c0b0ccb6b","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-09T08:33:10.894235Z","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:1aee9ad4ee56adf04e5183393e573184800dce2dd44b50ceb865a6774fd1ce1a","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-09T08:33:10.894235Z","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:7c6238720c5f0d05ed7a9b71d34132ba9ab155ac370eb530e6fcd83d1681f396","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-09T08:33:10.894235Z","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:cabe5fcb729d8079ddb1c01af311c0a6ca725ab54b8c47f7c2435ca815bd251d","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-09T08:33:10.894235Z","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:aacdd79f16b247473a41c400c8a7b157e6a0185ba09e4a832c3561ab9f032acf","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-09T08:33:10.894235Z","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:c37963381da59f98c84063d59b4410077a243e843bd168749dd4118115d9a9d2","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-09T08:33:10.894235Z","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:74e3dffa3e95e04100fa8ea94dfbb4f559df2c55a92dd8a071e9ba7617f8b60e","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-09T08:33:10.894235Z","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:2414d25f213722300b437fa75fc1636b64824f7dcb1246583f0e00840df43238","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-09T08:33:10.894235Z","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:e66483c282d11bab3e06b81a9f3726d58d572d57d0e79b1b227419c8fb5fb61e","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-09T08:33:10.894235Z","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:ad6750f3257fe40bb4403af93e543324390107b4d3e756a99331104a427ccbcb","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-09T08:33:10.894235Z","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:f7b0116f3b79a74782157a764dbbd10ff83d3f739e02d226b9af2d7900a6beb8","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-09T08:33:10.894235Z","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:1a208229e0f4ff5ba436a2392fbe499aefa023f6874c6dc366a49e413a2bc48c","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-09T08:33:10.894235Z","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:b5ec1af27252921b47a6ff17bbf548e0cb947d3c06204897865d6636dca77465","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-09T08:33:10.894235Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2512.14338."}