{"as_of":"2026-08-09T06:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e08f3bb31ecb3f61b640818adc8d56fc9392d6f2cdaa50d57dc08f8401e672e","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-09T06:31:02.800959+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-07T13:33:54.674767Z","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-07T13:33:55.246692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.15768","last_updated":"2025-03-20T15:46:13Z","snapshot_observed_at":"2026-08-08T13:12:45.017324Z","submitted_at":"2020-10-29T17:13:46Z","title":"A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems","version":3},"cited_work":{"arxiv_id":"2010.15768","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.15768","snapshot_observed_at":"2026-08-07T13:33:55.246692Z","title":"A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems","venue":"math.OC","work_id":"f7dfaa96-7743-4209-bfa9-ed9968a6acd2","year":2020},"citing_paper":{"arxiv_id":"2505.21598","last_updated":"2025-05-27T16:56:54Z","snapshot_observed_at":"2026-08-09T06:28:29.015364Z","submitted_at":"2025-05-27T16:56:54Z","title":"Rethinking Data Mixture for Large Language Models: A Comprehensive Survey and New Perspectives","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T13:33:54.674767Z"},"links":{"cited_paper":"/paper/2010.15768","citing_paper":"/paper/2505.21598"},"observation_digest":"sha256:d63a855c107001e9d0c05018d87a2ab1fba7426e661e2566bff9dfbf9eebba91","observation_id":"34000aaf-f730-4f6e-9659-43a4e2ce50f5","resolution":{"observed_at":"2026-08-07T13:33:55.333064Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2010.15768/citation-record","integrity":"/paper/2010.15768/integrity","json":"/paper/2010.15768/citation-record.json","paper":"/paper/2010.15768"},"outbound":[],"paper":{"arxiv_id":"2010.15768","last_updated":"2025-03-20T15:46:13Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T13:12:45.017324Z","submitted_at":"2020-10-29T17:13:46Z","title":"A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2010.15768."}