{"as_of":"2026-08-20T04:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d556ca30ee1f1b54c8df663863ff813713751eb986a2761019d22e7d8373ddb6","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-19T06:32:44.657259+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-15T22:22:58.208657Z","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-15T22:22:58.372563Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.08764","last_updated":"2021-10-17T08:58:08Z","snapshot_observed_at":"2026-08-20T02:27:25.509585Z","submitted_at":"2021-10-17T08:58:08Z","title":"S-Cyc: A Learning Rate Schedule for Iterative Pruning of ReLU-based Networks","version":1},"cited_work":{"arxiv_id":"2110.08764","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.08764","snapshot_observed_at":"2026-08-15T22:22:58.372563Z","title":"S-Cyc: A Learning Rate Schedule for Iterative Pruning of ReLU-based Networks","venue":"cs.LG","work_id":"4148e946-b37f-413c-bcf1-f05d9508f482","year":2021},"citing_paper":{"arxiv_id":"2505.07411","last_updated":"2025-06-15T08:13:14Z","snapshot_observed_at":"2026-08-19T03:48:20.487192Z","submitted_at":"2025-05-12T10:07:23Z","title":"ICE-Pruning: An Iterative Cost-Efficient Pruning Pipeline for Deep Neural Networks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T22:22:58.208657Z"},"links":{"cited_paper":"/paper/2110.08764","citing_paper":"/paper/2505.07411"},"observation_digest":"sha256:ca3d56026d6620155d21fbf21d11286b34a0ab9b790b231acdfdf7962f1c6bd7","observation_id":"75856f42-f771-48c5-99f3-8f68be0a0ae8","resolution":{"observed_at":"2026-08-15T22:22:58.376687Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.08764/citation-record","integrity":"/paper/2110.08764/integrity","json":"/paper/2110.08764/citation-record.json","paper":"/paper/2110.08764"},"outbound":[],"paper":{"arxiv_id":"2110.08764","last_updated":"2021-10-17T08:58:08Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T02:27:25.509585Z","submitted_at":"2021-10-17T08:58:08Z","title":"S-Cyc: A Learning Rate Schedule for Iterative Pruning of ReLU-based Networks"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2110.08764."}