{"as_of":"2026-08-21T12:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3efb5af48b38cf147d2647110cc87d388c5f4b9475933b504249639e1f6f2e08","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-21T06:32:19.484+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-04T09:19:03.371959Z","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":"2101.09741","last_updated":"2022-06-14T14:57:06Z","snapshot_observed_at":"2026-08-16T18:50:23.350488Z","submitted_at":"2021-01-24T16:20:56Z","title":"An optimal gradient method for smooth strongly convex minimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.09741","snapshot_observed_at":"2026-08-04T09:19:03.371959Z","title":"Mathematical Programming, Series A193(1–2), 475–501 (2022) https://doi.org/10.1007/s10107-022-01839-y arXiv:arXiv:2101.09741 [math.OC]","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.16680","last_updated":"2026-07-14T05:00:02Z","snapshot_observed_at":"2026-08-19T20:29:54.687228Z","submitted_at":"2025-10-19T01:21:01Z","title":"HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T09:19:03.371959Z"},"links":{"cited_paper":"/paper/2101.09741","citing_paper":"/paper/2510.16680"},"observation_digest":"sha256:2a77f59875c556db450751401c954d48f3baa647e9c528d272db5cfbe55fdada","observation_id":"1e86566d-de02-447b-adbc-736dbba609e0","resolution":{"observed_at":"2026-08-04T09:19:03.371959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.09741","last_updated":"2022-06-14T14:57:06Z","snapshot_observed_at":"2026-08-16T18:50:23.350488Z","submitted_at":"2021-01-24T16:20:56Z","title":"An optimal gradient method for smooth strongly convex minimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.09741","snapshot_observed_at":"2026-08-02T02:28:24.266806Z","title":"arXiv , author =:2101.09741 , primaryclass =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14361","last_updated":"2026-07-15T20:53:51Z","snapshot_observed_at":"2026-08-16T13:59:23.274873Z","submitted_at":"2026-07-15T20:53:51Z","title":"NeuralChaos: Optimal Adapted Approximation of Square Integrable Predictable Processes","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-02T02:28:24.266806Z"},"links":{"cited_paper":"/paper/2101.09741","citing_paper":"/paper/2607.14361"},"observation_digest":"sha256:fd80660ece5d2db786d2cc2a27fb5fc8dfff34083605cccb885fc6d71df5d773","observation_id":"67658398-631e-42e7-aba8-2d5ebfe9877e","resolution":{"observed_at":"2026-08-02T02:28:24.266806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2101.09741/citation-record","integrity":"/paper/2101.09741/integrity","json":"/paper/2101.09741/citation-record.json","paper":"/paper/2101.09741"},"outbound":[],"paper":{"arxiv_id":"2101.09741","last_updated":"2022-06-14T14:57:06Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T18:50:23.350488Z","submitted_at":"2021-01-24T16:20:56Z","title":"An optimal gradient method for smooth strongly convex minimization"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2101.09741."}