{"as_of":"2026-08-15T10:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c0d56c07f8c0836653ae63836fe611a58434b05afc0eb2db30aa771ae648350","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-15T06:32:42.880941+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-14T10:25:09.077944Z","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-12T11:20:40.215501Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.05162","last_updated":"2017-11-23T09:34:28Z","snapshot_observed_at":"2026-08-14T21:30:12.382790Z","submitted_at":"2016-11-16T06:34:41Z","title":"Net-Trim: Convex Pruning of Deep Neural Networks with Performance Guarantee","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.05162","snapshot_observed_at":"2026-08-14T10:25:09.077944Z","title":"Aghasi, N","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.11250","last_updated":"2019-08-29T14:17:41Z","snapshot_observed_at":"2026-08-15T05:17:25.546499Z","submitted_at":"2019-08-29T14:17:41Z","title":"Smaller Models, Better Generalization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:25:09.077944Z"},"links":{"cited_paper":"/paper/1611.05162","citing_paper":"/paper/1908.11250"},"observation_digest":"sha256:08326854dca24908e7948e4a8b2247b068b7a4130c0f49faa5886e2e017f0211","observation_id":"f461308f-27b0-4e1f-9f4d-70a76e10bfc0","resolution":{"observed_at":"2026-08-14T10:25:09.077944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.05162","last_updated":"2017-11-23T09:34:28Z","snapshot_observed_at":"2026-08-14T21:30:12.382790Z","submitted_at":"2016-11-16T06:34:41Z","title":"Net-Trim: Convex Pruning of Deep Neural Networks with Performance Guarantee","version":4},"cited_work":{"arxiv_id":"1611.05162","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.05162","snapshot_observed_at":"2026-08-12T11:20:40.215501Z","title":"Net-Trim: Convex Pruning of Deep Neural Networks with Performance Guarantee","venue":"cs.LG","work_id":"b989f5cd-c460-4d06-a2bb-a6ff186b9bba","year":2016},"citing_paper":{"arxiv_id":"2411.18376","last_updated":"2024-11-27T14:25:00Z","snapshot_observed_at":"2026-08-13T09:25:03.848797Z","submitted_at":"2024-11-27T14:25:00Z","title":"Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T11:20:38.022610Z"},"links":{"cited_paper":"/paper/1611.05162","citing_paper":"/paper/2411.18376"},"observation_digest":"sha256:454ea04f4eb7d81593ed566b2f8c9f734a08f150a606a9be386492a2538aecb4","observation_id":"6aeaeee8-611a-4795-9618-4475911eb944","resolution":{"observed_at":"2026-08-12T11:20:40.222633Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1611.05162/citation-record","integrity":"/paper/1611.05162/integrity","json":"/paper/1611.05162/citation-record.json","paper":"/paper/1611.05162"},"outbound":[],"paper":{"arxiv_id":"1611.05162","last_updated":"2017-11-23T09:34:28Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T21:30:12.382790Z","submitted_at":"2016-11-16T06:34:41Z","title":"Net-Trim: Convex Pruning of Deep Neural Networks with Performance Guarantee"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1611.05162."}