{"as_of":"2026-08-09T14:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58ee8b68db38e129b5efdb2f84573052dd74019e83cd3c82a865294dc9466c9c","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":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":25,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T11:28:42.170042Z","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-04T10:19:47.498950Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","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-09T11:28:42.170042Z","title":"Language model compression with weighted low-rank factorization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.02723","last_updated":"2025-02-04T21:17:51Z","snapshot_observed_at":"2026-08-09T11:19:32.107810Z","submitted_at":"2025-02-04T21:17:51Z","title":"Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectives","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T11:28:42.170042Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2502.02723"},"observation_digest":"sha256:1e8cd692fc41a979da98c5c73b73de3207adfd4e048d5f9bfa5fe34cad0421a8","observation_id":"12986e8d-83a8-470f-bd81-c000a674a273","resolution":{"observed_at":"2026-08-09T11:28:42.170042Z","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-07-06T13:26:38.135401Z","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-08T23:49:46.720117Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.04043","last_updated":"2025-02-06T13:03:05Z","snapshot_observed_at":"2026-08-08T23:42:17.470243Z","submitted_at":"2025-02-06T13:03:05Z","title":"Probe-Free Low-Rank Activation Intervention","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:46.720117Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2502.04043"},"observation_digest":"sha256:ad2425d0a4e83802bd8a5c57b0815712e3ac6906bfa06fbf976db4bfaa2cf220","observation_id":"221387e3-4ca1-441e-b3ea-09862da48a5d","resolution":{"observed_at":"2026-08-08T23:49:46.720117Z","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-07-06T13:26:38.135401Z","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-08T13:44:00.512142Z","title":"Language model compression with weighted low-rank factorization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.07832","last_updated":"2025-02-11T00:21:40Z","snapshot_observed_at":"2026-08-09T09:01:49.466932Z","submitted_at":"2025-02-11T00:21:40Z","title":"SHARP: Accelerating Language Model Inference by SHaring Adjacent layers with Recovery Parameters","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T13:44:00.512142Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2502.07832"},"observation_digest":"sha256:05f0a3f203d0adf5df047d915eb45796eb89deda243f264945d39229adeb32f4","observation_id":"24872e0f-5eed-430f-a35c-01ad60f58d30","resolution":{"observed_at":"2026-08-08T13:44:00.512142Z","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-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2505.12942","last_updated":"2026-05-12T22:54:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-19T10:29:32Z","title":"A3 : an Analytical Low-Rank Approximation Framework for Attention","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-22T15:02:33.864861Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2505.12942"},"observation_digest":"sha256:63fbb5656468ca2309252c18e67853c5c705bd0494a38381e2d1435b57a883bf","observation_id":"4e95d24e-4d0a-4e73-99a1-f1f350d54dae","resolution":{"observed_at":"2026-05-22T15:04:57.137032Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","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-07T13:23:35.080757Z","title":"Language model compression with weighted low-rank factorization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21987","last_updated":"2025-05-28T05:25:16Z","snapshot_observed_at":"2026-08-09T09:35:04.687777Z","submitted_at":"2025-05-28T05:25:16Z","title":"ACE: Exploring Activation Cosine Similarity and Variance for Accurate and Calibration-Efficient LLM Pruning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:23:35.080757Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2505.21987"},"observation_digest":"sha256:f9f6ece9175bbf8cbc0b1151032afeec30251767d7109b23128fd086e6664c47","observation_id":"520d8110-9129-4f9b-affb-c7bd169a1da9","resolution":{"observed_at":"2026-08-07T13:23:35.080757Z","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-07-06T13:26:38.135401Z","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-07T13:30:19.451609Z","title":"Language model compression with weighted low-rank factorization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T23:10:30.178835Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.451609Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:2ced823d56f8a8ad8107caf067d4906f54154721a6e08be46062837f3fc85190","observation_id":"a3b8eeaa-d291-47fa-9214-59a1377fb0fb","resolution":{"observed_at":"2026-08-07T13:30:19.451609Z","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-07-06T13:26:38.135401Z","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-07T11:20:42.319067Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.02818","last_updated":"2025-06-03T12:47:23Z","snapshot_observed_at":"2026-08-07T11:12:49.745940Z","submitted_at":"2025-06-03T12:47:23Z","title":"ProcrustesGPT: Compressing LLMs with Structured Matrices and Orthogonal Transformations","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T11:20:42.319067Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2506.02818"},"observation_digest":"sha256:a9bdfe686a9a3594e306f9a33ea0265acdd7e2f58b5b14b8b99a51f2b3c07f97","observation_id":"a6441d57-d696-4e5a-8b34-34510d9a74b6","resolution":{"observed_at":"2026-08-07T11:20:42.319067Z","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-07-06T13:26:38.135401Z","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-06T22:58:09.339529Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20353","last_updated":"2025-06-25T12:04:53Z","snapshot_observed_at":"2026-08-07T23:12:17.952101Z","submitted_at":"2025-06-25T12:04:53Z","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T22:58:09.339529Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2506.20353"},"observation_digest":"sha256:d8c20173197f90aa46bf4cb0f9b523eb6c00702669911a0bf8ef0dd3ee26ba40","observation_id":"4e341fb2-7a76-4e91-b483-8103974df16b","resolution":{"observed_at":"2026-08-06T22:58:09.339529Z","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-07-06T13:26:38.135401Z","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-06T15:24:45.738275Z","title":"Language model compression with weighted low-rank factorization, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.15977","last_updated":"2025-07-21T18:17:18Z","snapshot_observed_at":"2026-08-08T15:45:05.019347Z","submitted_at":"2025-07-21T18:17:18Z","title":"On the transferability of Sparse Autoencoders for interpreting compressed models","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T15:24:45.738275Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2507.15977"},"observation_digest":"sha256:ec29a052b3e16d2b6097dba44ca86bd2ffdc693063f4ca8a9668dcfd6f509249","observation_id":"0a599cdc-a07d-4dad-adfb-c16f25508174","resolution":{"observed_at":"2026-08-06T15:24:45.738275Z","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-07-06T13:26:38.135401Z","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-06T05:40:47.501518Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.01506","last_updated":"2025-08-02T22:06:46Z","snapshot_observed_at":"2026-08-08T13:50:09.517662Z","submitted_at":"2025-08-02T22:06:46Z","title":"FlashSVD: Memory-Efficient Inference with Streaming for Low-Rank Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T05:40:47.501518Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2508.01506"},"observation_digest":"sha256:cc1d936932be2ec88129707f13a4b4fcd3752653d20c8e7623b2b3475ad3e951","observation_id":"bb1e7e88-02f2-4590-9ec6-ab79e78161e2","resolution":{"observed_at":"2026-08-06T05:40:47.501518Z","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-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2510.25977","last_updated":"2026-04-23T22:27:02Z","snapshot_observed_at":"2026-08-02T11:49:00.583840Z","submitted_at":"2025-10-29T21:22:08Z","title":"NeuronMLP: Efficient LLM Inference via Singular Value Decomposition Compression and Tiling on AWS Trainium","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-18T02:51:19.275111Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2510.25977"},"observation_digest":"sha256:485850fd4c3463b7608e4229fed296f3600c3aaa447fb4b15c214c7ac8a29678","observation_id":"b33362d5-6368-473f-942d-c392235d0e53","resolution":{"observed_at":"2026-05-18T02:52:21.811734Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","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-03T06:01:14.604443Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.00942","last_updated":"2026-05-28T22:25:40Z","snapshot_observed_at":"2026-08-06T17:02:26.888999Z","submitted_at":"2026-02-01T00:00:11Z","title":"SALAAD: Sparse And Low-Rank Adaptation via ADMM for Large Language Model Inference","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-03T06:01:14.604443Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2602.00942"},"observation_digest":"sha256:90747f1a7ea09d671b2138b3ddd2111cb670327555f60e2936aeb30043e51e28","observation_id":"6333a707-fe88-4494-8500-307171bcf3c5","resolution":{"observed_at":"2026-08-03T06:01:14.604443Z","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-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2604.02570","last_updated":"2026-04-02T22:49:57Z","snapshot_observed_at":"2026-07-06T22:51:57.889822Z","submitted_at":"2026-04-02T22:49:57Z","title":"WSVD: Weighted Low-Rank Approximation for Fast and Efficient Execution of Low-Precision Vision-Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-13T21:05:09.254086Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2604.02570"},"observation_digest":"sha256:624f98579d096f2d1f95ea933915901908645747936333720f49d7cb789cbeab","observation_id":"7b4dd20a-31f6-431c-8b3f-3f9f570c744f","resolution":{"observed_at":"2026-05-13T21:08:18.057262Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2605.02829","last_updated":"2026-05-04T17:05:45Z","snapshot_observed_at":"2026-08-08T06:58:46.714670Z","submitted_at":"2026-05-04T17:05:45Z","title":"Compress Then Adapt? No, Do It Together via Task-aware Union of Subspaces","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T18:10:41.778201Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2605.02829"},"observation_digest":"sha256:3177a4f70f474469ae5fafaaedad2e4a04fb26d5540bcdc9fb61377099534d4f","observation_id":"c3b690d2-cef7-4434-a7c0-d45658d061eb","resolution":{"observed_at":"2026-05-09T06:45:40.951042Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2605.02905","last_updated":"2026-04-06T02:05:52Z","snapshot_observed_at":"2026-07-06T23:15:55.848885Z","submitted_at":"2026-04-06T02:05:52Z","title":"eOptShrinkQ: Near-Lossless KV Cache Compression Through Optimal Spectral Denoising and Quantization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T20:18:04.392331Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2605.02905"},"observation_digest":"sha256:891a413807a68610320fe9187e6660f890b9563b1e79e55dd819fe7672eaf946","observation_id":"b61d72c1-5caf-4a03-b047-1dd2f59a748e","resolution":{"observed_at":"2026-05-10T22:00:50.808755Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2605.08314","last_updated":"2026-05-08T14:20:42Z","snapshot_observed_at":"2026-08-02T20:58:18.012548Z","submitted_at":"2026-05-08T14:20:42Z","title":"FlashSVD v1.5: Making Low-Rank Transformers Inference Actually Fast","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-12T00:59:43.488204Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2605.08314"},"observation_digest":"sha256:8a340ce526d6c5a92f962ffc3503ca0a22bb43e94d8218d1d225f00a8390cb55","observation_id":"9a78fc8d-3cc2-4a59-982a-a90173837b45","resolution":{"observed_at":"2026-05-12T08:31:26.548872Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2605.08568","last_updated":"2026-05-09T00:02:33Z","snapshot_observed_at":"2026-08-02T23:13:09.763052Z","submitted_at":"2026-05-09T00:02:33Z","title":"Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compression","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-12T02:22:51.541981Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2605.08568"},"observation_digest":"sha256:cd5ff8dc450125e98583b4392868a98dcacd1b9666c9f768630842c847cb1334","observation_id":"20bc5027-8c3a-4184-9748-385517ec8bbc","resolution":{"observed_at":"2026-05-12T07:41:34.232003Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2605.16600","last_updated":"2026-05-15T20:00:59Z","snapshot_observed_at":"2026-08-04T00:48:44.312345Z","submitted_at":"2026-05-15T20:00:59Z","title":"Where Pretraining writes and Alignment reads: the asymmetry of Transformer weight space","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-20T20:34:56.529636Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2605.16600"},"observation_digest":"sha256:e69f538d86b414d094da20ff483b6c1c152f3d4a4df36d3c78f65d5c3ddefe17","observation_id":"b35aa454-63fd-492c-a315-010cb8c10e3b","resolution":{"observed_at":"2026-05-20T20:39:00.223911Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2605.17985","last_updated":"2026-05-18T07:40:46Z","snapshot_observed_at":"2026-08-03T02:11:52.628977Z","submitted_at":"2026-05-18T07:40:46Z","title":"SAFE-SVD: Sensitivity-Aware Fidelity-Enforcing SVD for Physics Foundation Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T13:02:08.337788Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2605.17985"},"observation_digest":"sha256:c58821656d55be2079121610240658cef3aef1204ead7ae9df196cc972671916","observation_id":"6c14d176-af5f-41b1-8d33-31c09eddec5e","resolution":{"observed_at":"2026-05-20T13:03:17.817416Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2605.19842","last_updated":"2026-05-19T13:37:53Z","snapshot_observed_at":"2026-07-06T23:30:30.141040Z","submitted_at":"2026-05-19T13:37:53Z","title":"Fast Tensorization of Neural Networks via Slice-wise Feature Distillation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T06:53:09.576838Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2605.19842"},"observation_digest":"sha256:1994558628464c312892e9acbd9b3464541081e74b3886c5ed0833809d6c0f18","observation_id":"f22e08ca-9a45-4d97-86cb-6ff9812185bc","resolution":{"observed_at":"2026-05-20T06:53:22.952467Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2606.00535","last_updated":"2026-05-30T05:05:24Z","snapshot_observed_at":"2026-08-09T01:45:13.939348Z","submitted_at":"2026-05-30T05:05:24Z","title":"DREAM-S: Speculative Decoding with Searchable Drafting and Target-Aware Refinement for Multimodal Generation","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-28T18:55:51.474956Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2606.00535"},"observation_digest":"sha256:dd6b3b847e992b240a9ffd06cbbf616b50d74d470f876716fa26941216ccf068","observation_id":"a4e9970c-1f03-4fd8-b94a-e96b1edb979e","resolution":{"observed_at":"2026-06-28T19:02:34.554045Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2606.00573","last_updated":"2026-05-30T06:53:23Z","snapshot_observed_at":"2026-08-08T01:36:01.912280Z","submitted_at":"2026-05-30T06:53:23Z","title":"LASER: Loss-Aware Singular-value Decomposition and Rank Allocation for Efficient Low-Precision Vision-Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T19:09:29.347284Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2606.00573"},"observation_digest":"sha256:5a1ba84f562764509a96960ea680966d638d0827b27be9fb507d857ed0390b32","observation_id":"061fea46-48a7-442f-8c29-41d69309f54a","resolution":{"observed_at":"2026-06-28T19:12:34.691828Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2606.07596","last_updated":"2026-05-29T05:18:25Z","snapshot_observed_at":"2026-08-02T15:34:41.267903Z","submitted_at":"2026-05-29T05:18:25Z","title":"Shortcuts in the Tail: Debiasing via Post-Hoc Spectral Compression of Fine-Tuning Updates","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T23:30:21.543618Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2606.07596"},"observation_digest":"sha256:faae6ee3629226c71acae7c6a9a6d18566a4f0b16d6ac7161ffcf8b15ca6cf1b","observation_id":"ffab6335-4646-4a61-b086-1d8612a8784f","resolution":{"observed_at":"2026-06-28T23:32:47.002913Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2606.19993","last_updated":"2026-06-18T09:31:31Z","snapshot_observed_at":"2026-08-07T06:04:20.969024Z","submitted_at":"2026-06-18T09:31:31Z","title":"Activation- and Influence-Aware Ranks (AIR): Function-Preserving SVD Compression for LLMs","version":1},"reference_index":180,"source":"arxiv_source","source_observed_at":"2026-06-26T18:09:17.414031Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2606.19993"},"observation_digest":"sha256:243880bd0d4d6318bbdc4b4c20bd804d0bff6681973378e8933ab9592ef94ae1","observation_id":"49d8fd08-9c1b-462d-9ee2-e3ec6043a2cc","resolution":{"observed_at":"2026-07-04T03:19:31.526717Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization","version":1},"cited_work":{"arxiv_id":"2207.00112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.00112","snapshot_observed_at":"2026-07-04T10:19:47.498950Z","title":"Language model compression with weighted low-rank factorization.arXiv preprint arXiv:2207.00112","venue":null,"work_id":"e0e91694-b244-460a-a49e-7b2c1ff42979","year":2022},"citing_paper":{"arxiv_id":"2606.23568","last_updated":"2026-06-22T16:33:16Z","snapshot_observed_at":"2026-08-05T09:40:47.660432Z","submitted_at":"2026-06-22T16:33:16Z","title":"SVD-Surgeon: Optimal Singular-Value Surgery for Large Language Model Compression","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T08:58:27.282205Z"},"links":{"cited_paper":"/paper/2207.00112","citing_paper":"/paper/2606.23568"},"observation_digest":"sha256:ea3d65449850e7158f9689fc130fcc680e1f95779c44d7099f06120f64d433c7","observation_id":"e8b9302a-e394-47af-8253-6488ef78e220","resolution":{"observed_at":"2026-07-04T10:19:47.500318Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2207.00112/citation-record","integrity":"/paper/2207.00112/integrity","json":"/paper/2207.00112/citation-record.json","paper":"/paper/2207.00112"},"outbound":[],"paper":{"arxiv_id":"2207.00112","last_updated":"2022-06-30T21:57:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:26:38.135401Z","submitted_at":"2022-06-30T21:57:07Z","title":"Language model compression with weighted low-rank factorization"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 25 inbound Pith citation observations for arXiv:2207.00112."}