{"as_of":"2026-08-09T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ef77971cd88ad59556fe6a176a02f422e8cf3ec800cb1e4ff75b4e9a76c86b2","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-09T06:31:02.800959+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-08T00:23:42.227303Z","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:a18fa410e81be656dc446cee0d43bf0ae017c06c45ff1bcb34a5801a8f09acc8","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-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"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-08T00:23:42.227303Z","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:cab6f09a0e52edd9f0fc39c4a910151471f9394b843e6aaede322dc2acca1686","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-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"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-08T00:23:42.227303Z","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-08T18:37:56.883291Z","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:5fdb54553b8e2424c0bfe5cba994323b9711de486afab9ef9ba40c0fd372e418","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-08T00:23:42.227303Z","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-08T05:47:28.129882Z","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:3632782b0a38ec701ac4d5b66307d4051bb790d237305a86c6ebf8041decd758","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-08T00:23:42.227303Z","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-07T05:32:36.448884Z","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:93cfd9379daa8624c3fb366d3b8a119f953a9ba692142cb8eaf105578a291de6","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-08T00:23:42.227303Z","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:2d8263c040961a1c20a7b2acae50a162946d8f9ddfb4d0028799578c03f65e9d","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-08T00:23:42.227303Z","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-09T03:45:24.611655Z","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:78acd260bf1f8029dd7b54eb9935835e5cc24c4dcf1825e92e88ff6404bac2f3","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-08T00:23:42.227303Z","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:bd989f6d6dffc6b6e451ce9ab65318d372b5b4ab86ac1934481c7676be4825ef","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-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/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-08T00:23:42.227303Z","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-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 8 inbound Pith citation observations for arXiv:2310.10082."}