{"as_of":"2026-08-10T14:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:65e7df90a252029efec1d9d63914fa71e2ca67de3a07cb60b60e6bf11946f3c6","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-10T06:31:04.303077+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-07T04:42:22.520527Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.15296","last_updated":"2025-02-28T15:23:40Z","snapshot_observed_at":"2026-08-10T12:41:40.136268Z","submitted_at":"2025-01-25T18:26:39Z","title":"You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15296","snapshot_observed_at":"2026-08-07T04:42:22.520527Z","title":"You only prune once: Designing calibration-free model compression with policy learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10100","last_updated":"2025-06-11T18:34:57Z","snapshot_observed_at":"2026-08-08T23:31:58.329673Z","submitted_at":"2025-06-11T18:34:57Z","title":"EfficientVLA: Training-Free Acceleration and Compression for Vision-Language-Action Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:42:22.520527Z"},"links":{"cited_paper":"/paper/2501.15296","citing_paper":"/paper/2506.10100"},"observation_digest":"sha256:4760a0142d5f2c97e8ea6d2f737f968d42f48b609790d395e895a7ecb705012b","observation_id":"052e0a74-8ea6-4abe-9850-bfc6f7250a8c","resolution":{"observed_at":"2026-08-07T04:42:22.520527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15296","last_updated":"2025-02-28T15:23:40Z","snapshot_observed_at":"2026-08-10T12:41:40.136268Z","submitted_at":"2025-01-25T18:26:39Z","title":"You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learning","version":3},"cited_work":{"arxiv_id":"2501.15296","doi":"10.48550/arxiv.2501.15296","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.15296","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ArXiv.org","work_id":"bcd1c4a1-1376-4fa3-a451-fa6ae35b53f0","year":2025},"citing_paper":{"arxiv_id":"2606.06254","last_updated":"2026-06-04T14:55:14Z","snapshot_observed_at":"2026-08-02T00:29:48.838327Z","submitted_at":"2026-06-04T14:55:14Z","title":"SecRL-Prune: Structured Reinforcement Learning-Based Pruning of CodeLLMs for Preserving Adversarial Code Mutation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T00:33:19.474677Z"},"links":{"cited_paper":"/paper/2501.15296","citing_paper":"/paper/2606.06254"},"observation_digest":"sha256:01eb02ad196aeeb23d7db3997e72629ff9375e43148b9adb51772267eca00030","observation_id":"e2fe82bc-5295-4c01-9e41-ac0d4e3c25be","resolution":{"observed_at":"2026-06-28T01:31:29.791122Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15296","last_updated":"2025-02-28T15:23:40Z","snapshot_observed_at":"2026-08-10T12:41:40.136268Z","submitted_at":"2025-01-25T18:26:39Z","title":"You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15296","snapshot_observed_at":"2026-08-05T16:41:28.839158Z","title":"You only prune once: Designing calibration-free model compression with policy learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03580","last_updated":"2026-08-04T12:34:46Z","snapshot_observed_at":"2026-08-08T08:43:28.385709Z","submitted_at":"2026-08-04T12:34:46Z","title":"SlimVLM: Sensitivity-aware Dynamic Structured Pruning with Adaptive Visual Token Selection for Efficient Vision-Language Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T16:41:28.839158Z"},"links":{"cited_paper":"/paper/2501.15296","citing_paper":"/paper/2608.03580"},"observation_digest":"sha256:a4a3e6c83699cc2c1fda5121943aaa06337204f34409030cbf59058cc21bf93a","observation_id":"05067279-0961-484b-b232-cfb3d156823d","resolution":{"observed_at":"2026-08-05T16:41:28.839158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.15296/citation-record","integrity":"/paper/2501.15296/integrity","json":"/paper/2501.15296/citation-record.json","paper":"/paper/2501.15296"},"outbound":[],"paper":{"arxiv_id":"2501.15296","last_updated":"2025-02-28T15:23:40Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T12:41:40.136268Z","submitted_at":"2025-01-25T18:26:39Z","title":"You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learning"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.15296."}