{"as_of":"2026-08-05T18:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:63470b2f3b4aa76b8f457fe6b532f2263b34cfa4767dc386a39e1475847c0d81","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-26T20:02:45.082477Z","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-04T02:09:22.265174Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.06470","last_updated":"2023-08-12T05:28:05Z","snapshot_observed_at":"2026-07-06T16:05:31.757410Z","submitted_at":"2023-08-12T05:28:05Z","title":"On the Optimal Lower and Upper Complexity Bounds for a Class of Composite Optimization Problems","version":1},"cited_work":{"arxiv_id":"2308.06470","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.06470","snapshot_observed_at":"2026-07-04T02:09:22.265174Z","title":"Preprint, arXiv:2308.06470 , year=","venue":null,"work_id":"750eaa27-0a19-48d0-922d-ccb285fffc3f","year":null},"citing_paper":{"arxiv_id":"2606.19050","last_updated":"2026-06-17T13:17:06Z","snapshot_observed_at":"2026-08-02T06:04:21.663026Z","submitted_at":"2026-06-17T13:17:06Z","title":"First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-06-26T20:02:45.082477Z"},"links":{"cited_paper":"/paper/2308.06470","citing_paper":"/paper/2606.19050"},"observation_digest":"sha256:eb326d0309e593c243f60beed56e1b4eae640fe35c71c5f99405c68050844be9","observation_id":"4e7f283d-55ab-404f-949e-cc3e5c4725d9","resolution":{"observed_at":"2026-07-04T02:09:22.267541Z","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/2308.06470/citation-record","integrity":"/paper/2308.06470/integrity","json":"/paper/2308.06470/citation-record.json","paper":"/paper/2308.06470"},"outbound":[],"paper":{"arxiv_id":"2308.06470","last_updated":"2023-08-12T05:28:05Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T16:05:31.757410Z","submitted_at":"2023-08-12T05:28:05Z","title":"On the Optimal Lower and Upper Complexity Bounds for a Class of Composite Optimization Problems"},"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 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2308.06470."}