{"as_of":"2026-08-14T21:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:880428a7da9c0f406a2685222297bb81d077117766351b9229fde1e30e0b9993","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-14T06:32:32.682623+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-12T15:18:41.976929Z","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-05-22T08:11:17.417545Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.12946","last_updated":"2023-07-24T17:18:35Z","snapshot_observed_at":"2026-08-14T09:17:01.667454Z","submitted_at":"2023-07-24T17:18:35Z","title":"Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.12946","snapshot_observed_at":"2026-08-12T15:18:41.976929Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-08-13T18:12:24.900357Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:18:41.976929Z"},"links":{"cited_paper":"/paper/2307.12946","citing_paper":"/paper/2411.14601"},"observation_digest":"sha256:d1debe89f3a3bbd88ef7b6a2020c7f7ed21a84c201e896aa6d6dee87a38e621d","observation_id":"d550c0f4-fc73-46c9-a848-fc68188fbe90","resolution":{"observed_at":"2026-08-12T15:18:41.976929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.12946","last_updated":"2023-07-24T17:18:35Z","snapshot_observed_at":"2026-08-14T09:17:01.667454Z","submitted_at":"2023-07-24T17:18:35Z","title":"Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems","version":1},"cited_work":{"arxiv_id":"2307.12946","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.12946","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2307.12946 , year=","venue":null,"work_id":"21b360a0-120a-4d62-bff1-e7bb68f7dc1e","year":null},"citing_paper":{"arxiv_id":"2605.22644","last_updated":"2026-05-21T15:50:40Z","snapshot_observed_at":"2026-08-12T12:23:14.587330Z","submitted_at":"2026-05-21T15:50:40Z","title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-22T08:06:52.309619Z"},"links":{"cited_paper":"/paper/2307.12946","citing_paper":"/paper/2605.22644"},"observation_digest":"sha256:bab26c234eb4f6f4de4e8b3dee9cefd226296cc0e0b851b1adc40237449b3d21","observation_id":"3a5c75f3-25f9-4b3e-8cdc-d1a03dfcae4d","resolution":{"observed_at":"2026-05-22T08:11:17.419879Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2307.12946/citation-record","integrity":"/paper/2307.12946/integrity","json":"/paper/2307.12946/citation-record.json","paper":"/paper/2307.12946"},"outbound":[],"paper":{"arxiv_id":"2307.12946","last_updated":"2023-07-24T17:18:35Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T09:17:01.667454Z","submitted_at":"2023-07-24T17:18:35Z","title":"Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2307.12946."}