{"as_of":"2026-08-07T20:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c812ee88b8610ad423748af44c0805f657c66c5f77585d9a2ddf2715b44ac44d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:03:50.150580Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-09T07:16:04.188505Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":"2305.18403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-07-09T07:16:04.188505Z","title":"Loraprune: Structured pruning meets low-rank parameter-efficient fine-tuning","venue":"cs.LG","work_id":"45ca4092-5bb4-47ea-8556-44f2eaa2a427","year":2023},"citing_paper":{"arxiv_id":"2403.14608","last_updated":"2024-09-16T02:54:50Z","snapshot_observed_at":"2026-08-04T09:07:42.158421Z","submitted_at":"2024-03-21T17:55:50Z","title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","version":7},"reference_index":120,"source":"pdf_text","source_observed_at":"2026-05-13T11:32:36.738536Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2403.14608"},"observation_digest":"sha256:5547d788caf015ecccd365231dac82cbc4985c3566795e3c66bc55c2e333a987","observation_id":"eece8467-a940-4d30-9a3e-59c99bc509f4","resolution":{"observed_at":"2026-05-13T11:32:37.137631Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":"2305.18403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-07-09T07:16:04.188505Z","title":"Loraprune: Structured pruning meets low-rank parameter-efficient fine-tuning","venue":"cs.LG","work_id":"45ca4092-5bb4-47ea-8556-44f2eaa2a427","year":2023},"citing_paper":{"arxiv_id":"2503.08223","last_updated":"2026-04-09T15:28:27Z","snapshot_observed_at":"2026-07-06T20:50:33.513259Z","submitted_at":"2025-03-11T09:41:29Z","title":"Will LLMs Scaling Hit the Wall? Breaking Barriers via Distributed Resources on Massive Edge Devices","version":3},"reference_index":169,"source":"pdf_text","source_observed_at":"2026-05-23T01:03:26.037233Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2503.08223"},"observation_digest":"sha256:73d612cca00683e6b5c346d17b94320f0c9b35576fc101b56983018acfb5baa5","observation_id":"35410915-288d-4501-a21e-73da44c434a7","resolution":{"observed_at":"2026-05-23T01:05:16.475146Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":"2305.18403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-07-09T07:16:04.188505Z","title":"Loraprune: Structured pruning meets low-rank parameter-efficient fine-tuning","venue":"cs.LG","work_id":"45ca4092-5bb4-47ea-8556-44f2eaa2a427","year":2023},"citing_paper":{"arxiv_id":"2505.17138","last_updated":"2026-05-18T17:05:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-22T06:12:42Z","title":"RAP: Runtime Adaptive Pruning for LLM Inference","version":5},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-22T13:20:41.739571Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2505.17138"},"observation_digest":"sha256:428d3b482379c207ab59ee01d776d2cdb0b4286cb8ad70b43818e6e8d8397295","observation_id":"3faaae99-1b2a-4eff-a91b-0fd3632e2971","resolution":{"observed_at":"2026-05-22T13:21:35.600815Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-08-07T14:03:50.150580Z","title":"Loraprune: Pruning meets low-rank parameter-efficient fine-tuning.arXiv preprint arXiv:2305.18403, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20155","last_updated":"2025-05-26T15:57:08Z","snapshot_observed_at":"2026-08-07T16:51:34.972907Z","submitted_at":"2025-05-26T15:57:08Z","title":"Pangu Light: Weight Re-Initialization for Pruning and Accelerating LLMs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:03:50.150580Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2505.20155"},"observation_digest":"sha256:2ddf1c7832421ee90880db93ec28f1d15cdece471196c4a29e820e5da684de7f","observation_id":"387bde6f-6707-497d-bb2a-e26386318834","resolution":{"observed_at":"2026-08-07T14:03:50.150580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-08-07T13:26:43.815649Z","title":"Loraprune: Pruning meets low-rank parameter-efficient fine-tuning.arXiv preprint arXiv:2305.18403, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21817","last_updated":"2025-05-27T22:59:44Z","snapshot_observed_at":"2026-08-07T13:20:29.702883Z","submitted_at":"2025-05-27T22:59:44Z","title":"ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:43.815649Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2505.21817"},"observation_digest":"sha256:58480efa4d4860196278af3af14d259b5ab84df30f9219e5c5193f59cc79f20c","observation_id":"1f917454-8130-4c47-9291-100440aea80f","resolution":{"observed_at":"2026-08-07T13:26:43.815649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-08-07T13:30:21.169863Z","title":"Loraprune: Pruning meets low- rank parameter-efficient fine-tuning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.22689","last_updated":"2025-05-28T03:01:28Z","snapshot_observed_at":"2026-08-07T13:17:13.301734Z","submitted_at":"2025-05-28T03:01:28Z","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:21.169863Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2505.22689"},"observation_digest":"sha256:8ce2687f7ae2f9d96e291cd21354e3f9ea8bdb257fee63621614b1b1d3423baa","observation_id":"dc6e8ff4-2f01-4fdd-98d8-d4f976dffa28","resolution":{"observed_at":"2026-08-07T13:30:21.169863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":"2305.18403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-07-09T07:16:04.188505Z","title":"Loraprune: Structured pruning meets low-rank parameter-efficient fine-tuning","venue":"cs.LG","work_id":"45ca4092-5bb4-47ea-8556-44f2eaa2a427","year":2023},"citing_paper":{"arxiv_id":"2506.12876","last_updated":"2026-05-13T04:56:46Z","snapshot_observed_at":"2026-08-01T16:23:25.586402Z","submitted_at":"2025-06-15T15:02:59Z","title":"MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T09:01:16.991413Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2506.12876"},"observation_digest":"sha256:410e7118dd6ca6a947ad8127d1264b4e4db3624f7e2ea42a177e3eef682acf6c","observation_id":"e5d46116-a700-4821-9c58-317345c79fdf","resolution":{"observed_at":"2026-05-19T09:02:14.375780Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-08-02T23:12:07.547170Z","title":"∂ ∂θi log pθ(y|x) 2# . Since the loss is the negative log-likelihood LCE (x, y) =− log pθ(y|x), we have ∂LCE (x, y) ∂θi =− ∂ ∂θi log pθ(y|x), which implies I(θi) = E(x,y)∼D","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.14649","last_updated":"2026-07-30T12:27:06Z","snapshot_observed_at":"2026-08-02T23:54:41.315848Z","submitted_at":"2026-02-16T11:14:02Z","title":"GradMAP: Faster Layer Pruning with Gradient Metric and Projection Compensation","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T23:12:07.547170Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2602.14649"},"observation_digest":"sha256:3796876de9532b124d3a4086567d7bcd05aa38434194275c9b21e50d1e650dc9","observation_id":"97d3112d-fc35-4633-8d29-ea6e107af233","resolution":{"observed_at":"2026-08-02T23:12:07.547170Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":"2305.18403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-07-09T07:16:04.188505Z","title":"Loraprune: Structured pruning meets low-rank parameter-efficient fine-tuning","venue":"cs.LG","work_id":"45ca4092-5bb4-47ea-8556-44f2eaa2a427","year":2023},"citing_paper":{"arxiv_id":"2606.01412","last_updated":"2026-05-31T19:17:39Z","snapshot_observed_at":"2026-08-05T23:04:35.966323Z","submitted_at":"2026-05-31T19:17:39Z","title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-06-28T17:28:14.160341Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2606.01412"},"observation_digest":"sha256:566cda17475aa3f7046998319c7b69e8a6141a84c3d52ebbca87ed103cb1a641","observation_id":"998a433b-3a50-4272-b9a8-eb960f3ff038","resolution":{"observed_at":"2026-07-01T21:06:14.414209Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":"2305.18403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-07-09T07:16:04.188505Z","title":"Loraprune: Structured pruning meets low-rank parameter-efficient fine-tuning","venue":"cs.LG","work_id":"45ca4092-5bb4-47ea-8556-44f2eaa2a427","year":2023},"citing_paper":{"arxiv_id":"2607.07557","last_updated":"2026-07-08T15:51:57Z","snapshot_observed_at":"2026-08-05T23:29:23.942367Z","submitted_at":"2026-07-08T15:51:57Z","title":"PALS: Percentile-Aware Layerwise Sparsity for LLM Pruning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-09T07:15:50.133587Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2607.07557"},"observation_digest":"sha256:0fbac5a30fd75fca2ad9cf0aabae15b71f529dd5d5fff7b0e519cf54a7e85903","observation_id":"400c6307-dab2-4c98-9956-0c8bfff0d564","resolution":{"observed_at":"2026-07-09T07:16:04.191634Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18403","snapshot_observed_at":"2026-08-02T03:55:41.247033Z","title":"Loraprune: Pruning meets low-rank parameter-efficient fine-tuning.arXiv preprint arXiv:2305.18403,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13735","last_updated":"2026-07-17T08:40:24Z","snapshot_observed_at":"2026-08-06T21:00:57.912415Z","submitted_at":"2026-07-15T11:47:24Z","title":"Constraint-Driven Model Optimization: An Industry Framework for Selecting Compression and Acceleration Techniques in Modern Machine Learning Systems","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T03:55:41.247033Z"},"links":{"cited_paper":"/paper/2305.18403","citing_paper":"/paper/2607.13735"},"observation_digest":"sha256:d26dc72f85e627ad52c556fb35c9992a5b01cdddb396bae9352df91826c1b114","observation_id":"72c9aa9b-2a55-434a-8003-4f91bdf4d635","resolution":{"observed_at":"2026-08-02T03:55:41.247033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.18403/citation-record","integrity":"/paper/2305.18403/integrity","json":"/paper/2305.18403/citation-record.json","paper":"/paper/2305.18403"},"outbound":[],"paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T07:29:40.859648Z","submitted_at":"2023-05-28T15:15:48Z","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2305.18403."}