{"as_of":"2026-08-11T15:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21d2a647fe6e45ac64143c80b268680d8e88946827705caa060a70500619a1a7","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:26:24.252992Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T17:52:28.021295Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T16:28:38.352564Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16719","snapshot_observed_at":"2026-08-05T17:52:28.021295Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.16680","last_updated":"2025-08-26T02:14:41Z","snapshot_observed_at":"2026-08-10T15:15:26.906793Z","submitted_at":"2025-08-21T13:16:02Z","title":"CALR: Corrective Adaptive Low-Rank Decomposition for Efficient Large Language Model Layer Compression","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T17:52:28.021295Z"},"links":{"cited_paper":"/paper/2412.16719","citing_paper":"/paper/2508.16680"},"observation_digest":"sha256:5277df69e4e1501e29c8219135746b1ae579fcf30e9d8f6d65381301a9e0a59e","observation_id":"99e1a964-ed56-4143-9af6-4b60f69254f0","resolution":{"observed_at":"2026-08-05T17:52:28.021295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"cited_work":{"arxiv_id":"2412.16719","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.16719","snapshot_observed_at":"2026-07-03T16:28:38.352564Z","title":"arXiv preprint arXiv:2412.16719 (2024)","venue":null,"work_id":"f0da9233-e73f-4795-8c8c-ab4efdc9c12f","year":2024},"citing_paper":{"arxiv_id":"2607.01851","last_updated":"2026-07-02T08:11:32Z","snapshot_observed_at":"2026-07-07T00:07:23.664493Z","submitted_at":"2026-07-02T08:11:32Z","title":"Geometric Foundation Model Distillation for Efficient Lunar 3D Reconstruction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-03T16:22:40.396646Z"},"links":{"cited_paper":"/paper/2412.16719","citing_paper":"/paper/2607.01851"},"observation_digest":"sha256:744b66a8cd13a3cc9a4989e34876fea2dcb7cdadc4d3f34f0561c4a764d6742c","observation_id":"1236c6d1-d384-4426-860f-473f0c2d39ee","resolution":{"observed_at":"2026-07-03T16:28:38.353831Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.16719/citation-record","integrity":"/paper/2412.16719/integrity","json":"/paper/2412.16719/citation-record.json","paper":"/paper/2412.16719"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.03368","last_updated":"2025-01-23T17:57:28Z","snapshot_observed_at":"2026-08-08T14:58:02.421377Z","submitted_at":"2024-06-05T15:23:08Z","title":"IrokoBench: A New Benchmark for African Languages in the Age of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03368","snapshot_observed_at":"2026-08-11T10:26:24.044838Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.044838Z"},"links":{"cited_paper":"/paper/2406.03368","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:8abec5374484bbf05362e0419ee3bcde85bb53862843daa17e087bde994d836d","observation_id":"6b53e45d-ac5f-4757-b2b9-8e4a3bae0ff2","resolution":{"observed_at":"2026-08-11T10:26:24.044838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13255","last_updated":"2020-12-22T07:42:30Z","snapshot_observed_at":"2026-08-11T03:48:13.950835Z","submitted_at":"2020-12-22T07:42:30Z","title":"Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13255","snapshot_observed_at":"2026-08-11T10:26:24.050638Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.050638Z"},"links":{"cited_paper":"/paper/2012.13255","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:7840d08bb24595ef7cf4a87d2313de5a1070570e82820b9a74b8bb3816e1708e","observation_id":"37da83b9-e8e6-4cc8-8e3c-ac4fd0e7de79","resolution":{"observed_at":"2026-08-11T10:26:24.050638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15024","last_updated":"2024-02-09T17:59:40Z","snapshot_observed_at":"2026-07-06T17:21:01.918787Z","submitted_at":"2024-01-26T17:35:45Z","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15024","snapshot_observed_at":"2026-08-11T10:26:24.055963Z","title":"Croci, Marcelo Gennari do Nascimento, Torsten Hoefler, and James Hensman","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.055963Z"},"links":{"cited_paper":"/paper/2401.15024","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:70f5e03f37ef2c5a4d1f1cf3f856bb36889ddd7f198768dbb8a3110b23ff8902","observation_id":"4e3ab15d-261c-4214-ba29-c6b95abd4e0b","resolution":{"observed_at":"2026-08-11T10:26:24.055963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.11477","last_updated":"2020-10-22T06:09:10Z","snapshot_observed_at":"2026-08-07T05:13:16.889179Z","submitted_at":"2020-06-20T02:35:02Z","title":"wav2vec 2.0: A Framework for Self-Supervised Learning of Speech Representations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.11477","snapshot_observed_at":"2026-08-11T10:26:24.060943Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.060943Z"},"links":{"cited_paper":"/paper/2006.11477","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:ab379992743b582ba817afd30e8a992ca1316f39c9ebf5420cef9a09419711b5","observation_id":"ef25bc43-cce1-4cdc-8a9f-66061ac8d43c","resolution":{"observed_at":"2026-08-11T10:26:24.060943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.065833Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.065833Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:ae62b8dc5f3c6f92cbbb4843b175a81cbc503147e4e3969c3daf14af1de39c91","observation_id":"8484a671-19ad-490a-ade8-d17ba33096a1","resolution":{"observed_at":"2026-08-11T10:26:24.065833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.01900","last_updated":"2022-04-28T02:13:09Z","snapshot_observed_at":"2026-08-11T10:00:42.821288Z","submitted_at":"2021-10-05T09:34:44Z","title":"DistilHuBERT: Speech Representation Learning by Layer-wise Distillation of Hidden-unit BERT","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.01900","snapshot_observed_at":"2026-08-11T10:26:24.070933Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.070933Z"},"links":{"cited_paper":"/paper/2110.01900","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:50b9cbb5b504f49b786959bdab0e6c92ef075441e4e88dacd41b153a5e61edbc","observation_id":"7e9ca3c4-ff7b-4102-b790-847b83f0dd24","resolution":{"observed_at":"2026-08-11T10:26:24.070933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04590","last_updated":"2021-10-09T15:06:09Z","snapshot_observed_at":"2026-08-05T05:35:24.064263Z","submitted_at":"2021-10-09T15:06:09Z","title":"An Exploration of Self-Supervised Pretrained Representations for End-to-End Speech Recognition","version":1},"cited_work":{"arxiv_id":"2110.04590","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.04590","snapshot_observed_at":"2026-08-11T10:26:24.769587Z","title":"An Exploration of Self-Supervised Pretrained Representations for End-to-End Speech Recognition","venue":"cs.CL","work_id":"c38b38c7-74e2-473f-8fe1-9db8b4551b94","year":2021},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.076210Z"},"links":{"cited_paper":"/paper/2110.04590","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:8ca07ca636d889703a15cb852a386f573feb0730261b650ff65350914579d874","observation_id":"b40f2482-4bda-4b6a-8c41-483e4c4bc37f","resolution":{"observed_at":"2026-08-11T10:26:24.774810Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.929817Z","title":null,"venue":null,"work_id":"d4c4d507-7630-4c7a-bba2-318707491bc7","year":2021},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.080594Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:b88db460a7ec416c8ef4b9f6e5f6f131763879552428ee8cdda7800c0c19f73c","observation_id":"a0fa9e57-3d4d-4dd0-8d3a-d87d288ea43f","resolution":{"observed_at":"2026-08-11T10:26:24.934330Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-11T10:26:24.084702Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.084702Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:80bfa30a359a85244c9e0504fa6481a40fed3ab2dfdd3b43078d15f3d8ad860b","observation_id":"d28cced4-5b82-49bc-9cdf-2cbb89484079","resolution":{"observed_at":"2026-08-11T10:26:24.084702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-11T10:26:24.089671Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.089671Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:30c62ac3ac2f29b0ed04cd29d250aa96d9c9a258cec271cd41612c3ec0dd8845","observation_id":"bffa6d21-c664-4df8-b6c5-a488bf8ee690","resolution":{"observed_at":"2026-08-11T10:26:24.089671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.094426Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.094426Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:ff7fefd41181aebbf682354be8322d2082bcc4b3c930990e04b80ef1afd37bc7","observation_id":"afccfa1f-6121-4291-95c3-6cf628420ae5","resolution":{"observed_at":"2026-08-11T10:26:24.094426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12446","last_updated":"2022-05-25T02:29:03Z","snapshot_observed_at":"2026-07-06T13:13:37.143547Z","submitted_at":"2022-05-25T02:29:03Z","title":"FLEURS: Few-shot Learning Evaluation of Universal Representations of Speech","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12446","snapshot_observed_at":"2026-08-11T10:26:24.098338Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.098338Z"},"links":{"cited_paper":"/paper/2205.12446","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:0f2b480cad06453537e9207a716cf9a3628dcaa3f0410b30cf2eddde444ea57d","observation_id":"3bfd18b1-a982-4c03-8cf9-2d6629c0ef05","resolution":{"observed_at":"2026-08-11T10:26:24.098338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03635","last_updated":"2019-03-04T15:51:11Z","snapshot_observed_at":"2026-08-05T23:54:27.386622Z","submitted_at":"2018-03-09T18:51:28Z","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03635","snapshot_observed_at":"2026-08-11T10:26:24.101781Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.101781Z"},"links":{"cited_paper":"/paper/1803.03635","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:aa32b32b8cd32164fcc4cf220107b7a369374ec332db6561c24a35b39e3591af","observation_id":"984b819f-adab-436d-b44f-e8ab16c88783","resolution":{"observed_at":"2026-08-11T10:26:24.101781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00774","last_updated":"2023-03-22T12:33:46Z","snapshot_observed_at":"2026-08-11T05:33:50.033336Z","submitted_at":"2023-01-02T17:48:56Z","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00774","snapshot_observed_at":"2026-08-11T10:26:24.105803Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.105803Z"},"links":{"cited_paper":"/paper/2301.00774","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:b15b3e5ef46be8bfa9a09d0c639a755aacfaccac257f22709e553d39121055f2","observation_id":"ebd7716e-12b8-4022-9342-45a7933d0712","resolution":{"observed_at":"2026-08-11T10:26:24.105803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.110293Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.110293Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:aba2a2cfa7264391e07dfae930960ba163bbe3c8c6c15f04eec50b92ebaa6f7f","observation_id":"45b99976-9fc8-49fd-9cec-cf42ffb136c1","resolution":{"observed_at":"2026-08-11T10:26:24.110293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00752","last_updated":"2024-05-31T17:55:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-01T18:01:34Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00752","snapshot_observed_at":"2026-08-11T10:26:24.114066Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.114066Z"},"links":{"cited_paper":"/paper/2312.00752","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:48ad37cec64531ede8332dcec98870e13fd1c6c4a3d62ef70a1a299f92ba16d2","observation_id":"e40804ab-be81-41de-b6be-9fa89f766d00","resolution":{"observed_at":"2026-08-11T10:26:24.114066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02626","last_updated":"2015-10-30T23:29:27Z","snapshot_observed_at":"2026-07-06T04:20:15.965140Z","submitted_at":"2015-06-08T19:28:43Z","title":"Learning both Weights and Connections for Efficient Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.02626","snapshot_observed_at":"2026-08-11T10:26:24.118146Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.118146Z"},"links":{"cited_paper":"/paper/1506.02626","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:6791739b15819ef5aa3590a1a0e4ec70e8dfca29915b27da75f2878c3e563ec7","observation_id":"dcdccc0e-cf08-4e9c-9b00-7e839719f82a","resolution":{"observed_at":"2026-08-11T10:26:24.118146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-11T10:26:24.122005Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.122005Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:f2992152ce72b01c1a1987af9966018fb28cedec75fe4a1a2057de8b8bd83865","observation_id":"416f6502-d868-4849-ae2f-073fb096c449","resolution":{"observed_at":"2026-08-11T10:26:24.122005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04088","last_updated":"2024-01-08T18:47:34Z","snapshot_observed_at":"2026-08-08T06:16:25.839566Z","submitted_at":"2024-01-08T18:47:34Z","title":"Mixtral of Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04088","snapshot_observed_at":"2026-08-11T10:26:24.126073Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.126073Z"},"links":{"cited_paper":"/paper/2401.04088","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:1e0e868d1ed46f5098508e6345606b115656c0777c149d9dfc97aad3321abafa","observation_id":"0df1a709-64e7-485d-abef-b7ae98866347","resolution":{"observed_at":"2026-08-11T10:26:24.126073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.10351","last_updated":"2020-10-16T02:12:46Z","snapshot_observed_at":"2026-08-10T14:27:02.964369Z","submitted_at":"2019-09-23T13:05:35Z","title":"TinyBERT: Distilling BERT for Natural Language Understanding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.10351","snapshot_observed_at":"2026-08-11T10:26:24.130171Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.130171Z"},"links":{"cited_paper":"/paper/1909.10351","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:b7874bc3e9087e17f507ce954a094ed9ffbb5425dc184725094a1d3ee5b20b7d","observation_id":"060bb882-f14d-4fa5-a5ee-2478dd185746","resolution":{"observed_at":"2026-08-11T10:26:24.130171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10369","last_updated":"2021-06-24T21:46:03Z","snapshot_observed_at":"2026-07-06T09:30:20.579973Z","submitted_at":"2020-06-18T09:06:49Z","title":"Deep Encoder, Shallow Decoder: Reevaluating Non-autoregressive Machine Translation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10369","snapshot_observed_at":"2026-08-11T10:26:24.134537Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.134537Z"},"links":{"cited_paper":"/paper/2006.10369","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:e51b1d58e4fc7947d3419f288b0bcb646d2e5de67ac0ae8e6c85383734a5e53c","observation_id":"574eacbe-1308-4096-9422-2e87f85bb009","resolution":{"observed_at":"2026-08-11T10:26:24.134537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.14021","last_updated":"2023-09-25T10:35:17Z","snapshot_observed_at":"2026-08-10T19:34:29.137928Z","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.14021","snapshot_observed_at":"2026-08-11T10:26:24.138836Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.138836Z"},"links":{"cited_paper":"/paper/2309.14021","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:81ba1bf34187f08f39c3ce58ecbd71401812d99d380cc51be7903766092cc625","observation_id":"47bee165-44dc-40cd-879d-477d565c9810","resolution":{"observed_at":"2026-08-11T10:26:24.138836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.143204Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.143204Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:8a5d2a81b53cd27d8d3986b64260370619de583d17320df6c01ceffb8306fdc6","observation_id":"a5706c22-007b-4858-9a7e-b88b9ce6cc75","resolution":{"observed_at":"2026-08-11T10:26:24.143204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.08838","last_updated":"2018-04-24T04:29:10Z","snapshot_observed_at":"2026-08-06T23:47:57.134059Z","submitted_at":"2018-04-24T04:29:10Z","title":"Measuring the Intrinsic Dimension of Objective Landscapes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.08838","snapshot_observed_at":"2026-08-11T10:26:24.147178Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.147178Z"},"links":{"cited_paper":"/paper/1804.08838","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:090a6e8c8ee339ed3aacdc12fb3ada248fcc06511d8c0b5dad69e7dce5ac8dc9","observation_id":"cac0bc13-1d7d-4e18-a9b5-3d343cf07a66","resolution":{"observed_at":"2026-08-11T10:26:24.147178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.899553Z","title":null,"venue":null,"work_id":"b7376af5-8703-4fb1-8fcf-66f60efa6c2b","year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.151295Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:6a5bc42cce16889e2aab7b1ea3049a9bbd7ea161202aeef924497ab94f224771","observation_id":"52ebe917-8c81-4805-9a52-1983cd2e381b","resolution":{"observed_at":"2026-08-11T10:26:24.903969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.155360Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.155360Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:8b33a25647dc115a3e1ded03cbf37043e9e97dda20c9c1d0aaf25f47c50df573","observation_id":"e18e9bf0-fdd1-4e36-8a55-0f9b58e01f68","resolution":{"observed_at":"2026-08-11T10:26:24.155360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14690","last_updated":"2025-02-25T21:00:50Z","snapshot_observed_at":"2026-07-06T19:06:19.400102Z","submitted_at":"2024-08-26T23:30:15Z","title":"Training-Free Activation Sparsity in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14690","snapshot_observed_at":"2026-08-11T10:26:24.161217Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.161217Z"},"links":{"cited_paper":"/paper/2408.14690","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:3336cd444354e29b0dd2301ad31fc0b1f12cddfe3c21aae312aaa195fed90e7d","observation_id":"ea868a50-58ce-4fff-8c14-b5b99ff10258","resolution":{"observed_at":"2026-08-11T10:26:24.161217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08124","last_updated":"2020-07-16T05:52:16Z","snapshot_observed_at":"2026-08-10T13:06:17.421919Z","submitted_at":"2020-07-16T05:52:16Z","title":"LogiQA: A Challenge Dataset for Machine Reading Comprehension with Logical Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08124","snapshot_observed_at":"2026-08-11T10:26:24.165131Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.165131Z"},"links":{"cited_paper":"/paper/2007.08124","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:614d9f8c8e7f2dc1cce6c5c742194e26779c30bf461fee88a489a869fdf8a8f4","observation_id":"1a163055-0678-4c2a-acef-4dfba9e49238","resolution":{"observed_at":"2026-08-11T10:26:24.165131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11627","last_updated":"2023-09-28T03:59:27Z","snapshot_observed_at":"2026-07-06T15:29:39.466936Z","submitted_at":"2023-05-19T12:10:53Z","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.11627","snapshot_observed_at":"2026-08-11T10:26:24.169507Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.169507Z"},"links":{"cited_paper":"/paper/2305.11627","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:964264c31b65280945a6ea31036088fe2cc6ebcbf2588780a59de610fe231371","observation_id":"e60199ea-8d5f-4fc7-8fe5-06043e3c6b3d","resolution":{"observed_at":"2026-08-11T10:26:24.169507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.173463Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.173463Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:0bd8c782b1f1bc72a6e4afa2382731e4dcbf0c8f924528cde6fb8ce20f1c0517","observation_id":"125e4697-6d9e-4f9a-84c4-ed81fb0a71d5","resolution":{"observed_at":"2026-08-11T10:26:24.173463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02707","last_updated":"2023-06-05T08:58:39Z","snapshot_observed_at":"2026-08-09T03:29:22.849759Z","submitted_at":"2023-06-05T08:58:39Z","title":"Orca: Progressive Learning from Complex Explanation Traces of GPT-4","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02707","snapshot_observed_at":"2026-08-11T10:26:24.177356Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.177356Z"},"links":{"cited_paper":"/paper/2306.02707","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:5322b2a7bbbc61184a41257a45a947d169eb96e6913196cfbdd3b56f4d580a4c","observation_id":"607218d8-2ac0-4ba6-974a-13e5c4a6c976","resolution":{"observed_at":"2026-08-11T10:26:24.177356Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.181796Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.181796Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:4f4760289adc428f809aa020bd207446b55edbc4992630108e8db30851119831","observation_id":"3efcd23e-6ae3-4cd4-a8fd-f862d512573a","resolution":{"observed_at":"2026-08-11T10:26:24.181796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.04734","last_updated":"2022-12-03T07:04:55Z","snapshot_observed_at":"2026-07-06T11:27:50.581243Z","submitted_at":"2021-07-10T02:13:25Z","title":"Layer-wise Analysis of a Self-supervised Speech Representation Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.04734","snapshot_observed_at":"2026-08-11T10:26:24.185821Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.185821Z"},"links":{"cited_paper":"/paper/2107.04734","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:ae7fbec33ec420437dbc0a3bb56d37004b457120081042016934018560f1d0e2","observation_id":"47f3be31-1468-4de6-ac7a-da54d05cd4dd","resolution":{"observed_at":"2026-08-11T10:26:24.185821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04356","last_updated":"2022-12-06T18:46:04Z","snapshot_observed_at":"2026-07-06T14:28:21.844826Z","submitted_at":"2022-12-06T18:46:04Z","title":"Robust Speech Recognition via Large-Scale Weak Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.04356","snapshot_observed_at":"2026-08-11T10:26:24.189520Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.189520Z"},"links":{"cited_paper":"/paper/2212.04356","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:4ed383375cac13e26862c472ff3d888ccebccaaf44c1d337dda0eebc00882fd7","observation_id":"3e3405c8-dac3-44d8-af36-82f47c4dd7b6","resolution":{"observed_at":"2026-08-11T10:26:24.189520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10641","last_updated":"2019-11-21T19:01:32Z","snapshot_observed_at":"2026-07-06T08:09:59.842324Z","submitted_at":"2019-07-24T18:11:59Z","title":"WinoGrande: An Adversarial Winograd Schema Challenge at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10641","snapshot_observed_at":"2026-08-11T10:26:24.194043Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.194043Z"},"links":{"cited_paper":"/paper/1907.10641","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:1f3dbd24e7f653237012e154b77e281e4fe11a881a5cb2e4bce5e54c71ff69a4","observation_id":"8ce199a4-ae31-4bdc-998a-bb6ec0723051","resolution":{"observed_at":"2026-08-11T10:26:24.194043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.877858Z","title":null,"venue":null,"work_id":"7453c1bc-132b-412d-9830-bd9dab65d3c5","year":2019},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.198680Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:5aefee2950f892dada69bd6a0552800a49401b76a4d025ceae31d9d41faef028","observation_id":"cdff7f64-d0ba-475d-843e-f7267e22eab3","resolution":{"observed_at":"2026-08-11T10:26:24.881589Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06619","last_updated":"2024-02-09T18:51:49Z","snapshot_observed_at":"2026-07-06T17:28:06.332906Z","submitted_at":"2024-02-09T18:51:49Z","title":"Aya Dataset: An Open-Access Collection for Multilingual Instruction Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06619","snapshot_observed_at":"2026-08-11T10:26:24.202456Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.202456Z"},"links":{"cited_paper":"/paper/2402.06619","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:8fd0cdb4b7f591808bb1699448c5d32ac4f1b26c48c508c636e34361b75d880b","observation_id":"17c49f9d-60ad-4a57-a3a9-44e8b362796e","resolution":{"observed_at":"2026-08-11T10:26:24.202456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11796","last_updated":"2024-12-09T18:31:01Z","snapshot_observed_at":"2026-08-07T10:56:20.468878Z","submitted_at":"2024-08-21T17:38:48Z","title":"LLM Pruning and Distillation in Practice: The Minitron Approach","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11796","snapshot_observed_at":"2026-08-11T10:26:24.208421Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.208421Z"},"links":{"cited_paper":"/paper/2408.11796","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:e192dee9916176ef249ed4ef559bc4b0d06fdce9db35fe2f0bc965a028add034","observation_id":"e44a0d85-3cd9-499f-ba50-cc6b26cc568e","resolution":{"observed_at":"2026-08-11T10:26:24.208421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11695","snapshot_observed_at":"2026-08-11T10:26:24.213170Z","title":"Zico Kolter","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.213170Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:4b3e782c4aa0bacebe026f5bbf7fbfef6e4c63d7c46da1d04c757ab3dab630e4","observation_id":"2ae3332f-6561-486f-889a-e5f49b7435a6","resolution":{"observed_at":"2026-08-11T10:26:24.213170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-11T10:26:24.217699Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.217699Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:53cedd8ef2ac5645e1658e9856bb07518f17b3ab6a60f7629fe8a86cbd1cbd40","observation_id":"a923e43f-ee3f-473b-b451-d782c2ff3c05","resolution":{"observed_at":"2026-08-11T10:26:24.217699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16840","last_updated":"2024-02-26T18:59:03Z","snapshot_observed_at":"2026-07-06T17:35:41.168780Z","submitted_at":"2024-02-26T18:59:03Z","title":"MobiLlama: Towards Accurate and Lightweight Fully Transparent GPT","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16840","snapshot_observed_at":"2026-08-11T10:26:24.222418Z","title":"Xing, and Fahad Shahbaz Khan","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.222418Z"},"links":{"cited_paper":"/paper/2402.16840","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:e0ba59cbd7b849096ec6e29ea74ae72bd4e523a5ef04c4fad9901465aaf4e99c","observation_id":"bdcb9637-4613-47f9-add7-4cfb9dcc701b","resolution":{"observed_at":"2026-08-11T10:26:24.222418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.17024","last_updated":"2024-09-03T13:55:01Z","snapshot_observed_at":"2026-08-11T13:44:11.498836Z","submitted_at":"2024-08-30T05:42:31Z","title":"InkubaLM: A small language model for low-resource African languages","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.17024","snapshot_observed_at":"2026-08-11T10:26:24.226902Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.226902Z"},"links":{"cited_paper":"/paper/2408.17024","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:866c9dab9d6ada11ccea2acc4ef27abbfc68229c77f5d4ef81abd16038f229d7","observation_id":"66cdd86f-2f85-484e-9126-03f40dc90838","resolution":{"observed_at":"2026-08-11T10:26:24.226902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-11T10:26:24.231776Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.231776Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:b7bd66512baac10840cf1132bc0c3de99417dbccb4f7eb440fe951c110e2beb7","observation_id":"2670fd2a-839b-49f8-bc3b-17b2ddfd953d","resolution":{"observed_at":"2026-08-11T10:26:24.231776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06694","last_updated":"2024-04-11T01:18:06Z","snapshot_observed_at":"2026-08-08T20:21:38.269492Z","submitted_at":"2023-10-10T15:13:30Z","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06694","snapshot_observed_at":"2026-08-11T10:26:24.240316Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.240316Z"},"links":{"cited_paper":"/paper/2310.06694","citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:64538888777e12748b00418bb19ac378b5918e7074a8df5ab2916be33ae94d68","observation_id":"74f73af4-5882-4c5f-b263-cd5e122e54da","resolution":{"observed_at":"2026-08-11T10:26:24.240316Z","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":"10.1609/aaai.v37i9.26304","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.287952Z","title":null,"venue":null,"work_id":"a0eda714-5c1e-4459-9a4b-4ccbc5e212c4","year":2023},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.244477Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:79f48b32e576110885dac2c00c1a05406de0b5b1618039e8291a91d17b2acdac","observation_id":"81033927-47ad-4c6a-adcc-d1a17ec17103","resolution":{"observed_at":"2026-08-11T10:26:24.293894Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.248530Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.248530Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:07e62e3dc2314baf16477c70f3ea76f65c17d8690b9e4c3cb5384ed69b7e140c","observation_id":"57678626-2cce-4469-b900-f313dad02e82","resolution":{"observed_at":"2026-08-11T10:26:24.248530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:26:24.252992Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T10:26:24.252992Z"},"links":{"citing_paper":"/paper/2412.16719"},"observation_digest":"sha256:1715a9b9d66b24092a1ef038ef2ac21f4db7e729ef5e483fdccbf1a0cb3d6bb3","observation_id":"a5905243-ebae-48ad-9b25-ae0c25fc962c","resolution":{"observed_at":"2026-08-11T10:26:24.252992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.16719","last_updated":"2024-12-28T17:45:12Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T10:17:56.598148Z","submitted_at":"2024-12-21T18:04:01Z","title":"Lillama: Large Language Models Compression via Low-Rank Feature Distillation"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":47},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 2 inbound Pith citation observations for arXiv:2412.16719."}