{"as_of":"2026-08-09T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e0156a4002249870a2d983893695c4bfe401624e86bfbd3806efe04a26bac91","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T04:08:39.594367Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2412.06289","last_updated":"2024-12-19T18:47:54Z","snapshot_observed_at":"2026-07-06T20:03:42.903210Z","submitted_at":"2024-12-09T08:24:11Z","title":"S$^{2}$FT: Efficient, Scalable and Generalizable LLM Fine-tuning by Structured Sparsity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06289","snapshot_observed_at":"2026-07-13T04:08:39.594367Z","title":"S2ft: Efficient, scalable and generalizable llm fine-tuning by structured sparsity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09287","last_updated":"2026-07-10T10:55:28Z","snapshot_observed_at":"2026-08-06T10:40:57.712485Z","submitted_at":"2026-07-10T10:55:28Z","title":"Super-Tuning: From Activation-Aware Pruning to Sparse Fine-Tuning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T04:08:39.594367Z"},"links":{"cited_paper":"/paper/2412.06289","citing_paper":"/paper/2607.09287"},"observation_digest":"sha256:df5f543aaa10c76b6aded044b44fa5652142954af590cdcb4eb74d6ca95d8e26","observation_id":"c9f00262-f308-48fc-8c1f-ed6329db4db5","resolution":{"observed_at":"2026-07-13T04:08:39.594367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.06289/citation-record","integrity":"/paper/2412.06289/integrity","json":"/paper/2412.06289/citation-record.json","paper":"/paper/2412.06289"},"outbound":[],"paper":{"arxiv_id":"2412.06289","last_updated":"2024-12-19T18:47:54Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:03:42.903210Z","submitted_at":"2024-12-09T08:24:11Z","title":"S$^{2}$FT: Efficient, Scalable and Generalizable LLM Fine-tuning by Structured Sparsity"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2412.06289."}