{"as_of":"2026-08-10T06:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f56571434f96f5a89686a0c676d8109042ab138d83af768e52fe3f33f58a4e74","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T05:07:55.923673Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T19:46:39.624903Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T11:05:08.926558Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"cited_work":{"arxiv_id":"2502.03350","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03350","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal task order for continual learning of multiple tasks.arXiv preprint arXiv:2502.03350","venue":null,"work_id":"c2be6a68-b979-4172-8d07-9c56372a56c9","year":null},"citing_paper":{"arxiv_id":"2604.15414","last_updated":"2026-06-09T00:58:37Z","snapshot_observed_at":"2026-07-12T19:46:39.068858Z","submitted_at":"2026-04-16T17:06:54Z","title":"Beyond Single-Model Optimization: Preserving Plasticity in Continual Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T11:01:17.325738Z"},"links":{"cited_paper":"/paper/2502.03350","citing_paper":"/paper/2604.15414"},"observation_digest":"sha256:60a60bf7a6c12c521f320846463e7b590fb28d2d9508e23e13f1555557a5205c","observation_id":"a3df7fcc-2dfe-477b-81be-b92fdd22dc9d","resolution":{"observed_at":"2026-05-10T11:05:08.928129Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03350","snapshot_observed_at":"2026-07-12T19:46:39.624903Z","title":"Optimal task order for continual learning of multiple tasks.arXiv preprint arXiv:2502.03350,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.15414","last_updated":"2026-06-09T00:58:37Z","snapshot_observed_at":"2026-07-12T19:46:39.068858Z","submitted_at":"2026-04-16T17:06:54Z","title":"Beyond Single-Model Optimization: Preserving Plasticity in Continual Reinforcement Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T19:46:39.624903Z"},"links":{"cited_paper":"/paper/2502.03350","citing_paper":"/paper/2604.15414"},"observation_digest":"sha256:3b1c0bf7c3c38a34f23abb840340ee9c6ed1b5b6fe4823ce80747ddeb2fe5485","observation_id":"1f2b590b-02fd-4061-a6b4-ba49eb8fff81","resolution":{"observed_at":"2026-07-12T19:46:39.624903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.03350/citation-record","integrity":"/paper/2502.03350/integrity","json":"/paper/2502.03350/citation-record.json","paper":"/paper/2502.03350"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:07:55.718205Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.718205Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:10e09fcdd2761a9ef09ab52cb5b0d9c3843c2aca6aa8730d9c37a317f5011a76","observation_id":"d44cd68b-eef8-479b-87d4-ba455a4f9851","resolution":{"observed_at":"2026-08-09T05:07:55.718205Z","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-09T05:07:55.723776Z","title":"S., Saxe, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.723776Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:d9c08f4d4f82076b30a9888cb2e8f666300e505b85637468d00ecb591548a022","observation_id":"b25578ee-46c9-4d52-99a3-6a818a6ac4bb","resolution":{"observed_at":"2026-08-09T05:07:55.723776Z","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-09T05:07:55.727795Z","title":"Statistical mechanical analysis of catastrophic forgetting in continual learning with teacher and student networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.727795Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:dd5187df3b899d3a62a09e8136db1df263abf5f6b8c6992256838b5f1bd72489","observation_id":"ecb22412-b0cf-47e2-98fa-44e8e5f7c448","resolution":{"observed_at":"2026-08-09T05:07:55.727795Z","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-09T05:07:56.463906Z","title":"S., Sohl-Dickstein, J., and Ganguli, S","venue":null,"work_id":"44a8789d-6cef-4a01-b3ee-910cae546f1b","year":2020},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.731937Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:151a0860f0d926543c861cad4c9f0bdf37481f38c84127f9056bb48cdb48c9ea","observation_id":"fc0ee77c-8074-4e9e-855a-290d74803df1","resolution":{"observed_at":"2026-08-09T05:07:56.467440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.13323","last_updated":"2022-05-26T12:56:15Z","snapshot_observed_at":"2026-08-03T13:51:42.394436Z","submitted_at":"2022-05-26T12:56:15Z","title":"The Effect of Task Ordering in Continual Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.13323","snapshot_observed_at":"2026-08-09T05:07:55.736247Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.736247Z"},"links":{"cited_paper":"/paper/2205.13323","citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:e2b7c861dc66749777eb8494aa2a80e108032cf9713551bad4666bb5ea1481cd","observation_id":"6f8b7fdb-c1ad-47b0-8d0a-87bd45915ac6","resolution":{"observed_at":"2026-08-09T05:07:55.736247Z","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-09T05:07:55.740710Z","title":"W., Sutton, C., Gehrmann, S., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.740710Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:607021cea21415f904d2d0054511044a407e195b82065f1aa179b1d9106352fe","observation_id":"32ea0a1c-7205-420b-b2d6-c08d9b04f300","resolution":{"observed_at":"2026-08-09T05:07:55.740710Z","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-09T05:07:56.446532Z","title":"D., and Sompolinsky, H","venue":null,"work_id":"93037b1e-5af7-4724-b438-eee1540f51ff","year":2020},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.744938Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:cdf70a058e270f8060c18203bd126aa46eb6dd6bd5f50e3fc306a3de891a2b32","observation_id":"b7d74704-f0b6-4b67-8342-0ec3b00bd38c","resolution":{"observed_at":"2026-08-09T05:07:56.449810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.434833Z","title":null,"venue":null,"work_id":"c93833c6-1700-48fa-82cf-bab49b96c449","year":1993},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.749253Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:539679a7d2db447f7c8b635bccb2da9d40a6c989c38a26f4d957701c7711d1de","observation_id":"d50d9e87-5988-4475-858e-3ea656e3cdb2","resolution":{"observed_at":"2026-08-09T05:07:56.438110Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.752487Z","title":"How catastrophic can catastrophic forgetting be in linear regression? In Conference on Learning Theory, pp.\\ 4028--4079","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.752487Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:d3c6e64c5110c6a1178c345287832df3c207a9a74136d7964fcdda03f470cf45","observation_id":"faf2a518-dc77-484e-8a04-57f1fe1a4d27","resolution":{"observed_at":"2026-08-09T05:07:55.752487Z","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-09T05:07:56.419435Z","title":"Continual learning in linear classification on separable data","venue":null,"work_id":"e186d58e-97ac-45e0-8b1a-4a4b0da987ef","year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.756019Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:64fd3db08ee218ff3c6c9003b992db8d837fc252e5520677215f5445f9827c15","observation_id":"5972cef6-02f1-4fff-b63d-c501b74ee636","resolution":{"observed_at":"2026-08-09T05:07:56.423150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.408780Z","title":null,"venue":null,"work_id":"fc7ce3fe-8890-43ea-8374-90e95bd2fc00","year":1991},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.759147Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:630189bacde73eb7a23c34e6830410f4573d9d35bf2851e08325854037749e84","observation_id":"59a2209f-49ab-404c-90f6-30469f5741b8","resolution":{"observed_at":"2026-08-09T05:07:56.412248Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.398395Z","title":null,"venue":null,"work_id":"b6947bca-e4a7-42ef-a3cc-233982b1fad1","year":1999},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.762778Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:2b4032cad67017b18f1baaa5a4e7d3a17ad2fdd3f6040a130835135c510637d7","observation_id":"25c061a9-f1b1-4d4e-8229-504d436d05f3","resolution":{"observed_at":"2026-08-09T05:07:56.401730Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.388733Z","title":"and Derrida, B","venue":null,"work_id":"5aab3dd0-bf42-4746-803c-0b9ec3531665","year":1983},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.765983Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:13db59b0bff34a38e5b18697b39277a4b3ca8e5098f7a0c46216981f94493628","observation_id":"ac0accb5-73ed-48bd-9614-f5208aa10bd7","resolution":{"observed_at":"2026-08-09T05:07:56.391975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.377838Z","title":"and Hand, P","venue":null,"work_id":"1f90e5de-418c-415d-ab02-4ddf2edf4754","year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.769156Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:130cfceb8c81102546640eaf54043eb87fa8fd1847ca42fb7c934c75bd71b4ec","observation_id":"817c0faa-f188-4a52-af2c-0d9d31eacbd8","resolution":{"observed_at":"2026-08-09T05:07:56.381463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.367950Z","title":"The joint effect of task similarity and overparameterization on catastrophic forgetting—an analytical model","venue":null,"work_id":"d3559112-6f60-4377-855b-ff39de518da7","year":null},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.772509Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:6518898fcc3d11fbedd17525f827f5ebbb416bd4061e0b3c535a9ae04c92b7b8","observation_id":"a3bf216f-2f01-44a0-9f74-cb15ce7a69d1","resolution":{"observed_at":"2026-08-09T05:07:56.371384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.357559Z","title":"Dynamic task prioritization for multitask learning","venue":null,"work_id":"9c3632f6-ac90-4794-af8c-75ebdb934c32","year":2018},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.776074Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:59df89d472db34cd6eb986268a850a71e32118372795be36195ecafe85c782c4","observation_id":"2b4df3f0-8312-435d-b9dd-1164dac043e9","resolution":{"observed_at":"2026-08-09T05:07:56.361166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.779139Z","title":"A., and Pascanu, R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.779139Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:02f82f8281630b51162c5ea8e30e9e64f1cc4c527822f53128399082487459b5","observation_id":"789d62c3-ebcd-4ce0-9af2-f3dd3e47ea3b","resolution":{"observed_at":"2026-08-09T05:07:55.779139Z","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-09T05:07:55.782690Z","title":"F lax: A neural network library and ecosystem for JAX , 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.782690Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:7febc161b399620e5c3de7b287ae4dc63defd4818a9e96eb238b8eae5aa1343e","observation_id":"cc961eba-34c1-4bd1-b25c-e09eaa2c722e","resolution":{"observed_at":"2026-08-09T05:07:55.782690Z","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-09T05:07:56.335919Z","title":"and Dahmen, D","venue":null,"work_id":"cf486f2c-99c5-4b8d-b691-3df394217e90","year":2020},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.786750Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:7c948a9d43e2b71fa00def4851edebd4a4825a76c3603e8a5f08e5ccca0cf951","observation_id":"5420c15c-8aab-4729-a1c2-93f5a1964b65","resolution":{"observed_at":"2026-08-09T05:07:56.339173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.325481Z","title":"Disentangling and mitigating the impact of task similarity for continual learning","venue":null,"work_id":"07e0ef0c-ecc2-4fee-a5bd-647ef4f0fc7a","year":null},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.790009Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:172c37b934099d61c499165e711abc35af80977ab0a5b29228e44ee77c051065","observation_id":"17292e26-8aea-4b19-b1de-762ec184eea2","resolution":{"observed_at":"2026-08-09T05:07:56.328897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.793376Z","title":"A., Welbl, J., Clark, A., et al","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.793376Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:0a99481b131840bee4ea28e15dd6a15cb12c207bee53497fc182f44e3d5f7c6a","observation_id":"8fb98fc9-41ca-4e96-b69c-be6e6db923f0","resolution":{"observed_at":"2026-08-09T05:07:55.793376Z","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-09T05:07:56.310091Z","title":"How to train your robot with deep reinforcement learning: lessons we have learned","venue":null,"work_id":"c40e1657-25d2-46ba-ac55-36b92a929dfa","year":2021},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.796473Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:2a4c651ab4f875129abd19d591872f3007b38a3169179e465e9fd16f5936d04c","observation_id":"f4eab34f-d922-4982-a5d2-f90be16f3130","resolution":{"observed_at":"2026-08-09T05:07:56.313827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.300124Z","title":"Sub-network discovery and soft-masking for continual learning of mixed tasks","venue":null,"work_id":"4e9a2361-f003-4f3a-90db-765e3063c7fe","year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.799592Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:e58245a4f8863f369dc2d5d3694367bc90809c7fb3e7854cd53e2476657b084d","observation_id":"9f229cde-d817-4449-98b6-c8d3c1aa77b8","resolution":{"observed_at":"2026-08-09T05:07:56.303860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.290220Z","title":"Continual learning of a mixed sequence of similar and dissimilar tasks","venue":null,"work_id":"3df6a5af-e514-4fbe-b49e-03872eeb8358","year":2020},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.803261Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:8a34d8bba31fe56ea98505124cb4c5e1c3c8c4f8228251c8a29f5450a43c6c9e","observation_id":"a3e976bd-4553-4a41-bdf8-9c3cd29dbd42","resolution":{"observed_at":"2026-08-09T05:07:56.293821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.806870Z","title":"A., Milan, K., Quan, J., Ramalho, T., Grabska-Barwinska, A., et al","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.806870Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:9ac9d3af565b0a9b27872832b42a90cbea339bc2832c0beec6090d678dfb031f","observation_id":"0295fdd3-5a98-4714-96d7-55ee8f6b66cb","resolution":{"observed_at":"2026-08-09T05:07:55.806870Z","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-09T05:07:56.274876Z","title":"Is continual learning ready for real-world challenges? CoRR, 2024","venue":null,"work_id":"ac69ae6c-fe7d-4d0f-8e0b-c6b33e34ce9c","year":2024},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.810093Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:f14018a86e749585ae08241896782709f9200584dcd2b162dafbba4fc6c2e291","observation_id":"6cd10ef4-4a68-42ec-80b4-25b5427ab9c1","resolution":{"observed_at":"2026-08-09T05:07:56.278214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.813827Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.813827Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:0054861f879c4186fe0d07dd11b89306afa9b74060526a7c4ef5ab9e173fa5d4","observation_id":"0d5a81af-c653-4831-9666-3af1904aec22","resolution":{"observed_at":"2026-08-09T05:07:55.813827Z","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-09T05:07:56.259115Z","title":null,"venue":null,"work_id":"6713be39-ba4e-4a66-81fe-88f946744e5a","year":2009},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.817086Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:31c9e0faac2af785ea83ab4253bb651cc10ca48e03ebeac4c2ef4d3fe4c40114","observation_id":"66493ad6-70f2-44d6-a4b9-9e964c66128f","resolution":{"observed_at":"2026-08-09T05:07:56.262261Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.249085Z","title":"Continual learning in medical imaging analysis: A comprehensive review of recent advancements and future prospects","venue":null,"work_id":"b450f42f-549b-49bc-8425-55a32cc9c729","year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.820294Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:a30d6acaa83c6cd7c971e0ba9afc49abc7607ff88bb0dfd2f1d085544405f557","observation_id":"587f6d06-c262-4b12-b824-cf7794a81750","resolution":{"observed_at":"2026-08-09T05:07:56.252581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.239143Z","title":"Toward optimal ordering of prediction tasks","venue":null,"work_id":"21dcf783-9ba0-4fc2-aea3-faf2b19cda2e","year":2009},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.823802Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:ab9e8c636bfd11cf20491cc3cb8af4a0907fe3653595e4c4fe498dc742f6943a","observation_id":"aa1cd0b1-9bc2-4051-b5ef-25b5f370ac7a","resolution":{"observed_at":"2026-08-09T05:07:56.242671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.826792Z","title":"Continual learning in the teacher-student setup: Impact of task similarity","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.826792Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:a3aca27904d1071696c625303795e18ef2ee19f67c7790391593d06828166dc3","observation_id":"fa347bb4-cf72-4c7c-b698-5f3099737821","resolution":{"observed_at":"2026-08-09T05:07:55.826792Z","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-09T05:07:56.223833Z","title":"Continual learning for robotics: Definition, framework, learning strategies, opportunities and challenges","venue":null,"work_id":"477ee1e0-8bc3-4b4f-b929-cc71292049c5","year":2020},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.829827Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:78b3931cb2b73b0835def71f3a024d032770425fbde2c8f5eab71cb94cc21c4c","observation_id":"8896b488-6dda-48b1-8774-ee082dd9bd96","resolution":{"observed_at":"2026-08-09T05:07:56.227517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.214006Z","title":"Statistical mechanics of continual learning: Variational principle and mean-field potential","venue":null,"work_id":"44514dfb-a2c2-433a-a2b8-f7c3c4a12303","year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.833113Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:79641b5dfe350042a913d96c384b9152e6e97302980f9680338e70bef18d41fe","observation_id":"6342a9f3-a36f-4ac7-b23b-c3b7fbb3d5ae","resolution":{"observed_at":"2026-08-09T05:07:56.217538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.203050Z","title":"Beyond not-forgetting: Continual learning with backward knowledge transfer","venue":null,"work_id":"f398ddbf-7799-4ff4-91b4-96bd4082d159","year":2022},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.836895Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:28a64cd7a8af6388ad9478451420c2418d5529bd5bf584264dcc96b6e47fbade","observation_id":"8d8188da-427d-4db7-bdce-2fea97f15564","resolution":{"observed_at":"2026-08-09T05:07:56.206474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.839834Z","title":"Theory on forgetting and generalization of continual learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.839834Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:d9ecee04f7ada0914676b7da1ce12ebd9343a03e8d66743f07cf1416f2465cd9","observation_id":"a9b23260-f844-4317-92a9-e22a802fe022","resolution":{"observed_at":"2026-08-09T05:07:55.839834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08747","last_updated":"2025-01-05T04:09:00Z","snapshot_observed_at":"2026-08-10T01:52:30.559515Z","submitted_at":"2023-08-17T02:53:23Z","title":"An Empirical Study of Catastrophic Forgetting in Large Language Models During Continual Fine-tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08747","snapshot_observed_at":"2026-08-09T05:07:55.843806Z","title":"An empirical study of catastrophic forgetting in large language models during continual fine-tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.843806Z"},"links":{"cited_paper":"/paper/2308.08747","citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:afc63d6ee8ff105a78fc4998855c7f46dc43bcb3746977b00337b0813894c860","observation_id":"98979c58-d758-4b69-94ee-5557f6999ed9","resolution":{"observed_at":"2026-08-09T05:07:55.843806Z","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-09T05:07:55.847960Z","title":"and Cohen, N","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.847960Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:bf37d07d2ae7da059ef0e7d407d2f4920b1301570e11166b210c62a421d35ac7","observation_id":"ced2c8b3-bac6-4f5e-ba3d-6a20b69cbaa9","resolution":{"observed_at":"2026-08-09T05:07:55.847960Z","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-09T05:07:56.181136Z","title":"S., and Mignacco, F","venue":null,"work_id":"d8f52835-af4a-4e0d-8b63-81b344fdb20f","year":2024},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.851282Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:9e855ff805fc49039a25ab6649bc51502218281157b0a6964e3fc86f32ff49ea","observation_id":"dc46accd-97b2-486a-902d-8d28514c4ed2","resolution":{"observed_at":"2026-08-09T05:07:56.184864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.171436Z","title":"E., and Stone, P","venue":null,"work_id":"80c4bfbf-a813-4611-ba2c-44b55e75bf15","year":2020},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.854533Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:2d0b86034e84c49bc8ed5ea0f55d8abab8bdc856090116df3d48e66481d44747","observation_id":"96996bcb-9ff9-4d71-838c-72b4fa5b418e","resolution":{"observed_at":"2026-08-09T05:07:56.174669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.857606Z","title":"The ideal continual learner: An agent that never forgets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.857606Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:ae6887218c262e1bcbb4d9451e46345478c6d2c6cdfcb9e6c43ea927c0255cc9","observation_id":"54c5ad6b-0e80-46a5-80c7-bed4aa665581","resolution":{"observed_at":"2026-08-09T05:07:55.857606Z","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-09T05:07:56.155351Z","title":null,"venue":null,"work_id":"a58a9ac3-4440-4d65-9818-80e2140ec63f","year":2015},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.860896Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:43e56e15fdca7395ea02f2f329f6a25cc4396fe3765ca66ce506b493240c99ee","observation_id":"c629c2bf-09e1-4ed1-8165-7da7dde2d2e9","resolution":{"observed_at":"2026-08-09T05:07:56.158859Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.144699Z","title":"N., Brunskill, E., Griffiths, T","venue":null,"work_id":"8e923ff0-09f2-46e0-858c-681d524b7ca9","year":2016},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.864039Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:5396324a9ae7cd244f1026bfb14091c8c3ca8c397c3a5d5879906debfe26b68a","observation_id":"7a77cfa4-43d5-4dcd-af4b-85d4c10651d3","resolution":{"observed_at":"2026-08-09T05:07:56.148224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.135038Z","title":"V., Dyer, E., and Raghu, M","venue":null,"work_id":"5079424d-7029-4f33-bd58-85a35695b864","year":null},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.867344Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:432d37876952e6a960036f18f3e55f231ba7adf75008f51504213ab2a586a4d2","observation_id":"6189ddbe-a579-4fdb-bc47-9a6f6eeb0643","resolution":{"observed_at":"2026-08-09T05:07:56.138300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.123799Z","title":"Catastrophic forgetting, rehearsal and pseudorehearsal","venue":null,"work_id":"b9123c7d-16c7-47d4-84f6-5c33746689eb","year":1995},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.871071Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:5c204ea1ecc5206c078ed0a26f880735339b6ead2d7481928e276b40768c4626","observation_id":"f7c07d0b-1401-4efe-b355-b27f2d50d134","resolution":{"observed_at":"2026-08-09T05:07:56.127276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.874328Z","title":"Experience replay for continual learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.874328Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:9672f2913859db3f96ff496b40797a1f1a777804d7cb41a9f8315ee179b9366e","observation_id":"42ffaefc-fd20-4ec7-a21c-c7625a04d47c","resolution":{"observed_at":"2026-08-09T05:07:55.874328Z","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-09T05:07:56.107308Z","title":"and Solla, S","venue":null,"work_id":"d6e32e6a-fe3b-47dd-8cd1-e7a4f7990882","year":1995},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.877458Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:f3ff5a5afd2410010220f9f3754a61a52822d12a717c88c7b2d53e4d7aa78f2c","observation_id":"695c9a1c-e78c-48b0-b5fd-77c625955dc7","resolution":{"observed_at":"2026-08-09T05:07:56.110458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.097594Z","title":"Exact solutions to the nonlinear dynamics of learning in deep linear neural networks","venue":null,"work_id":"6255ec23-6e55-4f62-a7f2-89b9016e5d38","year":2014},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.880496Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:beeafb640fecaf2189ccf8606447a11f98e92eea4e4b479e29e585512ff4e2ea","observation_id":"04ef1a09-9f88-4290-9102-c76bf380c76e","resolution":{"observed_at":"2026-08-09T05:07:56.101042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.087545Z","title":"M., McClelland, J","venue":null,"work_id":"7780d401-8592-42d7-b033-a5ecde02d8b8","year":2019},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.883615Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:d9352e9a81637b0205f6b1c7353936cb34e85d01ba2d422496705a92dd1ef3d0","observation_id":"d385b9f7-7bdf-4728-96df-ac651bf4242e","resolution":{"observed_at":"2026-08-09T05:07:56.091030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.076719Z","title":"Overcoming catastrophic forgetting with hard attention to the task","venue":null,"work_id":"ebd92156-8c65-4358-b887-d5f5990ace69","year":2018},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.886964Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:81c0d1a89d72e23ae3d1bf8c81b89434e59efd49e3a7bae121d3956612354bec","observation_id":"cdf1ef15-29e4-431a-88c9-c5bdde3cf3cb","resolution":{"observed_at":"2026-08-09T05:07:56.080253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.067158Z","title":"S., Sompolinsky, H., and Tishby, N","venue":null,"work_id":"a75443fe-d8eb-438a-b1cc-1312dd8f4e44","year":1992},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.889988Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:8f9586465b2bfe2735724777d12e89b829d5ece60ed8971e31c5062a8cd3efed","observation_id":"f737f7ea-9081-483c-ba02-9037e996c04d","resolution":{"observed_at":"2026-08-09T05:07:56.070432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.893013Z","title":"K., Kim, J., and Kim, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.893013Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:c56288a5cd65b7a60507dab5217b9d769e81577feadb8d3608b35382cf8abc03","observation_id":"a21d4bee-b1e6-45c3-9b3d-3fd9ebe7b502","resolution":{"observed_at":"2026-08-09T05:07:55.893013Z","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-09T05:07:56.049660Z","title":"W., Gao, D., Talbot, M","venue":null,"work_id":"2aba0294-fed4-4835-891c-812be476476c","year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.896566Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:b70ce71b1de7040fb01e76990fb086644b381d814556c6236d9d0bef4399ffe4","observation_id":"a01f7bdd-63ed-48ff-a414-993285046017","resolution":{"observed_at":"2026-08-09T05:07:56.053824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.038096Z","title":"Understanding self-supervised learning dynamics without contrastive pairs","venue":null,"work_id":"1807e4a9-7dfd-4f3a-883f-0ce366f8acb0","year":2021},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.899600Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:e0b1c30233cf23274c0e5b4910615536d3c91606a0704666f45024a40c7b86ca","observation_id":"1fe31c73-33b2-4017-ad37-444595f0dc05","resolution":{"observed_at":"2026-08-09T05:07:56.041819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07734","last_updated":"2019-04-15T12:22:36Z","snapshot_observed_at":"2026-07-06T07:46:29.188511Z","submitted_at":"2019-04-15T12:22:36Z","title":"Three scenarios for continual learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07734","snapshot_observed_at":"2026-08-09T05:07:55.903190Z","title":null,"venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.903190Z"},"links":{"cited_paper":"/paper/1904.07734","citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:9caf2c398ef822710f4315880badded9f61a8e16fbce85578d760042f74ce257","observation_id":"07761106-e745-4fd9-8415-ed59e3a047b1","resolution":{"observed_at":"2026-08-09T05:07:55.903190Z","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-09T05:07:56.026570Z","title":"Clad: A realistic continual learning benchmark for autonomous driving","venue":null,"work_id":"6962c01b-a97e-4896-83a6-758e2c3dc03f","year":2023},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.907263Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:52df8b91a99a9ef673c644dd54298e0abb52c0706c8e00f56fd5fe1d2f344192","observation_id":"b725c778-38e9-4d2b-9106-cfcceb7a089a","resolution":{"observed_at":"2026-08-09T05:07:56.029986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:56.016315Z","title":"Learning curves for stochastic gradient descent in linear feedforward networks","venue":null,"work_id":"6926ac0d-175a-4e90-b730-8b5d387ea381","year":2003},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.910217Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:4e74a8da5fb2ff3b33aaf404cfb8895b8d55cfbcdd75eef24a4265d7205b1fd6","observation_id":"5f428a33-b7ac-482b-9988-2ad257e4a14f","resolution":{"observed_at":"2026-08-09T05:07:56.019808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-07-06T05:56:41.814255Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-09T05:07:55.914039Z","title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.914039Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:98d4181bdc5a420050011d97b31b723a2a93c2c55d05c4f122c47b899941438c","observation_id":"3ffe1ca8-8071-45ac-8568-5822aff78667","resolution":{"observed_at":"2026-08-09T05:07:55.914039Z","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-09T05:07:56.003874Z","title":"On compressing deep models by low rank and sparse decomposition","venue":null,"work_id":"104f4372-c5cf-4a14-a435-d93a85c52234","year":2017},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.917501Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:9bf63d6f00cfe549c775da6b8a408148455de4b5131a2c7b44cc7f6983984bab","observation_id":"a250c9d5-0684-4c6b-9209-84c67f8bbf7b","resolution":{"observed_at":"2026-08-09T05:07:56.008367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"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-09T05:07:55.991982Z","title":"and Krzakala, F","venue":null,"work_id":"e73dac24-c60d-4a56-a606-389411f22860","year":2016},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.920528Z"},"links":{"citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:14f16dca11f63b24e128c0dd889a421180aa8a174c6150b4d95f05b313c94249","observation_id":"2f29e303-2704-4d38-b4a4-87b424165581","resolution":{"observed_at":"2026-08-09T05:07:55.996733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.05927","last_updated":"2018-01-18T03:53:56Z","snapshot_observed_at":"2026-08-04T11:16:37.582177Z","submitted_at":"2018-01-18T03:53:56Z","title":"An Overview of Machine Teaching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.05927","snapshot_observed_at":"2026-08-09T05:07:55.923673Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-09T05:07:55.923673Z"},"links":{"cited_paper":"/paper/1801.05927","citing_paper":"/paper/2502.03350"},"observation_digest":"sha256:6e3e1323dded4aab8bec2928d1fa84047cae4e2a26337f8a70b6bad017fb4e14","observation_id":"2068b95b-2820-41a8-9ed1-5ec47b0a1cd7","resolution":{"observed_at":"2026-08-09T05:07:55.923673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.03350","last_updated":"2025-07-20T01:26:04Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-09T21:18:42.379779Z","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":60},"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 60 of 60 outbound references and 2 inbound Pith citation observations for arXiv:2502.03350."}