{"as_of":"2026-08-18T22:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:352277cad28336c0f80ca96b8b529951bcc77688eae52d1896a9be91410be5a6","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-18T06:34:40.430872+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-15T21:14:38.788625Z","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-15T21:14:39.023333Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.02532","last_updated":"2023-03-05T00:26:10Z","snapshot_observed_at":"2026-08-16T15:50:46.543564Z","submitted_at":"2023-03-05T00:26:10Z","title":"PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities","version":1},"cited_work":{"arxiv_id":"2303.02532","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.02532","snapshot_observed_at":"2026-08-15T21:14:39.023333Z","title":"PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities","venue":"cs.LG","work_id":"4dea87b9-64d3-4d40-9250-d73f98c99c66","year":2023},"citing_paper":{"arxiv_id":"2505.10631","last_updated":"2025-05-15T18:12:31Z","snapshot_observed_at":"2026-08-15T21:04:07.971416Z","submitted_at":"2025-05-15T18:12:31Z","title":"Decentralized Min-Max Optimization with Gradient Tracking","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:14:38.788625Z"},"links":{"cited_paper":"/paper/2303.02532","citing_paper":"/paper/2505.10631"},"observation_digest":"sha256:bb1ff64472efeefe56d63da1d1df70049b0852538faad67915b3ffb052782b2f","observation_id":"fe1b6b42-27c2-4282-b1e0-867bd1f32afa","resolution":{"observed_at":"2026-08-15T21:14:39.028060Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2303.02532/citation-record","integrity":"/paper/2303.02532/integrity","json":"/paper/2303.02532/citation-record.json","paper":"/paper/2303.02532"},"outbound":[],"paper":{"arxiv_id":"2303.02532","last_updated":"2023-03-05T00:26:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:50:46.543564Z","submitted_at":"2023-03-05T00:26:10Z","title":"PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2303.02532."}