{"as_of":"2026-08-17T06:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f67f2fd0189928eaba9b8a4e1a493c9ced82e1b9e8b9e3ac8f6c5c29a107eac9","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-16T06:30:59.297886+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-14T11:30:12.292496Z","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-11T12:53:59.474268Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1608.04493","last_updated":"2016-11-10T00:17:25Z","snapshot_observed_at":"2026-08-14T21:44:03.580537Z","submitted_at":"2016-08-16T06:23:05Z","title":"Dynamic Network Surgery for Efficient DNNs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.04493","snapshot_observed_at":"2026-08-14T11:30:12.292496Z","title":"Dynamic network surgery for efficient dnns,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08976","last_updated":"2019-08-23T18:58:07Z","snapshot_observed_at":"2026-08-17T04:56:52.039737Z","submitted_at":"2019-08-23T18:58:07Z","title":"MASR: A Modular Accelerator for Sparse RNNs","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-14T11:30:12.292496Z"},"links":{"cited_paper":"/paper/1608.04493","citing_paper":"/paper/1908.08976"},"observation_digest":"sha256:48c59e4ab0bc8ed94a3e0987e46b8bab2cd7bb55ff71b43949b7434870b321b7","observation_id":"12f2a76d-5699-4674-b185-7c8a29f788cf","resolution":{"observed_at":"2026-08-14T11:30:12.292496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.04493","last_updated":"2016-11-10T00:17:25Z","snapshot_observed_at":"2026-08-14T21:44:03.580537Z","submitted_at":"2016-08-16T06:23:05Z","title":"Dynamic Network Surgery for Efficient DNNs","version":2},"cited_work":{"arxiv_id":"1608.04493","doi":null,"metadata_source":"pith","pith_arxiv_id":"1608.04493","snapshot_observed_at":"2026-08-11T12:53:59.474268Z","title":"Dynamic Network Surgery for Efficient DNNs","venue":"cs.NE","work_id":"2591dfe3-226c-4535-8e6f-7157bc412e01","year":2016},"citing_paper":{"arxiv_id":"2412.13737","last_updated":"2024-12-18T11:14:30Z","snapshot_observed_at":"2026-08-15T00:50:42.360737Z","submitted_at":"2024-12-18T11:14:30Z","title":"On the Compression of Language Models for Code: An Empirical Study on CodeBERT","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T12:53:58.409096Z"},"links":{"cited_paper":"/paper/1608.04493","citing_paper":"/paper/2412.13737"},"observation_digest":"sha256:cf8c5e076a2acd4471f6f36ab6b339b1b931681c78290ff5fb87922005364600","observation_id":"320d121c-e9d7-4c0a-bfc3-4471265442f9","resolution":{"observed_at":"2026-08-11T12:53:59.479314Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1608.04493/citation-record","integrity":"/paper/1608.04493/integrity","json":"/paper/1608.04493/citation-record.json","paper":"/paper/1608.04493"},"outbound":[],"paper":{"arxiv_id":"1608.04493","last_updated":"2016-11-10T00:17:25Z","latest_version":2,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-14T21:44:03.580537Z","submitted_at":"2016-08-16T06:23:05Z","title":"Dynamic Network Surgery for Efficient DNNs"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1608.04493."}