{"as_of":"2026-08-10T07:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04c4524e0b71cce00f963334be962d532f9e13511dc0d722b77562640493d562","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T19:04:34.039559Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T20:07:38.811639Z","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-15T20:10:18.228576Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"cited_work":{"arxiv_id":"2502.00463","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00463","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient over- parameterized matrix sensing from noisy measurements via alternating preconditioned gradient descent.arXiv preprint arXiv:2502.00463, 2025f","venue":null,"work_id":"44e3778d-00d8-4945-aacd-2df415e75129","year":2025},"citing_paper":{"arxiv_id":"2602.19926","last_updated":"2026-02-23T15:05:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-02-23T15:05:28Z","title":"Rethinking LoRA for Privacy-Preserving Federated Learning in Large Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-15T20:07:38.811639Z"},"links":{"cited_paper":"/paper/2502.00463","citing_paper":"/paper/2602.19926"},"observation_digest":"sha256:88c90ccaae59a10af88485ee60c822ffbe1b522bb87d43c5b749121db1a149dd","observation_id":"e8ac1fea-b0b2-4ec8-a957-ce53443b7a8a","resolution":{"observed_at":"2026-05-15T20:10:18.230382Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"cited_work":{"arxiv_id":"2502.00463","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00463","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient over- parameterized matrix sensing from noisy measurements via alternating preconditioned gradient descent.arXiv preprint arXiv:2502.00463, 2025f","venue":null,"work_id":"44e3778d-00d8-4945-aacd-2df415e75129","year":2025},"citing_paper":{"arxiv_id":"2604.21905","last_updated":"2026-04-23T17:50:23Z","snapshot_observed_at":"2026-07-06T23:08:23.939574Z","submitted_at":"2026-04-23T17:50:23Z","title":"Low-Rank Adaptation Redux for Large Models","version":1},"reference_index":118,"source":"pdf_text","source_observed_at":"2026-05-09T21:48:48.992712Z"},"links":{"cited_paper":"/paper/2502.00463","citing_paper":"/paper/2604.21905"},"observation_digest":"sha256:3b4da8cf963126d02ab36261b566f6778fcaaa5279f2debd0b69a311f9ea5130","observation_id":"904fdf8b-63f1-445e-bb68-54e2ebda7456","resolution":{"observed_at":"2026-05-11T14:26:03.888560Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00463/citation-record","integrity":"/paper/2502.00463/integrity","json":"/paper/2502.00463/citation-record.json","paper":"/paper/2502.00463"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:33.828617Z","title":"Robust principal component analysis?","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.828617Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:1b8004e85931c026b8ec5a9ffa5e23a0b99d1839ca0b86226b28036c1ae00975","observation_id":"de4fe613-2ee9-4bd5-9bed-60c9e2379c1f","resolution":{"observed_at":"2026-08-09T19:04:33.828617Z","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-09T19:04:34.735763Z","title":"Cloud removal in remote sensing images using nonnegative matrix factorization and error correction,","venue":null,"work_id":"8ce7c515-13bd-4016-ab2a-92cf432ccf83","year":2019},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.832566Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:74b02890a52eddcb8c660df35240e05bc47e0ba13034cef9b8659b5215af7c66","observation_id":"5afe3643-c169-4c2a-bcb4-f0e9613b4f4d","resolution":{"observed_at":"2026-08-09T19:04:34.739379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.725188Z","title":"Low-rank phase retrieval,","venue":null,"work_id":"c80d6bbe-ffb6-429b-8dae-d87e4040538c","year":2017},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.836453Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:b10c6de106c2fc7f2029fa35ee69f23c81fc3d65136838da470f8e2ee3b5f514","observation_id":"41bc4b80-ddab-4f82-97f3-183025e6fd63","resolution":{"observed_at":"2026-08-09T19:04:34.728622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.713740Z","title":"Sample-efficient low rank phase retrieval,","venue":null,"work_id":"3d926fff-0506-49a8-9dab-7bc295f45d15","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.840097Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:0f66825a278cb5c6a29695734d7c3dd2560f2be79bbaa7a795ffa8ea35a577ad","observation_id":"8936be55-eee8-4071-ae8f-344f336c21fe","resolution":{"observed_at":"2026-08-09T19:04:34.717495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.702694Z","title":"Robust and efficient high-dimensional quantum state tomography,","venue":null,"work_id":"ea503d9e-4ac3-42dd-adb3-b1d4dd1cc02d","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.843494Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:c24ce3d4045df250e7a75609859514fc8b79fa1569dc03e3b94c0ec456601377","observation_id":"15b891bf-e586-427c-b3f9-1af07e94d95b","resolution":{"observed_at":"2026-08-09T19:04:34.706488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:33.849532Z","title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.849532Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:50c69c05084fdc2c31b0840901a5e86ab623984d42c53c804dc53125e866b073","observation_id":"cd19bd05-f2a0-4604-8735-a3ced7fe8812","resolution":{"observed_at":"2026-08-09T19:04:33.849532Z","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-09T19:04:34.684667Z","title":"Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements,","venue":null,"work_id":"2a7d53b9-4b70-47da-9387-5833629b82d0","year":2011},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.853269Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:95f5aa40d8dae7c1a6073a1080b3151a5a4415ea15e3302d42ad104d08a15295","observation_id":"f3fc64ff-398c-46b4-968b-cb6dae4449f9","resolution":{"observed_at":"2026-08-09T19:04:34.688519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:33.856486Z","title":"Exact matrix completion via convex opti- mization,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.856486Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:90f84315d70d6a8336c33ed3650d4db7b73e17113417469535bd442a9e55af4c","observation_id":"832b35d5-bcf3-46a5-bdd7-7318da968cf7","resolution":{"observed_at":"2026-08-09T19:04:33.856486Z","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-09T19:04:34.666361Z","title":"The power of convex relaxation: Near-optimal matrix completion,","venue":null,"work_id":"dd4171f8-0a65-4583-b278-9d9f4e22969f","year":2010},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.859760Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:a5d9f3e02199c76987282a99d271505c8e4d7f56c0c7b8a5f29dfd40d84a8070","observation_id":"d60e742b-5a17-46e9-841c-b2949d857240","resolution":{"observed_at":"2026-08-09T19:04:34.669891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.656466Z","title":"A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,","venue":null,"work_id":"2467a342-196c-4447-94da-a231ba2aea8c","year":2003},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.863158Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:ef174bee5228676289f3a08da1542ff2db78df779fa7359d52035b6141a2a812","observation_id":"86d363ce-5cbd-4698-a743-3060db52b8af","resolution":{"observed_at":"2026-08-09T19:04:34.659635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.646759Z","title":"Local minima and convergence in low-rank semidefinite pro- gramming,","venue":null,"work_id":"23e6ba13-5ad5-4930-b00f-e8df6e1fdc3f","year":2005},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.866499Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:3b56ec959d0c533a05d16ce3c3d7a9a99f7c0122e3a9ecd00baf93332d7b32c2","observation_id":"90398dfe-3482-42e9-9dc7-52ec79f87811","resolution":{"observed_at":"2026-08-09T19:04:34.649844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.637017Z","title":"Low-rank solutions of linear matrix equations via procrustes flow,","venue":null,"work_id":"fa36643c-4506-4895-ac5e-67c97bd00784","year":2016},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.870115Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:21b5aaa9fb3d5f58a94ab5b7c6abaa77dd07f8af46170b1d3f322646e47d47d7","observation_id":"5f115571-c008-4499-a78e-df14fad4eec9","resolution":{"observed_at":"2026-08-09T19:04:34.640324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.626954Z","title":"On the computational and statistical complexity of over-parameterized matrix sensing,","venue":null,"work_id":"06fc9453-52cf-4cb5-b361-4f18237af98e","year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.873433Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:3e0a3b5e7ca9550e192e9fe84ca455053a6c827bc267674e57c08b5a8cfac4a2","observation_id":"263d7a7f-2f56-49a6-be66-74eab76daffa","resolution":{"observed_at":"2026-08-09T19:04:34.630387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.616197Z","title":"Global optimality of local search for low rank matrix recovery,","venue":null,"work_id":"6fefe715-82c0-4e2f-bcb4-b069747d9cd8","year":2016},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.876618Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:610658162854c5913d2c86debbe22d72bbd0a56158292820a429de21a814f1b7","observation_id":"b0eac86f-b338-4754-a547-d9e886c46fa5","resolution":{"observed_at":"2026-08-09T19:04:34.619752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11500","last_updated":"2023-01-27T02:30:51Z","snapshot_observed_at":"2026-07-06T14:45:08.248260Z","submitted_at":"2023-01-27T02:30:51Z","title":"Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11500","snapshot_observed_at":"2026-08-09T19:04:33.879951Z","title":"Understanding incremental learning of gradient descent: A fine-grained analysis of matrix sensing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.879951Z"},"links":{"cited_paper":"/paper/2301.11500","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:ec423e3aa977f943f2e22e162abf9f5755f66aa8caf6a3d61e0f32ee192b75d0","observation_id":"16b6ebec-9709-4d91-bd8f-fcc2ec620c32","resolution":{"observed_at":"2026-08-09T19:04:33.879951Z","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-09T19:04:34.602583Z","title":"Preconditioned gradient descent for over-parameterized nonconvex matrix factorization,","venue":null,"work_id":"2006711a-c23d-45d4-a027-6d2366f5ad47","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.883597Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:51347f57921844f26e35885fb3495ad7ce482049a259297bdaa44031e4d462de","observation_id":"7d8aece3-d34e-478b-ba64-199d6eab62d7","resolution":{"observed_at":"2026-08-09T19:04:34.607194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.588717Z","title":"Preconditioned gradient descent for overparameterized nonconvex burer–monteiro factorization with global optimality certification,","venue":null,"work_id":"d57fb7a6-e589-48bf-a283-4cf0fdadeaaf","year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.886932Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:9439c140e76190d8a0f125e04e4b97a320185953fa54c9d9524f84b9814c504f","observation_id":"e34376c4-6c7b-42e9-92a6-c16c1f95d4a7","resolution":{"observed_at":"2026-08-09T19:04:34.594791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.575899Z","title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements,","venue":null,"work_id":"1a0a9032-ff9f-4d78-8348-4430e73b04ca","year":2015},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.890578Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:f6eb9886c001c772b8a7ef954188bd9c2ead1c47e4936c9fd3672f892228d8a2","observation_id":"ed5484a5-c571-42cd-a9f3-a04b9bbc7c7f","resolution":{"observed_at":"2026-08-09T19:04:34.580220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.564308Z","title":"Solving 2d fredholm integral from incomplete measurements using compressive sensing,","venue":null,"work_id":"f3a25139-4b82-422a-94aa-10400742b2f1","year":2014},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.893792Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:ef75f942d4d69738d1806b0528f3f992db3312645e5a0bfa145df4a9447e6336","observation_id":"6f4cfb29-3eff-48a2-bf62-7aaca3765147","resolution":{"observed_at":"2026-08-09T19:04:34.568328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.550966Z","title":"Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent,","venue":null,"work_id":"5fd3cdb8-122b-4456-96f1-939c59826f1f","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.898153Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:503b3cba9b8b10a44bc611d38921eb0a5e6e615fd600b52bd7513be8e10f5a8f","observation_id":"482dd157-8381-4c54-a026-546d3a40d635","resolution":{"observed_at":"2026-08-09T19:04:34.555561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.538659Z","title":"The power of preconditioning in overparameterized low-rank matrix sensing,","venue":null,"work_id":"b4125c3c-ff30-47f3-9ecd-21ede7b3f7de","year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.901825Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:f8daf628581fa58488fee5f7cd32bb877914258a3785fff2fa729a1e35c4c829","observation_id":"8c8f81d2-fa8d-48b1-9c3c-1997a76c6367","resolution":{"observed_at":"2026-08-09T19:04:34.542238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.527236Z","title":"Accelerating gradient descent for over- parameterized asymmetric low-rank matrix sensing via preconditioning,","venue":null,"work_id":"cffd22eb-01b9-4f70-8cd7-36cf84da2d0d","year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.905529Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:b17b791d77377a24991efe5020707898f8f2c0245c2622df2dd965c5073e1452","observation_id":"0569bde6-32b6-4ded-b84a-648e89ddcf39","resolution":{"observed_at":"2026-08-09T19:04:34.531002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.515116Z","title":"Fast and accurate estimation of low-rank matrices from noisy measurements via preconditioned non- convex gradient descent,","venue":null,"work_id":"ee545fff-b738-4414-82d5-3423da43d4eb","year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.909224Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:a59a090de989aaba236b56a5ae995acd52ade894335fafca8c1c0ebd8cf5f8a5","observation_id":"8d5f53f0-c704-44cb-bce7-cb0b1ce7d330","resolution":{"observed_at":"2026-08-09T19:04:34.518999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.10675","last_updated":"2025-07-25T22:41:37Z","snapshot_observed_at":"2026-08-01T23:38:59.936253Z","submitted_at":"2022-09-21T22:01:23Z","title":"A Validation Approach to Over-parameterized Matrix and Image Recovery","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.10675","snapshot_observed_at":"2026-08-09T19:04:33.913471Z","title":"A validation ap- proach to over-parameterized matrix and image recovery,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.913471Z"},"links":{"cited_paper":"/paper/2209.10675","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:19b5c3c35815a7b95d541f3331eaa6bd942e904f90f465e54edb6362bb202e90","observation_id":"59ad8674-fe6e-4227-bf5a-56bda5be3a4b","resolution":{"observed_at":"2026-08-09T19:04:33.913471Z","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-09T19:04:33.916960Z","title":"Low-rank matrix completion using alternating minimization,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.916960Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:8d5f5d4b695eb3c4310ab3afffd173c4a4312ea953e1fda4625182cfddf10275","observation_id":"c0b076fb-3b99-4606-8abe-9ca534ab55b9","resolution":{"observed_at":"2026-08-09T19:04:33.916960Z","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-09T19:04:34.496911Z","title":"Low rank matrix completion by alternating steep- est descent methods,","venue":null,"work_id":"d7d79f54-7ddc-4558-877a-5af5350caa69","year":2016},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.919974Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:8121406d8032bdf2efa8d242a702e0d9268b62502bf4094154da41550ae00251","observation_id":"91f5b63f-c958-4b76-b861-15f93e7d966c","resolution":{"observed_at":"2026-08-09T19:04:34.500296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.486496Z","title":"Randomly initialized alternating least squares: Fast convergence for matrix sensing,","venue":null,"work_id":"1ffbc058-6699-4ad2-8d9b-1d641e16587f","year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.923331Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:cedd17cd4ac9df1e01795a36784ffa8fe79961939815e802648853f725f26bbc","observation_id":"135ca872-1aac-4360-a543-584cdfcbb155","resolution":{"observed_at":"2026-08-09T19:04:34.490221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.476236Z","title":"Low rank matrix completion via robust alternating minimization in nearly linear time,","venue":null,"work_id":"c36019fe-f082-4201-84cc-4f0aee8f5443","year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.926877Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:74c6f6e9e4a84c5c2e102d1b59267cafe421c3166067da633c8191abd73c533f","observation_id":"e784fe4e-608b-43eb-bb5f-3b3bd4d7a5a2","resolution":{"observed_at":"2026-08-09T19:04:34.479533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.466869Z","title":"Convergence of alternating gradient descent for matrix factorization,","venue":null,"work_id":"6323d9f0-4581-414b-8b69-2ca2ce9fe9de","year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.930130Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:b4e75a615222688d3cd8e53c9f31559ead15ff5fe540b9ae9427b7c889269f9d","observation_id":"4b0729da-12ea-4210-9781-f2e74b0a41b5","resolution":{"observed_at":"2026-08-09T19:04:34.470017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.456512Z","title":"Preconditioning matters: Fast global convergence of non-convex matrix factorization via scaled gradient descent,","venue":null,"work_id":"a1e86ba6-a497-4e2b-b7db-970f0f216917","year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.933174Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:77e956fbe3fb29988f91ede0781b11d103b85fd15271a8e468825640ebd68a1c","observation_id":"d6888bb1-ee9a-4b8b-86ff-14b96c751e1b","resolution":{"observed_at":"2026-08-09T19:04:34.459964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.03025","last_updated":"2015-09-10T06:07:52Z","snapshot_observed_at":"2026-08-05T23:17:35.406310Z","submitted_at":"2015-09-10T06:07:52Z","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.03025","snapshot_observed_at":"2026-08-09T19:04:33.936252Z","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":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.936252Z"},"links":{"cited_paper":"/paper/1509.03025","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:1d0e0ef59ca0f80eba5461adf3c0c015b70fe4580624333ee0d75993c5989fdb","observation_id":"7ca17356-32e8-4868-b5b3-f4ace9d2d45d","resolution":{"observed_at":"2026-08-09T19:04:33.936252Z","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-09T19:04:34.445470Z","title":"Guaranteed matrix completion via non-convex factorization,","venue":null,"work_id":"cd4ed5be-98bd-42a8-8df7-72b59b9fa0ce","year":2016},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.940063Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:71593679dbcf7a0766b0d7b12a69f5703aaa62cdf17cd96a4a3a852283119b57","observation_id":"12c1002b-2581-4427-bd0d-ff42134ca993","resolution":{"observed_at":"2026-08-09T19:04:34.449479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1211.1550","last_updated":"2012-11-12T17:50:39Z","snapshot_observed_at":"2026-07-06T02:59:20.652044Z","submitted_at":"2012-11-07T13:49:26Z","title":"A Riemannian geometry for low-rank matrix completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1211.1550","snapshot_observed_at":"2026-08-09T19:04:33.943284Z","title":"A riemannian geometry for low-rank matrix completion,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.943284Z"},"links":{"cited_paper":"/paper/1211.1550","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:9e56defa587c6ed358114c2c87f737e162f5ce29d277b5d499e52ca6480b1462","observation_id":"cd16999a-c1cb-43a3-9269-c904fc1f4b3d","resolution":{"observed_at":"2026-08-09T19:04:33.943284Z","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-09T19:04:34.433395Z","title":"Guarantees of riemannian optimization for low rank matrix recovery,","venue":null,"work_id":"b0728731-3746-4739-84eb-08f91b5822b9","year":2016},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.947075Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:c593f0e970a26d3e6324475a262d86613d67550f5671d748d497939f7b53bb2a","observation_id":"d07350ca-f03f-4c40-bed9-d8b56815656f","resolution":{"observed_at":"2026-08-09T19:04:34.437049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.421846Z","title":"Riemannian preconditioning,","venue":null,"work_id":"758321ef-dea0-49ca-96c4-eb2181061060","year":2016},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.950421Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:a68e8ea3f2eb1914d3ab326c29af7bf42f0cc53d31262ed22ae65d4ea6e331cf","observation_id":"2ef21b13-8a79-4d7d-b862-583707ef7c55","resolution":{"observed_at":"2026-08-09T19:04:34.425231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.411005Z","title":"Accelerating sgd for highly ill- conditioned huge-scale online matrix completion,","venue":null,"work_id":"f0805cf4-01a7-4d50-9397-7c88093a08af","year":2022},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.953954Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:964e5bd8aa95c027ca7441958938adb420eda5d4c0eafe6360fed154ffe61a51","observation_id":"441301e0-7d6f-4b69-a4a2-bf3bc0531e6a","resolution":{"observed_at":"2026-08-09T19:04:34.414767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02543","last_updated":"2023-05-04T04:41:25Z","snapshot_observed_at":"2026-08-06T08:23:52.028087Z","submitted_at":"2023-05-04T04:41:25Z","title":"A Preconditioned Riemannian Gradient Descent Algorithm for Low-Rank Matrix Recovery","version":1},"cited_work":{"arxiv_id":"2305.02543","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.02543","snapshot_observed_at":"2026-08-09T19:04:34.136863Z","title":"A Preconditioned Riemannian Gradient Descent Algorithm for Low-Rank Matrix Recovery","venue":"math.OC","work_id":"221f4406-b99b-404d-a435-968da8eefd88","year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.957195Z"},"links":{"cited_paper":"/paper/2305.02543","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:0a2e1cff9cee207709ad4de593ce89458b9ce161aecfcb4c4afb658ac1c8ad58","observation_id":"7c7eda70-626f-4d00-8fc2-d6e31bbd917a","resolution":{"observed_at":"2026-08-09T19:04:34.140907Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.394232Z","title":"Globally q-linear gauss- newton method for overparameterized non-convex matrix sensing,","venue":null,"work_id":"17b0036b-8907-46aa-ba19-73e8422538d8","year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.961133Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:2c91733169da5750a5b93529f740d8ff8d34610c60dd2b8a0545601578bb5348","observation_id":"1ada1017-754e-436a-9912-ebbca502ea65","resolution":{"observed_at":"2026-08-09T19:04:34.398166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.383349Z","title":"Learned robust pca: A scalable deep unfolding approach for high-dimensional outlier detection,","venue":null,"work_id":"fe076f11-97a2-40b8-8d67-ef7f76a1e56a","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.964510Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:74e314862372512d5b690cabf9de0c6b76defe34c0c0d30eb3357b10fcfabc2c","observation_id":"fa69ca46-8ca9-4623-8de9-9ab936be7b29","resolution":{"observed_at":"2026-08-09T19:04:34.386765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00677","last_updated":"2026-01-27T01:08:16Z","snapshot_observed_at":"2026-08-03T01:49:39.015038Z","submitted_at":"2024-12-31T23:22:12Z","title":"Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery","version":2},"cited_work":{"arxiv_id":"2501.00677","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.00677","snapshot_observed_at":"2026-08-09T19:04:34.119345Z","title":"Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery","venue":"cs.LG","work_id":"28764b06-0756-4e9d-a258-721afbd1641c","year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.968153Z"},"links":{"cited_paper":"/paper/2501.00677","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:3197104f85123cb8d62f599345df7bfce30f3aedfe9226ffe9871be12ab08ddb","observation_id":"f286486f-e2bd-40bc-8268-c349a317e2bc","resolution":{"observed_at":"2026-08-09T19:04:34.123421Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.372373Z","title":"Low-rank matrix recovery with scaled subgradient methods: Fast and robust convergence without the condition number,","venue":null,"work_id":"95dc7d55-5188-4949-8ebf-64980080f634","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.971900Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:dbd53d91b582d9a0983593d5d15e2dcb734e9a53ebc3bc4fdaf076e8c0a86eda","observation_id":"1d2075a2-f639-4e44-b75c-04babf9ad615","resolution":{"observed_at":"2026-08-09T19:04:34.376121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16826","last_updated":"2025-05-29T11:38:57Z","snapshot_observed_at":"2026-08-05T23:33:00.804488Z","submitted_at":"2024-10-22T08:58:44Z","title":"Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16826","snapshot_observed_at":"2026-08-09T19:04:33.975422Z","title":"Guarantees of a preconditioned subgradient algorithm for overparameterized asymmetric low-rank ma- trix recovery,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.975422Z"},"links":{"cited_paper":"/paper/2410.16826","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:bfb91283e106d611a29c5ec81b852d197f6331fe6fa1dbec3edcc7626ce3b0d5","observation_id":"97772a58-e7e0-417a-98e5-d8f9ab76fa20","resolution":{"observed_at":"2026-08-09T19:04:33.975422Z","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-09T19:04:34.361944Z","title":"Algorithmic regularization in over- parameterized matrix sensing and neural networks with quadratic ac- tivations,","venue":null,"work_id":"d0468136-bddc-4b5e-9818-d1e34e6a11e2","year":2018},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.979303Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:ba8e7713de604beeb4f3ec4ec654f1dca9ac8ee9702073ed0fb670345b1cd916","observation_id":"97c870e6-1d53-447d-9b90-d8ceaee95dd7","resolution":{"observed_at":"2026-08-09T19:04:34.365463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.351594Z","title":"Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction,","venue":null,"work_id":"d0f863ef-5ce0-4f3e-8b31-8190657332c7","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.982919Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:f95e96165e1ade0143174509e8d3bd5bec86cdd263c18995da28f7f31356403d","observation_id":"6d9bd42c-679d-4aba-b4c5-e43148e4d363","resolution":{"observed_at":"2026-08-09T19:04:34.355058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.341347Z","title":"Implicit balancing and regularization: Generalization and convergence guarantees for overpa- rameterized asymmetric matrix sensing,","venue":null,"work_id":"fe14b1c7-40a3-4224-b3f9-e19faa0fd0f5","year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.986593Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:f78b9cabe8b9d4ac7f4e5421c5010d2e097d9939c767715e9b50b2d4a6e98d13","observation_id":"eff7a8ff-e698-44f1-8cea-cb0d8917f0c2","resolution":{"observed_at":"2026-08-09T19:04:34.344773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.330879Z","title":"Rank overspecified robust matrix recovery: Subgradient method and exact recovery,","venue":null,"work_id":"61e8ed08-c875-43c4-b969-1e4fa5d4eb73","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.990300Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:a3c155bb6fe68abfb616a10c886b798174fba854c6628b6c71fa1740f775361f","observation_id":"09048332-70fa-4940-a95f-881bd07ab225","resolution":{"observed_at":"2026-08-09T19:04:34.334173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.321045Z","title":"How over-parameterization slows down gradient descent in matrix sensing: The curses of symmetry and initialization,","venue":null,"work_id":"a26637ca-a39c-4005-816c-a16f8e9f3a95","year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.993586Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:17b982afbcc4f16db9dd6348f4c6a63462450698f178e55ac4c4c569d1308986","observation_id":"ee6aecda-0aac-4194-b64b-cb5006724a81","resolution":{"observed_at":"2026-08-09T19:04:34.324226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.08788","last_updated":"2022-02-17T17:50:04Z","snapshot_observed_at":"2026-07-06T12:38:52.417555Z","submitted_at":"2022-02-17T17:50:04Z","title":"Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization","version":1},"cited_work":{"arxiv_id":"2202.08788","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.08788","snapshot_observed_at":"2026-08-09T19:04:34.087086Z","title":"Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization","venue":"cs.LG","work_id":"4cc1d1a4-3956-487c-8f2f-2a31de4c1057","year":2022},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:33.996857Z"},"links":{"cited_paper":"/paper/2202.08788","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:6c3f2a29e96a623af618052e02b0662afc78cab2db5c4b1cda39283a16d8d43d","observation_id":"5477690d-15ab-4508-be5e-f476ee8ac3ef","resolution":{"observed_at":"2026-08-09T19:04:34.093016Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02704","last_updated":"2024-03-05T06:54:49Z","snapshot_observed_at":"2026-08-10T01:07:37.110482Z","submitted_at":"2024-03-05T06:54:49Z","title":"Projected Gradient Descent Algorithm for Low-Rank Matrix Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02704","snapshot_observed_at":"2026-08-09T19:04:34.000402Z","title":"Projected gradient descent algorithm for low-rank matrix estimation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.000402Z"},"links":{"cited_paper":"/paper/2403.02704","citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:4c99282ab8c033d61877556b5c9d7eb2bc254f032f402224678b533c38515a6f","observation_id":"d5e61dc6-e813-4b77-8cd8-98b83b983731","resolution":{"observed_at":"2026-08-09T19:04:34.000402Z","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-09T19:04:34.311222Z","title":"Sharp restricted isometry property bounds for low-rank matrix recovery problems with corrupted measurements,","venue":null,"work_id":"d8f1b5b2-83bb-4c3a-a5f7-d70a938eaeee","year":2022},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.003707Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:ee41885ca2abf936c6dd3f6675aed1446177170307db440e2742fcffbf81a729","observation_id":"8a34eb27-c391-43e2-bf41-6e2f14f00545","resolution":{"observed_at":"2026-08-09T19:04:34.314784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.301554Z","title":"Noisy low-rank matrix optimization: Geometry of local minima and convergence rate,","venue":null,"work_id":"c095442e-f065-4a07-87e5-e4b8280bd545","year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.007097Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:280f8d39e23811c8a7bf06d9dc2f896a04fdc5e01f42ac0a7a4884714e2327ce","observation_id":"b51d9cb8-b2bf-4107-9740-5e3f7667ab4a","resolution":{"observed_at":"2026-08-09T19:04:34.305024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.290794Z","title":"A primal-dual analysis of global optimality in nonconvex low-rank matrix recovery,","venue":null,"work_id":"2ee77785-759e-4c71-9e5f-832b7926dd40","year":2018},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.010675Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:434cda46177795674653eb06931023492c2ef49a4e9f50a12eb4478b26360766","observation_id":"b6267daa-affe-4509-8b85-1188c384f56b","resolution":{"observed_at":"2026-08-09T19:04:34.294371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.280352Z","title":"Geometric analysis of noisy low-rank matrix recovery in the exact parametrized and the overparametrized regimes,","venue":null,"work_id":"5db975bc-605a-44a4-a5e1-ddf99a8a2524","year":2023},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.013808Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:7f646eca4ef93e84e3c6d9c0b10fc2c23dd184aa3cca8def5e4954939959d031","observation_id":"815f46f7-d09d-407e-a55e-92010ef3e33f","resolution":{"observed_at":"2026-08-09T19:04:34.283768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.270424Z","title":"The global optimization geometry of low-rank matrix optimization,","venue":null,"work_id":"c734149f-2423-4660-9895-6e17773a1ab2","year":2021},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.017522Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:aa64ee271a0ed6aeb482e952b8c831d7c970fda8a93c3f53ddc991d11a7c2a60","observation_id":"e7f4fe17-1773-4170-9757-4382936274b2","resolution":{"observed_at":"2026-08-09T19:04:34.273714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.259649Z","title":"The non-convex geometry of low-rank matrix optimization,","venue":null,"work_id":"53563b22-b57b-4c6a-b90f-910a47fa3da2","year":2019},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.020623Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:d19b3602daf36cd0af7f52dfe94a4b624439c9a3e616ca2c0e899a40e2f6f86a","observation_id":"fa85fa16-cfad-4d6c-821f-fe0e1dcd7d75","resolution":{"observed_at":"2026-08-09T19:04:34.263291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.248411Z","title":"Global optimality in low-rank matrix optimization,","venue":null,"work_id":"7e2be4af-6a63-4793-b600-2501cf694591","year":2018},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.023726Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:2b904fd7f729275080b068283f2db36eca6db11251a95214991ad501be0af31c","observation_id":"19575958-64e2-4545-a2cc-c1151fb0fd4f","resolution":{"observed_at":"2026-08-09T19:04:34.252116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.236551Z","title":"Guaranteed rank minimization via singular value projection,","venue":null,"work_id":"f9227a75-0db9-44de-8c51-583dd98a4f08","year":2010},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.026797Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:a4793a3d5f6aaf117218988a2f6faa1035ad076288e9196b37c62ca45e0d5a89","observation_id":"09a99ef3-3d46-48b5-a24a-259c1b175c3d","resolution":{"observed_at":"2026-08-09T19:04:34.240235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.225355Z","title":"Weighted low-rank approximations,","venue":null,"work_id":"ce16445e-48c1-4684-871b-02e640100e5b","year":2003},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.030139Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:78b4a9a663ca89dfd68df64c7a2aaed6b463dbd0fb99ec618ff3dbcc7a970976","observation_id":"34ba5c13-a369-491c-b4ce-a7f1b044a8fa","resolution":{"observed_at":"2026-08-09T19:04:34.229362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.214078Z","title":"1-bit matrix completion,","venue":null,"work_id":"9a121cbd-763f-4a24-b327-8cc0ada6a49e","year":2014},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.033198Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:f0faad7f5e70a5f39f5cf2e99f05e8c86fb6d01f24f3028fbe311172a2526a5a","observation_id":"ed22eb8a-8e6b-4a2e-85ad-04b939e6565e","resolution":{"observed_at":"2026-08-09T19:04:34.217631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.202260Z","title":"Generalized Assorted Pixel Camera: Post-Capture Control of Resolution, Dynamic Range and Spectrum,","venue":null,"work_id":"7b772876-d583-4278-b258-909b06b01bfd","year":2008},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.036410Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:da62975d4e13ca4798254b57d50808d7d22afb8060492a981172d35d6eb5eae8","observation_id":"864f7283-079f-43a5-989b-5244080133ca","resolution":{"observed_at":"2026-08-09T19:04:34.205920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:04:34.191608Z","title":null,"venue":null,"work_id":"0db1a781-5553-4563-89b3-4d93173dbea5","year":null},"citing_paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T19:04:34.039559Z"},"links":{"citing_paper":"/paper/2502.00463"},"observation_digest":"sha256:9c0055068a3e78a95557b959b976c5f1b65e15c648fdce72cbfcd4f6da3c2050","observation_id":"47600fb0-8e90-4548-9f11-30335ebc8db0","resolution":{"observed_at":"2026-08-09T19:04:34.194892Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.00463","last_updated":"2025-05-31T15:49:27Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T01:08:24.049463Z","submitted_at":"2025-02-01T15:44:39Z","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":3,"verified_fuzzy":47},"total_outbound_references":61},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 2 inbound Pith citation observations for arXiv:2502.00463."}