{"as_of":"2026-08-21T00:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e90e558d0e100f4220d41bfbc217361b16a53feff07a4265716973c3ad3a6558","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T19:55:21.735878Z","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-08-06T19:07:37.883698Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.08582","last_updated":"2025-01-15T05:07:06Z","snapshot_observed_at":"2026-08-19T23:44:19.210448Z","submitted_at":"2025-01-15T05:07:06Z","title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08582","snapshot_observed_at":"2026-08-12T19:55:21.735878Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2411.10272","last_updated":"2025-05-26T15:36:31Z","snapshot_observed_at":"2026-08-16T03:13:22.160394Z","submitted_at":"2024-11-15T15:28:42Z","title":"P$^2$ Law: Scaling Law for Post-Training After Model Pruning","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T19:55:21.735878Z"},"links":{"cited_paper":"/paper/2501.08582","citing_paper":"/paper/2411.10272"},"observation_digest":"sha256:19fa9542dc43d93b326c7b9ba9296cbd291eaf80eb2ad2a966820f89a0e0a7d6","observation_id":"cd6d65bd-6adc-481a-9883-618564783632","resolution":{"observed_at":"2026-08-12T19:55:21.735878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08582","last_updated":"2025-01-15T05:07:06Z","snapshot_observed_at":"2026-08-19T23:44:19.210448Z","submitted_at":"2025-01-15T05:07:06Z","title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08582","snapshot_observed_at":"2026-08-07T12:41:43.370243Z","title":"Lors: Efficient low-rank adaptation for sparse large language model.arXiv preprint arXiv:2501.08582,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24037","last_updated":"2026-06-02T09:33:40Z","snapshot_observed_at":"2026-08-17T13:47:30.560911Z","submitted_at":"2025-05-29T22:17:43Z","title":"Leave it to the Specialist: Repair Sparse LLMs with Sparse Fine-Tuning via Sparsity Evolution","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:41:43.370243Z"},"links":{"cited_paper":"/paper/2501.08582","citing_paper":"/paper/2505.24037"},"observation_digest":"sha256:5769d22a909d19b5ccb08f4696653ca4d36234607f48e00ae5030b9268d84e74","observation_id":"bb6b77e1-2ae0-4373-aea3-08aa3735edc8","resolution":{"observed_at":"2026-08-07T12:41:43.370243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08582","last_updated":"2025-01-15T05:07:06Z","snapshot_observed_at":"2026-08-19T23:44:19.210448Z","submitted_at":"2025-01-15T05:07:06Z","title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model","version":1},"cited_work":{"arxiv_id":"2501.08582","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.08582","snapshot_observed_at":"2026-08-06T19:07:37.883698Z","title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model","venue":"cs.CL","work_id":"fe03c2eb-9b0d-4004-8fa3-0fd6d237ee4c","year":2025},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-13T12:08:44.034823Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.037623Z"},"links":{"cited_paper":"/paper/2501.08582","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:dee0962ecd04c765f6fc4290ac9f65b852ddd85d59866d8ab10787aee7d1ad68","observation_id":"c8f65f69-f06c-48e7-ab45-8b75940b8964","resolution":{"observed_at":"2026-08-06T19:07:37.936654Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.08582/citation-record","integrity":"/paper/2501.08582/integrity","json":"/paper/2501.08582/citation-record.json","paper":"/paper/2501.08582"},"outbound":[],"paper":{"arxiv_id":"2501.08582","last_updated":"2025-01-15T05:07:06Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-19T23:44:19.210448Z","submitted_at":"2025-01-15T05:07:06Z","title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.08582."}