{"as_of":"2026-08-18T13:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:222fd6e55e48abf7b8c548ebe1c5fe1fa95100bdb210a4805d3297096c8a72ea","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:14:44.007356Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2511.02584/citation-record","integrity":"/paper/2511.02584/integrity","json":"/paper/2511.02584/citation-record.json","paper":"/paper/2511.02584"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:14:41.388060Z","title":"Neural networks and physical systems with emergent collective computational abilities.Proceed- ings of the national academy of sciences, 79(8):2554–2558, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.388060Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:c5f64cc9f29386030a9162d2c0fea72ebd8ee4a9a627d1dbe6fdc9ec01143cee","observation_id":"16c2f96e-44ec-4b70-ad70-4c2ad4298c12","resolution":{"observed_at":"2026-08-04T00:14:41.388060Z","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-04T00:14:41.444557Z","title":"The nobel prize in physics 2024 – press release","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.444557Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:9849e5c4337abdb52c55afe8ac0b1c4208f69622b6315ad90ccf45b527aabebb","observation_id":"b736b24f-38cd-4916-90fe-87fccafeeabd","resolution":{"observed_at":"2026-08-04T00:14:41.444557Z","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-04T00:14:41.520866Z","title":"Hopfield networks is all you need","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.520866Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:a7c849bc422e1a34b32e610b3312f18b4e10d9a8be7b78cedc638f110cdf3889","observation_id":"d5bf3769-5c97-486b-8bc3-f2ab0afb48b0","resolution":{"observed_at":"2026-08-04T00:14:41.520866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1204.2916","last_updated":"2015-05-19T21:46:42Z","snapshot_observed_at":"2026-08-15T04:13:11.486511Z","submitted_at":"2012-04-13T08:28:53Z","title":"Efficient and optimal binary Hopfield associative memory storage using minimum probability flow","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1204.2916","snapshot_observed_at":"2026-08-04T00:14:41.591186Z","title":"Efficient and optimal binary hopfield associative memory storage using minimum probability flow.arXiv preprint arXiv:1204.2916, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.591186Z"},"links":{"cited_paper":"/paper/1204.2916","citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:b96d102c9acc589b9f19b1ff664cab68d7af571a4ddb05cb32a42505a1437d05","observation_id":"0c69128e-93af-4c9a-94a3-367f57ce0fbd","resolution":{"observed_at":"2026-08-04T00:14:41.591186Z","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-04T00:14:41.692258Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.692258Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:827bdb54a2df8df8753005877fc0eb0cd2a47d6ed853c63696a21384b361cf07","observation_id":"78748593-18e4-495e-86ad-f9070c9e327f","resolution":{"observed_at":"2026-08-04T00:14:41.692258Z","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-04T00:14:41.742783Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.742783Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:12e52c1d2ef05f25958ecf459370a86140d1fb16b4eaee476ed1c32f048e8894","observation_id":"17a02d0d-cd45-4d95-b56a-ac1b9239ee82","resolution":{"observed_at":"2026-08-04T00:14:41.742783Z","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-04T00:14:41.889254Z","title":"Cover and Joy A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.889254Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:c847b349310c7de3bdb1d3e8ae758621cf5bb4c405837dd694bfe7fd75d132d2","observation_id":"18a4a34c-2628-484e-99c9-079b8067820f","resolution":{"observed_at":"2026-08-04T00:14:41.889254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1004.2515","last_updated":"2010-04-14T22:12:52Z","snapshot_observed_at":"2026-08-16T20:52:40.400093Z","submitted_at":"2010-04-14T22:12:52Z","title":"Nonnegative Decomposition of Multivariate Information","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1004.2515","snapshot_observed_at":"2026-08-04T00:14:41.952331Z","title":"Nonnegative decomposition of multivariate information.arXiv preprint arXiv:1004.2515, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.952331Z"},"links":{"cited_paper":"/paper/1004.2515","citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:8941d3f4ca3c48adfd38e508b75f9ece7c7c2eab7ed82bac096e03c4460ecef0","observation_id":"99feeeb9-9a77-4371-9c58-930862d35579","resolution":{"observed_at":"2026-08-04T00:14:41.952331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.00810","last_updated":"2017-04-29T17:32:47Z","snapshot_observed_at":"2026-08-14T21:13:52.487817Z","submitted_at":"2017-03-02T14:53:14Z","title":"Opening the Black Box of Deep Neural Networks via Information","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.00810","snapshot_observed_at":"2026-08-04T00:14:42.026155Z","title":"Opening the black box of deep neural networks via information.arXiv preprint arXiv:1703.00810, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.026155Z"},"links":{"cited_paper":"/paper/1703.00810","citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:b298cfe7f3b19ab61b76efacbada04a126b6e594990fe17e7e0ac8a71fbbfabb","observation_id":"fab62316-b0cd-417b-a4fe-89bae035c700","resolution":{"observed_at":"2026-08-04T00:14:42.026155Z","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-04T00:14:42.089956Z","title":"On information plane analyses of neural network classifiers—a review.IEEE Transactions on Neural Networks and Learning Systems, 33(12):7039–7051, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.089956Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:6d406622b5ef3aba6345b0e68d714b0c8d5f8bdd655d2674fdcd1bda9b34e3d3","observation_id":"508a1728-632c-4d12-b806-9ebc057ccd90","resolution":{"observed_at":"2026-08-04T00:14:42.089956Z","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-04T00:14:42.184462Z","title":"A measure of the complexity of neural representations based on partial information decomposition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.184462Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:889a501f65efdd50a917fee8d11e1189517b8b8a6f5a977fd4883bdc5a72534c","observation_id":"186603f3-21f9-45b7-900b-96e4fa708c67","resolution":{"observed_at":"2026-08-04T00:14:42.184462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15779","last_updated":"2025-04-22T10:41:38Z","snapshot_observed_at":"2026-08-16T11:15:47.299692Z","submitted_at":"2025-04-22T10:41:38Z","title":"Shannon invariants: A scalable approach to information decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15779","snapshot_observed_at":"2026-08-04T00:14:42.246691Z","title":"Gutknecht, Fernando E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.246691Z"},"links":{"cited_paper":"/paper/2504.15779","citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:8dcd0a0d0aee7b220543ad600a81bf8cc6ef9ea7c365d1fac58a811872512423","observation_id":"67650ec6-fef0-4473-866d-2f2bd7e37788","resolution":{"observed_at":"2026-08-04T00:14:42.246691Z","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-04T00:14:42.313049Z","title":"Schneider, David A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.313049Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:af600b60d8724d751ef07aee0d3321af969a3532844edc171b70c8f8695fa443","observation_id":"366c8c68-da1f-452d-a3d7-688445d0990e","resolution":{"observed_at":"2026-08-04T00:14:42.313049Z","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-04T00:14:42.368117Z","title":"Schneider, Valentin Neuhaus, David A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.368117Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:a718898c0d7a264fcbbb95cdf5db666507bd8b4712fc197ddd3ea3743dcaf033","observation_id":"3a691441-79d8-4179-8c88-a659acaaae93","resolution":{"observed_at":"2026-08-04T00:14:42.368117Z","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-04T00:14:42.432071Z","title":"Neurons with graded response have collective computational properties like those of two-state neurons.Proceedings of the national academy of sciences, 81(10):3088–3092, 1984","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.432071Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:a16029aee369f4731aa987763ee6878b8d8e840e161334d33d2ecd77c795d31a","observation_id":"0e2f9ee9-4c24-43e6-8fab-31b122afc241","resolution":{"observed_at":"2026-08-04T00:14:42.432071Z","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-04T00:14:42.505365Z","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":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.505365Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:10555bf38c740f394b25dd87e6affc18e24d30d19ac99300b4eb2b9f529586a6","observation_id":"e4bac725-6c00-4b4f-ad69-caa9b5729dc5","resolution":{"observed_at":"2026-08-04T00:14:42.505365Z","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-04T00:14:42.568344Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.568344Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:32a7ab999dda011ed2142ef25e4b6d0b26f92bc1f0789bdc6bca4431aab449d3","observation_id":"ce134858-78a4-4865-a608-3a2f5a1aa047","resolution":{"observed_at":"2026-08-04T00:14:42.568344Z","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-04T00:14:42.635011Z","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":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.635011Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:bd81587cb1721008e4df1b8f49f050737aefa7d33882b3379426b4caf9301e8e","observation_id":"30ef3b35-bb8b-4b88-a033-26dd62811478","resolution":{"observed_at":"2026-08-04T00:14:42.635011Z","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-04T00:14:42.672837Z","title":"Bits and pieces: Understanding information decomposition from part-whole relationships and formal logic.Proceedings of the Royal Society A, 477(2251): 20210110, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.672837Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:d1404d113ce198c6e08e03f9ed00656a5288fc4a9aecb5ae0582b4f6d99cdea5","observation_id":"6dfa50c9-5b2f-4306-9256-74910be5acfd","resolution":{"observed_at":"2026-08-04T00:14:42.672837Z","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-04T00:14:42.762382Z","title":"Information decomposition of target effects from multi-source interactions: Perspectives on previous, current and future work.Entropy, 20(4):307, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.762382Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:6abd9bb1369245b8fc58c7b38c0e0058d7a475ee1ab5f2c0cf456706da08b6de","observation_id":"82991655-c223-4cd9-9598-028bed14be21","resolution":{"observed_at":"2026-08-04T00:14:42.762382Z","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-04T00:14:42.859454Z","title":"Introducing a differentiable measure of pointwise shared information.Physical Review E, 103(3):032149, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.859454Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:ac47b5ea98e4841d038979faadb5796d8e84f8392e4e7a2f6b59cb0948590991","observation_id":"9f8b82fb-9ae8-47f7-9e6d-8140d64a3ce0","resolution":{"observed_at":"2026-08-04T00:14:42.859454Z","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-04T00:14:42.998887Z","title":"Coherent infomax as a computational goal for neural systems.Bulletin of mathematical biology, 73(2):344–372, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:42.998887Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:d3ec84f5e8a11dc0a10c3baea9f2740a2c8ec8a2c953d75e2407d9fad863c41f","observation_id":"7a9778fe-76b1-46b0-8271-6cec162f3c74","resolution":{"observed_at":"2026-08-04T00:14:42.998887Z","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-04T00:14:43.073396Z","title":"Completely derandomized self-adaptation in evolution strategies","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.073396Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:a3718c559060b013dd6de9dbef51a78be063fdd37fde8b9167fc3a3a395bde9f","observation_id":"e32c3710-231b-4384-b003-c78b388a5827","resolution":{"observed_at":"2026-08-04T00:14:43.073396Z","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":"10.1103/physrevlett.58.949","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Learning of correlated patterns in spin-glass networks by local learning rules.Phys","venue":"Physical Review Letters","work_id":"c180f2d8-3f71-42ad-802c-62483d446240","year":1987},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.172728Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:8b02a8995bb5fc979e80125b7c47cb18f0c480b30e6b26b46d7122493db12c80","observation_id":"1ec52c57-38df-414a-a6a7-324fee72bc12","resolution":{"observed_at":"2026-08-04T00:18:21.594098Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:14:43.234122Z","title":"Amit, Hanoch Gutfreund, and H","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.234122Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:17c7ab1475bc31f187f2b7d65307b1ddff760100f52dcd7e125ec3094af9d423","observation_id":"47d45a05-22f8-42d6-9e3e-e9cb3587111e","resolution":{"observed_at":"2026-08-04T00:14:43.234122Z","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-04T00:14:43.339377Z","title":"New method for parameter estimation in probabilistic models: minimum probability flow.Physical review letters, 107(22):220601, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.339377Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:21938e95b5304028d08a19d3244917f24671b25ea8e50db0910e63d91d0f544a","observation_id":"94061c03-81d1-47e7-948c-a3c695f453cd","resolution":{"observed_at":"2026-08-04T00:14:43.339377Z","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-04T00:14:43.428030Z","title":"Self-control in sparsely coded networks.Physical review letters, 80(13):2961, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.428030Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:025dcb2c38cebcc8704c6820af60d78a89fee172ef38969fdabd4dcab89ebd42","observation_id":"9af60b40-ff90-49c2-92b7-273ba3c077ab","resolution":{"observed_at":"2026-08-04T00:14:43.428030Z","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-04T00:14:43.490942Z","title":"Mutual information and topology 1: Asymmetric neural network","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.490942Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:92f53c8945dbd5813659cd325d0c18b7f4ae0720f622a3588a5c3930206a40f5","observation_id":"408c0841-3334-4013-ab76-d334ac5d39ed","resolution":{"observed_at":"2026-08-04T00:14:43.490942Z","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-04T00:14:43.534303Z","title":"Structured information in small-world neural networks.Physical Review E—Statistical, Nonlinear , and Soft Matter Physics, 79(2):021909, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.534303Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:a4f7fd2a19d105829839e3fc8e1f09c358a43da41abf89c0a6e7a706fe512dee","observation_id":"e468ec6c-384e-4c14-a986-773a27201f9e","resolution":{"observed_at":"2026-08-04T00:14:43.534303Z","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-04T00:14:43.600153Z","title":"An application of the principle of maximum information preservation to linear systems.Advances in neural information processing systems, 1, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.600153Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:cdba4487f3f8c0aaf8f41503a21d2c42b61ed7dba108535af7eebfc1ad2d4ed0","observation_id":"e4c2053f-fea0-44f5-a74a-fe112ae189ce","resolution":{"observed_at":"2026-08-04T00:14:43.600153Z","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-04T00:14:43.651492Z","title":"Hopfield","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.651492Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:7b0d10511cedfd805e5d151d58d3340055987c2eea3a1e609e3f08552d597a40","observation_id":"da8c7fde-36d2-4d4d-aac5-da37166526c8","resolution":{"observed_at":"2026-08-04T00:14:43.651492Z","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-04T00:14:43.759802Z","title":"A new frontier for Hopfield Networks.Nature Reviews Physics, pages 1–2, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.759802Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:53a2ec81c4c2178b6eb6265f14f3765131aeabb72d8537fd9a84eec948d03730","observation_id":"8fb2c352-89e5-4c1c-974e-aaac40ac8eae","resolution":{"observed_at":"2026-08-04T00:14:43.759802Z","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-04T00:14:43.831740Z","title":"On the storage capacity of hopfield models with correlated patterns.Annals of Applied Probability, 8, 11 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.831740Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:b6c8a8fa93fa66f62088cfc1f3e6e65fccc2b1d572d7a90d36bd2ae8669c8a7a","observation_id":"53fa8110-c5a4-4797-bac6-d3cb7b855fcd","resolution":{"observed_at":"2026-08-04T00:14:43.831740Z","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-04T00:14:43.884059Z","title":"Formal theory of creativity, fun, and intrinsic motivation (1990–2010).IEEE Transactions on Autonomous Mental Development, 2(3):230–247, 2010","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.884059Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:562118452f969a9f8435cdc419d7e824e0b7571ec75840b92f1354b9943c4c16","observation_id":"6d0e43e4-cb82-4d19-885e-93824af552ac","resolution":{"observed_at":"2026-08-04T00:14:43.884059Z","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-04T00:14:43.935414Z","title":"Partial information decomposition for continuous variables based on shared exclusions: Analytical formulation and estimation.Physical Review E, 110(1):014115, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:43.935414Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:e5f0db908456ea3bbdd88ba50a23bdbfae75ff5835a3ab5d8c1f1bb163fa8002","observation_id":"edf4cb6a-f7d4-4920-89a9-0bb30bd5b0e8","resolution":{"observed_at":"2026-08-04T00:14:43.935414Z","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-04T00:14:44.007356Z","title":"Information-theoretic neural networks for unsupervised learning: mathematical and statistical considera- tions","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:44.007356Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:b88cbd5849b68f77cda4eb07c7d49d1d0d7f91f5c44f3161ef3dd5789e2bd0c4","observation_id":"c222b827-eb18-4e48-b124-a42801a0c834","resolution":{"observed_at":"2026-08-04T00:14:44.007356Z","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-04T00:14:41.803674Z","title":null,"venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks","version":2},"reference_index":1948,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:41.803674Z"},"links":{"citing_paper":"/paper/2511.02584"},"observation_digest":"sha256:e77bf8cbcfbfc8d241afa64e1164758793495dde40126b5fb02c7729c40cd0fb","observation_id":"e57c8807-bddd-45f1-a685-e445318c3c70","resolution":{"observed_at":"2026-08-04T00:14:41.803674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.02584","last_updated":"2026-07-13T11:33:48Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-18T04:12:09.584228Z","submitted_at":"2025-11-04T14:01:36Z","title":"Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":37},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2511.02584."}