{"as_of":"2026-08-09T21:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7aa207e39239992ab2dc981367dbdf14aee479630c573a31846790219e02f8aa","coverage":[{"denominator":98,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":98,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:10:40.432061Z","state":"measured"},{"denominator":99,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":99,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T04:50:24.245377Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T05:51:27.038364Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"cited_work":{"arxiv_id":"2505.22602","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22602","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2505.22602 , year =","venue":null,"work_id":"b7146c97-1d6f-4cea-b724-d1b0a0d3574f","year":null},"citing_paper":{"arxiv_id":"2605.10741","last_updated":"2026-05-11T15:44:13Z","snapshot_observed_at":"2026-08-03T08:15:21.053434Z","submitted_at":"2026-05-11T15:44:13Z","title":"AdaPaD: Adaptive Parallel Deflation for PEFT with Self-Correcting Rank Discovery","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-12T04:50:24.245377Z"},"links":{"cited_paper":"/paper/2505.22602","citing_paper":"/paper/2605.10741"},"observation_digest":"sha256:adba7f3517151a2378d2aca4c75ee5b8f09a0eda6d0a2c7a8a6bcf67cdd4b990","observation_id":"bcdb39de-2dbc-4b18-8fed-7f1314e46c8d","resolution":{"observed_at":"2026-05-12T05:51:27.041999Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.22602/citation-record","integrity":"/paper/2505.22602/integrity","json":"/paper/2505.22602/citation-record.json","paper":"/paper/2505.22602"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:26.935165Z","title":"Recent advances in hierarchical reinforce- ment learning","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:26.935165Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:63100b515d4945a5921a48be7d57f1da0b658b8a3799a8a779671f0bbedd2f9f","observation_id":"1911c646-7913-4faa-8d40-7d583ae0e261","resolution":{"observed_at":"2026-08-07T13:10:26.935165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:27.136210Z","title":"Hierarchical reinforcement learning: A comprehensive survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:27.136210Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:c3d579dada5ea88960ff2073f0615b0de6fbbb38d1f125294b3d0bd6f0e607b1","observation_id":"742648ac-181c-434f-8c60-caf102338aa0","resolution":{"observed_at":"2026-08-07T13:10:27.136210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.11289","last_updated":"2017-11-30T09:47:28Z","snapshot_observed_at":"2026-07-06T06:12:00.680441Z","submitted_at":"2017-11-30T09:47:28Z","title":"Learning to Compose Skills","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.11289","snapshot_observed_at":"2026-08-07T13:10:27.354287Z","title":"Learning to compose skills","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:27.354287Z"},"links":{"cited_paper":"/paper/1711.11289","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:d5526fb4c57b8084f6e98c3f444622530dc7878743397df239ab30c9731cd696","observation_id":"8c544689-b1f7-42d3-9a9d-c0fabb8b4a57","resolution":{"observed_at":"2026-08-07T13:10:27.354287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-07-06T18:16:03.617132Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-07T13:10:27.491205Z","title":"Towards modular LLMs by building and reusing a library of LoRAs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:27.491205Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:2e28e34f2534ecd10e7a224f4f1f84a6f8133f5deb66a6cbce3996f1291ce345","observation_id":"b808e1df-d611-43fa-8a56-b1935e86bb42","resolution":{"observed_at":"2026-08-07T13:10:27.491205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:27.620539Z","title":"Joint prompt optimization of stacked llms using variational inference","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:27.620539Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:77be8e0c0a5f5544f294328d9b775e140c2dde207328382ea68eda5395a912e8","observation_id":"43c5915a-18ae-4700-a93a-d7c39bfc0d14","resolution":{"observed_at":"2026-08-07T13:10:27.620539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:27.790435Z","title":"Multi-head adapter routing for cross-task generalization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:27.790435Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:726c561253582b9fa15ff6ec12e1a2ea25b23b8013a23fa00c4c382da8d729aa","observation_id":"589402ae-7bdf-4b4f-a116-04a5b6b77cbf","resolution":{"observed_at":"2026-08-07T13:10:27.790435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:27.922113Z","title":"The structure of scientific revolutions","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:27.922113Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:9eb32b3dace5a57286f659b882bc37f331c416ca2166f77f3aae3e0a00faf14b","observation_id":"aab3acd3-27b5-42d0-8262-477c35f98acd","resolution":{"observed_at":"2026-08-07T13:10:27.922113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:28.024819Z","title":"Models of cognitive development","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.024819Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:cc4d4dfa624495142e2f39516b2968eaeb434d618c6f6f52efe2aa32c22a26e9","observation_id":"2ab6ad02-6513-4276-b39b-62bf870e402c","resolution":{"observed_at":"2026-08-07T13:10:28.024819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:28.222576Z","title":"Learning and memory.Proceedings of the National Academy of Sciences, 97(23):12403–12404, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.222576Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:a8d132b053fb334823ace00a5243226b2eb1b67a851efb6b63d47e9cf823f296","observation_id":"5833e180-f8b1-439c-95aa-918aebb46cbe","resolution":{"observed_at":"2026-08-07T13:10:28.222576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:28.348224Z","title":"Cognitive development","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.348224Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:d9fa5fbfb5073c5a9d648dc764e71174e085c69d54f730549331bec5a9ace3b2","observation_id":"caa32863-3601-4943-8692-7cf05eff0ece","resolution":{"observed_at":"2026-08-07T13:10:28.348224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:28.460761Z","title":"The role of deliberate practice in the acquisition of expert performance","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.460761Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:3aa105402102bc232978735d3bbb04f9d47d5c54fce098140d85e375506a88c5","observation_id":"8e051ea0-70c0-4657-a52c-6ea6910ee484","resolution":{"observed_at":"2026-08-07T13:10:28.460761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:28.587105Z","title":"How people learn: Brain, mind, experience, and school: Expanded edition , volume 1","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.587105Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:1761916794d16114b28798788543c79f1a3af3a789640154ac703f8ffa4499c6","observation_id":"fa8e4966-c56b-4c81-a634-e16d3429b4da","resolution":{"observed_at":"2026-08-07T13:10:28.587105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:28.700166Z","title":"Orthogonal gradient descent for continual learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.700166Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:ea11ea281a7f26942722015c501a54a9ec31ca415e8cb9d16fe15c38a2fea69f","observation_id":"d1ea9fba-0f66-4005-b10b-1e46ca2c78a7","resolution":{"observed_at":"2026-08-07T13:10:28.700166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:28.781539Z","title":"Continual learning in low-rank orthogonal subspaces","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.781539Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:29c470a331e2fd6ab235fa5dcbef6c55564875cf605d8512211a0479ed0f2e21","observation_id":"751d1ffa-cb55-4c26-a6a9-c0c10b339ca2","resolution":{"observed_at":"2026-08-07T13:10:28.781539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:28.850922Z","title":"Multitask learning","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.850922Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:c3cde2f016de6b5d7efc08e319dd56b23642bb77aa180aea1cd2e7acba41395a","observation_id":"01626653-3628-41b5-8ada-7d21e0e7c4b6","resolution":{"observed_at":"2026-08-07T13:10:28.850922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05098","last_updated":"2017-06-15T21:38:12Z","snapshot_observed_at":"2026-08-04T14:30:44.904839Z","submitted_at":"2017-06-15T21:38:12Z","title":"An Overview of Multi-Task Learning in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05098","snapshot_observed_at":"2026-08-07T13:10:28.918414Z","title":"An overview of multi-task learning in deep neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:28.918414Z"},"links":{"cited_paper":"/paper/1706.05098","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:74145b464f31b2bc768967244009f5383c7b226f0577be2af0add93eb9dc34bb","observation_id":"40d31122-9996-48f4-938e-fc61dbf1271c","resolution":{"observed_at":"2026-08-07T13:10:28.918414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:29.085959Z","title":"Learning to learn by gradient descent by gradient descent","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:29.085959Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:ea50c1ddc0b520e1b773b1925fc821a0c3d6de945a545c24701e2d5428fa8f39","observation_id":"2dba6290-909e-4c39-9214-d1711f6416c4","resolution":{"observed_at":"2026-08-07T13:10:29.085959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.09796","last_updated":"2020-09-10T19:31:04Z","snapshot_observed_at":"2026-08-09T08:30:49.737024Z","submitted_at":"2020-09-10T19:31:04Z","title":"Multi-Task Learning with Deep Neural Networks: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.09796","snapshot_observed_at":"2026-08-07T13:10:29.147877Z","title":"Multi-task learning with deep neural networks: A survey","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:29.147877Z"},"links":{"cited_paper":"/paper/2009.09796","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:2edc40c0359c14932c7f652105f08bc6cd1c22685b5f3ff97678456162fb4f1f","observation_id":"6874d0ed-ce92-40fc-8e66-319006b5b35f","resolution":{"observed_at":"2026-08-07T13:10:29.147877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.03530","last_updated":"2017-02-26T19:36:40Z","snapshot_observed_at":"2026-08-01T16:56:59.989486Z","submitted_at":"2016-11-10T22:02:36Z","title":"Understanding deep learning requires rethinking generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.03530","snapshot_observed_at":"2026-08-07T13:10:29.220467Z","title":"Understanding deep learning requires rethinking generalization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:29.220467Z"},"links":{"cited_paper":"/paper/1611.03530","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:57925af0b0e73d8f106221bc392d28b226cbf80f0557711c0113779bbdc7ae4f","observation_id":"35a459fc-5a11-4ceb-a644-d2284222b785","resolution":{"observed_at":"2026-08-07T13:10:29.220467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:29.321599Z","title":"Understanding batch normalization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:29.321599Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:7b46eac04fef4bea720b73b87d1582f827f6872e57346001478229eeb9517b14","observation_id":"755e6cb8-7e62-49fc-bb6a-a7c07123ef54","resolution":{"observed_at":"2026-08-07T13:10:29.321599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:29.474747Z","title":"Understanding dropout","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:29.474747Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:bdfb8cdb7f4143cdb67aae34a7ac2268d720e490443123de9146b2489e0c644f","observation_id":"d25431a4-b070-40b5-b677-53476241d02d","resolution":{"observed_at":"2026-08-07T13:10:29.474747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:29.628208Z","title":"Optimization for deep learning: An overview","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:29.628208Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:4f9089d6667eaf70d368a77a1f8653aebdcec13ccb108b46930c0cb74900621e","observation_id":"ac6374da-6dd1-4603-9ee0-9695374b892f","resolution":{"observed_at":"2026-08-07T13:10:29.628208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08249","last_updated":"2023-10-01T18:34:20Z","snapshot_observed_at":"2026-08-07T23:54:19.429300Z","submitted_at":"2020-04-17T13:59:07Z","title":"Understanding the Difficulty of Training Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08249","snapshot_observed_at":"2026-08-07T13:10:29.797034Z","title":"Understanding the difficulty of training transformers","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:29.797034Z"},"links":{"cited_paper":"/paper/2004.08249","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:d3619694e6593343182bfc40c345880da975c216983b8e84346ce81a0b5963f7","observation_id":"b2b02d37-08a6-438d-ae56-7976968cb27e","resolution":{"observed_at":"2026-08-07T13:10:29.797034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:29.950731Z","title":"Understanding the robustness in vision transformers","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:29.950731Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:478e710b0b70dac9b21733ee96b87062d4cad8d36748838576623ffe5f4d57ce","observation_id":"74905aa9-4e3a-4e25-909a-32c5fbc42865","resolution":{"observed_at":"2026-08-07T13:10:29.950731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:58.678158Z","title":"Rethinking calibration of deep neural networks: Do not be afraid of overconfidence","venue":null,"work_id":"2f96f158-aca4-44ab-bab1-a82e6fa0e80c","year":2021},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:30.092816Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:3718a5eb997d299ade4c95dab927d51d90ca7323f55c1d2caae5c97a9628c481","observation_id":"98b1ba82-929d-4377-bf84-7c1ef054ec90","resolution":{"observed_at":"2026-08-07T13:10:58.772023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:58.476173Z","title":"Rethinking bias- variance trade-off for generalization of neural networks","venue":null,"work_id":"10d190ea-3f1d-43eb-847c-0ad2c2827e62","year":2020},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:30.254754Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:19506f8fed96108a8a28835d28244ffa229a527c844ef22fa9d0753095548c6e","observation_id":"d4746401-b2e6-476d-a4e8-2a5915032b63","resolution":{"observed_at":"2026-08-07T13:10:58.595979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:58.209878Z","title":"Learning in order! a sequential strategy to learn invariant features for multimodal sentiment analysis","venue":null,"work_id":"80217491-4c14-47a0-b098-5cba9d5c7001","year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:30.434751Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:eea0d37349dc6a0bb05689b29d8e0d7238ab0ac54b7bfa953f209af1b5950615","observation_id":"f0610df9-9eef-41a2-b1d5-5481c8a4e3be","resolution":{"observed_at":"2026-08-07T13:10:58.283591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15729","last_updated":"2025-03-04T21:41:17Z","snapshot_observed_at":"2026-08-08T01:50:40.532778Z","submitted_at":"2024-09-24T04:23:00Z","title":"Sequential Learning in the Dense Associative Memory","version":2},"cited_work":{"arxiv_id":"2409.15729","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.15729","snapshot_observed_at":"2026-08-07T13:10:43.864102Z","title":"Sequential Learning in the Dense Associative Memory","venue":"cs.NE","work_id":"2c0256be-bc6d-40d4-bdb8-24d6e7ebe271","year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:30.552033Z"},"links":{"cited_paper":"/paper/2409.15729","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:6d04a92d09e9596f4225162b78603eb230538a6cc7f78dd48a3db3475d2c6ac6","observation_id":"747ff6ad-14fb-4899-a08f-83781be35179","resolution":{"observed_at":"2026-08-07T13:10:43.989027Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:57.975048Z","title":"Multi-modal mixture of experts represetation learning for sequential recommendation","venue":null,"work_id":"456b8415-cdc5-4f10-b6d8-b165618be8c9","year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:30.617563Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:6836bbb6e182c2b116d773edc234f0405488a3688159538fa3bd2c8c5f002ee5","observation_id":"3c653b83-fd00-4a94-9c4c-5b9911c5d8e3","resolution":{"observed_at":"2026-08-07T13:10:58.104206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.07090","last_updated":"2020-02-19T17:37:41Z","snapshot_observed_at":"2026-08-02T00:20:37.416352Z","submitted_at":"2018-04-19T11:17:41Z","title":"Robustness via Deep Low-Rank Representations","version":5},"cited_work":{"arxiv_id":"1804.07090","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.07090","snapshot_observed_at":"2026-08-07T13:10:43.597590Z","title":"Robustness via Deep Low-Rank Representations","venue":"cs.LG","work_id":"ed6c47ca-329d-4ba6-8dae-3d9d1422552c","year":2018},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:30.835735Z"},"links":{"cited_paper":"/paper/1804.07090","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:a2c29caa86779a92af122f72e5fe48997d3fcd93c61ba86f038467c476419d82","observation_id":"f7a653f6-6c28-49b5-a6f1-dd56fdbf5ebb","resolution":{"observed_at":"2026-08-07T13:10:43.690457Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:57.652842Z","title":"Jolliffe","venue":null,"work_id":"6fc9937a-9c05-49f9-9642-f0fa2c240cd1","year":1995},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:30.955712Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:90d808962b6b8f5d68d4e79f10b03545dec92102262b913256dda7b6fd7200ed","observation_id":"a930a8fe-9ba2-4362-9373-a12b0731089e","resolution":{"observed_at":"2026-08-07T13:10:57.784777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:57.365697Z","title":"Matrix factorization techniques for recommender systems","venue":null,"work_id":"c5943543-c0b9-4170-a875-699a7f22bebe","year":2009},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.078723Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:bc74e4151ee93a98554ccfab716c6f41abf673066b24f02535c7f49b76517296","observation_id":"f8abed6c-414c-46e4-9a98-5ceeaea03c1d","resolution":{"observed_at":"2026-08-07T13:10:57.493107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:57.027032Z","title":"Low rank subspace clustering","venue":null,"work_id":"ba7cb620-9fb9-4e39-be09-07456d00a206","year":2014},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.186009Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:94b04b1792ec0c9f3339b84ca7483a18eb72550605cc874c689eb665e7d1d724","observation_id":"2f5a0b4d-059c-4464-b2ef-7d20c5210c42","resolution":{"observed_at":"2026-08-07T13:10:57.179575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:56.743499Z","title":"Exact matrix completion via convex optimiza- tion","venue":null,"work_id":"c5c99647-f3d8-4300-b3b4-80de4e41fa19","year":2012},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.296498Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:03b73936da240077849a9421de65c73383d77fbd466cbc93d7f657c8556219c3","observation_id":"f703a427-d03c-476b-a5a7-2ecbc04357a0","resolution":{"observed_at":"2026-08-07T13:10:56.872513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:56.378380Z","title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization","venue":null,"work_id":"cfa1ed44-3c15-420b-a876-274c38ea722e","year":2010},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.372928Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:fa66db1d73749ad5f48d3fbafe675a542985b6c9515dfac181b7004ff62d73f4","observation_id":"914b2f82-8b05-40ca-a910-e07f0c132524","resolution":{"observed_at":"2026-08-07T13:10:56.502231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:56.094525Z","title":"Estimation of high-dimensional low-rank matrices1","venue":null,"work_id":"414cbbc8-4d69-414e-880e-cf180fbff9fa","year":2011},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.467869Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:3e6da8cd6e2130e296446d32b97f2ea11a28fade703daa4f8e229f68fa3539e0","observation_id":"f4a0ddee-7b68-45bd-8944-aa3ae4576f51","resolution":{"observed_at":"2026-08-07T13:10:56.223347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:55.795677Z","title":"Robust PCA with compressed data","venue":null,"work_id":"40864225-defd-4dd2-982a-bbb0354ee18e","year":2015},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.607207Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:2941ac622adb42dd17b66ba9cfce13477ec5b5d1fff343a69144bc9be4f1e2fa","observation_id":"9a72cb78-42ef-4d09-bde1-bee7d9300762","resolution":{"observed_at":"2026-08-07T13:10:55.986142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:55.514166Z","title":"Analysis of a complex of statistical variables into principal compo- nents","venue":null,"work_id":"9588c00b-fd05-44cb-b6e7-97cb3fbaea54","year":1933},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.773834Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:01a8bc49c62855813a65148c9decf3d6c312bc837b139723c8bfd56889f03c03","observation_id":"29f05000-8615-43b1-8366-4ea90de585df","resolution":{"observed_at":"2026-08-07T13:10:55.646801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:55.186268Z","title":"Deflation methods for sparse pca","venue":null,"work_id":"6995160c-a7e5-41ac-8858-9ff388ea608e","year":2008},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.902714Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:e72fdbb4e0f66fd88be3b52923914461b2e94ca83fc93c28cade252f56cc039b","observation_id":"6596e5ab-4e91-4a84-b3fb-ab90fd77b7be","resolution":{"observed_at":"2026-08-07T13:10:55.326129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:31.989804Z","title":"The Schur complement and its applications, volume 4","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:31.989804Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:8a579fd26e8497374f1e50698b16ba86388d2a8571f1ada1b77838baf8ca6577","observation_id":"fa02a072-39a6-4e2f-89cd-7d036d17b3fd","resolution":{"observed_at":"2026-08-07T13:10:31.989804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:54.901116Z","title":"Sparse eigen methods by DC programming","venue":null,"work_id":"a9d20daa-761b-4660-8631-66cb327763d7","year":2007},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:32.122828Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:f5ef6d52fa4ce05c0b558313495af87da6f73c51aabfa20046e90d8a242b10b7","observation_id":"79a6c1c3-99e5-4a8d-a60b-2240835bdda4","resolution":{"observed_at":"2026-08-07T13:10:55.016897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:54.591153Z","title":"Projection and deflation method for partial pole assignment in linear state feedback","venue":null,"work_id":"003f9a39-9819-4d96-9dec-eac90c943489","year":1988},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:32.238612Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:2c6f9b5bfd7a507009eb5f0e21276b54d61cd4f56d1143a890c4a81a1938ea74","observation_id":"f473e116-13ff-4d49-a312-c6c45916c374","resolution":{"observed_at":"2026-08-07T13:10:54.776009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:54.278282Z","title":"A comparison of eigenvalue methods for principal component analysis","venue":null,"work_id":"87a7b712-ea88-4aa4-b890-4fbef0f84bd4","year":2014},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:32.367228Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:f22d54c72349ad91a9a8053a8899242819aecc7f20d77bf9e040018209f6a656","observation_id":"e9a86ca2-a0ec-4751-a48d-871ad7b7496f","resolution":{"observed_at":"2026-08-07T13:10:54.415815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:53.845607Z","title":"Projection approximation subspace tracking","venue":null,"work_id":"c6b86dcb-aaa7-4121-b3b1-4384c849d547","year":1995},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:32.469963Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:ddca8fcee0240ce13a49cfa97f0772f30f68bae0dd01ae93ec29dd742e758008","observation_id":"bc548779-1421-4203-b173-ed471006ea2b","resolution":{"observed_at":"2026-08-07T13:10:54.076153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:53.333894Z","title":"Robust subspace learning: Robust PCA, robust subspace tracking, and robust subspace recovery","venue":null,"work_id":"62c3a3f7-a854-4b33-af58-4cc46f7abe1b","year":2018},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:32.645892Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:7ac9843e0d9926aa4f362e2b023fba5966e6ff4e900b7fb0c12f96fa4e4546b1","observation_id":"150697b7-22c8-49ce-b154-5bb3294c1327","resolution":{"observed_at":"2026-08-07T13:10:53.586529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:32.750261Z","title":"Streaming PCA and subspace tracking: The missing data case","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:32.750261Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:feac563c4206f7678cbd496604dd4b98a4bf1a97bee12d4f04c0ac38b86a01d2","observation_id":"ed15fd08-caef-4e12-82f5-0fecd28ac5bd","resolution":{"observed_at":"2026-08-07T13:10:32.750261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:52.877369Z","title":"The ideal continual learner: An agent that never forgets","venue":null,"work_id":"65655dee-f8b9-40e8-ab3b-3098fc0d9b30","year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:32.819378Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:1758bc80db068ba3a6f36f7ec3887e49d44b763e19feae867cff131df1f25eb6","observation_id":"fb627454-10d8-4671-b603-74fe7b769ffb","resolution":{"observed_at":"2026-08-07T13:10:53.083844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:52.491075Z","title":"LoRA: Low-rank adaptation of large language models","venue":null,"work_id":"344c950d-07fb-452c-9468-3a017ef0430c","year":2021},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:32.892032Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:658a4cb51f46e5b5da25301de5383210a0f9c4c3dcdde8f96f7295a13c8c2fbb","observation_id":"f08310b8-5a41-4bad-81a5-66d71e9edefa","resolution":{"observed_at":"2026-08-07T13:10:52.698408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0903.4742","last_updated":"2009-03-27T07:52:06Z","snapshot_observed_at":"2026-07-06T01:51:42.249244Z","submitted_at":"2009-03-27T07:52:06Z","title":"Guaranteed Minimum Rank Approximation from Linear Observations by Nuclear Norm Minimization with an Ellipsoidal Constraint","version":1},"cited_work":{"arxiv_id":"0903.4742","doi":null,"metadata_source":"pith","pith_arxiv_id":"0903.4742","snapshot_observed_at":"2026-08-07T13:10:43.324046Z","title":"Guaranteed Minimum Rank Approximation from Linear Observations by Nuclear Norm Minimization with an Ellipsoidal Constraint","venue":"cs.IT","work_id":"7816a668-960f-4b28-b778-632c35878da0","year":2009},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.026028Z"},"links":{"cited_paper":"/paper/0903.4742","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:b537df7c7ddf875026d39e3784eb3c844afa30d4bbf2ad3fd452b2365f3c06a4","observation_id":"b171613a-99bc-43ba-8a91-7ec19cd071d8","resolution":{"observed_at":"2026-08-07T13:10:43.456667Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:52.232326Z","title":"Interior-point method for nuclear norm approxi- mation with application to system identification","venue":null,"work_id":"90897f8f-1003-40de-9ec6-46debe5509f7","year":2009},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.101265Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:6357e7756e44dd22fab68513d0b64628399c355e7fc3ad332533c85fc352a0f9","observation_id":"3ce45750-c4c6-42c2-8a8c-67e905435a8b","resolution":{"observed_at":"2026-08-07T13:10:52.340473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:52.073081Z","title":"Guaranteed rank minimization via singular value projection","venue":null,"work_id":"54b6d549-7bd6-4a9b-9c69-93580eca30fb","year":2010},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.187569Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:48a2ccf7b280439e78ed7190e5db8e630d636979f45d424e9d568805773e3446","observation_id":"dd578896-aaea-4ef3-a358-331467f772f0","resolution":{"observed_at":"2026-08-07T13:10:52.133536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:51.883372Z","title":"Admira: Atomic decomposition for minimum rank approximation","venue":null,"work_id":"a191db5d-54b1-4295-aac8-c64ac507a82b","year":2010},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.357976Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:e69fa1c93b16af614b48014dfd1b0436ca7ac5ea89597679746bb3d562c2e23d","observation_id":"5dd5065e-5e84-4be7-83b5-ab6629a5aee0","resolution":{"observed_at":"2026-08-07T13:10:51.946504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:51.731776Z","title":"Kyrillidis and V","venue":null,"work_id":"2ab2dd26-6ff5-4212-8ce8-a6d1ffc2f0f1","year":2014},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.487380Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:b28dd6a91dec03ebcab91bce2bd46b31ae7fa6296cc7b4c3580731972f1515ca","observation_id":"15130ae5-2715-4f4c-ac1f-b6f5675e0f31","resolution":{"observed_at":"2026-08-07T13:10:51.796151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:51.593410Z","title":"Kyrillidis and V","venue":null,"work_id":"5c95c2df-60d5-461a-aebe-8723b827f1a6","year":2011},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.600777Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:4a9a585b930e6a26efab70338709abe79d97670f5dd49716009e43ba66547112","observation_id":"b9f4ade3-464d-47f1-82e7-143ebf42a578","resolution":{"observed_at":"2026-08-07T13:10:51.657914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.09379","last_updated":"2019-09-13T18:01:30Z","snapshot_observed_at":"2026-07-06T06:16:08.829992Z","submitted_at":"2017-12-26T19:40:47Z","title":"IHT dies hard: Provable accelerated Iterative Hard Thresholding","version":2},"cited_work":{"arxiv_id":"1712.09379","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.09379","snapshot_observed_at":"2026-08-07T13:10:43.039826Z","title":"IHT dies hard: Provable accelerated Iterative Hard Thresholding","venue":"math.OC","work_id":"79ca9452-ce45-453d-a8eb-cb0189c5b510","year":2017},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.755079Z"},"links":{"cited_paper":"/paper/1712.09379","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:33d37355cc9bfa06c45293e377cebc89043aa99855f7989fe50008ab5aff7e65","observation_id":"9d587d6a-b29c-4c1c-a3b2-054599fdb29c","resolution":{"observed_at":"2026-08-07T13:10:43.177553Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:51.411711Z","title":"Accelerated stochastic power iteration","venue":null,"work_id":"6d2d2b1e-b60d-4b58-b2f2-a6e2f5f4ea7b","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:33.900023Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:7e102b7ed4a1f0e62830002a9e9e8c07ff61b15e4f36872d3131fcdb3be6731f","observation_id":"5672db02-5c46-4a1a-b4a2-1d14b5173aad","resolution":{"observed_at":"2026-08-07T13:10:51.521265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:34.215549Z","title":"A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:34.215549Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:5082752351acb94cdd6615f499ce44a123a812b495e9c1e5d171fec61bdbd3d4","observation_id":"b30a8a4e-94de-4413-8d95-a534a6b74ec6","resolution":{"observed_at":"2026-08-07T13:10:34.215549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1306.0626","last_updated":"2013-06-04T00:38:17Z","snapshot_observed_at":"2026-07-06T03:15:01.221338Z","submitted_at":"2013-06-04T00:38:17Z","title":"Provable Inductive Matrix Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1306.0626","snapshot_observed_at":"2026-08-07T13:10:34.377652Z","title":"Provable inductive matrix completion","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:34.377652Z"},"links":{"cited_paper":"/paper/1306.0626","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:3f0d76661bbe1963a0302c8f4cd7d272e68fa2b50458e54707edaafc5477c4e2","observation_id":"07e5a34c-f5ca-400c-9e2f-366fea0d4eb9","resolution":{"observed_at":"2026-08-07T13:10:34.377652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1509.03025","last_updated":"2015-09-10T06:07:52Z","snapshot_observed_at":"2026-08-05T23:17:35.406310Z","submitted_at":"2015-09-10T06:07:52Z","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.03025","snapshot_observed_at":"2026-08-07T13:10:34.577927Z","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:34.577927Z"},"links":{"cited_paper":"/paper/1509.03025","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:1fa35187aa435f854279f75d2223f2a746f90fa9525d10ba87acc72d0ff0ad2d","observation_id":"ec500935-14c0-4b40-9605-ecf0781d11d3","resolution":{"observed_at":"2026-08-07T13:10:34.577927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:50.989934Z","title":"A nonconvex optimization framework for low rank matrix estimation","venue":null,"work_id":"23dfb570-6d30-47b0-9da7-5d251239c7da","year":2015},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:34.726495Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:d91b0ed0667f2a57791f4696c2ad482927a79f743a2e10c699c66c712274bc34","observation_id":"206caaad-f8b2-4dcc-8caf-c4a42a24c3af","resolution":{"observed_at":"2026-08-07T13:10:51.158219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:50.642822Z","title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","venue":null,"work_id":"9563503c-021c-4859-ab6b-0da004e4d743","year":2015},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:34.887307Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:f121d45004bd0ff543cd7f9e46f35c1405ce9eca47e0df0f5b63b83135c1c8bb","observation_id":"8b9c078b-b66e-427f-be9b-874bc225723d","resolution":{"observed_at":"2026-08-07T13:10:50.850082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:50.297952Z","title":null,"venue":null,"work_id":"ab9aad03-7ccc-4e38-9712-defff1ca64f4","year":2016},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:35.116992Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:bb4077e41d66a9edb2e0f4bf79e6b0ba133055490717bfb81fb8f487ec10460f","observation_id":"131648f8-421c-41d7-bdf6-3f7364cdead0","resolution":{"observed_at":"2026-08-07T13:10:50.440325Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:49.990804Z","title":"Provable compressed sensing quantum state tomography via non-convex methods","venue":null,"work_id":"fd20c3b7-b18d-4a0b-9747-984076e3f525","year":2018},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:35.318103Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:439bf376433533a242fc0c991a525fc5c3b7aa64970f5fd252c1fc440d8a5f86","observation_id":"760f022e-c7ef-4002-b6c5-a80d1100d67f","resolution":{"observed_at":"2026-08-07T13:10:50.135385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.03240","last_updated":"2016-09-27T00:57:44Z","snapshot_observed_at":"2026-07-06T05:10:24.678699Z","submitted_at":"2016-09-12T01:20:45Z","title":"Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach","version":2},"cited_work":{"arxiv_id":"1609.03240","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.03240","snapshot_observed_at":"2026-08-07T13:10:42.733443Z","title":"Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach","venue":"stat.ML","work_id":"b9c0e1b0-3295-4001-8280-78ffd77688c7","year":2016},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:35.470102Z"},"links":{"cited_paper":"/paper/1609.03240","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:d595a3555efc235d7cc70e3a42d4fb6725a78eb7b741ad9ef77eb9ffcdee1b98","observation_id":"66d89f81-2f47-4d79-acaa-d27d60d5ee60","resolution":{"observed_at":"2026-08-07T13:10:42.860950Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:49.707032Z","title":"Guaranteed matrix completion via non-convex factor- ization","venue":null,"work_id":"2b92fa19-5d01-4604-8b1c-96f9723eb0f8","year":2016},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:35.612399Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:a5f00fb400d36df324c707e6f5fa59bcc480fc7b4d03a2a220a7294de7f709bd","observation_id":"8101fab6-8dd4-412d-b615-74b267b057f2","resolution":{"observed_at":"2026-08-07T13:10:49.853398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:49.335712Z","title":"Dropping convexity for faster semi-definite optimization","venue":null,"work_id":"b313c843-049c-4260-8be5-77f793e15910","year":2016},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:35.739901Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:0fcc43feb8b97c58a172735c4adac7132aec29aa4056afbde8734115fb2b6365","observation_id":"3c304549-f681-4134-83f3-f2ffd1feab3e","resolution":{"observed_at":"2026-08-07T13:10:49.529813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:48.972371Z","title":"Global optimality of local search for low rank matrix recovery","venue":null,"work_id":"fdadd29a-9411-4072-a9b2-6960ef335f46","year":2016},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:35.874133Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:86c2d9e63a3e4b0d35810a42ba7832ca36942c6f8d6fbbee5f524e280c2accd8","observation_id":"0fe02c6c-6af9-4d7b-abc4-7b413d5cba0c","resolution":{"observed_at":"2026-08-07T13:10:49.165959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.03168","last_updated":"2016-10-29T21:03:47Z","snapshot_observed_at":"2026-07-06T04:59:27.042001Z","submitted_at":"2016-06-10T03:18:01Z","title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably","version":3},"cited_work":{"arxiv_id":"1606.03168","doi":null,"metadata_source":"pith","pith_arxiv_id":"1606.03168","snapshot_observed_at":"2026-08-07T13:10:42.442404Z","title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably","venue":"math.OC","work_id":"90522023-75d0-4601-a061-d28b20f4ccf0","year":2016},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:36.006906Z"},"links":{"cited_paper":"/paper/1606.03168","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:69fd1655ad0a7ff78944134d3b46388b1e1d33a715dc9cd2e1d4e855861a0ced","observation_id":"a86473ee-9d15-4014-9693-36d0867ab473","resolution":{"observed_at":"2026-08-07T13:10:42.567198Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.00708","last_updated":"2017-04-03T17:49:02Z","snapshot_observed_at":"2026-08-03T18:47:24.706084Z","submitted_at":"2017-04-03T17:49:02Z","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis","version":1},"cited_work":{"arxiv_id":"1704.00708","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.00708","snapshot_observed_at":"2026-08-07T13:10:42.237844Z","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis","venue":"cs.LG","work_id":"86a21df1-fe34-4be4-99cd-b2f2cecd92f1","year":2017},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:36.144464Z"},"links":{"cited_paper":"/paper/1704.00708","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:0ffc54a926974916d52ebafa2c2e2fa69fda55069a5c959757a33b79558bc90a","observation_id":"5b2197e9-89f4-4caf-8cb9-e6e69aa0cb56","resolution":{"observed_at":"2026-08-07T13:10:42.300877Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:48.598469Z","title":"A non-euclidean gradient descent framework for non- convex matrix factorization","venue":null,"work_id":"359ae7e6-622f-49e1-b90f-16c710c39286","year":2017},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:36.302731Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:fe7e6df7d02c400caa55f55c49fc531f3e8f24bb812b3c5b6a522ce89e6ec4fc","observation_id":"fad1a7f0-171d-4abb-b0ec-5f082e1130b5","resolution":{"observed_at":"2026-08-07T13:10:48.769256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:48.223327Z","title":"Kyrillidis, A","venue":null,"work_id":"35d33236-a687-4fa2-88b5-27d507080192","year":2018},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:36.455978Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:0bf24eb234a254301831c3a7ad9f42f24d509f099ef1f04b391bea4f630a3bcc","observation_id":"a8e18d21-3d23-4a51-b9ec-de50e8d3ce99","resolution":{"observed_at":"2026-08-07T13:10:48.383912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:48.015845Z","title":"Fast quantum state reconstruction via accelerated non-convex programming","venue":null,"work_id":"b3db2d6b-682c-400a-9a6b-a34a0e800903","year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:36.568521Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:f1435f84fa4bc58c66073c599fed4a861d36cfd7387a0b8c384b4a34055c1bde","observation_id":"c090d0b7-4602-47d8-988b-e552f3a39c40","resolution":{"observed_at":"2026-08-07T13:10:48.110815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:36.699291Z","title":"Matrix computations","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:36.699291Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:b280d07e7c50086d83bb52b4f8c47d944de138fc134db2cb7e67496bb7de067e","observation_id":"d683528c-fdf1-4ff0-9317-07210fcd5133","resolution":{"observed_at":"2026-08-07T13:10:36.699291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:47.590192Z","title":"Eigengame: {PCA} as a nash equilibrium","venue":null,"work_id":"78dc86ae-b665-4634-b910-0fc415ac11f3","year":2021},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:36.887825Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:97dd2d9ffa0a51eaf2702c1013babe2b432eec23cc380839abfcf84a584daedd","observation_id":"0e1ef574-89da-49ed-ab26-04114fe10ebf","resolution":{"observed_at":"2026-08-07T13:10:47.791247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04152","last_updated":"2022-03-22T16:43:13Z","snapshot_observed_at":"2026-08-09T18:28:30.068735Z","submitted_at":"2021-02-08T12:04:59Z","title":"EigenGame Unloaded: When playing games is better than optimizing","version":2},"cited_work":{"arxiv_id":"2102.04152","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.04152","snapshot_observed_at":"2026-08-07T13:10:41.946286Z","title":"EigenGame Unloaded: When playing games is better than optimizing","venue":"stat.ML","work_id":"3553ba1a-43cf-40cf-9158-e360085320c4","year":2021},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:37.070357Z"},"links":{"cited_paper":"/paper/2102.04152","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:95fe331554bd976ae6e100897501f0639156e716795390cbbff10f766abef877","observation_id":"0f6bb7f7-31dd-4de9-bda7-840a751029c0","resolution":{"observed_at":"2026-08-07T13:10:42.048976Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.13655","last_updated":"2019-10-26T07:09:24Z","snapshot_observed_at":"2026-08-05T12:07:30.166192Z","submitted_at":"2019-05-31T14:54:36Z","title":"Implicit Regularization in Deep Matrix Factorization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.13655","snapshot_observed_at":"2026-08-07T13:10:37.154177Z","title":"Implicit regularization in deep matrix factorization, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:37.154177Z"},"links":{"cited_paper":"/paper/1905.13655","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:8088040cc96b7a731a1a749a625d9e179014ca7a458a4d510e897bf304a4d598","observation_id":"5187ef2b-6af8-4d59-8ddc-9ec2f26b94ed","resolution":{"observed_at":"2026-08-07T13:10:37.154177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:47.257569Z","title":"Du, and Jason D","venue":null,"work_id":"b3d2c930-8df5-47e0-86a7-2db445d9b06f","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:37.293319Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:f15ddfd12dbeccc92e69187e237002e856e882ad92b228072cdc21a0d47d91a8","observation_id":"f50d816c-fd12-4f5b-ab13-27a03864f3e5","resolution":{"observed_at":"2026-08-07T13:10:47.406766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:46.880262Z","title":"Implicit balancing and regularization: Generalization and convergence guarantees for overparameterized asymmetric matrix sensing","venue":null,"work_id":"50aec232-e11b-481d-8d21-b0bdc1ba8fc8","year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:37.614192Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:43ce9c4892595639a96ea658262ae9c82b1d1929413b848e5e843976cb6a1507","observation_id":"bce8fe9b-cd7c-43de-8da3-6bc823433f2c","resolution":{"observed_at":"2026-08-07T13:10:47.063275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.05061","last_updated":"2024-03-11T18:55:33Z","snapshot_observed_at":"2026-07-06T16:44:59.350633Z","submitted_at":"2023-11-08T23:57:03Z","title":"Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning Dynamics","version":2},"cited_work":{"arxiv_id":"2311.05061","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.05061","snapshot_observed_at":"2026-08-07T13:10:41.286934Z","title":"Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning Dynamics","venue":"cs.LG","work_id":"fffb2493-bdcf-4021-bed0-322bc6bf17d6","year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:37.781160Z"},"links":{"cited_paper":"/paper/2311.05061","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:23e8287ce5974708ad845269f85972d4a1b76119dc2b5eb9b1a354ec16acd5e9","observation_id":"8c29277f-b5f0-4203-ad91-74b29028a3bc","resolution":{"observed_at":"2026-08-07T13:10:41.433252Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tcsvt.2023","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:40.622315Z","title":null,"venue":null,"work_id":"b3be8328-292d-498d-a124-026ca2243e52","year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:37.977489Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:747dc1710c984754bf00598b57f16e104a7d02a5c4db06f2151001c2acc56670","observation_id":"6e7b4a22-5f2c-4e95-be9f-464ce61a67cc","resolution":{"observed_at":"2026-08-07T13:10:40.725963Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:46.459643Z","title":"Contin- ual learning with low rank adaptation, 2023","venue":null,"work_id":"37c2858d-cebc-43c1-9841-dabf4363677b","year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:38.105799Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:55a024bc388155f312628d11498ae0b80878b714680f43b46cc91ae24f0c5e72","observation_id":"fa735d26-5e3d-4b3b-85b2-a7d8b8918e8d","resolution":{"observed_at":"2026-08-07T13:10:46.657359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.14152","last_updated":"2023-10-22T02:23:44Z","snapshot_observed_at":"2026-08-01T22:59:36.693105Z","submitted_at":"2023-10-22T02:23:44Z","title":"Orthogonal Subspace Learning for Language Model Continual Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.14152","snapshot_observed_at":"2026-08-07T13:10:38.267940Z","title":"Orthogonal subspace learning for language model continual learning, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:38.267940Z"},"links":{"cited_paper":"/paper/2310.14152","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:0444f3e0e3657636a34c7b90b5f03a1db915712f355c51c4099a95f0cfa25eff","observation_id":"a7194ccc-643e-44e0-9dfc-e8799e911ec4","resolution":{"observed_at":"2026-08-07T13:10:38.267940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10512","last_updated":"2023-12-20T20:56:14Z","snapshot_observed_at":"2026-07-06T15:05:16.471478Z","submitted_at":"2023-03-18T22:36:25Z","title":"AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10512","snapshot_observed_at":"2026-08-07T13:10:38.434276Z","title":"AdaLoRA: Adaptive budget allocation for parameter-efficient fine-tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:38.434276Z"},"links":{"cited_paper":"/paper/2303.10512","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:4ff93171a192869169806ec1e7e59dd85ad0bfb14dc6856d03c5296a64eed127","observation_id":"45701032-b117-4f0a-b37a-ea6a278b1e9c","resolution":{"observed_at":"2026-08-07T13:10:38.434276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.16167","last_updated":"2024-10-22T02:29:22Z","snapshot_observed_at":"2026-08-08T08:53:49.321482Z","submitted_at":"2024-09-24T15:08:41Z","title":"Merging LoRAs like Playing LEGO: Pushing the Modularity of LoRA to Extremes Through Rank-Wise Clustering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.16167","snapshot_observed_at":"2026-08-07T13:10:38.576098Z","title":"Merging LoRAs like playing LEGO: Pushing the modularity of LoRA to extremes through rank-wise clustering","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:38.576098Z"},"links":{"cited_paper":"/paper/2409.16167","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:a7d2e1260e38084561f3ffd21476a6738ae415ca168ef7ed52a4a213c6a20a80","observation_id":"3bc13e11-d894-4798-a682-9b0152770fed","resolution":{"observed_at":"2026-08-07T13:10:38.576098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08056","last_updated":"2025-02-26T17:56:57Z","snapshot_observed_at":"2026-08-09T15:39:12.371502Z","submitted_at":"2024-07-10T21:25:51Z","title":"Pareto Low-Rank Adapters: Efficient Multi-Task Learning with Preferences","version":2},"cited_work":{"arxiv_id":"2407.08056","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.08056","snapshot_observed_at":"2026-08-07T13:10:40.918898Z","title":"Pareto Low-Rank Adapters: Efficient Multi-Task Learning with Preferences","venue":"cs.LG","work_id":"c430209c-e4fa-4a6c-bab7-d2e442babdaa","year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:38.751034Z"},"links":{"cited_paper":"/paper/2407.08056","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:d22692158074c4077308ba52bdd227b653aeaf5f08bb0edcefca74bda8ddfc51","observation_id":"19d5f36d-f960-4b18-9056-e83e26e3dff7","resolution":{"observed_at":"2026-08-07T13:10:41.071014Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11909","last_updated":"2025-03-02T08:40:16Z","snapshot_observed_at":"2026-08-09T04:46:23.051166Z","submitted_at":"2024-06-16T14:19:49Z","title":"Mixture-of-Subspaces in Low-Rank Adaptation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11909","snapshot_observed_at":"2026-08-07T13:10:38.884701Z","title":"Mixture-of-subspaces in low-rank adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:38.884701Z"},"links":{"cited_paper":"/paper/2406.11909","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:ed56506b218cde1038946b4900a650ff0052510726c57233c45831012661ab29","observation_id":"5be3ced3-766e-40a0-b357-ff96ca864f13","resolution":{"observed_at":"2026-08-07T13:10:38.884701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:46.070894Z","title":"Towards modular LLMs by building and reusing a library of LoRAs","venue":null,"work_id":"b55d747b-e6d6-4e93-85c7-fad659293ee2","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:39.029879Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:ea2587b7a7fe03d2901a769ad1d3cf7a1792cdce30c5d17368b92780134721ff","observation_id":"5279352e-6c5b-4c04-9d34-2c0d0ccb7b75","resolution":{"observed_at":"2026-08-07T13:10:46.227147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16828","last_updated":"2024-07-26T21:56:47Z","snapshot_observed_at":"2026-07-06T17:35:41.168780Z","submitted_at":"2024-02-26T18:55:13Z","title":"Training Neural Networks from Scratch with Parallel Low-Rank Adapters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16828","snapshot_observed_at":"2026-08-07T13:10:39.159366Z","title":"Training neural networks from scratch with parallel low-rank adapters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:39.159366Z"},"links":{"cited_paper":"/paper/2402.16828","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:88543332e15668497e97d9f66ca824f6ed3ca83017f9122859fe1d15be0da936","observation_id":"f5404af7-b812-471e-85f8-ac7ca1a458ad","resolution":{"observed_at":"2026-08-07T13:10:39.159366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04151","last_updated":"2024-01-08T14:26:49Z","snapshot_observed_at":"2026-08-09T08:32:45.570035Z","submitted_at":"2024-01-08T14:26:49Z","title":"Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04151","snapshot_observed_at":"2026-08-07T13:10:39.293469Z","title":"Chain of LoRA: Efficient fine-tuning of language models via residual learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:39.293469Z"},"links":{"cited_paper":"/paper/2401.04151","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:afb3a56347687ba3f921b38e845d16673b3a45297d0ad44409e4400bfaefb893","observation_id":"8de89e86-fb84-41c7-92c5-cc8898bca693","resolution":{"observed_at":"2026-08-07T13:10:39.293469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:39.434501Z","title":"Perturbation bounds in connection with singular value decomposition","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:39.434501Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:2741da5ce0cccf828f0a0e3188255ffbbb50ae3c6b7c99616776cc12ec04b1aa","observation_id":"efc540ea-efec-4d7a-8ba3-00e8f994435d","resolution":{"observed_at":"2026-08-07T13:10:39.434501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:45.714428Z","title":"ground-truth","venue":null,"work_id":"c6060c2c-2e65-4d9e-b145-3e2f826ca20e","year":1912},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:39.660083Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:9c5a15042dfc014819715e32708ebeccb09c1e19627f76d15c618f4b651e6024","observation_id":"8c977124-82e2-4760-8430-9d474a04fb3a","resolution":{"observed_at":"2026-08-07T13:10:45.848244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:45.420535Z","title":"Given that ba⊤ is a rank-1 matrix, the product ba⊤X is also rank-1","venue":null,"work_id":"7bed28f7-6567-4beb-a88a-8b3c09ff757a","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:39.785529Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:20421e7681a5e192aec5a0785ebc359f21499168d1c568853377f9f331f901f0","observation_id":"b4f907d6-9998-43d0-bac6-330e70f9249a","resolution":{"observed_at":"2026-08-07T13:10:45.536048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:45.144560Z","title":null,"venue":null,"work_id":"d73f881e-351d-45ea-a3ba-eda0933fafb9","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:39.921300Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:62f5c1d5fd9281b6830226ea35db72ab45610c459ddf311b02b5629d4b18340d","observation_id":"c39e032c-9882-429b-b67b-6602c4e76c1e","resolution":{"observed_at":"2026-08-07T13:10:45.274628Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:44.872467Z","title":null,"venue":null,"work_id":"cd379756-f3a6-4033-a5e7-d2beb2f8633c","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:40.124561Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:39935a3df4b12f0d9118cf3c2d29f8664545110e06fb2db94375620c3653c603","observation_id":"90215a45-ecd2-47a1-9472-fde785d02402","resolution":{"observed_at":"2026-08-07T13:10:45.016026Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:44.572248Z","title":"more-first","venue":null,"work_id":"ac5f02c8-403e-42f7-a984-3b851a9a8537","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:40.268302Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:795de012d06d209565a9a076f10a600fad4a0b7e0152988e2d939ce2724f0264","observation_id":"921bb194-1901-42f5-a2cc-059bd9983c2c","resolution":{"observed_at":"2026-08-07T13:10:44.765648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:44.303077Z","title":"1→10→10” and “10→1→1","venue":null,"work_id":"0aa6c7de-1f7e-4226-8233-2c062f9a1713","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:40.432061Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:a54486812705f3b0ca5880036592a4e92744d6642097e1272aef8b6bd9c27836","observation_id":"34abb8dc-21bc-4202-83d4-554806ce8187","resolution":{"observed_at":"2026-08-07T13:10:44.428826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:10:51.257959Z","title":null,"venue":null,"work_id":"a86c4ed8-eb79-4ff9-823d-9dfb8bc9887b","year":null},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:34.028906Z"},"links":{"citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:92094bd47bda8ccbf4047990d16be5c627b8ec8a6c59b621b47006b1b4b51269","observation_id":"1186e949-3820-4bee-a33d-73023fcf9ede","resolution":{"observed_at":"2026-08-07T13:10:51.321429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11500","last_updated":"2023-01-27T02:30:51Z","snapshot_observed_at":"2026-07-06T14:45:08.248260Z","submitted_at":"2023-01-27T02:30:51Z","title":"Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing","version":1},"cited_work":{"arxiv_id":"2301.11500","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.11500","snapshot_observed_at":"2026-08-07T13:10:41.581434Z","title":"Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing","venue":"cs.LG","work_id":"dae3de17-c026-4c35-84d0-bcce0c45dee3","year":2023},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:37.445131Z"},"links":{"cited_paper":"/paper/2301.11500","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:d3535f964bf429ef599b402d5df8e58cf7e5ec55d1d88a02a0bf50a9eb45d799","observation_id":"ce63fad7-e86e-4b5f-9d76-fd69bc958237","resolution":{"observed_at":"2026-08-07T13:10:41.743230Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T23:54:45.808058Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning"},"reference_resolution":{"displayed":98,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":12,"verified_fuzzy":44},"total_outbound_references":98},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 98 of 98 outbound references and 1 inbound Pith citation observation for arXiv:2505.22602."}