{"as_of":"2026-08-16T19:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a985fece96d33891b49025b95a185aeee44d0bf2d37fc54de9cb178af869d96a","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":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:32:57.180087Z","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-13T13:23:48.683644Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22602","snapshot_observed_at":"2026-08-15T18:32:57.180087Z","title":"One rank at a time: Cascading error dynamics in sequential learning.arXiv preprint arXiv:2505.22602, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19839","last_updated":"2025-06-24T17:58:02Z","snapshot_observed_at":"2026-08-15T18:21:52.955526Z","submitted_at":"2025-06-24T17:58:02Z","title":"Improving Progressive Generation with Decomposable Flow Matching","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:57.180087Z"},"links":{"cited_paper":"/paper/2505.22602","citing_paper":"/paper/2506.19839"},"observation_digest":"sha256:bf58bbb7731d6c6fc051eff09a04950432f3ddddc506301699b798e81ba36aef","observation_id":"51f8f1d7-a6ed-4855-8b17-99e24ef13919","resolution":{"observed_at":"2026-08-15T18:32:57.180087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-13T13:23:48.683644Z","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-14T00:21:25.092042Z","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:efd3b19f5ac7cbbc658b0ce37684aef8773bfa73e9868c8a93d40d778cc8b308","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:eaa579ec91917f937708987063e324bed2e72a1474315f6d8c89d3c06c4fa437","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-13T13:23:48.683644Z","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:6b2cbed688eab67b6b2c903c3621c98ec618687ac784df41d577088f78695b26","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-08-14T20:08:29.979147Z","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-13T13:23:48.683644Z","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:1c5310c950ea3b0db92969ace84b06e6ee00d79d459c6291f5859fd74cdb2e36","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-08-16T13:51:43.541371Z","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-13T13:23:48.683644Z","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:5e3460d9c45b01dd5c34aff1ed9343ad54667398c2645518d91eed9a5b135103","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-13T13:23:48.683644Z","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:ff3099d689c04e42418571da0da4080fd1814b61ace46afb65533308a044e81f","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-13T13:23:48.683644Z","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:6cb2351dd513d070aefcbe818549010cae9f05b4a14b654c26b6371fbb6ab1a9","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-13T13:23:48.683644Z","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:bd04c9862af94dab4ac15736ca94ce1ea85b152b82fe3a191e4470389bdc34e2","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-13T13:23:48.683644Z","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:33a5545bbaa4976bd946f5bbaf347ba3d45a1ac25428f63caa6cec9ba004ddcc","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-13T13:23:48.683644Z","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:1f6e021e1e85af2b52c614c8be092085e7a1c87cf0a958a65e5b25f3ff6dfdc3","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-13T13:23:48.683644Z","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:c99ea4248a10fdbe9c1690d932990f481be91cad1fbac0b58bed421002b1d395","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-13T13:23:48.683644Z","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:2888dbad0ce8c29465509d7e1e3972318dc1ce70cdcc09b5dd8fd3933aad7ddc","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-13T13:23:48.683644Z","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:6df253845685e638d751a84d6b252ec7c3f502bcc23cc8136ca46e91ef1d4e9e","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-13T13:23:48.683644Z","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:8cf6fa99a6f3eb01c96249a2e2b8f02a10e861a2204c3c805fe1ec65df1ff9bc","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-13T13:23:48.683644Z","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:edd5ad892070a531b9492e7bc2ddec5188025e04dd1eeab07b50a57395c82679","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-13T13:23:48.683644Z","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:26207666a0c6cb11383298022ff69f3727394f5ced058d5cea5726ac6ebab592","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-13T21:53:02.384757Z","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-13T13:23:48.683644Z","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:3567db303c2fedfb3856a635730181c53e4a9bd97529d5ef9d4c0d891ad48f28","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-13T13:23:48.683644Z","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:64b36a4b19a8c23385987150566205d80aeac821272e62b452a9b2d830380216","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-13T13:23:48.683644Z","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:89866bd77ac0f31a6b98628a954532fa3702a9b4622d0b7be85bbf763a13c055","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-13T13:23:48.683644Z","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:5d1bfcf81795c42e40140e1f3a75352c43e9ab1ee55e9222a1f2aac260ddfb64","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-13T13:23:48.683644Z","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:71fc1894ef528a4c20cbdc1eb3b6fc5b57ec9681112169294ef6e325537b6a5f","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-13T13:23:48.683644Z","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:299564deaa1045b4726fd7f218c69be3fc83e3619bb67c0effbea0bfa42e5584","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-13T13:23:48.683644Z","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:3c724e59f67668ad71c72c431bc7793211a4a6467ffdf3f073476bde42234800","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-13T13:23:48.683644Z","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:f9b439e92745b0ae7964d92edcb7d783d83d62254988ee2c14661cfee7dc61c9","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-13T13:23:48.683644Z","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:d546721949363c879912b936002cadd0518be77ece9a148aaf9204805d1eb2a5","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-13T13:23:48.683644Z","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:0e05078cfd37c3f2d94116bf23a8a499edd0877e567a3ddef09a361f4728d35b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:681c226a523e07f9217ef4ad0057e3b11c8ccc57bd1c5db407eb251d9d9a5082","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:edc0432cb541b89b3d3006ffe88adbe7c212fa9ed84220aafd7e2348f4250f47","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T13:16:00.875262Z","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-13T13:23:48.683644Z","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:1306ddcf15e989c0ea6f2a32197d0c3815ac8691a711e1348cfa0bd534b17cf7","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:a46e704f591e09dbe05b8cd79aa6d240e2322b38b247bea4796e9a0bdc3efb34","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T19:24:19.864078Z","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-13T13:23:48.683644Z","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:f958934e8c690a9b666468e64218e272f1e87a37ae6de0e7543ae48b0dff9cef","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:fb39100e7327d11aa475710b9a158f78914687f4710e2480e951d8eff4e9546b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:ee4488bf26c4b90cc8e81266126b91e199e7ac583c771557cab1ed80f383141c","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:7ae2987f52216e47591f80f676bd44518f70163de92ae33540a17f2e2489bb9d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:fb79047d85ccd6830ba126339b3c22ea51ef5f7c06e1b58bc871014165a7dec6","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:c9e86afddd1c6eb4489ffd1c0cf3d32145b9c77bb83bc54bd5d823fc2f2a6f57","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:6248373154c2fd2fdf36dbca50c8fd75befc6ed43b55592b479d8d7ccafc26d4","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:5991d84d5fb2f4126157d46d4d0bd3def97e21df11e3d8f49e4b4190729fe860","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:d5d0502c9c99d920e28be043163ac58d89a50c95454196c26085403580bb8d88","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:04addb97c5b17bbbd1cb83b14dca89ddffadf8988207d5f5a38f462a058181c0","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:7e540f8463a91c1b5bc8aa9ed5e5c67069c5df66d6803960d2c4474080c3e0e6","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-13T13:23:48.683644Z","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:02c8ce3072595a3b5a349809e3512877b952f508bc8430eaf3a660439cfb215a","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:c2b9d046843cad98f10c4d16c27f79e45b19cd6d6ce3673ad137f759ad60da21","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:c608e9dd3bda75eb32e078076ae178b92de3f039302495038d4a9ad14dd039fb","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:7d3f7cf0e63b593dd04b9d3c9d3092c72cad4b7759f7bf0c0fe92028e96f3c94","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:16811c268babfe7813b8320ab652eba1bd9f48a1ef744181495ca706c0becf34","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:2a34c40ffa0f7c1304a693ebe828e7adb1f917fab7c72cedb8a100caddbdb224","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-13T13:23:48.683644Z","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:aa9cb7424e3c3a76c8c473963b658942927cceeed149368182d6b61e441a2eb9","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:490a75c7ef1d0275c5a7803f606a6c7abb9881d8fe89e8d0996a10d7460a4d3b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-15T05:52:00.854650Z","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-13T13:23:48.683644Z","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:ded146c6230f98abda6ee09b4f10b0b55e89f4dbabeaad572e505eb0231c0833","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:ac794d7861d6607cfb73d20267e3ff0a7b30b6de911721906524c50fb3e8f426","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:3d4d90d04d158523b7347e68751a5812da4ac4fbc5d113b863ce89995d6687dd","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:426ebee774b108458e393ca957c50ad257fc9d3c49539c96c208a61cad0a7782","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:6ec04d44e00ce1ed6d896190991e934b12007b0efbba9f5519f51b2c8a0f3077","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:c75bea256994e2bf92a9eeb3abcbc99d8ae40c05ce462ba5dc50692467a4edce","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T20:00:00.667477Z","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-13T13:23:48.683644Z","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:fa0beff4b072f22f4b6565a4519665edc60edec2daa8267244fd685ee2654689","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:9a344294834be0a70dfe62827e0879c535f42f239d2a7dadeda770e1e69eeb4c","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:a921ca20767c3fb8a5e2246da6b6df1b7c00dd96f8fac9352c4d50709ff053d9","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-08-15T00:15:20.589809Z","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-13T13:23:48.683644Z","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:933ff5dad9ad605a1616c249cbcc148acaed73b50e75a79015408999c2d72500","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-14T22:33:01.643882Z","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-13T13:23:48.683644Z","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:e83f4587037d7a3ac6c075aaff7f5698baceb416729ef23bb61b1e4a0b9e7024","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-13T13:23:48.683644Z","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:18f25b7c55092ff1b2050cc49718eeb708b3b5dfc03aa99e679533e5c1df3fca","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:ef1d901bf5c24c1e20ea8c14de6509e0d98ba625a1cc4492c7ef72e2d8cc20c5","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:0560fcbd9f6a7bf07db3d25598f6ceb71e19454393d66d0c3a2817802fffc0ac","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:e41ed810e4baaea1d87c72c6bea52a1bc02a07692dc5b1b0b8cc0967d8b27208","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T21:40:22.974748Z","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-13T13:23:48.683644Z","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:77a27cd7c23f39025b20c83f0df2ac1324f6121ebe08b6ceda0dd54b7aa9a5ce","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:f2041dd1ed6fc093834d54b1a21f089b9b39261b5e3b36197a6d3263359adb47","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:14d800a25691983fa02ba5f7d19ffc35f70daea20a89c81c0c10e850a6341301","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:558afc21af5ac260637de7c25a80781107bab4d7ff9ff2fbb522c2a145700bb8","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T21:53:23.294817Z","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-13T13:23:48.683644Z","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:520d8e5ca25203fc7d97c09fdcb781c142ca57777198cfaad9e2550f0ebf7897","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T21:08:31.903941Z","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-13T13:23:48.683644Z","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:679ee62ae4cfa15c0803e3c60605b81fb32f1e4ce218998696ea69ad39b6207c","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:472186bcdf96bb911ea5618aa4415347426c4e8e97102a2ea95530c6d0ce13da","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:665f87768aa5b5eda5e87ea54348eaf120f85c6997bdabbff43ca87fd451d2ff","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:b5ad6d65e5ba28eba928eb106cd327d116b0e54337edcdb5436f52fcdbc332c4","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:0d98239e7f5516cc21e9e878d817b525c84b5f01312efe5ec73d18ffcaa8b713","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-13T13:23:48.683644Z","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:99df91defb01a58f4ede5aa3ca55a23c91c0b4a2aba808bb1c80d3f4c6b0d40b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T18:47:03.694520Z","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-13T13:23:48.683644Z","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:8ba2be4330fbbe9286bd3e673c47f02a6b8912000f9f5204072089d01627bb33","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T16:22:59.266813Z","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-13T13:23:48.683644Z","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:2297d3aa40d65050741a702a2353c80918d66dedb25bccbc8740dcca5389a7ff","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-13T13:23:48.683644Z","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:f215be1a02d67eff5e882b5c641e78861eceebdb1374e9dcb8a450bde4004601","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:c18a2a757ad05d7e8f4f9d44f1b9217f9536b58a2984177309a9c7dd0e6fdcef","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-16T14:44:48.743607Z","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-13T13:23:48.683644Z","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:181a7795ebfa8f2513e65df02597c1bb452cbf41c428433a9ff6b14df593cf07","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:ac7ce2e95ba824cb784fae3331c80127e9b41d571029ad7d2258fb946331aef5","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:e14722894c5ec42f847800cc099d6521f2a15a4dd75c48b66c3e2f075c0ad6db","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T14:50:05.861873Z","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-13T13:23:48.683644Z","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:b232b542fb7e3516cb6fdd8e21082cc99039f530b5481c5a3af52d71216d5265","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-08-12T23:46:47.414754Z","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-13T13:23:48.683644Z","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:997f352f86f917134d0ce5e7171042b6e525a77f05e07a8086d060cffbfc89bb","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-16T13:15:49.145318Z","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-13T13:23:48.683644Z","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:c0f2cbc2d601c74632c03ff66ff1fb63d5bf9ba5f0efb479878144ed61d86a4b","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-16T13:35:16.649876Z","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-13T13:23:48.683644Z","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:5585a748b0b2e6ac15aa89007f9c3869058f2a0a8aca7e248bf07a8647f9b8f1","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T13:42:33.152857Z","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-13T13:23:48.683644Z","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:aa3a540132a5d94a4bd2e05d0fc64b01b6daf2ed4669cc8674df154192579c8d","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-13T13:23:48.683644Z","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:55552e6288f61717bc8765b839e2d49dbae239aef5754a9de54b01764167c07c","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-16T14:15:11.638425Z","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-13T13:23:48.683644Z","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:b3a06c885b1e27e05a9ac4498aaf0c07d7ca0e8482602e09a23113ec20d69b82","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-16T14:29:06.916084Z","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-13T13:23:48.683644Z","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:d7bd717d41c16b3fac3d9a8b4e4ad2ef80fe94b4bf81d61c45ab97f0be1fe1d3","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-13T13:23:48.683644Z","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:68628c26bf4f2f892d676796661cb1a2553e431878558d001378dd70b15bf5f3","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-13T13:23:48.683644Z","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:04ad19d32509e00f67a3b11209bf4b6c6a328babd959c66ccf677031788f7ad3","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:c1940459f5f00448215ecd507bea4b74c3ee9ec0edef6630d5589324e41d4ff7","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:b58d785aeb1c1a7e6160855d5afa79fdc7b373e530b7289e9ba9903089140491","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:b2deca56b528345d4b62482d6080b49741547ee4691522ac26747f1fff5d03fe","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:db354a9a3944874efaa519764a135bb8a4e1f9c391b0cd74b55f4e9ba5a3212d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:86a1090e15474781d202ff6656df48ea9e10c7f5b3a8d929cab78f6db55c5226","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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:4fc96e8eaed340d521dd0e4b2cf5a35f00ce5db12e6f38efc33e8dd2e79aa819","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-16T15:59:49.286874Z","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-13T13:23:48.683644Z","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:e3484c90809c076537754418a5515d7a5b67df55da305db214bd0a60205aa458","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-13T13:23:48.683644Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 98 of 98 outbound references and 2 inbound Pith citation observations for arXiv:2505.22602."}