{"as_of":"2026-07-22T15:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5f8ec53cd231cd09552fefd7056e01c077d58dfae44f5705d96dce90486a47ab","coverage":[{"denominator":84,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":84,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T15:23:35.559682Z","state":"measured"},{"denominator":84,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":84,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-22T06:31:00.163083+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/2604.11064/citation-record","integrity":"/paper/2604.11064/integrity","json":"/paper/2604.11064/citation-record.json","paper":"/paper/2604.11064"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Conditional channel gated networks for task-aware continual learning","venue":null,"work_id":"1407a10b-6380-4515-80ec-bf063a7d85a3","year":2020},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:367499f0a33bc1de05388491de58c66f2eaf67bb7160bb09056f2cf860fddf34","observation_id":"1e0756f6-a6bd-4bb3-ba3b-e2dff48f024d","resolution":{"observed_at":"2026-05-18T02:32:19.697386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Subspace regularizers for few-shot class incremental learning.ICLR","venue":null,"work_id":"b83633cf-c8ec-4d66-aae1-5aa39afebbba","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:d4455b85c635753cb2f4e0fb5e510a8932318fcedbd9e87ac88232bcba0fbf1e","observation_id":"5b85c57a-24ec-4a78-b78a-ff18ce0881d5","resolution":{"observed_at":"2026-05-18T02:32:19.701864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Shaping the learning landscape in neural networks around wide flat minima.Proceedings of the National Academy of Sciences, 117(1):161–170","venue":null,"work_id":"9d60ccbd-ff61-4cc7-908f-6b9a49bffa8f","year":2020},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:b3fed1968758ce40bc1f1a10a28744f6d44268329d091e1f0c99a5733c58f7a2","observation_id":"5c381161-0429-4a6d-82ea-14851b38a3b5","resolution":{"observed_at":"2026-05-18T02:32:19.695042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Objectnet: A large-scale bias-controlled dataset for pushing the limits of object recognition models.Advances in neural information processing systems","venue":null,"work_id":"45942447-a333-4155-9708-5516c43f58df","year":2019},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:685c5ae2f51d60a8b5d04441dab87f709d96ef0311f05e8801dbfe9a7ecb6779","observation_id":"81f93122-3d21-4a3d-b472-00a779097a64","resolution":{"observed_at":"2026-05-18T02:32:19.541374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Task-aware information routing from common representation space in lifelong learning.ICLR","venue":null,"work_id":"1f1acb43-551d-4543-868e-05d29e439c06","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:0c36fd94d6e66b422f53dec1ee7e96b5c364f439db9ca4232d7b48f36fab3300","observation_id":"102de6c8-5fba-467a-afdc-a950f938090f","resolution":{"observed_at":"2026-05-18T02:32:19.564305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Make continual learning stronger via c-flat.Advances in Neural Information Processing Systems, 37:7608–7630","venue":null,"work_id":"b9f5fbb0-8fd5-4d07-b1df-7e8eee4aaa1f","year":2024},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:39b3ac2f9c7166e20e7e4421af8a1232c0d4c5875e335de7b94ee8e50692a072","observation_id":"a621fe9f-24b4-4526-96a7-cd2013fbf4db","resolution":{"observed_at":"2026-05-18T02:32:19.646399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Cpr: classifier-projection regular- ization for continual learning.ICLR","venue":null,"work_id":"3adfec17-fb12-4ef2-b03e-39dc4245b9c2","year":2021},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:237f5b4a850d7596eaa0846be74e9bb6b4b533d70b182c273b42c1f1b6ed2437","observation_id":"f94591f2-64e2-4378-8005-a2a414e4d9ff","resolution":{"observed_at":"2026-05-18T02:32:19.514576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Flattening sharpness for dynamic gradient projection memory benefits continual learning","venue":null,"work_id":"7b6980e8-b203-474e-8151-7430512b7486","year":2021},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:11a9b5c14f49710e5df8ab5afa2172b6243b8627b56fb8f4d0241602099a53b6","observation_id":"18c1c2bf-80ee-4e95-89ed-0590abf9caeb","resolution":{"observed_at":"2026-05-18T02:32:19.600176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Imagenet: A large-scale hierarchical image database","venue":null,"work_id":"914e156b-b56c-4131-a4e9-2fb032bf4a41","year":2009},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:d924808f371b799c24767369fcd7df6a07eb6dcfea140ed5ba2c949432111226","observation_id":"6cde9557-44c2-461d-954f-58ece43ec642","resolution":{"observed_at":"2026-05-18T02:32:19.544042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.03141","last_updated":"2022-05-28T15:35:32Z","snapshot_observed_at":"2026-07-06T11:55:13.881828Z","submitted_at":"2021-10-07T02:20:37Z","title":"Efficient Sharpness-aware Minimization for Improved Training of Neural Networks","version":2},"cited_work":{"arxiv_id":"2110.03141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.03141","snapshot_observed_at":"2026-07-03T01:27:30.904690Z","title":"Efficient sharpness-aware minimization for improved training of neural networks","venue":null,"work_id":"09e31ef8-7353-4c92-af3b-79accf6e4bb9","year":2021},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2110.03141","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:a66ccfed15f39abd688eeaeb6b9b2de12ca613ef9eb7ece486297913fdd31d3a","observation_id":"9ec33ad2-5720-4fdd-a51b-0a55082d3ed9","resolution":{"observed_at":"2026-05-11T10:41:02.684644Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Sharpness-aware training for free.Ad- vances in Neural Information Processing Systems, 35:23439– 23451","venue":null,"work_id":"3f459583-9b2f-4953-945e-c75fb1b5ad75","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:3d33844657f755f4052e26bcb584f9eda06f9c462fc6019304a521953c229cec","observation_id":"e1bb7974-54e8-4f03-8b10-9aac9bf54738","resolution":{"observed_at":"2026-05-18T02:32:19.610257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Overcoming catastrophic forgetting in incremental object detection via elastic response distillation","venue":null,"work_id":"05c3dd49-4381-474b-897e-59a8f3eccd92","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:9537d4af05a7590fa6e3fa7ca39dca621610b1fa62b3323613486ede450db7f1","observation_id":"e75385ed-8fbb-4c32-8293-966f8b6e1602","resolution":{"observed_at":"2026-05-18T02:32:19.551505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Zeroflow: Overcoming catas- trophic forgetting is easier than you think","venue":null,"work_id":"579002e6-e1f8-446b-9222-ed32b1b9d71c","year":2025},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:75cf0355872d0947a983a81ae9456f444046a5c9388c41944978f29340d5e1a9","observation_id":"c3e77ca0-e1cb-452d-b05f-d2dea846b013","resolution":{"observed_at":"2026-05-18T02:32:19.519138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.01412","last_updated":"2021-04-29T16:44:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-10-03T19:02:10Z","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","version":3},"cited_work":{"arxiv_id":"2010.01412","doi":"10.48550/arxiv.2010.01412","metadata_source":"pith","pith_arxiv_id":"2010.01412","snapshot_observed_at":"2026-07-11T03:07:53.297912Z","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","venue":"cs.LG","work_id":"0f502a27-fa5d-459b-a595-548dc0691a9c","year":2020},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2010.01412","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:27018fb1809ee642aa725d33f28f25d57f2b4e735c2e1c812da209128ba13cdf","observation_id":"9821765c-0b98-4cbd-a687-8f8bcec08745","resolution":{"observed_at":"2026-05-16T20:13:53.559812Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Decorate the newcomers: Vi- sual domain prompt for continual test time adaptation","venue":null,"work_id":"b4a28e1c-507c-4b98-b235-341b1ca43934","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:6535ad86657d272ddf637f0f3964d2408330bde67340cc74f2a1f1b9581a10c0","observation_id":"15c518c9-2b64-409e-a642-13a21ced6cf5","resolution":{"observed_at":"2026-05-18T02:32:19.572307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"R-dfcil: Relation-guided representation learning for data-free class incremental learning","venue":null,"work_id":"cf37a62d-55a5-4b76-8985-8b851153182d","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:e1ef4e8c7bf7416480ce470018800a99140b440ba3bfbd7a815faf0c62af15b7","observation_id":"faa01e42-38b2-425d-8159-8e63d22b6202","resolution":{"observed_at":"2026-05-18T02:32:19.580023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"A unified continual learn- ing framework with general parameter-efficient tuning","venue":null,"work_id":"5c3614b3-6abf-488d-8a9f-02ccff3ffe1f","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:5b7c52d8df7ce1b51d5e9c7530ed540cfc551482d7c8ba85b8949279818cab7d","observation_id":"f3f46cc8-873b-4bcd-ad9a-4cd563fdd5b8","resolution":{"observed_at":"2026-05-18T02:32:19.590377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Embracing change: Continual learning in deep neural networks.Trends in cognitive sciences, 24(12):1028– 1040","venue":null,"work_id":"8ed85fd0-6ebe-4882-af82-89b814f6f53e","year":2020},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:58cffd770175e4abed705e268e9883b507626eaee8de4040f921c17fba52e683","observation_id":"0e55cce2-8f9a-4a76-941b-cc0eadefb600","resolution":{"observed_at":"2026-05-18T02:32:19.655955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Asymmetric val- leys: Beyond sharp and flat local minima.NeurIPS, 32","venue":null,"work_id":"b41909dd-f2d7-410c-bec0-197985897cea","year":2019},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:d3f18e149fa5adb3c0b02cfb7628c0b23a0b7ea39206d40db247cee91ffc7815","observation_id":"bc9d762c-b19b-481f-bbf9-001484f5904d","resolution":{"observed_at":"2026-05-18T02:32:19.699477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"The many faces of robust- ness: A critical analysis of out-of-distribution generalization","venue":null,"work_id":"ebe11e0e-4182-41eb-8e12-5df3c25b785d","year":2021},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:a7fb1b9ffae0f9ad7744ec8d20dc2068da2c444f7befc27956726b05046062c8","observation_id":"09a0b2ff-5384-4c7c-8dfa-8aabb158652c","resolution":{"observed_at":"2026-05-18T02:32:19.569501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Dense network expansion for class incre- mental learning","venue":null,"work_id":"d1e4e7c6-d352-4300-ad44-671a7b4b4ca4","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:62665cce2b56e9e84ee387c4be5f934fe735ee869119d6dc11aeb71deafe4412","observation_id":"232e3259-ee31-4ef3-89e0-5f290e1e6bb1","resolution":{"observed_at":"2026-05-18T02:32:19.546362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Birt: Bio-inspired replay in vision transformers for continual learning.ICML","venue":null,"work_id":"580a5aa7-af08-424b-8a70-240fd37c5983","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:76080472b8dc82534580d04d7a2edc52fd2c9dd503316f71971742ff257b3df8","observation_id":"cefba176-68f3-475b-a9e4-05f923f91946","resolution":{"observed_at":"2026-05-18T02:32:19.583019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Vi- sual prompt tuning","venue":null,"work_id":"a89548f5-81cf-4a5f-af83-647f1fbda5c5","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:33b74d86d2f13f98f569ef6300e28eaaf52f4fb0bbe9cd158ca5dc4e9c2a27a6","observation_id":"66fe1a05-3c30-4814-82ab-593cee426121","resolution":{"observed_at":"2026-05-18T02:32:19.559063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14647","last_updated":"2023-04-28T06:23:32Z","snapshot_observed_at":"2026-07-06T15:21:04.733820Z","submitted_at":"2023-04-28T06:23:32Z","title":"An Adaptive Policy to Employ Sharpness-Aware Minimization","version":1},"cited_work":{"arxiv_id":"2304.14647","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.14647","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An adaptive policy to employ sharpness-aware minimization","venue":null,"work_id":"923b4e11-c437-4c57-86cf-226f7f0b58ba","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2304.14647","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:040cfedfd2f5452cfe0473d9ad038a34188d6b9766cea2315d4f8a4fa3f017cc","observation_id":"bd35aaa5-c27a-4300-8a22-5cfcc5a62698","resolution":{"observed_at":"2026-05-11T10:41:02.579346Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Generating instance-level prompts for rehearsal-free continual learning","venue":null,"work_id":"0f7d0546-8560-4ad8-b98b-e117b544f90f","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:16533ad4a188f294b0bf94a7e8c169f63e719ebb031f89552fabf7a8b574ef18","observation_id":"c535b9f7-5ccd-4de0-8ec5-1e938f7da82a","resolution":{"observed_at":"2026-05-18T02:32:19.524102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Introducing language guidance in prompt-based continual learning","venue":null,"work_id":"44095152-5789-4302-9bac-e26e222477ed","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:0d642eecc00e6ff06f1636a8da363f6cd61e404d288817960ddd6eddd41f8d09","observation_id":"92fe2145-df7b-484c-9928-03a9ce27c437","resolution":{"observed_at":"2026-05-18T02:32:19.548731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Self-regulating prompts: Foundational model adap- tation without forgetting","venue":null,"work_id":"f4a17865-94ad-4b83-accf-62c1d6e6be83","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:6f09d0811a240a567b7672984169c63345a5337f2068311f54c30d7228b8cfa6","observation_id":"4c683a14-ded8-457d-b11b-1931272ed646","resolution":{"observed_at":"2026-05-18T02:32:19.666415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Warping the space: Weight space rotation for class- incremental few-shot learning","venue":null,"work_id":"54cb20e1-b073-498d-bc80-93100b20d678","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:bdafb33a03786b464a1fe5354977f5a4a032f5b8fe26e619d3ffd035a6b5d02e","observation_id":"4d70aa01-7f97-4e30-8a05-2328fb729223","resolution":{"observed_at":"2026-05-18T02:32:19.526499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Overcoming catastrophic forgetting in neural networks","venue":null,"work_id":"4646e832-a613-42cb-8004-cb4773f22a92","year":2017},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:0f1af3e4a721973d779e9f3f2eff7eb970b96eb1fe3608493649a064399c0103","observation_id":"81b130ad-c73f-44e3-9231-cb06cf1870ca","resolution":{"observed_at":"2026-05-18T02:32:19.683849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"af6af0c2-4048-41cc-82ec-786baa720e28","year":2024},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:557dd2e504ee9a1cb21f1b4757ba2548ea4472a2861abd2ae4140ef838e158d7","observation_id":"44e38d3b-9cc6-49f4-9242-3d872b3361b3","resolution":{"observed_at":"2026-05-18T02:32:19.516913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Learning multiple layers of features from tiny images.Technical report","venue":null,"work_id":"ded8d9e2-fc6e-4a56-89d8-8b7a22d20787","year":2009},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:45a84be030dbe6f96def380e099f99fff619f94d04dd3e1cfe1b6dbdd9dc51e2","observation_id":"c1c79965-0809-4320-8105-fe6b7294c331","resolution":{"observed_at":"2026-05-18T02:32:19.651327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Learning without forgetting","venue":null,"work_id":"6b85e6b5-a7a7-41d9-8c84-e8f8f8dae8ed","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:b3a93b0ae18ce5236eb8d0b387bafc1297a9237bbf3c9effec867fef895398eb","observation_id":"32d9bb99-c93f-4678-b2c1-18aaf5181427","resolution":{"observed_at":"2026-05-18T02:32:19.530869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Pcr: Proxy-based contrastive replay for online class-incremental continual learning","venue":null,"work_id":"2b32fc92-c532-4657-a3d7-75fe7724e7b0","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:f6e22c3730d7fb00d374547b9bacdc964d1cd41ff3fccea921422da14bf303b6","observation_id":"ac4b50bf-c060-4591-b9f1-7ad7c39f9efd","resolution":{"observed_at":"2026-05-18T02:32:19.595353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.02931","last_updated":"2022-02-07T04:21:54Z","snapshot_observed_at":"2026-07-06T12:35:02.495127Z","submitted_at":"2022-02-07T04:21:54Z","title":"TRGP: Trust Region Gradient Projection for Continual Learning","version":1},"cited_work":{"arxiv_id":"2202.02931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.02931","snapshot_observed_at":"2026-07-03T21:18:59.608242Z","title":"Trgp: Trust region gradient projection for continual learning","venue":null,"work_id":"22c6f4bf-62ae-4752-aae0-3ffd4ec8877d","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2202.02931","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:1397e4e5f3d8f977f7c22897baecd114fbc16766f1199cae1805bb5fed2d2666","observation_id":"b9a5a2fa-94f9-4f0b-b567-432276526d45","resolution":{"observed_at":"2026-05-11T10:41:02.638853Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Adaptive ag- gregation networks for class-incremental learning","venue":null,"work_id":"87ce3ac9-44cd-4e42-8d1d-4914717c9149","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:bc9e8a3d9db9a6844091593b3677df64d029dcb1a1c07b344ca50d01dd0c115a","observation_id":"3d5ae36e-6606-465b-b886-56269336b0a6","resolution":{"observed_at":"2026-05-18T02:32:19.536152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Towards efficient and scalable sharpness-aware minimization","venue":null,"work_id":"a9f8ef6a-ec74-484b-a36a-343471065f06","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:c78e67b32226674620a499743773467fd18ff8ed993a0f1f13b2d4810639a68b","observation_id":"6d1d2da0-422b-4a4e-84e3-162256638328","resolution":{"observed_at":"2026-05-18T02:32:19.653625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.20732","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T14:23:30.898577Z","title":"Continual gui agents","venue":null,"work_id":"96a64cb0-9062-458b-a4d2-52db65c7f5a1","year":2026},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:b84a5a6d13fd6e7822a58d127417800dce4e4a4b2e2d541c41cf51a4cee64365","observation_id":"a99bb73e-8558-42f8-831d-75177f714c47","resolution":{"observed_at":"2026-05-11T10:41:02.669946Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"McDonnell, Dong Gong, Amin Parvaneh, Ehsan Abbasnejad, and Anton van den Hengel","venue":null,"work_id":"0a07f2c7-3071-42c6-99f2-1788ff752483","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:3deb1db1c053bad300dda63bf7c6daf4bebbcd1c08d14f8910f9f221c7965ae4","observation_id":"b2e69fd0-fea3-4175-80a7-b1d2601a99e5","resolution":{"observed_at":"2026-05-18T02:32:19.615408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"An empirical investigation of the role of pre-training in lifelong learning.J","venue":null,"work_id":"b0e7c082-6b38-4556-b7fd-e05610bbf42f","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:cbd6f1821eb59d6afe2514d24e0fc225e737c00bec3d621c4201b8d145215184","observation_id":"cb0b6e14-4564-4245-a912-7b14c1d5df16","resolution":{"observed_at":"2026-05-18T02:32:19.585587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Alife: Adaptive logit regularizer and feature replay for incremental semantic segmentation.NeurIPS","venue":null,"work_id":"ae1083b4-021b-4d3b-a0f5-bc233681f6f1","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:883235da74e150cb45d1065a7ba5b8c75dbcd2701efe34a392a917d3bc5b55b6","observation_id":"86f64d11-8740-4aa9-a940-7fe680f213e7","resolution":{"observed_at":"2026-05-18T02:32:19.633889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Train with perturbation, infer after merging: A two-stage framework for continual learning","venue":null,"work_id":"38a38224-b68f-48af-8c12-46dd354a9ede","year":2025},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:94b65d2ccaf3b4b312110fc3a2984671b6c5ea8271efee522f5d7d2c1710535f","observation_id":"518969ea-b30d-482c-a87f-2fb40c8859fe","resolution":{"observed_at":"2026-05-18T02:32:19.626242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"icarl: Incremental classifier and representation learning","venue":null,"work_id":"a2a9f8f7-817b-47c3-a672-73544dc399e6","year":2017},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:fc759f114b733508a0405a7b8edd31a0bfdd145e1b15f1ea4fbeecbf4f7883df","observation_id":"137baf95-de6c-47b9-b7c7-b621bec53229","resolution":{"observed_at":"2026-05-18T02:32:19.639195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Experience replay for continual learning","venue":null,"work_id":"d644308a-384c-4c15-a4ff-67afd6d04d0b","year":2019},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:be49134f5e6226824a037c8da03599c093b804d68ed78b8ebd5111113147747c","observation_id":"c0b93800-616d-4816-8aa1-8ec0d1a8eeeb","resolution":{"observed_at":"2026-05-18T02:32:19.690375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Continual learning via sequential function-space variational inference","venue":null,"work_id":"fd7d6fee-8d87-48e6-9ba4-569745fe1af9","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:ee6fb5641cdd9b9a6eae6dbbc0a1444cdc3b38e65845dd381f83e6dd7ffa44bf","observation_id":"3da3a6cc-798e-42cf-9d01-0b68bc5a1d65","resolution":{"observed_at":"2026-05-18T02:32:19.648799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Gradient pro- jection memory for continual learning","venue":null,"work_id":"eb04f8e4-ce18-4731-990f-4d3ac7cf802f","year":2020},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:bc82cbebfe99fc715b5803c504530c7d68c4ef86d40929a83c7d57b09631dba8","observation_id":"8a048e17-39b5-4de3-9692-f68a8f175a49","resolution":{"observed_at":"2026-05-18T02:32:19.612737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Overcoming catastrophic forgetting with hard attention to the task","venue":null,"work_id":"837732e3-0db7-4aa0-946f-c8910e65b797","year":2018},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:5bb5fe70a26cdc7c2cb9ad42cf7b36747901b2379b5df0f485857c73b0f8f5e2","observation_id":"886ccbf8-428b-41db-8b5d-cb572e9bbba8","resolution":{"observed_at":"2026-05-18T02:32:19.688307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Overcoming catastrophic forget- ting in incremental few-shot learning by finding flat minima","venue":null,"work_id":"6451289f-7948-404e-a847-7d1e5c71da6a","year":2021},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:5ffaddceadaee37e4c5105034696919dab1c3b7f9833afc0b405a651dc3ce634","observation_id":"bc34cfb7-1006-4ab0-bd35-16167af3dafc","resolution":{"observed_at":"2026-05-18T02:32:19.561835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Woodfisher: Efficient second-order approximation for neural network compres- sion.Advances in Neural Information Processing Systems, 33:18098–18109","venue":null,"work_id":"6449776f-277d-4b40-99e8-c6f7f49da060","year":2020},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:ee244a1658eb8f96ea9792040f4e9ebde4e67ab98e1d9976e00ec756bd110ba5","observation_id":"c44fbd57-44f1-47a4-a187-8e3226cedb71","resolution":{"observed_at":"2026-05-18T02:32:19.566825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Coda-prompt: Contin- ual decomposed attention-based prompting for rehearsal-free continual learning","venue":null,"work_id":"4e8d8742-f792-4173-bb98-7fe14f80d5ff","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:8946dbbc9fb066bd30ad8a53e980106056085610b74a8297e89f31de35fd8038","observation_id":"0defe8da-a57f-4660-bd73-dccb596ac323","resolution":{"observed_at":"2026-05-18T02:32:19.628674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Decoupling learning and remembering: A bilevel memory framework with knowledge projection for task-incremental learning","venue":null,"work_id":"f9760a46-0dfc-4f80-8748-46aab93e8243","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:fc6f620e9ff9ecbf576629c65c8cbc94641486f743631b9ff38abce16c63b0af","observation_id":"c133ffda-c1cb-47de-9aa2-f607c23a7f10","resolution":{"observed_at":"2026-05-18T02:32:19.602978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Regularizing second-order influences for continual learning","venue":null,"work_id":"83f3a9f0-f6ff-448b-9e58-504b4e92c5fc","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:c3344eb0b71267cdd3e9200a40e5b2e2697f55df5ab2e8918fe871282b90f987","observation_id":"26ef4a2f-0845-4ce6-b0b2-e6af496e5224","resolution":{"observed_at":"2026-05-18T02:32:19.538676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"When prompt-based incremental learning does not meet strong pre- training","venue":null,"work_id":"278974ce-da21-4f82-aa9f-370d6081bd99","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:c9b02b8d69c75865e81da5a4003513c89e1f0405ecf41c25fb69958fda768995","observation_id":"1456d6a5-4602-410b-80e0-0dae61fd9f45","resolution":{"observed_at":"2026-05-18T02:32:19.631308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"The caltech-ucsd birds-200-2011 dataset","venue":null,"work_id":"2df07a1c-3d40-4a00-8ef9-672dd784bebd","year":2011},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:fdf574fe9f769b2eff849ab103126c1f1980145a8bcc30246cc6591ee5da661d","observation_id":"21d26a7e-8a7e-45d2-887e-5a143a0ccf51","resolution":{"observed_at":"2026-05-18T02:32:19.512298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"A comprehensive survey of continual learning: Theory, method and application.IEEE transactions on pattern analysis and machine intelligence, 46(8):5362–5383","venue":null,"work_id":"365b9d59-e533-4f90-a270-981728db317c","year":2024},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:9a9c19982caacfc61dbf5460631175414a6e76057a938a3215dfc975c82bc324","observation_id":"e5087580-bc69-41f0-a8ec-5184613bbe2e","resolution":{"observed_at":"2026-05-18T02:32:19.641860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"S-prompts learning with pre-trained transformers: An occam’s razor for domain incremental learning.Advances in Neural Informa- tion Processing Systems, 35:5682–5695","venue":null,"work_id":"efa84e71-44bc-4c5d-bd39-7ba944f615c6","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:9876928097ac2bdac05bc590adc0eacb4cee467217e3dbb358a7831d4f36ac6f","observation_id":"f3b46e5c-10cc-4257-a022-ec500f07737e","resolution":{"observed_at":"2026-05-18T02:32:19.521720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Isolation and impartial aggre- gation: A paradigm of incremental learning without interfer- ence","venue":null,"work_id":"54ccb43c-9f32-44ea-bcff-4364e211af58","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:b825386a99820c8ddc966caf43ebe90ddabf153cd048656ea90acdab56ec18ad","observation_id":"7ac95487-f5b0-465c-8460-6b9ee85b63db","resolution":{"observed_at":"2026-05-18T02:32:19.577427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Learning to prompt for continual learning","venue":null,"work_id":"86af5ff2-2efe-4793-a799-50e24b3523f1","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:20132710c01a7f02adef879539ae4794a64344e4af6b4f1c04eab7852ae2b7b7","observation_id":"87cd652e-6b85-41e7-897b-38ff3f81059d","resolution":{"observed_at":"2026-05-18T02:32:19.597697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"DER: dynam- ically expandable representation for class incremental learn- ing","venue":null,"work_id":"9b866902-68b4-4b76-a5e5-4a2155ddfd8e","year":2021},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:a45cab9f044f300ae088ad1b2b87297b916ca66bf8f3f1cfb32e54ff6d59639e","observation_id":"ebde55d8-f882-47c7-9bca-e73b5cfe2606","resolution":{"observed_at":"2026-05-18T02:32:19.681013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Scalable and order-robust continual learning with additive parameter decomposition","venue":null,"work_id":"7727e6fc-ac3b-4716-9636-98981b5d9bfe","year":2020},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:b2b170aa1f4ac2cf0e8dcb421e0c235d91748bc0bbcce12c266388db07f8fdec","observation_id":"18996930-5ded-41a9-a40a-ad685c3822b6","resolution":{"observed_at":"2026-05-18T02:32:19.663945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Slca: Slow learner with classifier align- ment for continual learning on a pre-trained model","venue":null,"work_id":"e03838b7-3530-41bf-b9b9-d5fe078c7d5c","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:a58d29018f9c765986801548f487b9dc8e1d9bb2272b6b57e8192a7f56b3ffe3","observation_id":"eb7705c8-46ce-4814-a894-3cc9032c1858","resolution":{"observed_at":"2026-05-18T02:32:19.658289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Gradient norm aware minimization seeks first-order flatness and improves generalization","venue":null,"work_id":"51778c64-9637-4930-8d3f-519d6cf4cda0","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:89e2d017eb19ba15d95f54bc36f40ef266fa23ba499582bafdf7955cc67612c4","observation_id":"69848000-f247-4d28-a675-329d1b8090c8","resolution":{"observed_at":"2026-05-18T02:32:19.553978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Penalizing gra- dient norm for efficiently improving generalization in deep learning","venue":null,"work_id":"0925a8ba-c383-40d0-b726-457419e5ebe1","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:2368995b6e646ae654ee05b0b294d6cac991e77e3b5fba5a258d68fa040a0b94","observation_id":"79d85654-4035-4c1c-8114-1720b9507eb5","resolution":{"observed_at":"2026-05-18T02:32:19.692826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.09962","last_updated":"2023-04-10T06:43:15Z","snapshot_observed_at":"2026-07-06T12:49:36.698431Z","submitted_at":"2022-03-18T13:57:17Z","title":"Randomized Sharpness-Aware Training for Boosting Computational Efficiency in Deep Learning","version":2},"cited_work":{"arxiv_id":"2203.09962","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.09962","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ss-sam: Stochastic scheduled sharpness-aware minimization for efficiently train- ing deep neural networks.ArXiv, abs/2203.09962","venue":null,"work_id":"a55b8b18-36dd-4e70-8590-1cf67b5643fc","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2203.09962","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:77d9077cbf7e89b3b527b5b933341ea012cc6bb51bedf3e3d9bb53f7ae720006","observation_id":"cbcda845-996f-4a95-9134-0e729928a769","resolution":{"observed_at":"2026-05-11T10:41:02.654579Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05497","last_updated":"2022-10-11T14:53:58Z","snapshot_observed_at":"2026-07-06T14:03:42.001135Z","submitted_at":"2022-10-11T14:53:58Z","title":"Improving Sharpness-Aware Minimization with Fisher Mask for Better Generalization on Language Models","version":1},"cited_work":{"arxiv_id":"2210.05497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.05497","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improving sharpness-aware minimization with fisher mask for better generalization on language models","venue":null,"work_id":"1ad3537d-0cff-4cea-84a5-134b5a96a1d3","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2210.05497","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:0361d82ad3434493567934ff555a40b777cd546eea4a6f7762c6090c87256a9f","observation_id":"56e45640-04ad-42ad-a1ef-dedea919845c","resolution":{"observed_at":"2026-05-11T10:41:02.714403Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Pycil: A python toolbox for class-incremental learning","venue":null,"work_id":"6f2a0b40-7997-4f57-8b91-1535735a557a","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:0b425af10038710e8aa157e1c2ea32a599add888f0b2d05f4fb8a70b75d446ca","observation_id":"c8e2591f-403f-4133-94a5-ab57a7583f19","resolution":{"observed_at":"2026-05-18T02:32:19.556502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03648","last_updated":"2024-07-15T13:35:33Z","snapshot_observed_at":"2026-07-06T14:49:23.099154Z","submitted_at":"2023-02-07T17:59:05Z","title":"Class-Incremental Learning: A Survey","version":2},"cited_work":{"arxiv_id":"2302.03648","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.03648","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deep class-incremental learning: A survey","venue":null,"work_id":"738fc88e-ecf5-4f2f-a714-b41e0d436beb","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2302.03648","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:57384f8fa1cbec0b2aa2555de18d36ba2c2a5cebacd1ac3cde00412a3f90bd0a","observation_id":"1659b2f8-c1cc-4897-a568-450421948b70","resolution":{"observed_at":"2026-05-11T10:41:02.566040Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"A model or 603 exemplars: Towards memory-efficient class-incremental learning.ICLR","venue":null,"work_id":"6f6f5cf8-86d8-4632-b06d-14c3706e6ff4","year":2023},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:657b9f34833c440d770adb634c0918fee8bf1a12936d0f8ef60777ae942da816","observation_id":"5976a6c7-1781-43d2-adf4-93264c36a641","resolution":{"observed_at":"2026-05-18T02:32:19.588089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.19270","last_updated":"2025-02-12T10:37:04Z","snapshot_observed_at":"2026-07-06T15:35:33.952097Z","submitted_at":"2023-05-30T17:59:32Z","title":"Learning without Forgetting for Vision-Language Models","version":2},"cited_work":{"arxiv_id":"2305.19270","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.19270","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning without forgetting for vision-language models.arXiv preprint arXiv:2305.19270","venue":null,"work_id":"2bedd690-7f45-4d0e-a608-ecd1d74cb2c0","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2305.19270","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:972ad1dee3a5bb4d1e12f494abe2659b0d45bbd463d267c1af14152af73fbd12","observation_id":"7c409b5f-41fc-42db-a5f1-b216a5345124","resolution":{"observed_at":"2026-05-11T10:41:02.596828Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Revisiting class-incremental learning with pre- trained models: Generalizability and adaptivity are all you need.International Journal of Computer Vision","venue":null,"work_id":"dc1e127b-814f-42fb-a9e3-efe95d6aff11","year":2024},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:8d2cff270891ceda174183837bee13fee4c41b53b33adc8ad0b4f8080d8b58fd","observation_id":"18340acc-8303-4435-a897-379b78683bae","resolution":{"observed_at":"2026-05-18T02:32:19.618246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16386","last_updated":"2024-04-23T10:44:01Z","snapshot_observed_at":"2026-07-06T17:21:58.983048Z","submitted_at":"2024-01-29T18:27:52Z","title":"Continual Learning with Pre-Trained Models: A Survey","version":2},"cited_work":{"arxiv_id":"2401.16386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.16386","snapshot_observed_at":"2026-07-04T02:49:25.503928Z","title":"Con- tinual learning with pre-trained models: A survey","venue":null,"work_id":"283359ab-3ad3-424b-a6b8-89e104f4360b","year":2024},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2401.16386","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:7be2086ca372fd6a605e40dc3d5bd4d2e9a3e5515cfecdc2d5f1f7cd5b7c40e5","observation_id":"d5f23034-14b4-45a4-a37e-358bdd969aa5","resolution":{"observed_at":"2026-05-11T10:41:02.630246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12030","last_updated":"2024-03-18T17:58:13Z","snapshot_observed_at":"2026-07-06T17:46:29.153377Z","submitted_at":"2024-03-18T17:58:13Z","title":"Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learning","version":1},"cited_work":{"arxiv_id":"2403.12030","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.12030","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Expandable subspace ensemble for pre-trained model-based class-incremental learning","venue":null,"work_id":"902e0186-80b8-45a7-9592-ab01a183bc54","year":2024},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2403.12030","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:bd05edb618a0595d8d825f92cafd653559a261dd81a373cdd53b5dc687a154d5","observation_id":"d5a1be9d-966a-49b8-9b38-ce4104b93a5b","resolution":{"observed_at":"2026-05-11T10:41:02.605885Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10373","last_updated":"2025-02-20T10:08:28Z","snapshot_observed_at":"2026-07-06T19:33:00.110753Z","submitted_at":"2024-10-14T10:56:42Z","title":"Sharpness-Aware Minimization Efficiently Selects Flatter Minima Late in Training","version":2},"cited_work":{"arxiv_id":"2410.10373","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10373","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sharpness-aware minimization efficiently selects flatter minima late in training","venue":null,"work_id":"6533406a-c87c-474a-b347-7ef28221e37b","year":2024},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2410.10373","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:3a1c83484f2bffae5b028de1f13db48c541fe13c495e9080dc5d2c288b4b385e","observation_id":"898ea833-c673-4a00-a88b-6c2f1ad31e5e","resolution":{"observed_at":"2026-05-11T10:41:02.533502Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Prototype augmentation and self-supervision for incremental learning","venue":null,"work_id":"1b38e2fd-abf7-4704-8a41-35b0029fbb86","year":2021},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:ed6207d2cb6371635e3cf1611d1c45a01e9ee48f70ffd56a96d1e8ea0edd8103","observation_id":"b0d255a8-557b-4785-966d-c23e34741a91","resolution":{"observed_at":"2026-05-18T02:32:19.592793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Self-sustaining representation expansion for non-exemplar class-incremental learning","venue":null,"work_id":"2292c613-46da-4aef-8745-844581162609","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:88869d67c2387c27c96219eeaaf5d5aea66eb7a07ff263848a182e064b278ddf","observation_id":"c86d6297-8ccd-4efc-ae0b-1949faf9349d","resolution":{"observed_at":"2026-05-18T02:32:19.620872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.08065","last_updated":"2022-03-19T15:56:32Z","snapshot_observed_at":"2026-07-06T12:48:13.087800Z","submitted_at":"2022-03-15T16:57:59Z","title":"Surrogate Gap Minimization Improves Sharpness-Aware Training","version":2},"cited_work":{"arxiv_id":"2203.08065","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.08065","snapshot_observed_at":"2026-07-04T13:09:50.640284Z","title":"Surrogate gap minimization improves sharpness-aware training","venue":null,"work_id":"355ec115-ef7d-4ab1-9f40-bb6fb1e10108","year":2022},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"cited_paper":"/paper/2203.08065","citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:3d85317078a5bbdb34fb144933372d27c39432f3c9192af14fc5013d0876949e","observation_id":"feb4ee73-03c2-43d8-9326-3d88681e4b14","resolution":{"observed_at":"2026-05-11T10:41:02.618219Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Appendix A.1","venue":null,"work_id":"4fe09d09-433f-40d8-bfa1-f3c863aa1bfd","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:f0e371dd89c2753006b06705306d2b321ee6456c10fca05f6714f28d03d3f869","observation_id":"4fb46705-f756-499d-b7be-96c76b692e51","resolution":{"observed_at":"2026-05-18T02:32:19.686024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"131c1c57-411d-4107-81b8-b81008e6d344","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:421d0745d0d7a458ba2a996b525d58667e84b59b113866f1ccad2879c616b497","observation_id":"2fbbbb32-dd33-4b5b-9d7b-dfa84d6045bc","resolution":{"observed_at":"2026-05-18T02:32:19.644066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"584f31d3-f0b5-4c15-9e38-ab46b1e7b388","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:0442253fac84c5da28b12bb8f3a4a59510036dc96c7ea88d2f16fa9bd5b3c1e6","observation_id":"5ba93c19-3383-407b-a6fb-d41f6b282d85","resolution":{"observed_at":"2026-05-18T02:32:19.607584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"563ebb1c-f827-4f88-8850-0e4d91c9570e","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:ba2e5211693cb9d8aaa9229a8a519ea5e8cd5e8eb35a192e9b3882f5f93d070f","observation_id":"6d2d78e7-af7e-4761-a4c8-dbe30adbd0a6","resolution":{"observed_at":"2026-05-18T02:32:19.605224Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"12aebd6d-83a0-4ac2-9097-4b5e3ef649ed","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:63ae74b1dbfe4fd3467f2eccd2888d68225fc073f1b8fcb332126788d653e652","observation_id":"5cc95f38-a537-409d-baae-2ff535407d4d","resolution":{"observed_at":"2026-05-18T02:32:19.623190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7789.1097","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c6af1b47-0c4a-437d-983b-dd9a0fab7886","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:e07e32b68b7c04777850299b3656a37a9027ef3ae8805132d7b868c2ee03eb03","observation_id":"282c4e86-2005-4313-8d39-1da216c447d1","resolution":{"observed_at":"2026-05-11T10:41:02.527988Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"76cc6d46-40a7-48c8-a24f-d93847e343ce","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:8b2aa2a379bb49028db1271dcad946d9ef63bfa4a738f8d787774d8d53d494ad","observation_id":"7d8184c5-270c-4437-b7c6-08bc46c5962c","resolution":{"observed_at":"2026-05-18T02:32:19.528751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4511358d-a1f2-49be-bee7-99007f169215","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:962cd452ceb760fb325752512d4d794c0989d5fbe6a039860852b21b01501260","observation_id":"9be27441-2892-4aec-96a8-43fda6ff82b8","resolution":{"observed_at":"2026-05-18T02:32:19.574649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-06-05T21:23:00.469572Z","title":"Assumption 4(Stepsize and perturbation schedule).We use the schedule in [61]: 𝜂𝑡 = 𝜂0√𝑡 , 𝜌 𝑡 = 𝜌0√𝑡 , with𝜂 0 chosen so that𝜂 𝑡 ≤1/(4𝐿)for all𝑡","venue":null,"work_id":"9a4262c8-c52d-43d7-8384-11ab22fa3510","year":null},"citing_paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-05-10T15:23:35.559682Z"},"links":{"citing_paper":"/paper/2604.11064"},"observation_digest":"sha256:e906d4e46d3ba7da97e480821a77b4ba7c2ac34342f51cfdbbfd694b6de8f3bc","observation_id":"4d47c03e-5b94-4695-8a63-71542a3db753","resolution":{"observed_at":"2026-05-18T02:32:19.533619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.11064","last_updated":"2026-04-15T01:05:22Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T22:59:32.051572Z","submitted_at":"2026-04-13T06:45:25Z","title":"A Faster Path to Continual Learning"},"reference_resolution":{"displayed":84,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":0,"verified_exact":14,"verified_fuzzy":69},"total_outbound_references":84},"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-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"thesis":"As of 22 July 2026, this Paper Citation Record lists 84 of 84 outbound references and 0 inbound Pith citation observations for arXiv:2604.11064."}