{"as_of":"2026-08-06T06:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2bde5726c253d2ce5c8f3f9e619b05b36971ad46c82ee8549f06a31c210c4132","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-05T06:32:48.257954+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-06-26T14:00:19.385619Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T06:59:37.620479Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.06742","last_updated":"2021-02-12T19:53:15Z","snapshot_observed_at":"2026-08-06T04:47:54.096294Z","submitted_at":"2021-02-12T19:53:15Z","title":"Approximation Bounds for Sparse Programs","version":1},"cited_work":{"arxiv_id":"2102.06742","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.06742","snapshot_observed_at":"2026-07-04T06:59:37.620479Z","title":"arXiv preprint arXiv:2102.06742 , title =","venue":null,"work_id":"33500482-93c1-4669-923d-9a3e60a19f43","year":null},"citing_paper":{"arxiv_id":"2606.21354","last_updated":"2026-06-19T11:54:49Z","snapshot_observed_at":"2026-07-06T23:56:21.824303Z","submitted_at":"2026-06-19T11:54:49Z","title":"Restart and Adaptive Acceleration in Stochastic Gradient Methods","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-26T14:00:19.385619Z"},"links":{"cited_paper":"/paper/2102.06742","citing_paper":"/paper/2606.21354"},"observation_digest":"sha256:deeecc441436e2dc6a732e486bb94ac53d9b0e5b3eaa57fa51e908f42fd30051","observation_id":"29d12d9c-dc70-433f-b3d6-930de4b59db9","resolution":{"observed_at":"2026-07-04T06:59:37.622204Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.06742/citation-record","integrity":"/paper/2102.06742/integrity","json":"/paper/2102.06742/citation-record.json","paper":"/paper/2102.06742"},"outbound":[],"paper":{"arxiv_id":"2102.06742","last_updated":"2021-02-12T19:53:15Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T04:47:54.096294Z","submitted_at":"2021-02-12T19:53:15Z","title":"Approximation Bounds for Sparse Programs"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2102.06742."}