{"as_of":"2026-08-11T15:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fff4e3623fa7c8df1b7328bef46df4b5e4ec8ddb5642adc7e680de3eeb6c907c","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-11T06:34:44.6726+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-10T14:46:38.275991Z","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-05T10:19:23.215633Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.02164","last_updated":"2020-07-20T15:26:14Z","snapshot_observed_at":"2026-08-05T18:36:15.605417Z","submitted_at":"2020-04-05T11:28:39Z","title":"DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.02164","snapshot_observed_at":"2026-08-10T14:46:38.275991Z","title":"Dsa: More efficient budgeted pruning via differentiable sparsity allocation, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.15014","last_updated":"2025-01-28T20:29:44Z","snapshot_observed_at":"2026-08-11T01:12:50.576066Z","submitted_at":"2025-01-25T01:37:03Z","title":"On Accelerating Edge AI: Optimizing Resource-Constrained Environments","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T14:46:38.275991Z"},"links":{"cited_paper":"/paper/2004.02164","citing_paper":"/paper/2501.15014"},"observation_digest":"sha256:479e649edd441a4f99ea988042f43d1a86d2ef9fa49b9d8f66e269e52ef4ce18","observation_id":"4e3e87d2-475f-47a7-a184-c7e2a4e9ea2c","resolution":{"observed_at":"2026-08-10T14:46:38.275991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.02164","last_updated":"2020-07-20T15:26:14Z","snapshot_observed_at":"2026-08-05T18:36:15.605417Z","submitted_at":"2020-04-05T11:28:39Z","title":"DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocation","version":5},"cited_work":{"arxiv_id":"2004.02164","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.02164","snapshot_observed_at":"2026-08-05T10:19:23.215633Z","title":"DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocation","venue":"cs.CV","work_id":"6f258825-f79a-4e6e-91c6-54221151e1d4","year":2020},"citing_paper":{"arxiv_id":"2509.10526","last_updated":"2025-09-04T15:05:05Z","snapshot_observed_at":"2026-08-09T12:27:44.080634Z","submitted_at":"2025-09-04T15:05:05Z","title":"Resource-Aware Neural Network Pruning Using Graph-based Reinforcement Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T10:19:22.884726Z"},"links":{"cited_paper":"/paper/2004.02164","citing_paper":"/paper/2509.10526"},"observation_digest":"sha256:58db16913eee69a1c506f14f7fa3066665172b232746447591bf9998f68068af","observation_id":"2db6e222-3f4a-4103-aed7-54335f180a42","resolution":{"observed_at":"2026-08-05T10:19:23.220572Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.02164/citation-record","integrity":"/paper/2004.02164/integrity","json":"/paper/2004.02164/citation-record.json","paper":"/paper/2004.02164"},"outbound":[],"paper":{"arxiv_id":"2004.02164","last_updated":"2020-07-20T15:26:14Z","latest_version":5,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-05T18:36:15.605417Z","submitted_at":"2020-04-05T11:28:39Z","title":"DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocation"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2004.02164."}