{"as_of":"2026-08-09T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b41164b1f7244e52ded24f2852aa3dd35137ee1b3102d188e46e72226e48458b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:33:17.474748Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.15353","last_updated":"2023-06-06T03:20:50Z","snapshot_observed_at":"2026-08-02T11:09:21.725311Z","submitted_at":"2020-07-30T10:03:47Z","title":"Growing Efficient Deep Networks by Structured Continuous Sparsification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.15353","snapshot_observed_at":"2026-08-04T11:33:17.474748Z","title":"Growing efficient deep networks by structured continuous sparsification","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.04500","last_updated":"2026-06-03T23:33:57Z","snapshot_observed_at":"2026-08-07T18:27:51.712711Z","submitted_at":"2025-10-06T05:26:52Z","title":"Expand Neurons, Not Parameters","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T11:33:17.474748Z"},"links":{"cited_paper":"/paper/2007.15353","citing_paper":"/paper/2510.04500"},"observation_digest":"sha256:ec502f0fc6ad796cf7b6317419f52a28a8445ea864d9cf7cd83a96c70d5d5d05","observation_id":"0bff169f-713c-4fec-b2ce-cf1dd358f694","resolution":{"observed_at":"2026-08-04T11:33:17.474748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.15353/citation-record","integrity":"/paper/2007.15353/integrity","json":"/paper/2007.15353/citation-record.json","paper":"/paper/2007.15353"},"outbound":[],"paper":{"arxiv_id":"2007.15353","last_updated":"2023-06-06T03:20:50Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T11:09:21.725311Z","submitted_at":"2020-07-30T10:03:47Z","title":"Growing Efficient Deep Networks by Structured Continuous Sparsification"},"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 1 inbound Pith citation observation for arXiv:2007.15353."}