{"as_of":"2026-08-14T17:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c16173f3e340729acece529346616cc1843332f7deece2c66a24d2cfe9585d5","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:18:54.477464Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2502.09500/citation-record","integrity":"/paper/2502.09500/integrity","json":"/paper/2502.09500/citation-record.json","paper":"/paper/2502.09500"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:55.160248Z","title":"Superposition of many models into one","venue":null,"work_id":"fce6f66e-9a62-4f23-a761-3d5a3262de98","year":2019},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.010679Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:b88ef979c2d7d7322f0ee994827067485165a2da24cfd2b0b205614c041b0388","observation_id":"568ca858-a280-4dcb-b685-1089e4e6c312","resolution":{"observed_at":"2026-08-07T21:18:55.165320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T21:18:54.016145Z","title":"Imagenet: A large-scale hierarchical image database","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.016145Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:f3be117dded697df26a83c25209e07c43192c25a02d692ec545b7b3df74279a1","observation_id":"66b01309-f8c4-443c-8e4a-8c48dcf9fba9","resolution":{"observed_at":"2026-08-07T21:18:54.016145Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:55.131011Z","title":"Head2toe: Utilizing intermediate representations for better transfer learning","venue":null,"work_id":"328b0f64-e2f5-4fc0-91c9-01fa66c3142d","year":2022},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.021468Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:eb068333fe782c6c4d654ef8e3979d39288d6f6f2489a36b2d9825a92c73bebd","observation_id":"062f438e-bc04-4d05-a0b9-da5102b42745","resolution":{"observed_at":"2026-08-07T21:18:55.137494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.04476","last_updated":"2019-03-11T17:53:34Z","snapshot_observed_at":"2026-08-14T17:04:05.511934Z","submitted_at":"2019-03-11T17:53:34Z","title":"Continual Learning via Neural Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.04476","snapshot_observed_at":"2026-08-07T21:18:54.026875Z","title":"Continual learning via neural pruning","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.026875Z"},"links":{"cited_paper":"/paper/1903.04476","citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:55ea3590623d6b9cd6491b57384639cfdfe774fb5cef6176a0c8fef350e6d16f","observation_id":"3859cc0d-54f5-4f00-87ac-4ab86db521a7","resolution":{"observed_at":"2026-08-07T21:18:54.026875Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:55.113162Z","title":"Shels: Exclusive feature sets for novelty detection and continual learning without class boundaries","venue":null,"work_id":"8df50e61-6ab1-4013-810f-6740cb8360de","year":2022},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.033020Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:1b95edccb86f39147ae751e1b49299f10a551747cfd00c71ad61f6a857599ee0","observation_id":"38dbf063-1bf1-406b-a2d8-e5acc49caa35","resolution":{"observed_at":"2026-08-07T21:18:55.118651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T21:18:54.038165Z","title":"Learning both weights and connections for efficient neural network","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.038165Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:94b75dd4f0791aef6c7e07e5e10d4778136f7517ac221ff6c9169eeefc31a651","observation_id":"e4244124-c742-4a4b-8264-8d6fa61795ee","resolution":{"observed_at":"2026-08-07T21:18:54.038165Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:55.083225Z","title":"Imagenette: A smaller subset of 10 easily classified classes from imagenet, March 2019","venue":null,"work_id":"55f57263-e400-4db2-90db-83d0fa33c042","year":2019},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.043172Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:7f50b87cb316d82f17cd81c7f0f478eb9b372d454981c8a96a24489ead597003","observation_id":"eb2cfa75-b91d-4c47-9c52-f14e1e7891ab","resolution":{"observed_at":"2026-08-07T21:18:55.089050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T21:18:54.048144Z","title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.048144Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:1dae4d3df19ebe6837238337c0e5051bff0370160e5e34a30ce0d55610ceb37e","observation_id":"abb2c5a5-60be-4377-bff3-1d029d8ffdf7","resolution":{"observed_at":"2026-08-07T21:18:54.048144Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:55.056253Z","title":"Russian doll network: Learning nested networks for sample-adaptive dynamic inference","venue":null,"work_id":"dc0535ef-fcb1-4fbc-96b9-a5ca5cc0bdee","year":2021},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.053176Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:5681a63f1cd4d9bfcc29a425d9fe9b3af53b2a95307f9511566d489b3abb5df2","observation_id":"15abc116-4996-48c5-993e-2fedc049d5c0","resolution":{"observed_at":"2026-08-07T21:18:55.061329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:55.039594Z","title":"Continual learning with node-importance based adaptive group sparse regularization","venue":null,"work_id":"c5cc0128-3b36-4140-978d-15267412f512","year":2020},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.057674Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:8d3b18d338e757620431ab82651e0ab03637ba38745cb3e45d1cf5fb6c6bd01d","observation_id":"37d48067-3f89-41f0-9675-f03412b5604b","resolution":{"observed_at":"2026-08-07T21:18:55.044402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:55.022523Z","title":"Natural continual learning: success is a journey, not (just) a destination","venue":null,"work_id":"3c1bcef3-5463-4938-bc29-cfb9d7a8c1ca","year":2021},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.062331Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:212e3f8e826d344f90fd3a334210564312902dfccd04cfeec8cb335bf853506c","observation_id":"09ae6465-7de4-4d84-aafd-10e870849912","resolution":{"observed_at":"2026-08-07T21:18:55.028408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:55.005008Z","title":"Understanding catastrophic forgetting and remembering in continual learning with optimal relevance mapping","venue":null,"work_id":"06b5efd2-a08c-452c-8b7e-c4c32746f9af","year":2021},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.081607Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:cf648cc051bb2ee9988c606f0d394b97a21612b5eb248d46bf618744e38ce047","observation_id":"dabf3d8e-bb32-403a-9a3c-439c5fc5ded8","resolution":{"observed_at":"2026-08-07T21:18:55.010528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.987638Z","title":"Nestednet: Learning nested sparse structures in deep neural networks","venue":null,"work_id":"3311d72b-22f5-4187-8570-91ccf791d0c0","year":2018},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.127145Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:4f0db13f8c7a76cb5c69869d55500540ad45692cc9df52305ddb9a3f67b5d510","observation_id":"90dcb429-c3ce-431b-9e27-15f416a4d2b9","resolution":{"observed_at":"2026-08-07T21:18:54.992827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.971721Z","title":"Overcoming catastrophic forgetting in neural networks","venue":null,"work_id":"c7c93627-ffc8-4a74-9949-e8ae8c7687fe","year":2017},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.196462Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:b79d702ca709e5f0c97ee18ea12f08b5b3b14f78ddae9cabcd1a47d7763316ac","observation_id":"bf7da0ce-0f1c-407d-ba08-63edbe6558f7","resolution":{"observed_at":"2026-08-07T21:18:54.977070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.955639Z","title":"Packnet: Adding multiple tasks to a single network by iterative pruning","venue":null,"work_id":"a0d58878-38f1-40b7-ba30-590ef2a20122","year":2018},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.248190Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:cfe9b91e476686b78ba9879a05249fea03603a86acd83dce58af510c1786de0b","observation_id":"b2cd9ce8-1752-45e6-a632-092edfae3849","resolution":{"observed_at":"2026-08-07T21:18:54.960367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.937302Z","title":"Piggyback: Adapting a single network to multiple tasks by learning to mask weights","venue":null,"work_id":"757c2a0e-1db5-42bf-ab14-49daec225316","year":2018},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.263543Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:3b137dd05cd7d6cc139ad8493ed95a98e7a6ddf75057c1a0bd9089ffdf034577","observation_id":"a822630f-e800-460e-a961-955b8de2630e","resolution":{"observed_at":"2026-08-07T21:18:54.942750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T21:18:54.278796Z","title":"Class-incremental learning: survey and performance evaluation on image classification","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.278796Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:e427f3481316b709da527c72e6c0b6aef5b64e7f0a55d0bcbc38f77a4be86ae1","observation_id":"d24df384-f3bf-4f45-a363-3bd4b621f6f7","resolution":{"observed_at":"2026-08-07T21:18:54.278796Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.907594Z","title":"Parallel distributed processing, volume 2: Explorations in the microstructure of cognition: Psychological and biological models, volume 2","venue":null,"work_id":"e89d1697-6d69-4a5c-8daa-5e99f6b8f597","year":1987},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.288111Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:10262f60ccfb304dfcdcde7f2fdfb1f49076a1be561b33a42a4a5f17c8e774ee","observation_id":"53a5a1c6-f954-47a3-8b2a-5f36c209c080","resolution":{"observed_at":"2026-08-07T21:18:54.913505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.889261Z","title":"Catastrophic interference in connectionist networks: The sequential learning problem","venue":null,"work_id":"3815d7ef-9c82-4345-9552-4195b860a75a","year":1989},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.292925Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:40ce4ce2b8c0b799dd64561da0fc70df367b25ab47a691fd48bddec2c52a424e","observation_id":"3a3c49a0-9177-4702-b05f-906cc15406d3","resolution":{"observed_at":"2026-08-07T21:18:54.894989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.872834Z","title":"Pruning convolutional neural networks for resource efficient inference","venue":null,"work_id":"835fdbc1-1613-4da1-a4fb-8f3df1f79354","year":2017},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.297205Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:57765ba6995f460c57898161a74bc0bb12b34b49b7b2d496c442eb2e2c207af9","observation_id":"66a534d4-99a2-46c8-9f8c-07f55a90046d","resolution":{"observed_at":"2026-08-07T21:18:54.878160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.782477Z","title":"Online structured laplace approximations for overcoming catastrophic forgetting","venue":null,"work_id":"cd7e3e2e-9a83-4b2b-b17a-5e77ba0d9fcd","year":2018},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.301541Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:b9ac6d6eaf923f5857014fb40c9afae91da99a03c92d90acc67a99f353c30418","observation_id":"02172021-c98e-4213-af58-7a58a30772df","resolution":{"observed_at":"2026-08-07T21:18:54.862281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.764450Z","title":"Parallel distributed processing, volume 1: Explorations in the microstructure of cognition: Foundations","venue":null,"work_id":"96cdca33-bfc4-4cfa-bb15-fb54069170ae","year":1986},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.306394Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:0612d87ea52ca7ae89f6883d478b3f325b90598de942302662807ef017c4763f","observation_id":"04667f73-d6d0-4985-9abc-868663c0f257","resolution":{"observed_at":"2026-08-07T21:18:54.770811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.742639Z","title":"Outrageously large neural networks: The sparsely-gated mixture-of-experts layer","venue":null,"work_id":"8986ceee-4983-462c-b22b-28039bdde457","year":2016},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.311138Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:dbd2208b3a20a5bf96d2e1f704e333a61ea0516299c6d908b7c9f9f19372c97d","observation_id":"34c78645-dff6-4d55-b10f-ea26268b71ef","resolution":{"observed_at":"2026-08-07T21:18:54.749341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T21:18:54.316346Z","title":"Dropout: a simple way to prevent neural networks from overfitting","venue":null,"work_id":null,"year":1929},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.316346Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:88e4d19c71014064805b621676495365138a68e7b31e4e23af2a3263f53c6ba2","observation_id":"0f8d3b96-edd4-4c4b-8a14-6e2a90aa82c2","resolution":{"observed_at":"2026-08-07T21:18:54.316346Z","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-07T21:18:54.321219Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.321219Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:f6c7afc5faa979c356993b1640a354581e4c764065be30fa01823dbee48799e0","observation_id":"27099880-f08a-4400-8175-ff390c54d228","resolution":{"observed_at":"2026-08-07T21:18:54.321219Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.601039Z","title":"Continual learning through synaptic intelligence","venue":null,"work_id":"6f4404d0-965b-444f-a2ed-f40fef9556c3","year":2017},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.326315Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:1373568dcd37f0df28fe54721de060b4d34d38a6e68de0ec2d95bbb520c9411f","observation_id":"bce10d7a-20b2-44fe-936c-8c8db1391dcd","resolution":{"observed_at":"2026-08-07T21:18:54.651766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T21:18:54.332173Z","title":"Understanding deep learning requires rethinking generalization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.332173Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:30e14fc6ccceb17e64081cc902e17e34bce56ddeef59bd96634a30b00426bbaf","observation_id":"c3c68170-e54c-4435-bd61-ab6ebb561e94","resolution":{"observed_at":"2026-08-07T21:18:54.332173Z","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-07T21:18:54.397381Z","title":"Understanding deep learning (still) requires rethinking generalization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.397381Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:0f7490fa5a7a032b5adeb60588d30633acb8e58f265687e8b3ced6f6b288fba2","observation_id":"bd7932b7-2a8c-46ab-8487-7d0002b53834","resolution":{"observed_at":"2026-08-07T21:18:54.397381Z","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-07T21:18:54.449241Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.449241Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:22d2e83a446e55dbba90bbeef1fa6ea1a0da445e9a5a5a0d24cf24cbddd517f1","observation_id":"0f896f10-6eca-47c2-b5e6-40439c1ac0dd","resolution":{"observed_at":"2026-08-07T21:18:54.449241Z","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-07T21:18:54.461181Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.461181Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:94230efc612ab0ef7397e9f3dca3a2dcc15db05e3618610d88263476261f963d","observation_id":"58f2fa39-5efe-480e-b795-44e80944e6b3","resolution":{"observed_at":"2026-08-07T21:18:54.461181Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:18:54.542650Z","title":null,"venue":null,"work_id":"5bf5e98c-4408-4e35-9a23-67efbb40e52c","year":2024},"citing_paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T21:18:54.477464Z"},"links":{"citing_paper":"/paper/2502.09500"},"observation_digest":"sha256:fc1bc9e17b2e3c8eefc111495300fd6295714a1931f971c85dd16b1d9ad357f1","observation_id":"25eb92e4-5e5f-48ae-8a2f-5afee56cd35a","resolution":{"observed_at":"2026-08-07T21:18:54.548514Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.09500","last_updated":"2025-02-14T14:39:22Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T13:22:37.971670Z","submitted_at":"2025-02-13T17:10:43Z","title":"Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":31},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2502.09500."}