{"as_of":"2026-08-05T02:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:858f02d6f2c0d4425a9bba09b5d3d41956fbc38fae54e72270821bbf3705390f","coverage":[{"denominator":97,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":97,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T13:31:06.702424Z","state":"measured"},{"denominator":97,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":97,"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/2510.00192/citation-record","integrity":"/paper/2510.00192/integrity","json":"/paper/2510.00192/citation-record.json","paper":"/paper/2510.00192"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T13:30:57.667330Z","title":"Binarybert: Pushing the limit of bert quantization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:57.667330Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:cbbf2513ba5c32590cd70012c1d69b4cf1c49623668ad135c361ea082e1a7418","observation_id":"dc40d292-4cf2-46ee-a940-4023f01d7983","resolution":{"observed_at":"2026-08-04T13:30:57.667330Z","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-04T13:30:57.727948Z","title":"Federated fine-tuning of large language models under heterogeneous tasks and client resources.Advances in Neural Information Processing Systems, 37: 14457–14483, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:57.727948Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:44fe608623bcc7eb531e92500a02d22567aac19fcc57372e95e3b19c7d842aca","observation_id":"829f914f-a6b3-4a26-93fe-7c48cd0be5c6","resolution":{"observed_at":"2026-08-04T13:30:57.727948Z","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-04T13:30:57.789018Z","title":"Ce-lora: Computation-efficient lora fine-tuning for language models.CoRR, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:57.789018Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:ad35d639ceb57a535cf6de0ad153d6a3160c465fb00176718fa355930691a472","observation_id":"69e5e4f8-3aa1-43f4-b374-c0775893f143","resolution":{"observed_at":"2026-08-04T13:30:57.789018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18356","last_updated":"2023-10-31T04:21:33Z","snapshot_observed_at":"2026-07-06T16:39:40.673808Z","submitted_at":"2023-10-24T00:47:26Z","title":"LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18356","snapshot_observed_at":"2026-08-04T13:30:57.879086Z","title":"Lorashear: Efficient large language model structured pruning and knowledge recovery.arXiv preprint arXiv:2310.18356, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:57.879086Z"},"links":{"cited_paper":"/paper/2310.18356","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:a50510ad567a6c7f204de47e6a7d4afa8a5c6241e1ca7b4059dd7d7fc46bf5d9","observation_id":"7b10f8df-b062-44a4-b9db-5e73b59e7c13","resolution":{"observed_at":"2026-08-04T13:30:57.879086Z","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-04T13:30:58.009389Z","title":"Hessian-free optimization for learning deep multidimensional recurrent neural networks.Advances in Neural Information Processing Systems, 28, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:58.009389Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:2c94008a1e95edefe3c148ae883de01b2314a3c2a08e89ddcd8f11b35504f421","observation_id":"5aa05aaa-d78d-4e87-abba-d1fb33ab20c8","resolution":{"observed_at":"2026-08-04T13:30:58.009389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06432","last_updated":"2024-02-20T21:15:59Z","snapshot_observed_at":"2026-07-06T17:14:41.030939Z","submitted_at":"2024-01-12T07:52:07Z","title":"Heterogeneous LoRA for Federated Fine-tuning of On-Device Foundation Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06432","snapshot_observed_at":"2026-08-04T13:30:58.132349Z","title":"Heterogeneous low-rank approximation for federated fine-tuning of on-device foundation models.arXiv preprint arXiv:2401.06432, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:58.132349Z"},"links":{"cited_paper":"/paper/2401.06432","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:887838320ef89b08c0ef27922610cbd729ed99ed64a05ad83832beded9dc98d7","observation_id":"347cdee2-d545-4bb6-abfe-ac372b75b811","resolution":{"observed_at":"2026-08-04T13:30:58.132349Z","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-08-04T15:46:25.710484Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-04T13:30:58.253214Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:58.253214Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:a996ea46591357f0f17b856c95ec5899b26613177abdd941637e06d0d71b58c9","observation_id":"e785c09b-20d2-4a6f-991d-29182f7982a0","resolution":{"observed_at":"2026-08-04T13:30:58.253214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.04902","last_updated":"2024-04-08T22:42:49Z","snapshot_observed_at":"2026-07-30T16:56:04.978117Z","submitted_at":"2023-11-08T18:59:54Z","title":"Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.04902","snapshot_observed_at":"2026-08-04T13:30:58.419534Z","title":"Beyond size: How gradients shape pruning decisions in large language models.arXiv preprint arXiv:2311.04902, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:58.419534Z"},"links":{"cited_paper":"/paper/2311.04902","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:3907d4b6653f0fee42dfef4c9663091a89184c555a5427a6208c263aab332403","observation_id":"8fb65cf2-809b-434b-8327-d4561dd6a95a","resolution":{"observed_at":"2026-08-04T13:30:58.419534Z","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-04T13:30:58.539382Z","title":"Predicting parameters in deep learning.Advances in neural information processing systems, 26, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:58.539382Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:1c8fa038e896d6dcfacf6dbf25b6987d9f8b360c61cb0fdc2f2667fb241e6c4e","observation_id":"81998eaa-18f5-4c34-8de5-bfeb10e6d1a8","resolution":{"observed_at":"2026-08-04T13:30:58.539382Z","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-04T13:30:58.651587Z","title":"Coreset-based neural network compression","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:58.651587Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:299e47beb1c62e4331c625bb890973da80348424bb0e236b1a196b0a901ffed5","observation_id":"8593886f-bb44-4ff9-ae21-7058745dd726","resolution":{"observed_at":"2026-08-04T13:30:58.651587Z","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-04T13:30:58.815555Z","title":"Reducing transformer depth on demand with structured dropout","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:58.815555Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:a2e46ddb323a8a674e9d2dd1d86188e72931b710bab3b9316f685137393b017a","observation_id":"a4212534-6d08-43e8-ac53-500660fabe92","resolution":{"observed_at":"2026-08-04T13:30:58.815555Z","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-04T13:30:59.010834Z","title":"Depgraph: Towards any structural pruning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:59.010834Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:fe6eb1494215b9d1020fab81b89dfb5344502eda41e3e9999c22fd63083b90fb","observation_id":"a3e5cb77-57db-4f56-aca9-a09d56084375","resolution":{"observed_at":"2026-08-04T13:30:59.010834Z","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-04T13:30:59.232150Z","title":"Geometric measure theory","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:59.232150Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:28205f329c9de8f14f64c7f2b669aa913960ef01ac9f5f76c681cf01f528a2a0","observation_id":"a553de21-3638-415d-a056-b6fac7f67c54","resolution":{"observed_at":"2026-08-04T13:30:59.232150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03432","last_updated":"2024-03-06T03:33:48Z","snapshot_observed_at":"2026-08-04T23:08:32.752799Z","submitted_at":"2024-03-06T03:33:48Z","title":"Mixture-of-LoRAs: An Efficient Multitask Tuning for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03432","snapshot_observed_at":"2026-08-04T13:30:59.403201Z","title":"Mixture-of-loras: An efficient multitask tuning for large language models.arXiv preprint arXiv:2403.03432, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:59.403201Z"},"links":{"cited_paper":"/paper/2403.03432","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:fdff6e1ea734775271de2e20c53e5f21da75f5753f95b42516697abccbd6e9a9","observation_id":"a998bcb7-ccb8-48c2-9103-5237a4d3ae33","resolution":{"observed_at":"2026-08-04T13:30:59.403201Z","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-04T13:30:59.575040Z","title":"Optimal brain compression: A framework for accurate post-training quantization and pruning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:59.575040Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:b77ed346fad7c12e481dc2b09346fffa8e337918d939f70c8257525b7708f007","observation_id":"c8bfe133-019a-433d-af1d-5816d365fa01","resolution":{"observed_at":"2026-08-04T13:30:59.575040Z","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-04T13:30:59.747709Z","title":"Sparsegpt: Massive language models can be accurately pruned in one-shot","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:59.747709Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:7c799e4918d397f8683f2ee5fad40844b58f274498578340a1dbf5dd631dbef8","observation_id":"c27ab0c7-20d9-419c-86f9-48c760c5a6bf","resolution":{"observed_at":"2026-08-04T13:30:59.747709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-04T13:30:59.893551Z","title":"The llama 3 herd of models.arXiv preprint arXiv:2407.21783, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T13:30:59.893551Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:023850b9f3e59599375d351ba88244c9f7ca057959f6c846b7cf7ef222cfca0e","observation_id":"38c1c143-6cce-43d0-8c2e-8905d447a0a7","resolution":{"observed_at":"2026-08-04T13:30:59.893551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.12486","last_updated":"2019-12-23T01:23:53Z","snapshot_observed_at":"2026-08-05T02:20:38.740015Z","submitted_at":"2019-09-27T04:10:10Z","title":"Reweighted Proximal Pruning for Large-Scale Language Representation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.12486","snapshot_observed_at":"2026-08-04T13:31:00.113570Z","title":"Reweighted proximal pruning for large-scale language representation","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.113570Z"},"links":{"cited_paper":"/paper/1909.12486","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:d84244963e3d6227a604e736be9d83c9222f08f09ddb1ed27799371e320ad12f","observation_id":"60746ec9-aa14-41a6-9c04-27fd519c4acb","resolution":{"observed_at":"2026-08-04T13:31:00.113570Z","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-04T13:31:00.200249Z","title":"Learning both weights and connections for efficient neural network","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.200249Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:e5e7503e7dbe02d49d7df4a3b142f6ddd4e13475136bd15dca65776c39947d07","observation_id":"0a8af465-7787-4c78-8712-2ac545802ffc","resolution":{"observed_at":"2026-08-04T13:31:00.200249Z","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-04T13:31:00.267651Z","title":"Flora: Low-rank adapters are secretly gradient compressors","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.267651Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:a39f39d424eac88f70d901bc6c448a23953dd9f6798505d41b6c21d82b553b25","observation_id":"fd0a66d6-9342-4826-b44a-9505b07b4879","resolution":{"observed_at":"2026-08-04T13:31:00.267651Z","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-04T13:31:00.377084Z","title":"Second order derivatives for network pruning: Optimal brain surgeon.Advances in neural information processing systems, 5, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.377084Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:67feb91a0a89aa1a031cf08fa772c1196a0f5ad494df9ffcff07fcd8040f0ccf","observation_id":"75b7bbc3-f206-4ec3-8529-8ba3ad957d01","resolution":{"observed_at":"2026-08-04T13:31:00.377084Z","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-04T13:31:00.452127Z","title":"Optimal brain surgeon and general network pruning","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.452127Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:a54447aba945ac2076e29b8fc2f6445e23c9f3d58406719e6235e25985af435c","observation_id":"0b66a6d9-281c-4180-8916-7e5201e9d6fa","resolution":{"observed_at":"2026-08-04T13:31:00.452127Z","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-04T13:31:00.577372Z","title":"Lora+ efficient low rank adaptation of large models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.577372Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:4fd19277034d0b10d883762a446152a46cda5c6c45ac03c2646cd4832a8aa913","observation_id":"ea315db3-c540-4089-97b4-19033bee0107","resolution":{"observed_at":"2026-08-04T13:31:00.577372Z","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-04T13:31:00.636127Z","title":"Subspace optimization for large language models with convergence guarantees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.636127Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:07c6be1fe99f36a5a216e9cfe1d18ce0b335c07a0cb237ef7440fbc316574875","observation_id":"0db7e1ab-1d6f-487a-ac22-a1175654dbad","resolution":{"observed_at":"2026-08-04T13:31:00.636127Z","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-04T13:31:00.720564Z","title":"Measuring mathematical problem solving with the math dataset","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.720564Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:f46867d75252bb550174eaab901c3d18f8cc1aedab0732faa7ec8b58efbd0197","observation_id":"82da0f9e-fa4f-4c04-bde8-d07bdae9ff6c","resolution":{"observed_at":"2026-08-04T13:31:00.720564Z","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-04T13:31:00.770959Z","title":"Lora: Low-rank adaptation of large language models.ICLR, 1(2):3, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.770959Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:724e293e95e24b6d0e4fd2a07cd71e82747ac2d19fde66a6558bed62fd045b18","observation_id":"c1f34cec-dee5-4380-8315-9e35d55661e1","resolution":{"observed_at":"2026-08-04T13:31:00.770959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.03250","last_updated":"2016-07-12T07:43:01Z","snapshot_observed_at":"2026-07-06T05:03:13.994105Z","submitted_at":"2016-07-12T07:43:01Z","title":"Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.03250","snapshot_observed_at":"2026-08-04T13:31:00.881626Z","title":"Network trimming: A data-driven neuron pruning approach towards efficient deep architectures.arXiv preprint arXiv:1607.03250, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.881626Z"},"links":{"cited_paper":"/paper/1607.03250","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:e3b7bdf7f43851de24ce549499c537ca4b279c0150e964f4be3f9512d82a8155","observation_id":"6cfcee99-6076-4fd8-9bd8-e294b84fd331","resolution":{"observed_at":"2026-08-04T13:31:00.881626Z","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-04T13:31:00.993208Z","title":"Accelerated sparse neural training: A provable and efficient method to find n: m transposable masks.Advancesin neural information processing systems, 34:21099–21111, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:00.993208Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:acc0fc8db0ec77bfb60219991ce461ae061a49abce0f7635bb56af67126731ec","observation_id":"5d104d56-4bae-4022-8f64-9cf8a47b2b6d","resolution":{"observed_at":"2026-08-04T13:31:00.993208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03732","last_updated":"2023-11-28T03:23:20Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-11-28T03:23:20Z","title":"A Rank Stabilization Scaling Factor for Fine-Tuning with LoRA","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03732","snapshot_observed_at":"2026-08-04T13:31:01.064826Z","title":"Arankstabilizationscalingfactorforfine-tuningwithlora","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.064826Z"},"links":{"cited_paper":"/paper/2312.03732","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:55bed43f9174a31c7f1b2f84729467237865511af99e0052dcdd1cc38b4be428","observation_id":"1d7aa9df-d1ad-421d-93af-ead81aab9d49","resolution":{"observed_at":"2026-08-04T13:31:01.064826Z","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-04T13:31:01.163745Z","title":"Some fundamental aspects about lipschitz continuity of neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.163745Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:a9b6e01fb31020ebcb3e3ae9d5672f0bd1aa74599a717eea39a172a2cc0b7133","observation_id":"ce9c9923-2138-4087-adf9-6dd6bf2f73b1","resolution":{"observed_at":"2026-08-04T13:31:01.163745Z","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-04T13:31:01.261636Z","title":"The optimal bert surgeon: Scalable and accurate second-order pruning for large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.261636Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:9ad7699902ac7abe5a526cc759036ea4db650dd555299d4019663baa7fba0ce7","observation_id":"ea43b0f6-c49e-4693-8e1d-6dfd56a352fa","resolution":{"observed_at":"2026-08-04T13:31:01.261636Z","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-04T13:31:01.363823Z","title":"Ziplm: Inference-aware structured pruning of language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.363823Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:146d0e7ad2b644f8d2a7309cffea784a23abad968d03d7611e4675aec1f1799c","observation_id":"dc589ecf-70d9-4690-90ee-b25976b1e18c","resolution":{"observed_at":"2026-08-04T13:31:01.363823Z","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-04T13:31:01.435804Z","title":"Sparse fine-tuning for inference acceleration of large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.435804Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:513e36afbbaa9bfa2744b44a36e42ac5518f6c2052136fc8a79aa8ae802aeaa0","observation_id":"fd0e990b-98d0-4b0d-9226-683156e44756","resolution":{"observed_at":"2026-08-04T13:31:01.435804Z","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-04T13:31:01.498965Z","title":"Albert: A lite bert for self-supervised learning of language representations","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.498965Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:26b787540dea2a9a736bfbad8fd656f4f17ba0ff54e8602dc4b06423ec87cb4a","observation_id":"fa481466-fcc0-46aa-a3de-6c80f060e2d2","resolution":{"observed_at":"2026-08-04T13:31:01.498965Z","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-04T13:31:01.572932Z","title":"Lipschitz constant estimation of neural networks via sparse polynomial optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.572932Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:1d0e909292f6ac7d32b2001c022483d1f4e5c5bb5f05b97a0da00bc2bb18fb71","observation_id":"bd2b4232-c958-4914-99c0-78fd768a553c","resolution":{"observed_at":"2026-08-04T13:31:01.572932Z","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-04T13:31:01.644621Z","title":"Optimal brain damage.Advances in neural information processing systems, 2, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.644621Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:359a5316e4ff3089a609d8bbef2ccec144e845c4013728de9ee511e40129aeb1","observation_id":"46224fc7-20ab-4d6d-93e2-2889a5679241","resolution":{"observed_at":"2026-08-04T13:31:01.644621Z","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-04T13:31:01.724813Z","title":"T\\’yr-the-pruner: Unlocking accurate 50% structural pruning for llms via global sparsity distribution optimization.arXiv preprint arXiv:2503.09657, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.724813Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:881b758ad54a088d61d6660792b006eca93a47bfb11a5b55c51b0ff49e337167","observation_id":"3d5b2695-62ab-4310-b536-33e6b58d6be7","resolution":{"observed_at":"2026-08-04T13:31:01.724813Z","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-04T13:31:01.801639Z","title":"Pruning filters for efficient convnets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.801639Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:b8779bc9f08f7debecde3a39578c3bddd106f51ea02cf32b69e3f9d1b29e7ed3","observation_id":"f377ed9a-4110-41d9-9aa4-d46ba17cac09","resolution":{"observed_at":"2026-08-04T13:31:01.801639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.12079","last_updated":"2025-05-17T16:44:38Z","snapshot_observed_at":"2026-07-06T21:25:37.773959Z","submitted_at":"2025-05-17T16:44:38Z","title":"SepPrune: Structured Pruning for Efficient Deep Speech Separation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.12079","snapshot_observed_at":"2026-08-04T13:31:01.902086Z","title":"Sepprune: Structured pruning for efficient deep speech separation.arXiv preprint arXiv:2505.12079, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:01.902086Z"},"links":{"cited_paper":"/paper/2505.12079","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:c1db7324ec082b29fc8c7008451efb4737ca8e4d997edd0e373d76ebea2f7225","observation_id":"67fbccff-3515-48f2-a62c-8b650db8c896","resolution":{"observed_at":"2026-08-04T13:31:01.902086Z","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-04T13:31:02.028336Z","title":"Memory-efficient llm training with online subspace descent","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.028336Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:66e5e7ac761b07f98dad676a60a91504af67ed17b2fdbda956b2645e7fc5dcca","observation_id":"02eaee91-d8c1-467b-ba31-d265e0f9b270","resolution":{"observed_at":"2026-08-04T13:31:02.028336Z","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-04T13:31:02.116020Z","title":"Dynamic adaptation of lora fine-tuning for efficient and task-specific optimization of large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.116020Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:c969642f3d883d3399834d9c735649f2a6138c16f943955486cb6ca25255f9e3","observation_id":"78ce60b2-284a-4e14-b5cd-b0e312e95d29","resolution":{"observed_at":"2026-08-04T13:31:02.116020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19820","last_updated":"2024-12-15T12:28:13Z","snapshot_observed_at":"2026-07-06T20:13:49.797517Z","submitted_at":"2024-12-15T12:28:13Z","title":"GaLore$+$: Boosting Low-Rank Adaptation for LLMs with Cross-Head Projection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19820","snapshot_observed_at":"2026-08-04T13:31:02.244573Z","title":"Galore+: Boosting low-rank adaptation for llms with cross-head projection.arXiv preprint arXiv:2412.19820, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.244573Z"},"links":{"cited_paper":"/paper/2412.19820","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:8088ef7c0fe739649df0fade9db591818dd7a3667e45b4208c5305e8bfcd0ec0","observation_id":"cee76c2c-d269-4488-b224-d10321023029","resolution":{"observed_at":"2026-08-04T13:31:02.244573Z","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-04T13:31:02.321581Z","title":"Dora: Weight-decomposed low-rank adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.321581Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:61f449e6dea39ac1e858c34a46e2472d4e686b26083f5eff54d7b1bfc0685d13","observation_id":"a19f575a-b0a2-4c96-8290-454a52ffdc12","resolution":{"observed_at":"2026-08-04T13:31:02.321581Z","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-04T13:31:02.406112Z","title":"Ebert: Efficient bert inference with dynamic structured pruning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.406112Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:f0f00dd537c9d3ad46391c0df2489485af902d7cb53255e11b0c0c54c44a6e6d","observation_id":"42116b73-24c9-4af0-889e-1b473d258b69","resolution":{"observed_at":"2026-08-04T13:31:02.406112Z","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-04T13:31:02.464210Z","title":"Learning efficient convolutional networks through network slimming","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.464210Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:3369fcf0014426dc10ba705ca5454951ba114249c558a9fc563b3f82d39c1cc9","observation_id":"3e949072-23a0-403c-b972-8d0394646aa3","resolution":{"observed_at":"2026-08-04T13:31:02.464210Z","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-04T13:31:02.512248Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.512248Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:10c771786a8e5702b96b55d9d267ddfabcce483bec15506cf7a744d3e4e7227f","observation_id":"6f1e7130-2b04-48c4-9699-0a982d3c7b13","resolution":{"observed_at":"2026-08-04T13:31:02.512248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.05556","last_updated":"2023-11-09T18:04:15Z","snapshot_observed_at":"2026-07-06T16:45:20.005195Z","submitted_at":"2023-11-09T18:04:15Z","title":"LCM-LoRA: A Universal Stable-Diffusion Acceleration Module","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.05556","snapshot_observed_at":"2026-08-04T13:31:02.588362Z","title":"Lcm-lora: A universal stable-diffusion acceleration module.arXiv preprint arXiv:2311.05556, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.588362Z"},"links":{"cited_paper":"/paper/2311.05556","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:1df314697ff9b944d065716ec695826e410a6a422779d70ac43e2c215e10625c","observation_id":"5852614b-c80a-48b6-af93-a3ccaf18e4df","resolution":{"observed_at":"2026-08-04T13:31:02.588362Z","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-04T13:31:02.664766Z","title":"Llm-pruner: On the structural pruning of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.664766Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:d3e846ee8fb01924894668b689af41dbcbab492d28fbd1af5a1ad1a71fed47e3","observation_id":"04174519-2574-4dd5-9a98-aa8e09c27a20","resolution":{"observed_at":"2026-08-04T13:31:02.664766Z","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-04T13:31:02.724189Z","title":"Pissa: Principal singular values and singular vectors adaptation of large language models.Advances in Neural Information Processing Systems, 37:121038–121072, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.724189Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:6ef4abcfcf05e449d0973d3782bd1e1ed183d055187e02e7f62305d06ecac9a8","observation_id":"ed1f517f-41bf-4dc7-8107-87eb88756a67","resolution":{"observed_at":"2026-08-04T13:31:02.724189Z","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-04T13:31:02.773302Z","title":"Pointer sentinel mixture models","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.773302Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:505824bcce59a564c23e38e2d1b30fceb0df79cc64ab4471ceea8c6ce4e8fbec","observation_id":"594ba95e-f619-4659-879d-f769ab4372e0","resolution":{"observed_at":"2026-08-04T13:31:02.773302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08378","last_updated":"2021-04-16T21:27:32Z","snapshot_observed_at":"2026-08-04T11:24:11.301809Z","submitted_at":"2021-04-16T21:27:32Z","title":"Accelerating Sparse Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08378","snapshot_observed_at":"2026-08-04T13:31:02.854535Z","title":"Accelerating sparse deep neural networks.arXiv preprint arXiv:2104.08378, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.854535Z"},"links":{"cited_paper":"/paper/2104.08378","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:90205dcafb805c4bcfa669f077a367ca0bdc452f604218c2adfc7e940ac41d14","observation_id":"2cecd9cf-dc79-41b9-aa5f-9e68b937cf78","resolution":{"observed_at":"2026-08-04T13:31:02.854535Z","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-04T13:31:02.913442Z","title":"Pruning convolutional neural networks for resource efficient inference","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.913442Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:0ada1308c0846f064fca6e2b156988c212251d9cf7abe57e68cfeeb1753944fa","observation_id":"b116ae71-3485-4aba-b171-d45906e821dd","resolution":{"observed_at":"2026-08-04T13:31:02.913442Z","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-04T13:31:02.966630Z","title":"Importance estimation for neural network pruning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:02.966630Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:206b93f7b045bddbb815e6de771585e5987c35a600509c35a37c62800a63a6ec","observation_id":"628ae958-cc78-481d-8b24-d10852a51e77","resolution":{"observed_at":"2026-08-04T13:31:02.966630Z","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-04T13:31:03.016361Z","title":"Sosp: Efficiently capturing global correlations by second-order structured pruning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.016361Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:baeb2463f56240ae67387320132baa12d64dd31e45378475e1c3e10ee2856955","observation_id":"8fb9fdb9-f12a-4cb4-9ffe-f53d0ad78993","resolution":{"observed_at":"2026-08-04T13:31:03.016361Z","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-04T13:31:03.069053Z","title":"Gradient-free structured pruning with unlabeled data","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.069053Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:f6698da3ca72642569a07a34c9977918d09047513d92c2f513ff308f2763b49c","observation_id":"78eb8584-3cdc-4233-a5dc-9230d16c2916","resolution":{"observed_at":"2026-08-04T13:31:03.069053Z","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-04T13:31:03.120217Z","title":"Meta-kd: A meta knowledge distillation framework for language model compression across domains","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.120217Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:de71c65cd9f4c138681c87ab10edddba3844e8255f3785086d8f71d9317a19dc","observation_id":"3d9d37ea-f880-4ce3-8101-013c7a10833a","resolution":{"observed_at":"2026-08-04T13:31:03.120217Z","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-04T13:31:03.178876Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer.Journal of machine learning research, 21(140):1–67, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.178876Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:bb55ec66e373b6a60e453aa6bd0e3db080bc99e937f43fabb750cb1f940fd30b","observation_id":"e4eaa6c2-9814-4e3c-a220-a47cafac1877","resolution":{"observed_at":"2026-08-04T13:31:03.178876Z","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-04T13:31:03.252672Z","title":"Structural pruning via latency-saliency knapsack","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.252672Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:be41bf1c805dbc7e4d37b59dd7353f5911ef3516f68596ae207f20eac46bc1b5","observation_id":"151baf2e-ef0a-48ff-8549-056c48550fa5","resolution":{"observed_at":"2026-08-04T13:31:03.252672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.10704","last_updated":"2024-09-12T18:25:16Z","snapshot_observed_at":"2026-08-04T05:04:56.942998Z","submitted_at":"2024-03-15T21:43:46Z","title":"Parameter Efficient Reinforcement Learning from Human Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.10704","snapshot_observed_at":"2026-08-04T13:31:03.312654Z","title":"Parameter efficient reinforcement learning from human feedback","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.312654Z"},"links":{"cited_paper":"/paper/2403.10704","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:ea37610d5b1eae73bb84e9ed02a3552cb83bf255f73bc74fd48716e50f0b687b","observation_id":"a898b301-55d1-458a-b5c6-098fa3d90597","resolution":{"observed_at":"2026-08-04T13:31:03.312654Z","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-04T13:31:03.388666Z","title":"Woodfisher: Efficient second-order approximation for neural network compression","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.388666Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:33b30e5592a4278b7387f2e196c8673607f336c9e6acf2729725ca9b9f13b09e","observation_id":"5e895c56-e7f8-4dd0-9ba5-5b4538ecc5ce","resolution":{"observed_at":"2026-08-04T13:31:03.388666Z","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-04T13:31:03.449666Z","title":"A simple and effective pruning approach for large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.449666Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:60e3bc99b71d03580b8f7657712118c66ca60327c8521982fe6e2e0e2733ab23","observation_id":"aeaff8f7-a551-48ec-a25b-1818c93bbbf2","resolution":{"observed_at":"2026-08-04T13:31:03.449666Z","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-04T13:31:03.499646Z","title":"Patient knowledge distillation for bert model compression","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.499646Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:8344bab5986ea026a64df32426b06988ef91e436ac764dd0a06369e609c1c2fc","observation_id":"b80c776c-8e10-4a80-8266-6ea6aa176c55","resolution":{"observed_at":"2026-08-04T13:31:03.499646Z","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-04T13:31:03.582653Z","title":"Contrastive distillation on intermediate representations for language model compression","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.582653Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:365e49ff57154999b88a4fa8d2d323215ffb8b96ab2071e78481a564d29fbf27","observation_id":"b9768038-dcf6-4def-bb72-9a0c0cf783a8","resolution":{"observed_at":"2026-08-04T13:31:03.582653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12313","last_updated":"2024-03-18T23:20:08Z","snapshot_observed_at":"2026-07-06T17:46:42.199436Z","submitted_at":"2024-03-18T23:20:08Z","title":"Improving LoRA in Privacy-preserving Federated Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12313","snapshot_observed_at":"2026-08-04T13:31:03.641942Z","title":"Improving lora in privacy-preserving federated learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.641942Z"},"links":{"cited_paper":"/paper/2403.12313","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:a904da6d68a7ea41edde2bd78977c6dbd9060322552da10b28f745d012b03eab","observation_id":"698325b9-6deb-43ea-8a43-ad4849f0bff1","resolution":{"observed_at":"2026-08-04T13:31:03.641942Z","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-04T13:31:03.690169Z","title":"Mobilebert: a compact task-agnostic bert for resource-limited devices","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.690169Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:09847f99ce7585fe8e30584bbf10588a7b8a758ead177786046e416ef2d244b6","observation_id":"3aaf5e46-c21b-4668-9174-283dad6bbc6a","resolution":{"observed_at":"2026-08-04T13:31:03.690169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07780","last_updated":"2026-07-15T12:46:32Z","snapshot_observed_at":"2026-07-18T23:18:58.038237Z","submitted_at":"2025-02-11T18:59:35Z","title":"DarwinLM: Evolutionary Structured Pruning of Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07780","snapshot_observed_at":"2026-08-04T13:31:03.739460Z","title":"Darwinlm: Evolutionary structured pruning of large language models.arXiv preprint arXiv:2502.07780, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.739460Z"},"links":{"cited_paper":"/paper/2502.07780","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:4fad4cd7fac06b528c13cbfb8f06a52814bd46fca7edab0ecbf1dac196e63165","observation_id":"4f06c780-054b-4572-b047-7384f857302a","resolution":{"observed_at":"2026-08-04T13:31:03.739460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-04T13:31:03.822129Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.822129Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:48e70adc49874138e3f6c97c8705885c17cd9725fde7955beb51c529b891b183","observation_id":"0216e233-01c7-4c2e-89a7-237199be87e7","resolution":{"observed_at":"2026-08-04T13:31:03.822129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-02T11:57:18.735747Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-04T13:31:03.870042Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.870042Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:26ea1ca43e1d3a11ccec818fe27f4daf5caeec256374a6a9670dd4bc7a3b5ee6","observation_id":"b2a2da0b-79bc-48d7-9642-64b67cd3d4bd","resolution":{"observed_at":"2026-08-04T13:31:03.870042Z","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-04T13:31:03.928668Z","title":"Attention is all you need.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.928668Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:3b968433944087fa6abdf1c86eb32bcbfd470c2837a3875034150d0a7325209f","observation_id":"921b7e6b-9ba1-4951-89f4-9ebaf443aaa5","resolution":{"observed_at":"2026-08-04T13:31:03.928668Z","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-04T13:31:03.986729Z","title":"Glue: A multi-task benchmark and analysis platform for natural language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:03.986729Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:c9957221cfe25bc6852ddd06b8e47db9a8192114af4bad994cc0846ecaec7e89","observation_id":"97b8fa66-7df6-4169-98db-b4ada96729d5","resolution":{"observed_at":"2026-08-04T13:31:03.986729Z","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-04T13:31:04.026847Z","title":"Lora-ga: Low-rank adaptation with gradient approximation.Advances in Neural Information Processing Systems, 37:54905–54931, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.026847Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:eada8caf888b564fe2faf1090831e47a75d4007eaf5385f4586fb780058c435b","observation_id":"f842fe44-9d50-4586-9b46-808aa377678d","resolution":{"observed_at":"2026-08-04T13:31:04.026847Z","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-04T13:31:04.133041Z","title":"Lora-pro: Are low-rank adapters properly optimized? In The Thirteenth International Conference on Learning Representations, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.133041Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:4c50441fcfd38e8ac153116b886cfa875b3cd6c7a0cfd256bf8987fffba53eec","observation_id":"b914099e-0017-4294-b5d7-c0e39b07384a","resolution":{"observed_at":"2026-08-04T13:31:04.133041Z","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-04T13:31:04.196398Z","title":"Assessing the brittleness of safety alignment via pruning and low-rank modifications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.196398Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:8e85acd8676e1a6893dd5585ad2d57b7977fc5e10776600636b7f6714cce5602","observation_id":"1487b643-c4e3-42b9-9ef9-b4087d23ba37","resolution":{"observed_at":"2026-08-04T13:31:04.196398Z","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-04T13:31:04.272275Z","title":"Structured optimal brain pruning for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.272275Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:c700581031c54247106fa4421d35172e75a2717d8bbc6a0b3893876dd6fb6d3e","observation_id":"0984fd7f-d6e7-4b3d-8e53-868410bd99d6","resolution":{"observed_at":"2026-08-04T13:31:04.272275Z","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-04T13:31:04.340595Z","title":"The iterative optimal brain surgeon: Faster sparse recovery by leveraging second-order information.Advances in Neural Information Processing Systems, 37:139621–139649, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.340595Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:c51236eba084ad43c07defad4068c62eab40c769fe32d28d22985676a1711249","observation_id":"54288fbb-9f33-44eb-bda4-7ad7a22ba123","resolution":{"observed_at":"2026-08-04T13:31:04.340595Z","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-04T13:31:04.422456Z","title":"Structured pruning learns compact and accurate models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.422456Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:af79ae5795e23523bb154cd4376e104de2ffbe147fe61f2f3b8d365799cdea9b","observation_id":"b9aa7571-1b63-427b-9019-1ca5061b3c0b","resolution":{"observed_at":"2026-08-04T13:31:04.422456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12013","last_updated":"2024-10-15T19:22:27Z","snapshot_observed_at":"2026-07-06T19:34:10.252984Z","submitted_at":"2024-10-15T19:22:27Z","title":"MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12013","snapshot_observed_at":"2026-08-04T13:31:04.500933Z","title":"Pruning mixture-of-experts large language model using the hints from its router.arXiv preprint arXiv:2410.12013, 3, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.500933Z"},"links":{"cited_paper":"/paper/2410.12013","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:1b13570491ebcd3f67d2f2263ef34f3145150c4e4bd3cf90b00877b0b96844de","observation_id":"004f3f9e-bb2a-4b06-bc39-57ed81f83761","resolution":{"observed_at":"2026-08-04T13:31:04.500933Z","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-04T13:31:04.514773Z","title":"Deebert: Dynamic early exiting for accelerating bert inference","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.514773Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:c131cdddd71b55f2e5617d6fd4f2b07609904856f7e86a709166b7902e92b8e8","observation_id":"cd4e1ad9-f87e-4464-adfd-1e93b5909e6b","resolution":{"observed_at":"2026-08-04T13:31:04.514773Z","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-04T13:31:04.600548Z","title":"Rethinking network pruning–under the pre-train and fine-tune paradigm","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.600548Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:7a7f3e86e99aa3eec7ec90f727d31b0370f52116b06bbfc3f72a25d77c2f7836","observation_id":"9c20982d-41d1-4529-98da-8cc4468b79c7","resolution":{"observed_at":"2026-08-04T13:31:04.600548Z","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-04T13:31:04.693547Z","title":"Theoretical characterization of how neural network pruning affects its generalization.OpenReview, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.693547Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:86f9c10a2a1b99d03f42445639fdf772b0cab8fb34a47c28fd4f85bd6f5a21e7","observation_id":"26c72107-9900-4c67-93a8-b16ccdd102bf","resolution":{"observed_at":"2026-08-04T13:31:04.693547Z","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-04T13:31:04.788138Z","title":"Mtl-lora: Low-rank adaptation for multi-task learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.788138Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:762c58ac7ca6b2d585f30c1e34e998f6286c6f5ef2566723a0ad91bde7fa1ea9","observation_id":"310b74ce-55c8-4d1a-b4c6-717d9304bea0","resolution":{"observed_at":"2026-08-04T13:31:04.788138Z","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-04T13:31:04.870527Z","title":"Wanda++: Pruning large language models via regional gradients","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.870527Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:585f22a776e6971cd066eaf8cec97b2b049b71b39fe33c80f521925e757dec82","observation_id":"10c78340-18b5-47cd-8366-53db9232320f","resolution":{"observed_at":"2026-08-04T13:31:04.870527Z","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-04T13:31:04.951471Z","title":"Gradient-based intra-attention pruning on pre-trained language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.951471Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:70876aaead13a92b5fe2901f87d1941704bd39a3743bdca77cbe156c8ae41f9c","observation_id":"ede60751-dd98-42db-9867-a69701b04380","resolution":{"observed_at":"2026-08-04T13:31:04.951471Z","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-04T13:31:04.990337Z","title":"Zeroquant: Efficient and affordable post-training quantization for large-scale transformers.Advances in neural information processing systems, 35:27168–27183, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:04.990337Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:fd5964a00e8da36729fd55a2ca29f88e955689a9925c44eb3bc0e24fafed0bca","observation_id":"aff35142-5fa4-4932-9f00-d9b61fffd795","resolution":{"observed_at":"2026-08-04T13:31:04.990337Z","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-04T13:31:05.051943Z","title":"Lora done rite: Robust invariant transformation equilibration for lora optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:05.051943Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:868b240f6f3f1c217264045c20e8710fc3ea2000c6465962896a97ff9cc9a3c4","observation_id":"5541c67e-4196-4196-b9d8-c229384ac352","resolution":{"observed_at":"2026-08-04T13:31:05.051943Z","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-04T13:31:05.165928Z","title":"Metamath: Bootstrap your own mathematical questions for large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:05.165928Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:5d2a8037dee8f61ec638905097c14bab525907c64cb6443b4f9a508acc3e834c","observation_id":"3e77a342-d52c-4a35-92c5-13246ca3e522","resolution":{"observed_at":"2026-08-04T13:31:05.165928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08934","last_updated":"2025-06-01T06:17:31Z","snapshot_observed_at":"2026-08-03T14:26:38.876105Z","submitted_at":"2024-10-11T16:00:21Z","title":"Understanding the Statistical Accuracy-Communication Trade-off in Personalized Federated Learning with Minimax Guarantees","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08934","snapshot_observed_at":"2026-08-04T13:31:05.241541Z","title":"Understanding the statistical accuracy-communication trade-off in personalized federated learning with minimax guarantees.arXiv preprint arXiv:2410.08934, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:05.241541Z"},"links":{"cited_paper":"/paper/2410.08934","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:cdd6c4d92ce06de60b966d9bd9ebab2af474a2cbaa8d89860cf0e702b4a2e7e3","observation_id":"50972c07-37a0-4a48-94c9-1c93fd4060dc","resolution":{"observed_at":"2026-08-04T13:31:05.241541Z","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-04T13:31:05.348090Z","title":"Altlora: Towards better gradient approximation in low-rank adaptation with alternating projections.arXiv preprint arXiv:2505.12455, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:05.348090Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:19a13ea90675211fba89a33fbdb6a4d38c02d3472bcfee4f2e8ab91e6d0984a7","observation_id":"00e775b1-f0b2-40cb-aa5c-af2c90e37031","resolution":{"observed_at":"2026-08-04T13:31:05.348090Z","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-04T13:31:05.494508Z","title":"Q8bert: Quantized 8bit bert","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:05.494508Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:6b7621fc9ffb3d15bbaaeef096583114519fe33e8f3a9808a1d910aa3e33f0f1","observation_id":"e17a03dc-21e9-4c78-a211-0c9296c0c804","resolution":{"observed_at":"2026-08-04T13:31:05.494508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.07296","last_updated":"2017-12-20T02:52:35Z","snapshot_observed_at":"2026-08-04T10:23:55.502485Z","submitted_at":"2017-12-20T02:52:35Z","title":"Block-diagonal Hessian-free Optimization for Training Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.07296","snapshot_observed_at":"2026-08-04T13:31:05.703639Z","title":"Block-diagonal hessian-free optimization for training neural networks.arXiv preprint arXiv:1712.07296, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:05.703639Z"},"links":{"cited_paper":"/paper/1712.07296","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:f6186f58ef9889b85a3a7657b818f18d4206de9cfd9de68a0eaae17128d14801","observation_id":"b6ff9d6a-c44d-496f-80fd-7ddb175e5aec","resolution":{"observed_at":"2026-08-04T13:31:05.703639Z","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-04T13:31:05.792586Z","title":"Loraprune: Struc- tured pruning meets low-rank parameter-efficient fine-tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:05.792586Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:4d3a3d3aa602b26d855905e154bb503898caa99decf7c1aa53d575ce2cdb799e","observation_id":"04a1f2bc-20fc-45e9-8af4-1adcf7e87a18","resolution":{"observed_at":"2026-08-04T13:31:05.792586Z","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-04T13:31:06.001832Z","title":"Adap- tive budget allocation for parameter-efficient fine-tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:06.001832Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:2fda10c3e86783e974b038ec1e88916f56e4f409d4da2bd009189b245b29a379","observation_id":"a2d8d4ed-11ae-45ac-8387-58b1465c45bf","resolution":{"observed_at":"2026-08-04T13:31:06.001832Z","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-04T13:31:06.136237Z","title":"Lora-one: One-step full gradient could suffice for fine-tuning large language models, provably and efficiently","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:06.136237Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:5159c64272810eb25dc57fa0827ff696df7991a1a51d1c312cfa078ccf77a1c1","observation_id":"684e44fd-643e-43a4-9cf3-f192963eacdb","resolution":{"observed_at":"2026-08-04T13:31:06.136237Z","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-04T13:31:06.262731Z","title":"Galore: Memory-efficient llm training by gradient low-rank projection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:06.262731Z"},"links":{"citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:698d3da26fbf65c5865132c32fa8d1ce5d2d6f68eeb3e9e5f999b0945a4cdb0c","observation_id":"58561001-168f-4cb2-968d-059b871e41c0","resolution":{"observed_at":"2026-08-04T13:31:06.262731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10520","last_updated":"2023-03-09T20:01:31Z","snapshot_observed_at":"2026-08-01T19:34:25.312383Z","submitted_at":"2022-01-21T22:21:31Z","title":"Adaptive Activation-based Structured Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10520","snapshot_observed_at":"2026-08-04T13:31:06.404589Z","title":"Adaptive activation-based structured pruning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:06.404589Z"},"links":{"cited_paper":"/paper/2201.10520","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:3d1b1af53816fa063e972d378787810090ecfd290f47002ec57797e3e86b8907","observation_id":"75ef3e90-57fa-4ee7-bd45-c9a061a9e25f","resolution":{"observed_at":"2026-08-04T13:31:06.404589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15103","last_updated":"2025-06-19T04:00:52Z","snapshot_observed_at":"2026-07-30T22:08:16.206174Z","submitted_at":"2025-01-25T06:56:39Z","title":"Each Rank Could be an Expert: Single-Ranked Mixture of Experts LoRA for Multi-Task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15103","snapshot_observed_at":"2026-08-04T13:31:06.541083Z","title":"Each rank could be an expert: Single-ranked mixture of experts lora for multi-task learning.arXiv preprint arXiv:2501.15103, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:06.541083Z"},"links":{"cited_paper":"/paper/2501.15103","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:c7840d4189b2d720e903f467b8e29ce37af379840c34d1d23c3b80f047392af0","observation_id":"db05630d-57f8-4472-8431-ac7392949e70","resolution":{"observed_at":"2026-08-04T13:31:06.541083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.01878","last_updated":"2017-11-13T18:40:16Z","snapshot_observed_at":"2026-08-05T00:54:50.482913Z","submitted_at":"2017-10-05T04:26:49Z","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.01878","snapshot_observed_at":"2026-08-04T13:31:06.702424Z","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-04T13:31:06.702424Z"},"links":{"cited_paper":"/paper/1710.01878","citing_paper":"/paper/2510.00192"},"observation_digest":"sha256:89ccea76df38bc5cfd69a2d8f92249c02bd1848ed4058f254fa33662803d1730","observation_id":"41485d92-3dbb-484b-bc63-31ad17e3a477","resolution":{"observed_at":"2026-08-04T13:31:06.702424Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.00192","last_updated":"2026-07-28T23:06:32Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T13:30:56.253163Z","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation"},"reference_resolution":{"displayed":97,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":96,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":97},"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 5 August 2026, this Paper Citation Record lists 97 of 97 outbound references and 0 inbound Pith citation observations for arXiv:2510.00192."}