{"as_of":"2026-08-04T11:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8b32bb3f016cb41be40f4395eab8d8373bb81a2e73f52e35984ece9a275a4ac","coverage":[{"denominator":103,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T18:31:01.804061Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2606.08565/citation-record","integrity":"/paper/2606.08565/integrity","json":"/paper/2606.08565/citation-record.json","paper":"/paper/2606.08565"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08905","last_updated":"2024-12-12T03:37:41Z","snapshot_observed_at":"2026-08-02T08:41:10.128841Z","submitted_at":"2024-12-12T03:37:41Z","title":"Phi-4 Technical Report","version":1},"cited_work":{"arxiv_id":"2412.08905","doi":"10.48550/arxiv.2412.08905","metadata_source":"pith","pith_arxiv_id":"2412.08905","snapshot_observed_at":"2026-07-11T00:47:43.055842Z","title":"Phi-4 Technical Report","venue":"cs.CL","work_id":"b6274271-7af9-4ee8-993b-ba1ba4205ba8","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2412.08905","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:75126b802b5bd11f7f342c6f3eca5053777f660ac89821648a47e9cb4c5038c8","observation_id":"060c5dbb-8c5c-4923-a9b1-b112a2c3620c","resolution":{"observed_at":"2026-07-02T22:57:26.696503Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-02T03:08:11.323957+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-02T03:08:11.323957+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01743","last_updated":"2025-03-07T09:05:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-03T17:05:52Z","title":"Phi-4-Mini Technical Report: Compact yet Powerful Multimodal Language Models via Mixture-of-LoRAs","version":2},"cited_work":{"arxiv_id":"2503.01743","doi":"10.18653/v1/2023.wmt-1.23","metadata_source":"pith","pith_arxiv_id":"2503.01743","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Phi-4-Mini Technical Report: Compact yet Powerful Multimodal Language Models via Mixture-of-LoRAs","venue":"cs.CL","work_id":"83956045-536a-41ff-af02-b80e2a614eab","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2503.01743","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d1d9b63c722f9a8cd368293722ea1f5849ef9f23d4283d83ddf3da07c4fa370c","observation_id":"80f64914-1c6f-483e-b062-253aec610cd6","resolution":{"observed_at":"2026-07-02T23:07:26.490409Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"TQCompressor : improving tensor decomposition methods in neural networks via permutations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:65c5feb5cbb16ce135e416949abc4c819b5dbe8c15624e92514687483de4e976","observation_id":"d634edd9-47ba-44a1-8e5c-872f8fb263b3","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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":"2603.03975","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T23:07:26.454476Z","title":"Phi-4-reasoning-vision-15b technical report","venue":null,"work_id":"4c34eb5f-5781-4ddc-a444-677f271528d0","year":2026},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:c6cde57f51d6e980b39ae990d3a958b62041cfed6195a3150ac9cd3ee4f45c47","observation_id":"212d80d5-a560-4159-8ad1-055316ea5eeb","resolution":{"observed_at":"2026-07-02T23:07:26.456602Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2504.09629","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T14:47:14.553019Z","title":"Quantization error propagation: Revisiting layer-wise post-training quantization","venue":null,"work_id":"ba0b6247-52ab-47a3-b8ba-6c270322929a","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:f1186077aa46e3d7376d8358e01474c14ba2329c683272cd092c9c71b600f673","observation_id":"c3ba677f-2eae-4235-920e-5b671dc7abd6","resolution":{"observed_at":"2026-07-02T23:07:26.471531Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.09985","last_updated":"2025-06-11T17:57:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-11T17:57:09Z","title":"V-JEPA 2: Self-Supervised Video Models Enable Understanding, Prediction and Planning","version":1},"cited_work":{"arxiv_id":"2506.09985","doi":"10.48550/arxiv.2506.09985","metadata_source":"pith","pith_arxiv_id":"2506.09985","snapshot_observed_at":"2026-07-11T02:27:49.493432Z","title":"V-JEPA 2: Self-Supervised Video Models Enable Understanding, Prediction and Planning","venue":"cs.AI","work_id":"a9c28401-f16a-4933-89f0-788e2f94e52b","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2506.09985","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:115b4ca2a521a3c862dee055c1094a60eff1df1b55f135db16ff65eca9750021","observation_id":"96969584-42d7-4d26-95be-c068fd9ce6fc","resolution":{"observed_at":"2026-07-02T23:07:26.496372Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-03T19:08:37.559938+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T19:08:37.559938+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.00625","last_updated":"2024-12-29T17:38:32Z","snapshot_observed_at":"2026-08-03T07:09:22.905094Z","submitted_at":"2024-01-01T01:12:42Z","title":"Beyond Efficiency: A Systematic Survey of Resource-Efficient Large Language Models","version":4},"cited_work":{"arxiv_id":"2401.00625","doi":"10.48550/arxiv.2401.00625","metadata_source":"arxiv_reference","pith_arxiv_id":"2401.00625","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Beyond efficiency: A systematic survey of resource-efficient large language models","venue":null,"work_id":"5aad8b00-adae-4d93-b605-916d638c9d99","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2401.00625","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:bb234e49863042d19394459776d8776e9ad85ae9de1edfa7160ade555db7257d","observation_id":"b1747d63-cc58-4b66-90fa-046b8a7ff847","resolution":{"observed_at":"2026-07-02T23:07:26.494000Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17946","last_updated":"2024-10-31T19:38:15Z","snapshot_observed_at":"2026-07-06T17:36:32.068270Z","submitted_at":"2024-02-28T00:09:07Z","title":"SparseLLM: Towards Global Pruning for Pre-trained Language Models","version":4},"cited_work":{"arxiv_id":"2402.17946","doi":"10.48550/arxiv.2402.17946","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17946","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Sparsellm: Towards global pruning for pre-trained language models","venue":null,"work_id":"69f48840-2333-44e3-a13e-edcdb4db3b51","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2402.17946","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:f20c3095e40622426dc51f69e701418e4a30b35c011e12dbbafd8724122605e7","observation_id":"884e62bf-1f11-4fdc-a963-096bf82432ee","resolution":{"observed_at":"2026-07-02T23:07:26.462625Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.21631","last_updated":"2025-11-27T12:16:54Z","snapshot_observed_at":"2026-07-06T22:37:03.716474Z","submitted_at":"2025-11-26T17:59:08Z","title":"Qwen3-VL Technical Report","version":2},"cited_work":{"arxiv_id":"2511.21631","doi":"10.1016/j.neunet.2025.107777","metadata_source":"pith","pith_arxiv_id":"2511.21631","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3-VL Technical Report","venue":"cs.CV","work_id":"1fe243aa-e3c0-4da6-b391-4cbcfc88d5c0","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2511.21631","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:828347eee35dbb6abd8fc8986de1299846a83731143088bf186b037b06de4a75","observation_id":"0b44070d-3054-46a1-98a8-c6d639331ef7","resolution":{"observed_at":"2026-07-02T23:07:26.473977Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01376","last_updated":"2024-02-05T12:42:52Z","snapshot_observed_at":"2026-07-06T17:24:16.787573Z","submitted_at":"2024-02-02T13:00:38Z","title":"LoTR: Low Tensor Rank Weight Adaptation","version":2},"cited_work":{"arxiv_id":"2402.01376","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.01376","snapshot_observed_at":"2026-07-02T23:07:26.497230Z","title":"LoTR: Low tensor rank weight adaptation","venue":null,"work_id":"9e2ecc9b-d32a-46de-b961-0e385fba418b","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2402.01376","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d74e75305d1dfeb397db224911b5cf508eebede8ca54e21fadbe64d3b399d470","observation_id":"dde72244-8249-4e61-9cd1-1b8c57a63ef6","resolution":{"observed_at":"2026-07-02T23:07:26.498803Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07726","last_updated":"2024-10-10T17:28:23Z","snapshot_observed_at":"2026-08-04T10:58:38.750074Z","submitted_at":"2024-07-10T14:57:46Z","title":"PaliGemma: A versatile 3B VLM for transfer","version":2},"cited_work":{"arxiv_id":"2407.07726","doi":"10.48550/arxiv.2407.07726","metadata_source":"pith","pith_arxiv_id":"2407.07726","snapshot_observed_at":"2026-07-10T23:37:43.136584Z","title":"PaliGemma: A versatile 3B VLM for transfer","venue":"cs.CV","work_id":"df6f48b3-5792-47c7-9614-cb856ea31ad9","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2407.07726","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:efc32dabc3b15fd8750f14d7c7679b3ed6ab0eea2fdd219265f8f9b3928683de","observation_id":"69e8b5d7-2fe0-4726-af3a-62f7dc21dfbb","resolution":{"observed_at":"2026-07-02T22:57:26.703938Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T13:22:31.538292+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T13:22:31.538292+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"K., Hachtel, G","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:c43fed89f43f1cfa011748073d7bfec12a09428da005595c641e6951904b493e","observation_id":"5a15239c-9a3c-4c75-b2a2-9958025828bb","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Pyramid KV : Dynamic KV cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:582b44d6a123409c2b43c55dbe82644a90d12d7e563fcc3bfdde4d756a7bc159","observation_id":"bd7f7b1f-d13f-432d-8819-eb4dc6abb964","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21118","last_updated":"2024-11-04T02:08:55Z","snapshot_observed_at":"2026-07-06T18:54:41.705593Z","submitted_at":"2024-07-30T18:19:38Z","title":"Palu: Compressing KV-Cache with Low-Rank Projection","version":2},"cited_work":{"arxiv_id":"2407.21118","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.21118","snapshot_observed_at":"2026-07-10T01:36:44.121083Z","title":"Palu: Compressing kv-cache with low-rank projection.arXiv preprint arXiv:2407.21118","venue":"cs.AI","work_id":"dc6247ce-a2da-431d-a935-3fb13543cb13","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2407.21118","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:124993b534f601cc0b23ae067bed1aa644c978928984505b9f21f686f6a9ffca","observation_id":"af4941be-b6f9-4ab6-80a6-1de7e319cc81","resolution":{"observed_at":"2026-07-02T22:57:26.699258Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.07967","last_updated":"2023-10-16T15:52:20Z","snapshot_observed_at":"2026-07-06T15:42:10.592303Z","submitted_at":"2023-06-13T17:59:32Z","title":"One-for-All: Generalized LoRA for Parameter-Efficient Fine-tuning","version":2},"cited_work":{"arxiv_id":"2306.07967","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.07967","snapshot_observed_at":"2026-07-02T22:57:26.700322Z","title":"One-for-all: Generalized lora for parameter-efficient fine-tuning.arXiv preprint arXiv:2306.07967","venue":null,"work_id":"d28ada12-b5c8-45ec-b014-b1a1bc0f16f5","year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2306.07967","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:f8ca5a3a03c881fab5a5165e0968a130f1f8ee95bab9319bb8d7dd9d634ac389","observation_id":"31c41499-bcae-44c0-83e6-8d4e30a5259c","resolution":{"observed_at":"2026-07-02T22:57:26.701714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"SuperLoRA : Parameter-efficient unified adaptation for large vision models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:8a5f44b8b8feec914ed4cb31b42a137da7f852e2a95d283b50616af2837f54d0","observation_id":"004165f5-ab75-4178-846c-83e859c5312c","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"QuanTA : Efficient high-rank fine-tuning of LLMs with quantum-informed tensor adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:4117b17c9ccd085c4e9a36b16c34de63f2f1692db4fed43f3b5fadb79283ef6f","observation_id":"9c511318-fa50-4861-b5a0-4dd7aa660edc","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":"2110.14168","doi":"10.1002/j.1545-","metadata_source":"pith","pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Training Verifiers to Solve Math Word Problems","venue":"cs.LG","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":2021},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:c968cce1d0dea6a4d5060c1e46ade2535164b5133e8e64c125645389ae51a77e","observation_id":"33321887-bc6b-4919-932f-9bbc9ac08d7e","resolution":{"observed_at":"2026-07-02T22:57:26.736167Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:bd3fca633ea7d408447f09834f75ff80d764ca1507271312e8096729c48159d0","observation_id":"d492969c-292b-4891-87ea-c15a1db94774","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Predicting parameters in deep learning","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:e7348c63209fad348390108935226fa10009cc266fe20a5f7220b4f20afbfb10","observation_id":"d9fdb5d9-ce87-4a5e-8cd7-320475167b91","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"L., Zaremba, W., Bruna, J., LeCun, Y., and Fergus, R","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:fba302428e6622bbca51535082371a8b53a7de9f734833dcad2622f9ff80074a","observation_id":"4975695e-94c0-4ec3-be36-8d97d9a3ecde","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"DaViT : Dual attention vision transformers","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:9047c352211125e1f8fb5d203c50dd15b10c592bd7847ec21fa23ec69c91d16c","observation_id":"a9e7a6d8-dcb3-4a9b-b7c1-8f8f6cc8b2cd","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Learning to prune deep neural networks via layer-wise optimal brain surgeon","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:289d57db89f8381869dcf21451bcaccd91f3dd5699722a66a9bf77af45ef4da4","observation_id":"eaf3e1c9-f091-463a-ad5a-7089236e24b5","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"W., and Keutzer, K","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:f5a7999d67c28efa910dd57daf60e7c4630c95b5542744c26a19f8fe34a95d7b","observation_id":"ca01fbb4-4bab-4466-af2f-7646441fb8d9","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10650","last_updated":"2022-12-20T20:56:52Z","snapshot_observed_at":"2026-08-03T01:40:26.342026Z","submitted_at":"2022-12-20T20:56:52Z","title":"KronA: Parameter Efficient Tuning with Kronecker Adapter","version":1},"cited_work":{"arxiv_id":"2212.10650","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.10650","snapshot_observed_at":"2026-07-02T23:07:26.470587Z","title":"P., Clark, J","venue":null,"work_id":"8f1f1fc9-45c5-4fb6-a8a9-53aea5c4b981","year":2022},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2212.10650","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:af1844a0e4231e61a40541cb6b9c8675e4b45aeebca8b5ad44c9bde230d933c4","observation_id":"4cfd3732-a135-46f9-a031-111376ed4518","resolution":{"observed_at":"2026-07-02T23:07:26.472139Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"Gauge fixing, canonical forms, and optimal truncations in tensor networks with closed loops","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:b514f06cb22cca8f61e329b6e842b092d9c88de77e5f9ba763ea831c110bdfc7","observation_id":"580138e9-7bf6-44c7-af28-ba9e6c21b7f7","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"and Alistarh, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:aab4106e75d3ce407f25e7264f6b95a4c5da13051dda32ffc8a7274f0623a96f","observation_id":"54349636-6361-429b-8255-f00c034ba563","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17323","last_updated":"2023-03-22T13:10:47Z","snapshot_observed_at":"2026-07-31T03:44:36.976336Z","submitted_at":"2022-10-31T13:42:40Z","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","version":2},"cited_work":{"arxiv_id":"2210.17323","doi":"10.48550/arxiv.2210.17323","metadata_source":"pith","pith_arxiv_id":"2210.17323","snapshot_observed_at":"2026-07-10T14:47:14.534663Z","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","venue":"cs.LG","work_id":"19ed8c44-202a-48f6-8169-637d5a5f2408","year":2022},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2210.17323","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:15ec104821673a6f7c6a0d5b0a6039302495c78c00cd3237cafe204b84658c04","observation_id":"14938294-507e-4396-a6df-3dcdbe7fae72","resolution":{"observed_at":"2026-07-02T23:07:26.487873Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-17T20:22:03.028003+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T20:22:03.028003+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"S., Thomas, A., Spector, B., Poli, M., Rudra, A., and R \\'e , C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:950dbcee76df694607e6674bd248419e93cb35e29fd4ada71e18bd6e6fb392f9","observation_id":"2c371ff5-c263-4d74-b7a6-54972b79fc42","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19786","last_updated":"2025-03-25T15:52:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-25T15:52:34Z","title":"Gemma 3 Technical Report","version":1},"cited_work":{"arxiv_id":"2503.19786","doi":"10.1007/978-3-540-48085-3_36","metadata_source":"pith","pith_arxiv_id":"2503.19786","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Gemma 3 Technical Report","venue":"cs.CL","work_id":"f93e08bf-9e96-409b-8ac6-b8385fd17fd7","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2503.19786","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:e116df49764bb67ff77e210210a60a8d5cac53af1029694ca0f72d33f6dfd57d","observation_id":"e813fe44-f814-48dc-ba6d-6beec70aed3c","resolution":{"observed_at":"2026-07-02T23:07:26.450287Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.08850","last_updated":"2019-04-29T07:56:18Z","snapshot_observed_at":"2026-07-06T07:40:42.809424Z","submitted_at":"2019-03-21T07:05:44Z","title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations","version":2},"cited_work":{"arxiv_id":"1903.08850","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.08850","snapshot_observed_at":"2026-07-02T22:57:26.747620Z","title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations","venue":"stat.ML","work_id":"ff021bf5-c3c0-46b6-a60d-2234b3df567e","year":2019},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/1903.08850","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:72864d3cd440ab873d1b9fa0e1fbd99433cd679a6135c46f42c2588c548181bc","observation_id":"d0d19f3d-09ed-490a-b073-6ef1d4496c4b","resolution":{"observed_at":"2026-07-02T22:57:26.748956Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.13833","last_updated":"2024-08-23T00:04:31Z","snapshot_observed_at":"2026-07-06T18:48:42.015848Z","submitted_at":"2024-07-18T18:06:59Z","title":"Phi-3 Safety Post-Training: Aligning Language Models with a \"Break-Fix\" Cycle","version":2},"cited_work":{"arxiv_id":"2407.13833","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.13833","snapshot_observed_at":"2026-07-04T18:10:00.725443Z","title":"Phi-3 safety post-training: Aligning language models with a ``break-fix''' cycle","venue":null,"work_id":"93a8931b-1823-4f05-86d6-713504477eea","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2407.13833","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:e1deb07b95d6b8d7784c2ee6de82f237f56c5c0ffab30e9abd0d254bc6d7b960","observation_id":"26b60772-c88a-4836-aef9-d6f1e9fcb58b","resolution":{"observed_at":"2026-07-02T22:57:26.746294Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"Optimal brain surgeon: Extensions and performance comparisons","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:9998cf7946f09884a6cf364d01062f47033aac423a4ef813049beff96dd4d903","observation_id":"c0cfa905-53a9-4b88-b096-0b5d89e2075e","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"LoRA +: Efficient low rank adaptation of large models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:0b1143df2cdeb0310a4099f1fccdcd9edd444ff3767cf9d7eaa0c95543a5ecb6","observation_id":"c69931b6-53fc-4f81-b779-6bc1317481ba","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02301","last_updated":"2023-07-05T16:59:31Z","snapshot_observed_at":"2026-07-06T15:22:55.122322Z","submitted_at":"2023-05-03T17:50:56Z","title":"Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizes","version":2},"cited_work":{"arxiv_id":"2305.02301","doi":"10.48550/arxiv.2305.02301","metadata_source":"pith","pith_arxiv_id":"2305.02301","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizes","venue":"cs.CL","work_id":"5aa5f825-0529-4a20-a69d-9ecab4c8290c","year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2305.02301","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:e906a5dd7ed0514a251b6b4baf5770809a3a6bb2906d90161ed59829e2f77564","observation_id":"c87ca0ea-f034-43bd-b243-db4bb0ba1723","resolution":{"observed_at":"2026-07-02T22:57:26.751796Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-20T14:22:04.795988+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T14:22:04.795988+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"J., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., Chen, W., et al","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:69830dda042a08f0bff534ee3cfb025787d17742f806cde5be0ca006d34c4ac0","observation_id":"31693dd3-b2df-4e3b-940e-bf867f3eed50","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"B., and Stoudenmire, E","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:a350305a4b1c83f01bae09a32d1c2380ac00defb98cd66018cfa2cd69422a79d","observation_id":"b08211e4-6093-41c7-811a-674aafe0ac07","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09117","last_updated":"2024-06-13T13:44:31Z","snapshot_observed_at":"2026-07-06T18:30:19.486766Z","submitted_at":"2024-06-13T13:44:31Z","title":"PC-LoRA: Low-Rank Adaptation for Progressive Model Compression with Knowledge Distillation","version":1},"cited_work":{"arxiv_id":"2406.09117","doi":"10.48550/arxiv.2406.09117","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.09117","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2406.09117 (2024).https://doi.org/10.48550/arXiv.2406.09117,https: //arxiv.org/abs/2406.091172","venue":null,"work_id":"6bf7390f-177a-4795-b988-3ca8b420d6ba","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2406.09117","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:0d62a9fd6aa06d9d1bf67d93a0e6e290ebd5d1ec3c7959ee0f4e0ff0aa3c3808","observation_id":"39e4a619-9de8-4409-8ddb-a6dfcc804cfe","resolution":{"observed_at":"2026-07-02T22:57:26.744827Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16054","last_updated":"2025-04-22T17:31:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-22T17:31:29Z","title":"$\\pi_{0.5}$: a Vision-Language-Action Model with Open-World Generalization","version":1},"cited_work":{"arxiv_id":"2504.16054","doi":"10.1609/aaai.v40i28.39562","metadata_source":"pith","pith_arxiv_id":"2504.16054","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"$\\pi_{0.5}$: a Vision-Language-Action Model with Open-World Generalization","venue":"cs.LG","work_id":"d1ad7304-d09a-49bc-809e-846439f6aff9","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2504.16054","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:fdf4f28526a1703328054c64591e6a7e40dedee7758d721095edee01e3a7ed32","observation_id":"fce13e10-9a4d-4f86-b779-7059c554c9dd","resolution":{"observed_at":"2026-07-02T23:07:26.476673Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.3866","last_updated":"2014-05-15T14:41:06Z","snapshot_observed_at":"2026-08-02T11:57:23.843985Z","submitted_at":"2014-05-15T14:41:06Z","title":"Speeding up Convolutional Neural Networks with Low Rank Expansions","version":1},"cited_work":{"arxiv_id":"1405.3866","doi":null,"metadata_source":"pith","pith_arxiv_id":"1405.3866","snapshot_observed_at":"2026-07-02T22:57:26.748490Z","title":"Speeding up Convolutional Neural Networks with Low Rank Expansions","venue":"cs.CV","work_id":"7146e6fd-9e3b-4ade-a5f1-e2f7ea3929d9","year":2014},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/1405.3866","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:155d355ded51aadc4a7b81818a0f616decd8e644d11bb5164403cfec2625843b","observation_id":"3ac16a52-80b3-40fe-ad10-7de7ced2a15d","resolution":{"observed_at":"2026-07-02T22:57:26.749992Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"M., Bommarito, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:f6d9d735edba45a2d3ba9f5238af46fc571013468456fe9c11df550a35477eff","observation_id":"109b7f3e-de9c-4967-b633-ae68cb0bbef0","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.18451","last_updated":"2025-05-24T01:23:02Z","snapshot_observed_at":"2026-07-06T21:29:40.876235Z","submitted_at":"2025-05-24T01:23:02Z","title":"$\\mu$-MoE: Test-Time Pruning as Micro-Grained Mixture-of-Experts","version":1},"cited_work":{"arxiv_id":"2505.18451","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.18451","snapshot_observed_at":"2026-07-02T23:07:26.477842Z","title":"-moe: Test-time pruning as micro-grained mixture-of-experts","venue":null,"work_id":"28e2213c-7ec0-4aea-9252-080dcaec9676","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2505.18451","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:c21ceb4eb99cf2e9c703416d3527678c7d73d629e5bf33397c23d5ec71cda0d3","observation_id":"ac90eb9b-e415-47cc-8e6d-dc15263edfaf","resolution":{"observed_at":"2026-07-02T23:07:26.479351Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05431","last_updated":"2025-03-07T14:01:25Z","snapshot_observed_at":"2026-07-06T20:48:31.837669Z","submitted_at":"2025-03-07T14:01:25Z","title":"Quantum-PEFT: Ultra parameter-efficient fine-tuning","version":1},"cited_work":{"arxiv_id":"2503.05431","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.05431","snapshot_observed_at":"2026-07-02T23:07:26.491776Z","title":"Z., Candogan, L","venue":null,"work_id":"fe053419-8b8f-4153-82a8-ed1ed97fa022","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2503.05431","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:c3539a3984cedef56b88b800801dd6ac294bb65eda1d7561dde2cc491dd26f57","observation_id":"ed77df24-774b-4be4-b540-5b9579921fcc","resolution":{"observed_at":"2026-07-02T23:07:26.493147Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"P., and Brand, M","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:9957c0bd1e3d19ba52dc8e6055ada76a0f0915e59cdc09d9a5e10037436c9493","observation_id":"73a8ba03-dd22-41d4-abed-4246ccd9a78f","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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":"2603.19296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T23:07:26.451665Z","title":"TTQ : Activation-aware test-time quantization to accelerate LLM inference on the fly","venue":null,"work_id":"41ed5d71-59c0-4a71-b9b1-1433321a9fcb","year":2026},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:a822b0dc08501853069b1d165276aa89f637c98a590f0a61e7a6b6e39a6f2144","observation_id":"4a96e608-a837-4c21-85f2-63208606e294","resolution":{"observed_at":"2026-07-02T23:07:26.453424Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6553","last_updated":"2015-04-24T11:40:54Z","snapshot_observed_at":"2026-07-06T04:04:16.777653Z","submitted_at":"2014-12-19T23:02:43Z","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","version":3},"cited_work":{"arxiv_id":"1412.6553","doi":"10.48550/arxiv.1412.6553","metadata_source":"pith","pith_arxiv_id":"1412.6553","snapshot_observed_at":"2026-07-11T00:17:47.086538Z","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","venue":"cs.CV","work_id":"a2f11225-5437-4f66-a9c7-811e77abb657","year":2014},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/1412.6553","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:0b49cbec3cf6b0b6bd902aba8811ffd4700f95922d477149770bf61dd622eefa","observation_id":"7abe5dc3-dbc2-4278-b6d8-ee1696e6773e","resolution":{"observed_at":"2026-07-02T23:07:26.501585Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"Optimal brain damage","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:0e5cfeb75c5caad434a47da553ce48a26882f59d09468ba5388e7eeaa64bdd34","observation_id":"a3bfb80d-431b-44d3-876d-c78f3ea70b2d","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":null,"venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:133c8a8a09ff96a5b7cdee5c3cd3bf760957f8b581bd5da78abf0a9e613442e4","observation_id":"6baa49c1-0b34-472b-ab91-cb5e0a264004","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Reversible simulation of irreversible computation","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:831b628deeb8e4495aaee1f93405392fd8c3c229ea4f8238a501dab2e038078e","observation_id":"5b86c7f9-ef4b-418f-8f36-29f5bdf58d54","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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":"2604.00821","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T18:10:01.064816Z","title":"Optimal brain decomposition for accurate llm low-rank approximation","venue":null,"work_id":"d8c9802f-4398-4c3f-8c88-a54c9a42f882","year":2026},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:01caf00b9256f371919fb91d10ac05753376e7bc62bd780bea78708bc960f886","observation_id":"f0d7d801-4cbc-4576-b93b-ed301bfd1898","resolution":{"observed_at":"2026-07-02T23:07:26.463179Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15947","last_updated":"2024-12-23T08:05:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-29T08:13:40Z","title":"MoE-LLaVA: Mixture of Experts for Large Vision-Language Models","version":5},"cited_work":{"arxiv_id":"2401.15947","doi":"10.48550/arxiv:2401.15947","metadata_source":"pith","pith_arxiv_id":"2401.15947","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"MoE-LLaVA: Mixture of Experts for Large Vision-Language Models","venue":"cs.CV","work_id":"63cb47e5-f562-42d1-8877-63216e4c0af6","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2401.15947","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:e4b49c943a708d03da3c176e501981eb18dbd3632ff95b73249c1a57ed8067af","observation_id":"67682217-0106-450c-a1c4-ebadb7b96b9b","resolution":{"observed_at":"2026-07-02T23:07:26.481893Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00978","last_updated":"2026-04-25T06:58:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-01T17:59:10Z","title":"AWQ: Activation-aware Weight Quantization for LLM Compression and Acceleration","version":6},"cited_work":{"arxiv_id":"2306.00978","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.00978","snapshot_observed_at":"2026-07-10T11:17:03.640788Z","title":"AWQ: Activation-aware Weight Quantization for LLM Compression and Acceleration","venue":"cs.CL","work_id":"ea9d1d72-db24-4cae-8c89-4ecd83dd87c1","year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2306.00978","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:1d12a040cbc5d9538945f5ff296cd095c00b9540285e4b9d8fdbaf99636f5527","observation_id":"7622605c-7ca3-48f3-99a9-2e0d6f2658f2","resolution":{"observed_at":"2026-07-02T23:07:26.496015Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"AWQ : Activation-aware weight quantization for on-device LLM compression and acceleration","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d61d43b4a5d47702fa5abffdeab2272fe600912ebe56935fbbbc85096d6cceee","observation_id":"e42a57cf-b99b-4dfb-ac3c-68362ebe91cb","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":"2412.19437","doi":"10.1016/j.neucom.2023.127063.url:https://www.sciencedirect","metadata_source":"pith","pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"DeepSeek-V3 Technical Report","venue":"cs.CL","work_id":"57d2791d-2219-4c31-a077-afc04b12a75c","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:3d6350e1443111716527e32716313ff979eabb56b165c92c96c08c27521063e5","observation_id":"2c025af0-ad03-4445-bdda-522b59d218f3","resolution":{"observed_at":"2026-07-02T23:07:26.498634Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"LIBERO : Benchmarking knowledge transfer for lifelong robot learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:fa7876d544b6385e19c97f12968809b9111e36b3d8f91551c88dfb226dabf1e9","observation_id":"378a430a-ad46-4339-a715-2719c1f5c2a4","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"LoDA : Low-dimensional adaptation of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:1b0f2a49f95b8de37ecd7835150e6128ce8c8926d2625db7307bb6e85e0ba30b","observation_id":"55179f44-794b-4822-8daf-c6a720d3b8f1","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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":"2506.10205","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T23:07:26.489683Z","title":"AWP : Activation-aware weight pruning and quantization with projected gradient descent","venue":null,"work_id":"c0c0ad1e-09e3-4c60-b034-2ac601f2635a","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:7c1f479065fd23a85db932ff1ecca77816fcdd7613ae7ae01b5865e94ff9da64","observation_id":"da80c8a4-4740-4acf-bc72-68e6f73f133d","resolution":{"observed_at":"2026-07-02T23:07:26.491212Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"KIVI : A tuning-free asymmetric 2bit quantization for KV cache","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:da7e943f08c2ecdd98e9d4bbded12c050c01445c33e8715263a43abf0128a38f","observation_id":"4cdccfd4-0a5c-471b-9463-3655f567a0bd","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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":"2408.01534","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T22:57:26.740659Z","title":"An adaptive tensor-train decomposition approach for efficient deep neural network compression","venue":null,"work_id":"124ae435-d5b4-4e20-bf8a-75aae3178fa8","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:c8174f936486c74f15d98519ddd6a353a320d5f8b6539ba8ac4fc82c60a14fb1","observation_id":"af88bd37-7d57-4a76-aae9-3675eb2e69fe","resolution":{"observed_at":"2026-07-02T22:57:26.742193Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":null,"venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:6852e8d6cb60657e565d35ad20bdb87e1515fbea5aa2d35bc31ba4efaa6829a5","observation_id":"674194aa-263e-4c9d-9e9f-1cbf60a4c0cf","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.08665","last_updated":"2018-02-23T18:15:13Z","snapshot_observed_at":"2026-07-06T06:25:04.506480Z","submitted_at":"2018-02-23T18:15:13Z","title":"Learning Latent Permutations with Gumbel-Sinkhorn Networks","version":1},"cited_work":{"arxiv_id":"1802.08665","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.08665","snapshot_observed_at":"2026-07-02T23:07:26.484888Z","title":"Learning Latent Permutations with Gumbel-Sinkhorn Networks","venue":"stat.ML","work_id":"f24fe268-ea6b-408a-b42f-3598cbb8400c","year":2018},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/1802.08665","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:024af53d79732485893d94f0f1a94d9fe675411216718cdea44dadac2e5f262a","observation_id":"f68db4e2-79b5-451a-b106-0151d8732f91","resolution":{"observed_at":"2026-07-02T23:07:26.486184Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":"1609.07843","doi":"10.1007/978-3-030-62077-6","metadata_source":"pith","pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Pointer Sentinel Mixture Models","venue":"cs.CL","work_id":"fef3833e-dc80-42a3-a1e0-ffbfafee6fff","year":2016},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:fef26e74c7dab22f05125d9b5e6e99d12c15baca8512572be7b88d10a1f9f162","observation_id":"aaa9a989-072c-4098-8ca8-060c0682852a","resolution":{"observed_at":"2026-07-02T22:57:26.743435Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:737f855c9c74f765089272367d96c179dca43d0636d443541581884594afc4db","observation_id":"4e3b95e4-dd38-40a3-bd14-ec0e560833f4","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"A practical introduction to tensor networks: Matrix product states and projected entangled pair states","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:48f10caa8fdb06d45d406bef3f61d64abc6410d8baf9d32e3128ca80ceeef7b1","observation_id":"b13c633d-6b1b-443c-b298-fabc0725166d","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"PyTorch : An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:7b2824750df792f72f3c64e719ba53980ccbdb934d7a6e820e49c670953bf040","observation_id":"8d6e7697-12f6-47c2-a904-b4872a3f75b2","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"and Xie, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:ecaaa38c13ed27e7f8f518e48452cdd47f379b5f24949302e4f3c7604338bb8b","observation_id":"cfb548df-b16b-4f0f-b2a7-ba7905a174bc","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Stable low-rank tensor decomposition for compression of convolutional neural network","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:38b112c741256dccb6124df4706e3b4c00f0c80d43827883792d234d8498557d","observation_id":"283bb168-95db-4841-b860-4f731564def5","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"and Eisenschlos, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:cecaf539f60228a76e00c3ef09e441baf789b113c9c086580df87eda61dd1523","observation_id":"45e6475c-7a6b-4035-be17-6447c4770f6f","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.01330","last_updated":"2019-05-03T18:14:25Z","snapshot_observed_at":"2026-07-06T07:50:15.799069Z","submitted_at":"2019-05-03T18:14:25Z","title":"TensorNetwork: A Library for Physics and Machine Learning","version":1},"cited_work":{"arxiv_id":"1905.01330","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.01330","snapshot_observed_at":"2026-07-02T23:07:26.487403Z","title":"TensorNetwork: A Library for Physics and Machine Learning","venue":"physics.comp-ph","work_id":"33e8ec43-7a85-4e1f-8f6d-a2604ce0972f","year":2019},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/1905.01330","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:ca744842712bf5b9069689c912066b0710bcc61edcb3b68b8a589bf93a7fea0b","observation_id":"aa77a5ba-1c57-4405-84a0-357676e31975","resolution":{"observed_at":"2026-07-02T23:07:26.488616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"Compressing large language models using low rank and low precision decomposition","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d32675bf392ec3491b4690f5567c238b24c08ec030cccbeb76511650bf723253","observation_id":"19d67241-31ee-40e0-9922-e57b832a8c1d","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"N., Kingsbury, B., Sindhwani, V., Arisoy, E., and Ramabhadran, B","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d756800b4a0756d4e4a15d89572965ccce5c8906a8c933ca4325f0b4cf449d85","observation_id":"4810940a-1d02-46ba-9bcf-659ce0baf76c","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05646","last_updated":"2024-11-08T16:29:33Z","snapshot_observed_at":"2026-07-06T18:59:16.978029Z","submitted_at":"2024-08-10T22:47:12Z","title":"Eigen Attention: Attention in Low-Rank Space for KV Cache Compression","version":2},"cited_work":{"arxiv_id":"2408.05646","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.05646","snapshot_observed_at":"2026-07-02T22:57:26.739875Z","title":"Eigen attention: Attention in low-rank space for kv cache compression","venue":null,"work_id":"b3688659-ff88-450f-91b7-1e1897c12eee","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2408.05646","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d61f58c75841bb8c37161696902f099a602f61c92407a1ac09aac0dfd80b24a6","observation_id":"472b73db-3eda-4e47-80f7-92333d86dbe0","resolution":{"observed_at":"2026-07-02T22:57:26.741222Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"The density-matrix renormalization group in the age of matrix product states","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d048facb976bd0eaa2388ac2b36345f7f7badd4b27bad4cf2355ed8f2348bd3b","observation_id":"3f35e383-3266-4f63-94ee-0a500648deb7","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"A., and Etzioni, O","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:e2c98c2f9aa0fcc3ac331c40aaf7e2404adb24b44efe3b885aea0b5cccadac62","observation_id":"55798516-69b5-486a-8e04-1bbe669bb4a8","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d977e797aacba8ae755853480ab22aafe237044daf51d823b51fc04a89e334a3","observation_id":"c1ebc294-1edb-49d9-ae6b-5b6f570a608a","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Towards VQA models that can read","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:49fd073592fb9eb7aed88260c34be40665438a7f29bcf0d437cea821b82d38dd","observation_id":"95920561-c0e0-4e20-87e1-f82456a61f67","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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":"2604.02119","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T22:57:26.737933Z","title":"Aa-svd: Anchored and adaptive svd for large language model compression","venue":null,"work_id":"f6169377-d576-48fd-97b7-2aa4e97d8541","year":2026},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:aee62b3b8daff3a8ecd3c5af9b64ecdede6997d67b47296c66e0a3e2b60304f9","observation_id":"91141da7-35c9-49be-b8ec-71b91a1c78bb","resolution":{"observed_at":"2026-07-02T22:57:26.739435Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.10098","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T22:56:37.617412Z","title":"Vla-jepa: Enhancing vision-language-action model with latent world model","venue":null,"work_id":"32706181-717a-461d-87e8-271938e76e0b","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:28f5d4db57ac63e824840d4284a6440e415ae121e92e9fc8b0f2c9914cb858eb","observation_id":"5c3a4168-0b53-4560-9418-b5ed39ddbed4","resolution":{"observed_at":"2026-07-02T22:57:26.738697Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11695","last_updated":"2024-05-06T17:47:01Z","snapshot_observed_at":"2026-07-06T15:44:42.776459Z","submitted_at":"2023-06-20T17:18:20Z","title":"A Simple and Effective Pruning Approach for Large Language Models","version":3},"cited_work":{"arxiv_id":"2306.11695","doi":"10.48550/arxiv.2306.11695","metadata_source":"pith","pith_arxiv_id":"2306.11695","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"A Simple and Effective Pruning Approach for Large Language Models","venue":"cs.CL","work_id":"e764df7f-c928-4b41-812e-352750f475c2","year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:63c521785720e235f574dc3c81c430dcf8811d5047def9f21fcd5c369717314d","observation_id":"20077609-0ed0-4ba9-840d-b947522cc23d","resolution":{"observed_at":"2026-07-02T22:57:26.733917Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:e9aeda3652c51086738e4fe850c1411b8e6a0b5a081a40564a71373ba0ff8857","observation_id":"61e3f397-6300-4ba1-bee9-598e9dadd3f2","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08295","last_updated":"2024-04-16T12:52:47Z","snapshot_observed_at":"2026-08-03T03:29:01.959523Z","submitted_at":"2024-03-13T06:59:16Z","title":"Gemma: Open Models Based on Gemini Research and Technology","version":4},"cited_work":{"arxiv_id":"2403.08295","doi":"10.48550/arxiv.2403.08295","metadata_source":"pith","pith_arxiv_id":"2403.08295","snapshot_observed_at":"2026-07-10T23:07:48.332027Z","title":"Gemma: Open Models Based on Gemini Research and Technology","venue":"cs.CL","work_id":"a9ea2870-df28-40b8-a9e0-a7e9a116f793","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2403.08295","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:1436ae9e00607ff7c9803873975ab4c9ba4450b8cc38db0259efb92e17dd0858","observation_id":"51276c5f-b61e-40cb-9766-1df10be6bfe8","resolution":{"observed_at":"2026-07-02T22:57:26.725749Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"Class of quantum many-body states that can be efficiently simulated","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:16d695ecaabafcc4766bb0b14e9acf87d4d9be5e2ed00d2195d70d03f4ee4235","observation_id":"7be8b308-817d-4f42-b261-e37754e67988","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08119","last_updated":"2025-02-24T01:36:56Z","snapshot_observed_at":"2026-07-06T19:31:18.802964Z","submitted_at":"2024-10-10T17:02:48Z","title":"Q-VLM: Post-training Quantization for Large Vision-Language Models","version":3},"cited_work":{"arxiv_id":"2410.08119","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08119","snapshot_observed_at":"2026-07-02T22:57:26.724266Z","title":"Q-vlm: Post- training quantization for large vision-language models.arXiv preprint arXiv:2410.08119, 2024a","venue":null,"work_id":"52d79b7a-631e-464d-a35c-12052b12f3cf","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2410.08119","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:c377ebba186ecf80fb9baa6a1f89c795c07b82f7aa767a79abcadc39c87d6967","observation_id":"c570f93a-ff93-4205-b5e8-9e5136aecba5","resolution":{"observed_at":"2026-07-02T22:57:26.725735Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07378","last_updated":"2025-03-16T03:27:33Z","snapshot_observed_at":"2026-07-06T17:43:05.793351Z","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":"2403.07378","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.07378","snapshot_observed_at":"2026-07-04T03:19:31.562858Z","title":"Svd-llm: Truncation-aware singular value decomposition for large language model compression.arXiv preprint arXiv:2403.07378","venue":null,"work_id":"ee21cc0a-025b-448d-a40a-fe1ad4345d29","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2403.07378","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:235924b401616188051fa6a4c74146a5f9aeb859a744bca61fcfafe553ae92e2","observation_id":"1d2cbcff-3302-4991-901b-2baa81d54828","resolution":{"observed_at":"2026-07-02T22:57:26.723076Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.09755","last_updated":"2024-08-12T17:57:00Z","snapshot_observed_at":"2026-07-06T16:48:29.239105Z","submitted_at":"2023-11-16T10:30:00Z","title":"On the Impact of Calibration Data in Post-training Quantization and Pruning","version":2},"cited_work":{"arxiv_id":"2311.09755","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.09755","snapshot_observed_at":"2026-07-02T22:57:26.718837Z","title":"On the impact of calibration data in post-training quantization and pruning","venue":null,"work_id":"7a480d08-5363-44f4-a1dd-161feb97f2a4","year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2311.09755","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:c754a9028c343ab42530c88dc41c443f53e6aaae85721e46a6b40f8369bd05d1","observation_id":"466a9892-4fec-4c28-9ee8-b7668b1a24f9","resolution":{"observed_at":"2026-07-02T22:57:26.720144Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":"1910.03771","doi":"10.48550/arxiv.1910.03771","metadata_source":"pith","pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-07-11T03:57:46.849092Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","venue":"cs.CL","work_id":"9d86da8d-01d3-41af-a0d2-ee14897927a9","year":2019},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:39a820b4690a6bdb5084613915fde77bfb0b095d5dcdc9d6ae208922f8de0a17","observation_id":"6314ee24-c072-4681-a60a-67d224ea1ed0","resolution":{"observed_at":"2026-07-02T22:57:26.711757Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"Florence-2: Advancing a unified representation for a variety of vision tasks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:37a2564c1dd1ac3c10213eb5bc96e5a1f00ad9211158ef66174f95fa3154f905","observation_id":"0f9b99ab-cadd-4453-b0c0-0b65a7d6874b","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Efficient streaming language models with attention sinks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:bda83e759ab1fc01f4c48fa78ef61ae1d699fc18d87d319b054a58c8a454a4bb","observation_id":"7baac66f-8b2a-43b9-aae5-84dde15a449e","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"and McAuley, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:60b680bb80be9041d0546bc4d4a8c646678804b7a0c350009607b7de69591fa4","observation_id":"4a9dc2cb-c69b-4cc1-9825-21a035cf27c5","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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":"2505.24357","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T22:57:26.713027Z","title":"Recalkv: Low-rank kv cache compression via head reordering and offline calibra- tion","venue":null,"work_id":"f4d4ecc7-db21-4d34-ac1b-d3c88d7fbcbc","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:7be62d8033b9443626d1cdb785c1e042485c2f9433e76a056d9f902c3be524c0","observation_id":"17a8f0d4-4269-4648-bfdb-1a72d06fd38e","resolution":{"observed_at":"2026-07-02T22:57:26.714699Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:1d3a7b2e3fe1b674cd63d7341b2ad63b0c4e5a0e1098fbf88105294d4cfde982","observation_id":"19356b44-6f10-4d08-957d-8dbe3fb4392e","resolution":{"observed_at":"2026-07-02T22:57:26.747260Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:be7941b8df54f701d98a549229d3a6ecd52bc98bbfcee458527d7592b35b0132","observation_id":"97192a9f-e52b-4d9e-b05c-59033acfac75","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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":"2312.05821","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.05821","snapshot_observed_at":"2026-07-10T02:06:42.147921Z","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","venue":"cs.CL","work_id":"fd990065-5054-4270-85c7-76af94bddb15","year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2312.05821","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:5dec2a69ab2007bb7df34596c7473eaf8146065637568ec21ec0bcfbaa5e5cd3","observation_id":"98c43428-ba5b-4a06-a00f-1ef469dde7ff","resolution":{"observed_at":"2026-07-02T22:57:26.709145Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16363","last_updated":"2024-05-01T20:42:28Z","snapshot_observed_at":"2026-08-01T22:52:35.092898Z","submitted_at":"2024-02-26T07:33:05Z","title":"LLM Inference Unveiled: Survey and Roofline Model Insights","version":6},"cited_work":{"arxiv_id":"2402.16363","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.16363","snapshot_observed_at":"2026-07-11T01:57:51.001945Z","title":"Llm inference unveiled: Survey and roofline model insights","venue":"cs.CL","work_id":"ab1b1623-49b9-406b-9b4a-f5de11424e01","year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"cited_paper":"/paper/2402.16363","citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:083554a52fe3708e3959096ea061b74b59936f0779129e801ed83a623dbdffd7","observation_id":"5bb01164-4430-424f-8618-806e1500196c","resolution":{"observed_at":"2026-07-02T22:57:26.711487Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-27T18:31:01.804061Z","title":"R., and Smola, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:85989d87bef377d2badb9d36c57c5db90b7a3981a35b77c7f71f334292ac1526","observation_id":"3420d640-d087-426c-81ca-b9aca2433c85","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"QJL : 1-bit quantized JL transform for KV cache quantization with zero overhead, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:065293b7c9cf50e0ab37cc296235115af3b8a7e5f000ffd375ae6369d5e6b1d6","observation_id":"de5e722f-3df1-402e-94d0-694d33cd6d17","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Turboquant: Online vector quantization with near-optimal distortion rate","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:d660ee55595edc056ba887e916b43daabccd9a57e8fffc7dae813af8f176ed92","observation_id":"f5361667-34e7-474b-895f-1093ea658822","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Sigmoid loss for language image pre-training","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:ed14c660c094819b8e7064880eeff2cde026c575c0b22274933989ae2db10cb2","observation_id":"6fad41bb-ab1f-4b78-8890-b06779dd9047","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"Lo RC : Low-rank compression for LLM s KV cache with a progressive compression strategy, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:b354271e80f264a80deb944a380fad77d7cda9b709ef70d0b0e2442308a84204","observation_id":"ca1e1377-2758-4419-8d21-f5950428660c","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","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-06-27T18:31:01.804061Z","title":"A., and Chen, B","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-06-27T18:31:01.804061Z"},"links":{"citing_paper":"/paper/2606.08565"},"observation_digest":"sha256:0a72badc147b079bba00062693283c3fb2ffe1228918f70bb44195faa2ea1073","observation_id":"61cfc00c-2e28-459a-bfb6-27d6b3b2f609","resolution":{"observed_at":"2026-06-27T18:31:01.804061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.08565","last_updated":"2026-06-07T10:43:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:48:02.118629Z","submitted_at":"2026-06-07T10:43:30Z","title":"EinSort: Sorting is All We Need for Tensorizing LLM"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":52,"verified_exact":45,"verified_fuzzy":0},"total_outbound_references":103},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 100 of 103 outbound references and 0 inbound Pith citation observations for arXiv:2606.08565."}