{"as_of":"2026-08-13T23:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0362a7decf362103c1b2e05e6283e8f2339b17fe7e960221ebf655f28c20237e","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-13T06:32:02.005865+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-11T04:26:16.692003Z","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-06-30T20:05:04.717541Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-08-10T15:17:17.824988Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-08-06T05:56:11.926307Z","title":"Suh and Shiqian Ma","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-10T15:17:34.764887Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T05:56:11.926307Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2508.01353"},"observation_digest":"sha256:37d2418c8bbc1f4068191f34049fcaae48f6d36f95b4bd58029f3372617e70d7","observation_id":"2892f6ac-b865-4f2d-b095-dc44e74f3252","resolution":{"observed_at":"2026-08-06T05:56:11.926307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-08-10T15:17:17.824988Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":"2505.11670","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-06-30T20:05:04.717541Z","title":"Suh and Shiqian Ma","venue":null,"work_id":"e08f7cb5-f9e3-4503-8df4-42f4e09d5bec","year":2025},"citing_paper":{"arxiv_id":"2603.23492","last_updated":"2026-05-16T02:51:45Z","snapshot_observed_at":"2026-08-13T19:02:29.138052Z","submitted_at":"2026-03-24T17:57:36Z","title":"Universal and Parameter-free Gradient Sliding for Composite Optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-21T10:26:12.965171Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2603.23492"},"observation_digest":"sha256:1eec5be312c0d59cb39f53cc845bff6807abe1ba2f677ad611dc48a164056737","observation_id":"147e7abe-54b3-4f30-8373-fa087e08f3ba","resolution":{"observed_at":"2026-05-21T10:30:00.359166Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-08-10T15:17:17.824988Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":"2505.11670","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-06-30T20:05:04.717541Z","title":"Suh and Shiqian Ma","venue":null,"work_id":"e08f7cb5-f9e3-4503-8df4-42f4e09d5bec","year":2025},"citing_paper":{"arxiv_id":"2604.06525","last_updated":"2026-04-14T04:56:12Z","snapshot_observed_at":"2026-08-02T21:35:49.903063Z","submitted_at":"2026-04-07T23:43:48Z","title":"Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T18:23:59.771222Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2604.06525"},"observation_digest":"sha256:e417da4ae0132f9a665c1f377632885779ca9e5c6be16ec5d83fb07d054ad454","observation_id":"9485163c-9c94-4435-bfb1-43fa9d7db78c","resolution":{"observed_at":"2026-05-11T00:41:05.427182Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-08-10T15:17:17.824988Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":"2505.11670","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-06-30T20:05:04.717541Z","title":"Suh and Shiqian Ma","venue":null,"work_id":"e08f7cb5-f9e3-4503-8df4-42f4e09d5bec","year":2025},"citing_paper":{"arxiv_id":"2605.15512","last_updated":"2026-05-28T00:40:19Z","snapshot_observed_at":"2026-07-06T23:26:46.595393Z","submitted_at":"2026-05-15T01:12:32Z","title":"Auto-Conditioned Frank-Wolfe Algorithms","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-19T15:34:35.086823Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2605.15512"},"observation_digest":"sha256:c610847b6f128ab180bdbeef68b2cdab382f74b38831af233e502dd2f3a87d17","observation_id":"5f5aec34-0fd0-4bf6-9e7b-bf7d1882284b","resolution":{"observed_at":"2026-05-19T15:37:37.285325Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-08-10T15:17:17.824988Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":"2505.11670","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-06-30T20:05:04.717541Z","title":"Suh and Shiqian Ma","venue":null,"work_id":"e08f7cb5-f9e3-4503-8df4-42f4e09d5bec","year":2025},"citing_paper":{"arxiv_id":"2605.15512","last_updated":"2026-05-28T00:40:19Z","snapshot_observed_at":"2026-07-06T23:26:46.595393Z","submitted_at":"2026-05-15T01:12:32Z","title":"Auto-Conditioned Frank-Wolfe Algorithms","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-30T20:01:43.310456Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2605.15512"},"observation_digest":"sha256:92c7947407c6b0fbd001c6b124a64f9fae3a330b90d58ce45b1971e389376565","observation_id":"9d5822cf-4524-43d4-92bd-f65f0e9f313e","resolution":{"observed_at":"2026-06-30T20:05:04.719271Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-08-10T15:17:17.824988Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"An adaptive and parameter-free nesterov’s accelerated gradient method for convex optimization.arXiv preprint arXiv:2505.11670, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-08-13T19:02:30.164749Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:d4e20badeb8d685f5f81b71e2f33b1f641eadd74b7841048a367616e0fd9d97a","observation_id":"f51df9a8-62ef-4923-92b1-6e9b35a593bc","resolution":{"observed_at":"2026-07-14T02:28:43.704810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-08-10T15:17:17.824988Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-08-11T04:26:16.692003Z","title":"arXiv preprint arXiv:2505.11670 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03170","last_updated":"2026-08-10T05:24:38Z","snapshot_observed_at":"2026-08-13T22:38:22.490985Z","submitted_at":"2026-08-04T06:01:34Z","title":"Optimal Nonergodic Primal-Dual Complexity of Efficient Inexact Parameter-Free Augmented Lagrangian Methods","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T04:26:16.692003Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2608.03170"},"observation_digest":"sha256:7f95b8d981681c51266306cd012d2ccddf5bdfda7f43f29f5be96fee1a33193c","observation_id":"bfc0e496-c14b-4349-8a52-f20e211b59a7","resolution":{"observed_at":"2026-08-11T04:26:16.692003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.11670/citation-record","integrity":"/paper/2505.11670/integrity","json":"/paper/2505.11670/citation-record.json","paper":"/paper/2505.11670"},"outbound":[],"paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T15:17:17.824988Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method 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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2505.11670."}