{"as_of":"2026-08-08T06:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7119bdfb8ca7317569879b69060b8294d1b6e596547290e72d714e72c1fc9605","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:10:12.138443Z","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-23T06:25:28.048062Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-07-06T16:35:11.681492Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":"2310.12139","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal and parameter-free gra- dient minimization methods for convex and nonconvex optimization","venue":null,"work_id":"8854a7eb-b6a6-4fd5-9021-59d1102ac355","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":24,"source":"pdf_text","source_observed_at":"2026-05-23T06:23:51.617737Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2412.14291"},"observation_digest":"sha256:e2209ced6fb4712a882b744ff5ab4f2bd25544d878947c43a5ea3db77d2730d8","observation_id":"049e9f33-2098-4397-94b6-85a9259d4656","resolution":{"observed_at":"2026-05-23T06:25:28.051347Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-07-06T16:35:11.681492Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-08-07T13:10:12.138443Z","title":"Optimal and parameter-free gradient minimization methods for smooth optimization.arXiv preprint arXiv:2310.12139, 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":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:12.138443Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2505.23081"},"observation_digest":"sha256:d02375a2dacbe104b02532d64c11ba04d9776682f14a874d2342e7e61732156c","observation_id":"2f51d06b-a0fb-4662-b0ab-143ebea5d09d","resolution":{"observed_at":"2026-08-07T13:10:12.138443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-07-06T16:35:11.681492Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":"2310.12139","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal and parameter-free gra- dient minimization methods for convex and nonconvex optimization","venue":null,"work_id":"8854a7eb-b6a6-4fd5-9021-59d1102ac355","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":22,"source":"pdf_text","source_observed_at":"2026-05-18T17:20:09.257391Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2509.11043"},"observation_digest":"sha256:06eda336d3130f6acc2bb48bc7ff222689fc8aec51342a1533dbcce8e3b80ec3","observation_id":"3136f5e9-3b2c-4c6a-aa39-8173c4a07d28","resolution":{"observed_at":"2026-05-18T17:21:40.034267Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-07-06T16:35:11.681492Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-08-03T09:22:12.506552Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.14680","last_updated":"2026-06-02T02:28:42Z","snapshot_observed_at":"2026-08-05T07:22:40.350255Z","submitted_at":"2026-01-21T05:51:32Z","title":"Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization I: Convex Optimization","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T09:22:12.506552Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2601.14680"},"observation_digest":"sha256:59f88b773e216209f6890b9318ac9d3a32bc36682a91b3b9f757116658dd9bdd","observation_id":"e2c772a2-e3c8-4dee-b837-4bbb2831cb2a","resolution":{"observed_at":"2026-08-03T09:22:12.506552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-07-06T16:35:11.681492Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":"2310.12139","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal and parameter-free gra- dient minimization methods for convex and nonconvex optimization","venue":null,"work_id":"8854a7eb-b6a6-4fd5-9021-59d1102ac355","year":2023},"citing_paper":{"arxiv_id":"2603.23492","last_updated":"2026-05-16T02:51:45Z","snapshot_observed_at":"2026-07-06T22:50:23.931381Z","submitted_at":"2026-03-24T17:57:36Z","title":"Universal and Parameter-free Gradient Sliding for Composite Optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T10:26:12.965171Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2603.23492"},"observation_digest":"sha256:49eb71403dc55c06787a283bd1e2c23bacbd347a864d91461ae70a3c03b46451","observation_id":"bbc1a885-9203-44e2-adf5-66d59ac341b2","resolution":{"observed_at":"2026-05-21T10:30:00.355207Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-07-06T16:35:11.681492Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":"2310.12139","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal and parameter-free gra- dient minimization methods for convex and nonconvex optimization","venue":null,"work_id":"8854a7eb-b6a6-4fd5-9021-59d1102ac355","year":2023},"citing_paper":{"arxiv_id":"2604.18321","last_updated":"2026-04-20T14:20:52Z","snapshot_observed_at":"2026-07-06T23:05:13.178333Z","submitted_at":"2026-04-20T14:20:52Z","title":"Accuracy Certificates for Convex Optimization at Accelerated Rates via Primal-Dual Averaging","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-10T04:04:34.684258Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2604.18321"},"observation_digest":"sha256:32ba979060a593bdd216f2da3e3cbfccbbd9479c330e4e81086add6e108cb072","observation_id":"14e53317-7909-4df5-81a4-fefaa3ed2804","resolution":{"observed_at":"2026-05-11T12:11:08.121071Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-07-06T16:35:11.681492Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":"2310.12139","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal and parameter-free gra- dient minimization methods for convex and nonconvex optimization","venue":null,"work_id":"8854a7eb-b6a6-4fd5-9021-59d1102ac355","year":2023},"citing_paper":{"arxiv_id":"2605.18604","last_updated":"2026-05-18T16:14:04Z","snapshot_observed_at":"2026-07-06T23:29:29.105126Z","submitted_at":"2026-05-18T16:14:04Z","title":"Efficient Gradient Methods for Distributed Saddle Problems","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-20T08:39:37.686041Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2605.18604"},"observation_digest":"sha256:22651d3cef64bcebd25b983634405f7e938777c9d00eb71619cb83f437488e30","observation_id":"a2702532-9101-40c7-8a20-58618fa118ee","resolution":{"observed_at":"2026-05-20T08:43:10.151901Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.12139/citation-record","integrity":"/paper/2310.12139/integrity","json":"/paper/2310.12139/citation-record.json","paper":"/paper/2310.12139"},"outbound":[],"paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T16:35:11.681492Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2310.12139."}