{"as_of":"2026-08-18T09:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d202a9b844ca5c11419709e81cc8f4ea4e7d1eb4c3a518ff5b16519300d1e234","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-18T06:34:40.430872+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-16T12:45:21.601956Z","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:97b3954d7c3130ac9443672ddcb906858ae95cf97da18af2d032969671b34482","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-16T12:45:21.601956Z","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:c52750967e1135cc378bb57f2b92fbde35cd28a4d370d14a7b9fb399cc3da809","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-16T12:45:21.601956Z","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:bfd789e58495e58a0d40ed6d0f00b47b1e9c6ce5189143c83de082b2611498ad","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:45:21.601956Z","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:fbf878f7e239d49e4a49d7b2eedbb538f618eab6f20f47062cfa4f541d3d4a2a","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:45:21.601956Z","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:ba33d8c71859b3a43502d48aacfccd4f7f2091e71b064bcd50673097c7c050e6","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-08-14T18:16:28.847993Z","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-16T12:45:21.601956Z","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:9c1b90c4fcdc8be147d171cd23c571bd6f8b6ab225dbbeb667ee176f93231683","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-16T12:45:21.601956Z","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:6330302baad335b956d2329fc2e405a2d47e9634ac6a76b6a9cb7df013aa606e","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-18T01:41:35.046505Z","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-16T12:45:21.601956Z","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:78f9df0a549070554e31016ef55b32a40f14b1019377d888c914a0a4e5648419","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-08-17T20:47:46.242385Z","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-16T12:45:21.601956Z","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:ab79133ff7f5b0029c174b9b2a2e78b9a371a092378336c84d3adef5429e62b9","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-16T12:45:21.601956Z","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:8f17e1f6ab5ab6b855c952302ddbed02512719372b8bc368e1d92dd6d00293e7","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-08-15T13:34:24.234242Z","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-16T12:45:21.601956Z","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:16e1708c973c4c89ad7de0528d25e0abc64da7f58356816fbf6eb2a85fc6aaaf","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-16T16:49:06.065092Z","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-16T12:45:21.601956Z","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:71e42652671221ab43125ce3be9a6c3fcf192bde7a3739985d73c6ad9730a90f","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-17T18:04:53.578114Z","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-16T12:45:21.601956Z","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:9639351418a302a9069cef65e79c5bd488c55143b4f8b3470458221b125dbb69","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-16T12:45:21.601956Z","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:e0b12e23a43d3183bccfe5fa1fe73ad8c8a0e52ca959848b54a481798d7ef250","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-16T12:45:21.601956Z","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:d64d3eb1f6c7eaab8b60442580f7cffb8f417e8f614cef268ead6ee3531f45f4","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:45:21.601956Z","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:56ab5eaee127fdac96eed191579f37cdd87da5c8608ccf9336ff8dfa1fefe353","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-16T12:45:21.601956Z","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:575b55ad2b687c05d186868ccd02139e33e2ed9fb324241a31ba30419fa70792","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-16T12:45:21.601956Z","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:5a3e6c342e19fe5662ab146d65c77c612c5e7e43e7a09427ca25104b6f8db5b9","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-16T16:57:23.105321Z","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-16T12:45:21.601956Z","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:0e73d7b0cf299f527543fe56bc60e336ef354b62084c5ea8f6dfb60d63f25576","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T21:37:39.248967Z","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-16T12:45:21.601956Z","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:f8842ad2d4caa3de459be73108d2ea4853250e4860001b7fe1c2d1665753de92","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-08-17T01:19:18.409791Z","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-16T12:45:21.601956Z","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:4cd80b688da3b84b82dc69c7e433a495112b743020a022d274fb385e3386a3f6","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-08-16T09:50:11.319379Z","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-16T12:45:21.601956Z","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:01d16ba1b9b83d620295c314a261081a2ea93648d0f6be51f639ef4f0e6a88de","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-16T12:45:21.601956Z","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:c181fd51db2fc1c3548dbf9b75b9606effc3189ca2c121585313dfc3354fd217","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-14T23:23:42.318384Z","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-16T12:45:21.601956Z","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:dba1a0739c42091a4333cf77b471c4c68b43b3781cfa2f59dbd6fd1250d48a07","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-16T14:10:41.693836Z","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-16T12:45:21.601956Z","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:799f32ef73fe74c5a235d92d04b6fe79d44d67884e2bc3369bdba785938d7073","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-08-16T15:03:40.750477Z","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-16T12:45:21.601956Z","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:b72bc72a576667a0b6f6b472cd9bbd5a26412a6b0e094d800b43c7fb4a92bcb3","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-16T12:45:21.601956Z","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:70cef0f36f88e647fd7c6f449506903566af8da70cdc46f294e31062e3ce4cb9","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:45:21.601956Z","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:73c82cfe177f866e9ab2f393b52c76bd1137cd553a0c80e38199e88147034286","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-16T12:45:21.601956Z","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:5bb7bfeaae204bd9c044afbb6cb8fa56e89ecf5381212e67791c91173ed47481","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-16T12:45:21.601956Z","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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2411.10543."}