{"as_of":"2026-08-11T09:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64b9d720cdfe4507162a00455d5f48b470d2f8930b3f4d9754ab854db8948be2","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:49:52.499732Z","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-23T07:42:42.957198Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":"2310.10082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Li and G","venue":null,"work_id":"440a3e65-e473-4508-a379-f3cf903ce5d3","year":2023},"citing_paper":{"arxiv_id":"2412.06319","last_updated":"2026-04-16T15:15:47Z","snapshot_observed_at":"2026-07-06T20:03:47.277630Z","submitted_at":"2024-12-09T09:13:54Z","title":"Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-23T07:42:25.733968Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2412.06319"},"observation_digest":"sha256:f9b602e8e552c07af372660b74f8728bed942181db7643fa5a796763569c73e2","observation_id":"a7f3055d-392f-440a-91b0-0721d190d985","resolution":{"observed_at":"2026-05-23T07:42:42.961285Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":"2310.10082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Li and G","venue":null,"work_id":"440a3e65-e473-4508-a379-f3cf903ce5d3","year":2023},"citing_paper":{"arxiv_id":"2412.14291","last_updated":"2026-05-14T16:58:17Z","snapshot_observed_at":"2026-07-06T20:09:33.491422Z","submitted_at":"2024-12-18T19:34:16Z","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-23T06:23:51.617737Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2412.14291"},"observation_digest":"sha256:97a2481f95a9b19c4b1a6638d3f918a8451e7ec624d33ebb87c49b0aaece72e0","observation_id":"17b0771c-7440-4330-8c40-5bce85efbd3c","resolution":{"observed_at":"2026-05-23T06:25:28.073687Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-08-08T18:49:52.499732Z","title":"A simple uniformly optimal method without line search for convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-09T19:08:23.815423Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.499732Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:413407e458b911738d4d5a1e3859503a512878072b6cf5f30192ddb21f8f0c08","observation_id":"dc27d49f-6d70-4de7-8556-123ac7ef1ae7","resolution":{"observed_at":"2026-08-08T18:49:52.499732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-08-07T13:10:12.329475Z","title":"A simple uniformly optimal method without line search for convex opti- mization.arXiv preprint arXiv:2310.10082, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23081","last_updated":"2025-09-05T02:19:47Z","snapshot_observed_at":"2026-08-10T15:27:55.230768Z","submitted_at":"2025-05-29T04:35:21Z","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:12.329475Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2505.23081"},"observation_digest":"sha256:a15c01cd6e8a85ddf2403c91b21137aa4468c190fde6a9644bc96b8d263901cd","observation_id":"5f05fe23-b761-4118-9756-402baffd1343","resolution":{"observed_at":"2026-08-07T13:10:12.329475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-08-07T05:47:48.443882Z","title":"Li and G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07397","last_updated":"2025-06-09T03:39:21Z","snapshot_observed_at":"2026-08-09T19:07:53.014111Z","submitted_at":"2025-06-09T03:39:21Z","title":"Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:48.443882Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2506.07397"},"observation_digest":"sha256:c03026eb9347bb162bf7a062dd18801a7a6d1b9a5a16b779e7c39151ae7897bc","observation_id":"b5c63562-f318-4e1e-afc2-981cd77cfa44","resolution":{"observed_at":"2026-08-07T05:47:48.443882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-08-07T05:24:28.611408Z","title":"A High Probability Analysis of Adaptive SGD with Mo- mentum","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.08419","last_updated":"2025-06-10T03:46:41Z","snapshot_observed_at":"2026-08-09T02:44:15.496942Z","submitted_at":"2025-06-10T03:46:41Z","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:28.611408Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2506.08419"},"observation_digest":"sha256:20298dbf1a4ccd29c84915d3ecdbe76620cdaaca209392f2290500ad643b9965","observation_id":"1a7f0fb7-aca2-4c02-842a-88d3e1c121da","resolution":{"observed_at":"2026-08-07T05:24:28.611408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-08-06T17:59:07.249015Z","title":"and Lan, G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.249015Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:dcac6a97f2a8f100ba1f0454c0e80a1b108f4dc669755adce4a46569012b5195","observation_id":"6bfe14ab-f60b-4826-bfc9-c353829fd351","resolution":{"observed_at":"2026-08-06T17:59:07.249015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":"2310.10082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Li and G","venue":null,"work_id":"440a3e65-e473-4508-a379-f3cf903ce5d3","year":2023},"citing_paper":{"arxiv_id":"2509.11043","last_updated":"2026-04-03T14:30:55Z","snapshot_observed_at":"2026-07-06T22:29:48.011706Z","submitted_at":"2025-09-14T02:17:01Z","title":"A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T17:20:09.257391Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2509.11043"},"observation_digest":"sha256:bb2db639f1a387d1e1d9c26508222c8dd8555a8779710d26630a65bc5dceeaaa","observation_id":"97fff874-5793-4c70-bd6c-5441de448984","resolution":{"observed_at":"2026-05-18T17:21:40.018420Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.10082/citation-record","integrity":"/paper/2310.10082/integrity","json":"/paper/2310.10082/citation-record.json","paper":"/paper/2310.10082"},"outbound":[],"paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2310.10082."}