{"as_of":"2026-08-09T15:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e518a2c3ce5293af8ea169520e31b686ec267561ff050f2ede45dbdf182ccb9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:31:42.048006Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-08T22:25:39.548166Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2410.11289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-07-08T22:25:39.548166Z","title":"Subspace optimization for large language models with convergence guarantees","venue":"cs.LG","work_id":"8b5ec92a-bbe7-467f-a250-8b217078a6d5","year":2024},"citing_paper":{"arxiv_id":"2501.07237","last_updated":"2026-04-27T13:03:55Z","snapshot_observed_at":"2026-07-06T20:20:14.452585Z","submitted_at":"2025-01-13T11:35:09Z","title":"GWT: Scalable Optimizer State Compression for Large Language Model Training","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T05:57:09.276224Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2501.07237"},"observation_digest":"sha256:9b212cd16542aa9ee7caf1e0cee4e5447697842d08f92dbbaed3f9f38d97d61b","observation_id":"d9141f1c-e2fc-42e2-a2ca-79107ea60e5d","resolution":{"observed_at":"2026-05-23T05:57:36.612097Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-08-08T13:31:42.048006Z","title":"Subspace optimization for large language models with convergence guarantees","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.07222","last_updated":"2025-02-11T03:32:10Z","snapshot_observed_at":"2026-08-08T13:23:06.239630Z","submitted_at":"2025-02-11T03:32:10Z","title":"A Memory Efficient Randomized Subspace Optimization Method for Training Large Language Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T13:31:42.048006Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2502.07222"},"observation_digest":"sha256:33a7c68473104b2c1382716cb02ca11d41ce95ceb3bb3faf91abc612ee821eb6","observation_id":"723f37ca-d918-4659-b148-8b7389db98c5","resolution":{"observed_at":"2026-08-08T13:31:42.048006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-08-07T13:06:24.246688Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22922","last_updated":"2025-05-28T22:51:43Z","snapshot_observed_at":"2026-08-09T07:36:25.123706Z","submitted_at":"2025-05-28T22:51:43Z","title":"Scalable Parameter and Memory Efficient Pretraining for LLM: Recent Algorithmic Advances and Benchmarking","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T13:06:24.246688Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2505.22922"},"observation_digest":"sha256:b0482ec0969d71dc96269d152664ab600d714d2375be15d6f3738ae00384bc01","observation_id":"ebb7ee23-15e3-4f34-9b01-749953309ab2","resolution":{"observed_at":"2026-08-07T13:06:24.246688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2410.11289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-07-08T22:25:39.548166Z","title":"Subspace optimization for large language models with convergence guarantees","venue":"cs.LG","work_id":"8b5ec92a-bbe7-467f-a250-8b217078a6d5","year":2024},"citing_paper":{"arxiv_id":"2506.15588","last_updated":"2026-05-18T12:41:38Z","snapshot_observed_at":"2026-08-02T14:39:33.262823Z","submitted_at":"2025-06-18T16:05:09Z","title":"Memory-Efficient Differentially Private Training with Gradient Random Projection","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T23:46:54.620034Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2506.15588"},"observation_digest":"sha256:e1ef7c3a0236da25a299dd94614494ffaefd9676b5d54e2668f63adbbea429ea","observation_id":"38f9b6a3-ba15-47bc-9cdb-220ec0cb7a97","resolution":{"observed_at":"2026-05-21T23:50:47.514836Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-08-04T17:01:42.075076Z","title":"NX i=1 (λ(i) t +γ (i) t ) ! A+ NX i=1 β(i) t ! B # C∈span(C), ⇒ ˜Pt =C. Then: Qt = 1 N NX i=1 ∆(i)⊤ t ˜Pt = qt−1 N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11254","last_updated":"2025-09-14T12:54:28Z","snapshot_observed_at":"2026-08-09T11:55:48.689651Z","submitted_at":"2025-09-14T12:54:28Z","title":"From PowerSGD to PowerSGD+: Low-Rank Gradient Compression for Distributed Optimization with Convergence Guarantees","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T17:01:42.075076Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2509.11254"},"observation_digest":"sha256:5f5aa3a862850069cf2cece96cc168493811cb8fd6a9d1bcc2c64d00c511aedf","observation_id":"ccd0a2ae-c1ed-4255-8051-ae80ee6c9889","resolution":{"observed_at":"2026-08-04T17:01:42.075076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2410.11289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-07-08T22:25:39.548166Z","title":"Subspace optimization for large language models with convergence guarantees","venue":"cs.LG","work_id":"8b5ec92a-bbe7-467f-a250-8b217078a6d5","year":2024},"citing_paper":{"arxiv_id":"2509.18993","last_updated":"2026-05-13T13:30:21Z","snapshot_observed_at":"2026-08-02T18:52:22.902766Z","submitted_at":"2025-09-23T13:43:02Z","title":"CR-Net: Scaling Parameter-Efficient Training with Cross-Layer Low-Rank Structure","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T14:51:30.312509Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2509.18993"},"observation_digest":"sha256:e7e9d937d52715c68da327d4c14116fd21f56933076ff03d27ec377d918543b9","observation_id":"1dd91a1a-c8d2-43cf-bea9-6cf9a2778342","resolution":{"observed_at":"2026-05-18T14:52:41.177711Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2410.11289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-07-08T22:25:39.548166Z","title":"Subspace optimization for large language models with convergence guarantees","venue":"cs.LG","work_id":"8b5ec92a-bbe7-467f-a250-8b217078a6d5","year":2024},"citing_paper":{"arxiv_id":"2605.06316","last_updated":"2026-05-07T14:16:16Z","snapshot_observed_at":"2026-08-03T22:01:24.808214Z","submitted_at":"2026-05-07T14:16:16Z","title":"Pro-KLShampoo: Projected KL-Shampoo with Whitening Recovered by Orthogonalization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T13:06:05.234216Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2605.06316"},"observation_digest":"sha256:32ef6178bdc2eebe21db29acfb99eadb13202a8d18b3af17f4acce796ba8e05f","observation_id":"76f83585-c9ce-427b-9269-1557acd2287a","resolution":{"observed_at":"2026-05-11T19:01:12.885801Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2410.11289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-07-08T22:25:39.548166Z","title":"Subspace optimization for large language models with convergence guarantees","venue":"cs.LG","work_id":"8b5ec92a-bbe7-467f-a250-8b217078a6d5","year":2024},"citing_paper":{"arxiv_id":"2605.10288","last_updated":"2026-05-12T10:19:03Z","snapshot_observed_at":"2026-07-06T23:22:18.704329Z","submitted_at":"2026-05-11T09:50:10Z","title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-12T04:47:04.868735Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2605.10288"},"observation_digest":"sha256:c1f90fe2854ef35e94c5a4fd1862a4197754503c8c7df967142ac519143049ea","observation_id":"a9cb9c52-fe7c-4318-945c-3696a6d1c235","resolution":{"observed_at":"2026-05-12T05:56:26.503281Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2410.11289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-07-08T22:25:39.548166Z","title":"Subspace optimization for large language models with convergence guarantees","venue":"cs.LG","work_id":"8b5ec92a-bbe7-467f-a250-8b217078a6d5","year":2024},"citing_paper":{"arxiv_id":"2605.10288","last_updated":"2026-05-12T10:19:03Z","snapshot_observed_at":"2026-07-06T23:22:18.704329Z","submitted_at":"2026-05-11T09:50:10Z","title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-13T06:20:42.781613Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2605.10288"},"observation_digest":"sha256:741fbc72ccdb2548e8f957d6f75f6136a602684e1618c0bc41d2ee5471bff910","observation_id":"eb0a1a1a-e5e2-4bc7-99b0-1f2950ec9d72","resolution":{"observed_at":"2026-05-13T06:22:23.282182Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2410.11289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-07-08T22:25:39.548166Z","title":"Subspace optimization for large language models with convergence guarantees","venue":"cs.LG","work_id":"8b5ec92a-bbe7-467f-a250-8b217078a6d5","year":2024},"citing_paper":{"arxiv_id":"2607.05872","last_updated":"2026-07-19T20:06:25Z","snapshot_observed_at":"2026-08-02T08:27:39.275378Z","submitted_at":"2026-07-07T06:06:04Z","title":"No Subspace to Track: Non-Identifiability and Optimizer State in Low-Rank Training","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-08T22:16:44.668076Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2607.05872"},"observation_digest":"sha256:13c510d42ea5799eabcdd7fad089818140b3f3c78346b3948f8a0c6cbc39a4ab","observation_id":"9143cfc6-cddb-42fe-81f2-ec2ad5ef5bcc","resolution":{"observed_at":"2026-07-08T22:25:39.549901Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11289","snapshot_observed_at":"2026-08-02T08:27:40.379240Z","title":"Subspace optimization for large language models with convergence guarantees.arXiv:2410.11289,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.05872","last_updated":"2026-07-19T20:06:25Z","snapshot_observed_at":"2026-08-02T08:27:39.275378Z","submitted_at":"2026-07-07T06:06:04Z","title":"No Subspace to Track: Non-Identifiability and Optimizer State in Low-Rank Training","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T08:27:40.379240Z"},"links":{"cited_paper":"/paper/2410.11289","citing_paper":"/paper/2607.05872"},"observation_digest":"sha256:4e1d8a3e3a694d4d95e14a912916dab0ede6c5fba322c08370e7faef1aa076d1","observation_id":"1bc5d689-3c66-4b8c-8c83-a11f84e130fc","resolution":{"observed_at":"2026-08-02T08:27:40.379240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.11289/citation-record","integrity":"/paper/2410.11289/integrity","json":"/paper/2410.11289/citation-record.json","paper":"/paper/2410.11289"},"outbound":[],"paper":{"arxiv_id":"2410.11289","last_updated":"2025-06-04T06:11:50Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T08:32:10.511805Z","submitted_at":"2024-10-15T05:16:32Z","title":"Subspace Optimization for Large Language Models with Convergence Guarantees"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2410.11289."}