{"as_of":"2026-08-09T23:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73ef6e9a91dbf270e75b668aee084e37910f4c410efc7d11e6c3365bc0eceacd","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":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-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:48:53.804404Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T20:28:14.163808Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.11057","last_updated":"2024-09-17T10:35:30Z","snapshot_observed_at":"2026-07-06T19:16:36.688367Z","submitted_at":"2024-09-17T10:35:30Z","title":"KVPruner: Structural Pruning for Faster and Memory-Efficient Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.11057","snapshot_observed_at":"2026-08-08T14:48:53.804404Z","title":"Lv, B., Zhou, Q., Ding, X., Wang, Y ., and Ma, Z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06663","last_updated":"2025-02-11T19:01:39Z","snapshot_observed_at":"2026-08-08T14:42:01.589221Z","submitted_at":"2025-02-10T16:51:03Z","title":"EfficientLLM: Scalable Pruning-Aware Pretraining for Architecture-Agnostic Edge Language Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T14:48:53.804404Z"},"links":{"cited_paper":"/paper/2409.11057","citing_paper":"/paper/2502.06663"},"observation_digest":"sha256:a05d24efb47561a05f40263fe38c538d5f9eb222524b0def60d7f1e8a1d2accb","observation_id":"8a3a09ec-7afe-49f6-b34f-d893f9a8f504","resolution":{"observed_at":"2026-08-08T14:48:53.804404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11057","last_updated":"2024-09-17T10:35:30Z","snapshot_observed_at":"2026-07-06T19:16:36.688367Z","submitted_at":"2024-09-17T10:35:30Z","title":"KVPruner: Structural Pruning for Faster and Memory-Efficient Large Language Models","version":1},"cited_work":{"arxiv_id":"2409.11057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.11057","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kvpruner: Structural pruning for faster and memory-efficient large language models","venue":null,"work_id":"528f1cf8-aa4e-47cf-9466-3eccd149d545","year":2024},"citing_paper":{"arxiv_id":"2604.02501","last_updated":"2026-04-02T20:09:05Z","snapshot_observed_at":"2026-07-30T03:07:00.572975Z","submitted_at":"2026-04-02T20:09:05Z","title":"ECG Foundation Models and Medical LLMs for Agentic Cardiovascular Intelligence at the Edge: A Review and Outlook","version":1},"reference_index":108,"source":"pdf_text","source_observed_at":"2026-05-13T20:23:15.138933Z"},"links":{"cited_paper":"/paper/2409.11057","citing_paper":"/paper/2604.02501"},"observation_digest":"sha256:f46d126cd2f177bd9a99a297c6bd6e67280ef79b3604a510dda823cce1277aeb","observation_id":"11610039-0eb8-429d-a93a-37a43e2890be","resolution":{"observed_at":"2026-05-13T20:28:14.165172Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.11057/citation-record","integrity":"/paper/2409.11057/integrity","json":"/paper/2409.11057/citation-record.json","paper":"/paper/2409.11057"},"outbound":[],"paper":{"arxiv_id":"2409.11057","last_updated":"2024-09-17T10:35:30Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T19:16:36.688367Z","submitted_at":"2024-09-17T10:35:30Z","title":"KVPruner: Structural Pruning for Faster and Memory-Efficient Large Language Models"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2409.11057."}