{"as_of":"2026-08-17T09:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f647d8d6fd44ff0a533367738b6807e298fceaec3e27b1887e72a03c7fa2ebb8","coverage":[{"denominator":2,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T23:12:07.547170Z","state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2602.14649/citation-record","integrity":"/paper/2602.14649/integrity","json":"/paper/2602.14649/citation-record.json","paper":"/paper/2602.14649"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.18403","last_updated":"2024-08-07T03:30:30Z","snapshot_observed_at":"2026-08-16T15:28:53.781349Z","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-14T15:59:35.524037Z","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:496a7e02153762a2ffb3e061f1cf67ee205a1087ff313d9cab7effcb5f11ef6c","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":"2404.09695","last_updated":"2024-04-15T11:53:22Z","snapshot_observed_at":"2026-08-16T14:00:52.580489Z","submitted_at":"2024-04-15T11:53:22Z","title":"LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.09695","snapshot_observed_at":"2026-08-02T23:12:07.448084Z","title":"arXiv preprint arXiv:2404.09695","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.14649","last_updated":"2026-07-30T12:27:06Z","snapshot_observed_at":"2026-08-14T15:59:35.524037Z","submitted_at":"2026-02-16T11:14:02Z","title":"GradMAP: Faster Layer Pruning with Gradient Metric and Projection Compensation","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T23:12:07.448084Z"},"links":{"cited_paper":"/paper/2404.09695","citing_paper":"/paper/2602.14649"},"observation_digest":"sha256:c178acc6e26b49a7e5d1b6911d4397f5dc9e0ec4bd799537d4589508e1c9bcc9","observation_id":"f8182ef2-333a-4221-acbf-3d154c62d011","resolution":{"observed_at":"2026-08-02T23:12:07.448084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.14649","last_updated":"2026-07-30T12:27:06Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T15:59:35.524037Z","submitted_at":"2026-02-16T11:14:02Z","title":"GradMAP: Faster Layer Pruning with Gradient Metric and Projection Compensation"},"reference_resolution":{"displayed":2,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":2},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 2 of 2 outbound references and 0 inbound Pith citation observations for arXiv:2602.14649."}