{"as_of":"2026-08-08T18:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed15bad597647a56ea2037e05969037972187b19d44a6381b4974ee35c2e22d0","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-08T06:32:00.761636+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-07T13:45:11.664328Z","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-07-01T21:06:14.426896Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.13652","last_updated":"2025-05-20T13:06:00Z","snapshot_observed_at":"2026-07-31T17:31:30.624645Z","submitted_at":"2024-09-20T17:02:00Z","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.13652","snapshot_observed_at":"2026-08-07T13:45:11.664328Z","title":"Oats: Outlier-aware pruning through sparse and low rank decomposition.arXiv preprint arXiv:2409.13652, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21036","last_updated":"2025-06-09T11:33:40Z","snapshot_observed_at":"2026-08-07T13:36:00.763303Z","submitted_at":"2025-05-27T11:15:02Z","title":"RainFusion: Adaptive Video Generation Acceleration via Multi-Dimensional Visual Redundancy","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:45:11.664328Z"},"links":{"cited_paper":"/paper/2409.13652","citing_paper":"/paper/2505.21036"},"observation_digest":"sha256:e8f5f94a703afb9a8a526cbb3885dde1e197e0aacbf14b20391ad55d0d3329c4","observation_id":"5f47e94f-c121-4f8e-bca6-2792189ad26b","resolution":{"observed_at":"2026-08-07T13:45:11.664328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13652","last_updated":"2025-05-20T13:06:00Z","snapshot_observed_at":"2026-07-31T17:31:30.624645Z","submitted_at":"2024-09-20T17:02:00Z","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.13652","snapshot_observed_at":"2026-08-06T05:11:11.685207Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.02128","last_updated":"2025-08-04T07:22:36Z","snapshot_observed_at":"2026-08-08T06:49:38.643278Z","submitted_at":"2025-08-04T07:22:36Z","title":"Amber Pruner: Leveraging N:M Activation Sparsity for Efficient Prefill in Large Language Models","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T05:11:11.685207Z"},"links":{"cited_paper":"/paper/2409.13652","citing_paper":"/paper/2508.02128"},"observation_digest":"sha256:ec3609e9f10038f45084eb0f345d52df57b276735e8e2d5a5d20f031b11d050f","observation_id":"c4466d57-885c-4e17-b2e8-adf3d8d70b50","resolution":{"observed_at":"2026-08-06T05:11:11.685207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13652","last_updated":"2025-05-20T13:06:00Z","snapshot_observed_at":"2026-07-31T17:31:30.624645Z","submitted_at":"2024-09-20T17:02:00Z","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","version":3},"cited_work":{"arxiv_id":"2409.13652","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.13652","snapshot_observed_at":"2026-07-01T21:06:14.426896Z","title":"Oats: Outlier-aware pruning through sparse and low rank decomposition.arXiv preprint arXiv:2409.13652","venue":null,"work_id":"757097c3-a3ef-4baf-ac7b-c19e27b7744d","year":2024},"citing_paper":{"arxiv_id":"2605.03667","last_updated":"2026-05-05T12:04:51Z","snapshot_observed_at":"2026-08-07T08:19:40.429347Z","submitted_at":"2026-05-05T12:04:51Z","title":"ELAS: Efficient Pre-Training of Low-Rank Large Language Models via 2:4 Activation Sparsity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T17:07:18.278784Z"},"links":{"cited_paper":"/paper/2409.13652","citing_paper":"/paper/2605.03667"},"observation_digest":"sha256:bc745659efac1cb58529c78248f3715ab1ba0cb6455ea1c1e7ca49c0a72e6e4b","observation_id":"cee8349e-911f-4fde-83ae-f7566b637f79","resolution":{"observed_at":"2026-05-12T10:56:29.828718Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13652","last_updated":"2025-05-20T13:06:00Z","snapshot_observed_at":"2026-07-31T17:31:30.624645Z","submitted_at":"2024-09-20T17:02:00Z","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","version":3},"cited_work":{"arxiv_id":"2409.13652","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.13652","snapshot_observed_at":"2026-07-01T21:06:14.426896Z","title":"Oats: Outlier-aware pruning through sparse and low rank decomposition.arXiv preprint arXiv:2409.13652","venue":null,"work_id":"757097c3-a3ef-4baf-ac7b-c19e27b7744d","year":2024},"citing_paper":{"arxiv_id":"2605.26632","last_updated":"2026-06-01T03:03:29Z","snapshot_observed_at":"2026-07-06T23:36:29.930024Z","submitted_at":"2026-05-26T07:09:49Z","title":"RT-Lynx: Putting the GEMM Sparsity In a Right Way for Diffusion Models","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-29T19:40:42.033793Z"},"links":{"cited_paper":"/paper/2409.13652","citing_paper":"/paper/2605.26632"},"observation_digest":"sha256:7bf31fd0536e9becfd351f304b67779a7b38af778cee763b3bc6a1f1d5ca4d9c","observation_id":"1d199569-2ff4-4c7b-b4e0-6c7c5b65f462","resolution":{"observed_at":"2026-06-29T19:43:54.666757Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13652","last_updated":"2025-05-20T13:06:00Z","snapshot_observed_at":"2026-07-31T17:31:30.624645Z","submitted_at":"2024-09-20T17:02:00Z","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","version":3},"cited_work":{"arxiv_id":"2409.13652","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.13652","snapshot_observed_at":"2026-07-01T21:06:14.426896Z","title":"Oats: Outlier-aware pruning through sparse and low rank decomposition.arXiv preprint arXiv:2409.13652","venue":null,"work_id":"757097c3-a3ef-4baf-ac7b-c19e27b7744d","year":2024},"citing_paper":{"arxiv_id":"2606.01412","last_updated":"2026-05-31T19:17:39Z","snapshot_observed_at":"2026-08-05T23:04:35.966323Z","submitted_at":"2026-05-31T19:17:39Z","title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-06-28T17:28:14.160341Z"},"links":{"cited_paper":"/paper/2409.13652","citing_paper":"/paper/2606.01412"},"observation_digest":"sha256:ada23f2f19f60756d4c5e3693689cc8cc5fb065f2e1aa1f3586b35ad4824d074","observation_id":"d1d61899-270a-4eba-9765-3047579d35dd","resolution":{"observed_at":"2026-07-01T21:06:14.428276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.13652/citation-record","integrity":"/paper/2409.13652/integrity","json":"/paper/2409.13652/citation-record.json","paper":"/paper/2409.13652"},"outbound":[],"paper":{"arxiv_id":"2409.13652","last_updated":"2025-05-20T13:06:00Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-31T17:31:30.624645Z","submitted_at":"2024-09-20T17:02:00Z","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2409.13652."}