{"as_of":"2026-08-14T16:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fd3dad149ecdac41d5998da0d6fdb2ac306a3f2f2ab151d50e828bed6a9a87f7","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T19:41:46.626449Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.10543/citation-record","integrity":"/paper/2411.10543/integrity","json":"/paper/2411.10543/citation-record.json","paper":"/paper/2411.10543"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T19:41:46.535198Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.535198Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:03a456a936ab8060e48211be2b595cef6c4f22ba29a2111b87d2fae7ed9bf053","observation_id":"e0c01d9d-a4d0-4876-be87-b61d7de15e6c","resolution":{"observed_at":"2026-08-12T19:41:46.535198Z","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-12T19:41:46.539525Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.539525Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:282cd768db30bfb7727ae125ea817e960ea37e420952ca4f3e6c2ff82015996b","observation_id":"53208383-8328-4fb5-9942-e0f1e94259ec","resolution":{"observed_at":"2026-08-12T19:41:46.539525Z","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-12T19:41:46.972398Z","title":"https://pythonhosted.org/nvidia-ml-py/","venue":null,"work_id":"2a3f0e05-0fdc-4f0b-b358-e1a217ac6c79","year":2024},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.543011Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:716c5a3301dedeb9b4506327e66a1afdea90c39aef55e0ca00a5508876315f7a","observation_id":"be780af1-04ff-4f7d-9020-72dadf52b25d","resolution":{"observed_at":"2026-08-12T19:41:46.975562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T19:41:46.963760Z","title":"https://blog.salesforceairesearch.com","venue":null,"work_id":"37e2b085-3d28-4dad-a8e9-1a4a94ed5bd8","year":2024},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.545880Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:61a69c87ddff4f73777c96deeb76fbb4093eafa3bcadf453c3f3d8374c95773b","observation_id":"de19c2f2-de55-43d3-9ce8-40fdde50446b","resolution":{"observed_at":"2026-08-12T19:41:46.966881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14314","last_updated":"2023-05-23T17:50:33Z","snapshot_observed_at":"2026-08-13T23:56:42.354755Z","submitted_at":"2023-05-23T17:50:33Z","title":"QLoRA: Efficient Finetuning of Quantized LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14314","snapshot_observed_at":"2026-08-12T19:41:46.549176Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.549176Z"},"links":{"cited_paper":"/paper/2305.14314","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:34e55b6a3672ad6f60ac6d0cc5b673e2fdea0dfda83c45407da39eb71524af95","observation_id":"2db0ac54-9c4c-4273-8b14-ab54d812d465","resolution":{"observed_at":"2026-08-12T19:41:46.549176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-12T19:41:46.553050Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.553050Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:3ce295d78bf51a26afc0828e5df7c8fc4eca454b3ab6b5dfe1f0dfba060410cc","observation_id":"87073638-ac84-4d4c-9486-da3df337b538","resolution":{"observed_at":"2026-08-12T19:41:46.553050Z","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-12T19:41:46.556963Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.556963Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:751b1a72f32768b50b03225597f0d7bce7670417c65f5a625d4f25ab0caf47c4","observation_id":"f25a4cc5-8d52-4ed5-bbc7-c468ed0e0db0","resolution":{"observed_at":"2026-08-12T19:41:46.556963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08307","last_updated":"2020-05-14T21:58:57Z","snapshot_observed_at":"2026-08-14T05:32:02.596713Z","submitted_at":"2020-02-19T17:40:57Z","title":"Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08307","snapshot_observed_at":"2026-08-12T19:41:46.559981Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.559981Z"},"links":{"cited_paper":"/paper/2002.08307","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:6dc0b68bafb7543068951341bfdd33e305a8ac94ce8701059876a3a8b0bc6fef","observation_id":"5f6ed768-daef-4f2d-a779-43eed045f30c","resolution":{"observed_at":"2026-08-12T19:41:46.559981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00752","last_updated":"2024-05-31T17:55:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-01T18:01:34Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00752","snapshot_observed_at":"2026-08-12T19:41:46.563651Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.563651Z"},"links":{"cited_paper":"/paper/2312.00752","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:c179ceac07cb83013d2ca686da599f92fc5bd31df3bb2aa77508c0263bbb1f05","observation_id":"35619af1-e926-41df-9d18-ce5de5d0d4c0","resolution":{"observed_at":"2026-08-12T19:41:46.563651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00149","last_updated":"2016-02-15T06:25:40Z","snapshot_observed_at":"2026-08-04T16:59:47.843960Z","submitted_at":"2015-10-01T09:03:44Z","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00149","snapshot_observed_at":"2026-08-12T19:41:46.566955Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.566955Z"},"links":{"cited_paper":"/paper/1510.00149","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:efbfa7e6ec78ec28afd171d2abb5a7642ddb8cae74e27d818f14709f92562b7d","observation_id":"3583d3ef-f786-45c2-8e56-f2184dad2b87","resolution":{"observed_at":"2026-08-12T19:41:46.566955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02626","last_updated":"2015-10-30T23:29:27Z","snapshot_observed_at":"2026-07-06T04:20:15.965140Z","submitted_at":"2015-06-08T19:28:43Z","title":"Learning both Weights and Connections for Efficient Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.02626","snapshot_observed_at":"2026-08-12T19:41:46.570146Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.570146Z"},"links":{"cited_paper":"/paper/1506.02626","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:1b1c8a7e8eb4d565772afc38fb7cca9a0d9c72b38a576599735e0c462d7c21e7","observation_id":"62e62996-011e-4c30-a2f8-5b410510ccec","resolution":{"observed_at":"2026-08-12T19:41:46.570146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-08-13T15:13:00.616968Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-08-12T19:41:46.573271Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.573271Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:a39cecd80e16f73af0cca68249b5a0a893bf1037c1f4888c450830a2b1b3c66b","observation_id":"29da7c40-b3e9-4778-81d2-b398182951a7","resolution":{"observed_at":"2026-08-12T19:41:46.573271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-11T08:20:29.798517Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-12T19:41:46.576548Z","title":"Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.576548Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:6a33c399cc2141f1fd43cf5f0075d22d9b234d3a708d98bec671aeeeae255445","observation_id":"375ae6ea-6899-44ae-8adb-99d705d2292e","resolution":{"observed_at":"2026-08-12T19:41:46.576548Z","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-12T19:41:46.579762Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.579762Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:179da288bcb19bde2ac8c8f7255f2536456bc5899d499d3b0b59460295117575","observation_id":"39e1faaf-9038-46d6-8ab9-b90fc8d7a6e3","resolution":{"observed_at":"2026-08-12T19:41:46.579762Z","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-12T19:41:46.949247Z","title":null,"venue":null,"work_id":"8788692e-9578-4992-82a0-235cb012dfeb","year":2020},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.582747Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:82aec238a982de0952f3e3827e9152e8dd4c23337154be6bd57b1d7c628cfe0f","observation_id":"5410116c-51b1-4fdb-9a4b-5d2d91e2371c","resolution":{"observed_at":"2026-08-12T19:41:46.953451Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T19:41:46.585490Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.585490Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:a833d3262c3bbcec28e672f9e60426a604db778eb7d791c051912f99f00e955a","observation_id":"f7f9a587-5702-42ee-bad7-fec7905f61ed","resolution":{"observed_at":"2026-08-12T19:41:46.585490Z","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-12T19:41:46.588399Z","title":"Sainath, Brian Kingsbury, Vikas Sindhwani, Ebru Arisoy, and Bhuvana Ramabhadran","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.588399Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:7c01c2b4b93bc46c759e96e324c21936e7f9a55c0b39421ad2433bb86ad23783","observation_id":"5280fac3-e7b2-4073-9814-da51ecb48e69","resolution":{"observed_at":"2026-08-12T19:41:46.588399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01108","last_updated":"2020-03-01T02:57:50Z","snapshot_observed_at":"2026-08-07T19:07:36.327251Z","submitted_at":"2019-10-02T17:56:28Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01108","snapshot_observed_at":"2026-08-12T19:41:46.591238Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.591238Z"},"links":{"cited_paper":"/paper/1910.01108","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:1867eda0dab20f71d92dfee01b24f317f8b1513ce20418333709d812a0118e95","observation_id":"94712f74-dcaa-4307-9eb4-40e68b3b0ea4","resolution":{"observed_at":"2026-08-12T19:41:46.591238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.13571","last_updated":"2022-10-18T12:22:36Z","snapshot_observed_at":"2026-08-13T15:35:48.242460Z","submitted_at":"2022-05-26T18:18:12Z","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","version":2},"cited_work":{"arxiv_id":"2205.13571","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.13571","snapshot_observed_at":"2026-08-12T19:41:46.797511Z","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","venue":"cs.LG","work_id":"c7aba801-fe88-4397-890a-76e29ea6e9b8","year":2022},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.594830Z"},"links":{"cited_paper":"/paper/2205.13571","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:341ba20c5c4b2f3d376d2dceb0173e14cf77925bd797bb78f35d04b7bca72712","observation_id":"c120b108-5d53-429d-8b33-9c547c4196aa","resolution":{"observed_at":"2026-08-12T19:41:46.802828Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.09355","last_updated":"2019-08-25T16:13:24Z","snapshot_observed_at":"2026-08-14T11:11:56.612741Z","submitted_at":"2019-08-25T16:13:24Z","title":"Patient Knowledge Distillation for BERT Model Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09355","snapshot_observed_at":"2026-08-12T19:41:46.597859Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.597859Z"},"links":{"cited_paper":"/paper/1908.09355","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:bdaebdd824d87d403132cb639b20860d079895a2d4f896825b728a2fc0b7dba9","observation_id":"75c20bf1-b3b6-45c4-a226-7c581ab092d3","resolution":{"observed_at":"2026-08-12T19:41:46.597859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-12T19:41:46.600780Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.600780Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:215b13fb6538aeca01e7481c4f6201dd98b3cf3472d73f2d737adf428e59fd4e","observation_id":"1b53cfa7-abc3-4f56-b8b4-4c3c10946d39","resolution":{"observed_at":"2026-08-12T19:41:46.600780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.07461","last_updated":"2019-02-22T23:53:34Z","snapshot_observed_at":"2026-07-06T06:34:26.609892Z","submitted_at":"2018-04-20T06:35:04Z","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.07461","snapshot_observed_at":"2026-08-12T19:41:46.603878Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.603878Z"},"links":{"cited_paper":"/paper/1804.07461","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:029a17d05b08e927834222a6adba5b07474e1f288ab00d36cd79099243705392","observation_id":"857d9ae7-734c-4408-b7f7-1f217d2390f8","resolution":{"observed_at":"2026-08-12T19:41:46.603878Z","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-12T19:41:46.607038Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.607038Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:ee095233542dbf8569c5d79c7008eb4c2e7006dddd6d4d573bf3cff9a39d9c95","observation_id":"5248b4a5-70a9-4b2e-a60f-88ab891133d2","resolution":{"observed_at":"2026-08-12T19:41:46.607038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10957","last_updated":"2020-04-06T02:53:18Z","snapshot_observed_at":"2026-08-10T12:28:10.970434Z","submitted_at":"2020-02-25T15:21:10Z","title":"MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10957","snapshot_observed_at":"2026-08-12T19:41:46.610038Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.610038Z"},"links":{"cited_paper":"/paper/2002.10957","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:b3aed73234e0b7d1a54c15d9e233633989ae2d692281db26fdbe55846e0a11cb","observation_id":"e2f02d61-2f8a-4cf4-9340-877aee94bdec","resolution":{"observed_at":"2026-08-12T19:41:46.610038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07378","last_updated":"2025-03-16T03:27:33Z","snapshot_observed_at":"2026-08-13T18:13:07.594457Z","submitted_at":"2024-03-12T07:31:18Z","title":"SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07378","snapshot_observed_at":"2026-08-12T19:41:46.614176Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.614176Z"},"links":{"cited_paper":"/paper/2403.07378","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:d64e4a3c144c85e5cfe7cffb59c6bf8b3670373e975ea0ce1fa0fd2cf9807dfd","observation_id":"72506a2b-16e7-4c14-b94a-7fa744348646","resolution":{"observed_at":"2026-08-12T19:41:46.614176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05821","last_updated":"2025-08-28T03:57:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-10T08:41:24Z","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05821","snapshot_observed_at":"2026-08-12T19:41:46.617286Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.617286Z"},"links":{"cited_paper":"/paper/2312.05821","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:aec592940b04612d7ea6e04aa9b217383d8d1304161c9952b870d405bf6cd6b9","observation_id":"35e20103-cff7-4755-9939-9bbee6b7c4c7","resolution":{"observed_at":"2026-08-12T19:41:46.617286Z","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-12T19:41:46.935717Z","title":null,"venue":null,"work_id":"2af52537-8a0e-438a-8d4d-41c2b60e6ade","year":2019},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.620252Z"},"links":{"citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:830b6f5bf2eed8450343beff2eb97825e53725627913b9c6179f552d33aa1275","observation_id":"3f97ff41-ae0a-4e16-a9d5-a0cd8ddd949c","resolution":{"observed_at":"2026-08-12T19:41:46.938962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02385","last_updated":"2024-06-04T02:05:30Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-04T17:54:59Z","title":"TinyLlama: An Open-Source Small Language Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02385","snapshot_observed_at":"2026-08-12T19:41:46.623282Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.623282Z"},"links":{"cited_paper":"/paper/2401.02385","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:2a24fe98dd64e413169005e6d02ce2a1ceeed81bc241ce5a0667e10dcc483c6a","observation_id":"ef2d8b76-4b47-43a9-ab80-d8b434196554","resolution":{"observed_at":"2026-08-12T19:41:46.623282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10512","last_updated":"2023-12-20T20:56:14Z","snapshot_observed_at":"2026-08-12T23:46:47.414754Z","submitted_at":"2023-03-18T22:36:25Z","title":"AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10512","snapshot_observed_at":"2026-08-12T19:41:46.626449Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T19:41:46.626449Z"},"links":{"cited_paper":"/paper/2303.10512","citing_paper":"/paper/2411.10543"},"observation_digest":"sha256:aa8b0d7799a5e7fc793c6f83bacb99fa1cd974cbd02f7d5950bd83d735feb420","observation_id":"156e1460-849b-4149-9457-1c684f96e195","resolution":{"observed_at":"2026-08-12T19:41:46.626449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.10543","last_updated":"2024-11-15T19:29:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T05:53:32.378116Z","submitted_at":"2024-11-15T19:29:51Z","title":"SoftLMs: Efficient Adaptive Low-Rank Approximation of Language Models using Soft-Thresholding Mechanism"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":1,"verified_fuzzy":2},"total_outbound_references":29},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2411.10543."}