{"as_of":"2026-08-19T18:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc3e65255ccf7934012f4ad24223a70a921a4183731c9a128f4ad962816b1361","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:19:37.367714Z","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-20T20:28:59.903294Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.17660","last_updated":"2024-06-25T15:50:32Z","snapshot_observed_at":"2026-08-17T12:43:36.846568Z","submitted_at":"2024-06-25T15:50:32Z","title":"Grass: Compute Efficient Low-Memory LLM Training with Structured Sparse Gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.17660","snapshot_observed_at":"2026-08-10T22:19:37.367714Z","title":"Grass: Compute efficient low-memory llm training with structured sparse gradients.arXiv preprint arXiv:2406.17660, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.02379","last_updated":"2025-05-30T21:08:32Z","snapshot_observed_at":"2026-08-15T11:56:12.258668Z","submitted_at":"2025-01-04T20:51:51Z","title":"TensorGRaD: Tensor Gradient Robust Decomposition for Memory-Efficient Neural Operator Training","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:19:37.367714Z"},"links":{"cited_paper":"/paper/2406.17660","citing_paper":"/paper/2501.02379"},"observation_digest":"sha256:9ef13a1a10e1adca9234842c0cdf7c26c57c8d6af66290b3213a0a6f879e3bf1","observation_id":"384b94d9-ee53-4845-80a1-dd8b201f123c","resolution":{"observed_at":"2026-08-10T22:19:37.367714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17660","last_updated":"2024-06-25T15:50:32Z","snapshot_observed_at":"2026-08-17T12:43:36.846568Z","submitted_at":"2024-06-25T15:50:32Z","title":"Grass: Compute Efficient Low-Memory LLM Training with Structured Sparse Gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.17660","snapshot_observed_at":"2026-08-07T14:43:42.491956Z","title":"Muhamed, O","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18313","last_updated":"2025-05-23T19:17:55Z","snapshot_observed_at":"2026-08-12T21:10:08.165033Z","submitted_at":"2025-05-23T19:17:55Z","title":"PLUMAGE: Probabilistic Low rank Unbiased Min Variance Gradient Estimator for Efficient Large Model Training","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:42.491956Z"},"links":{"cited_paper":"/paper/2406.17660","citing_paper":"/paper/2505.18313"},"observation_digest":"sha256:7cfa252f6e5c14970d30a3914093caa032e2cc2920e5cbb9158f62d0c28d59d4","observation_id":"8211329e-85a8-4282-82da-d55948a924ab","resolution":{"observed_at":"2026-08-07T14:43:42.491956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17660","last_updated":"2024-06-25T15:50:32Z","snapshot_observed_at":"2026-08-17T12:43:36.846568Z","submitted_at":"2024-06-25T15:50:32Z","title":"Grass: Compute Efficient Low-Memory LLM Training with Structured Sparse Gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.17660","snapshot_observed_at":"2026-08-04T12:51:25.889874Z","title":"Grass: Compute efficient low-memory llm training with structured sparse gradients, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.01878","last_updated":"2026-06-26T18:31:10Z","snapshot_observed_at":"2026-08-19T11:17:23.698292Z","submitted_at":"2025-10-02T10:35:38Z","title":"Geometrically Principled Randomized Optimization for Efficient LLM Training","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T12:51:25.889874Z"},"links":{"cited_paper":"/paper/2406.17660","citing_paper":"/paper/2510.01878"},"observation_digest":"sha256:c523195c7dd93133c61a1f2d9c95f547cca175e4080be851d315c2b334ac17d8","observation_id":"3552efa4-8be1-4205-98fa-b1d15ec007f4","resolution":{"observed_at":"2026-08-04T12:51:25.889874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17660","last_updated":"2024-06-25T15:50:32Z","snapshot_observed_at":"2026-08-17T12:43:36.846568Z","submitted_at":"2024-06-25T15:50:32Z","title":"Grass: Compute Efficient Low-Memory LLM Training with Structured Sparse Gradients","version":1},"cited_work":{"arxiv_id":"2406.17660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.17660","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Grass: Com- pute efficient low-memory llm training with structured sparse gradients","venue":null,"work_id":"9c8ffb45-4bbf-4edb-8dba-890bda475c36","year":2024},"citing_paper":{"arxiv_id":"2605.13652","last_updated":"2026-05-19T00:27:00Z","snapshot_observed_at":"2026-08-17T01:44:27.115486Z","submitted_at":"2026-05-13T15:11:37Z","title":"Beyond Perplexity: A Geometric and Spectral Study of Low-Rank Pre-Training","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-14T19:19:18.275446Z"},"links":{"cited_paper":"/paper/2406.17660","citing_paper":"/paper/2605.13652"},"observation_digest":"sha256:c7f74c569cab6238d77887e44eeb3cef31f35d34d8e9daad693357f83c9c2f9f","observation_id":"1a8a2fb6-a51d-4e35-aafd-8f6c9dde1754","resolution":{"observed_at":"2026-05-14T19:19:23.570105Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17660","last_updated":"2024-06-25T15:50:32Z","snapshot_observed_at":"2026-08-17T12:43:36.846568Z","submitted_at":"2024-06-25T15:50:32Z","title":"Grass: Compute Efficient Low-Memory LLM Training with Structured Sparse Gradients","version":1},"cited_work":{"arxiv_id":"2406.17660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.17660","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Grass: Com- pute efficient low-memory llm training with structured sparse gradients","venue":null,"work_id":"9c8ffb45-4bbf-4edb-8dba-890bda475c36","year":2024},"citing_paper":{"arxiv_id":"2605.13652","last_updated":"2026-05-19T00:27:00Z","snapshot_observed_at":"2026-08-17T01:44:27.115486Z","submitted_at":"2026-05-13T15:11:37Z","title":"Beyond Perplexity: A Geometric and Spectral Study of Low-Rank Pre-Training","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T20:24:26.681383Z"},"links":{"cited_paper":"/paper/2406.17660","citing_paper":"/paper/2605.13652"},"observation_digest":"sha256:5aa4363a0cc8cae7c3d01c7bbacd7ffd5d5b1f3c52a17b51a5ace8f2917b4827","observation_id":"ca427d36-c68a-492f-a612-a80c1f77a853","resolution":{"observed_at":"2026-05-20T20:28:59.905006Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.17660/citation-record","integrity":"/paper/2406.17660/integrity","json":"/paper/2406.17660/citation-record.json","paper":"/paper/2406.17660"},"outbound":[],"paper":{"arxiv_id":"2406.17660","last_updated":"2024-06-25T15:50:32Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T12:43:36.846568Z","submitted_at":"2024-06-25T15:50:32Z","title":"Grass: Compute Efficient Low-Memory LLM Training with Structured Sparse Gradients"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2406.17660."}