{"as_of":"2026-08-17T07:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3839b309c5f2d3da539a64c4e441deff58409496088fe090b7d654d8e66523b9","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:30:24.992058Z","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:53:54.481823Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1709.03594","last_updated":"2017-11-03T19:30:10Z","snapshot_observed_at":"2026-08-14T20:34:12.600151Z","submitted_at":"2017-09-11T20:59:25Z","title":"Lower Bound for Randomized First Order Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.03594","snapshot_observed_at":"2026-08-15T23:30:24.992058Z","title":"Lower bound for randomiz ed first order convex optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04599","last_updated":"2025-05-07T17:40:12Z","snapshot_observed_at":"2026-08-16T19:42:40.483998Z","submitted_at":"2025-05-07T17:40:12Z","title":"Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T23:30:24.992058Z"},"links":{"cited_paper":"/paper/1709.03594","citing_paper":"/paper/2505.04599"},"observation_digest":"sha256:1a3fc7a1da1286ee4f639997c426dac7c7884cc0e0cc625f8df76ff067c9244b","observation_id":"169bd41b-dcaa-489f-a398-2a81204853fc","resolution":{"observed_at":"2026-08-15T23:30:24.992058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.03594","last_updated":"2017-11-03T19:30:10Z","snapshot_observed_at":"2026-08-14T20:34:12.600151Z","submitted_at":"2017-09-11T20:59:25Z","title":"Lower Bound for Randomized First Order Convex Optimization","version":2},"cited_work":{"arxiv_id":"1709.03594","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.03594","snapshot_observed_at":"2026-08-15T21:53:54.481823Z","title":"Lower Bound for Randomized First Order Convex Optimization","venue":"math.OC","work_id":"34fe130b-fa49-4b46-94b1-24ba7876d156","year":2017},"citing_paper":{"arxiv_id":"2505.09045","last_updated":"2025-05-14T00:54:49Z","snapshot_observed_at":"2026-08-15T21:39:21.843370Z","submitted_at":"2025-05-14T00:54:49Z","title":"The Adaptive Complexity of Finding a Stationary Point","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T21:53:54.325240Z"},"links":{"cited_paper":"/paper/1709.03594","citing_paper":"/paper/2505.09045"},"observation_digest":"sha256:2d05a67c2c3b12a829c89a7f8697e382ee57d59596daea370de981f8b26ac345","observation_id":"5ca7a3b8-2976-4994-bf62-63600b6252ed","resolution":{"observed_at":"2026-08-15T21:53:54.486234Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.03594","last_updated":"2017-11-03T19:30:10Z","snapshot_observed_at":"2026-08-14T20:34:12.600151Z","submitted_at":"2017-09-11T20:59:25Z","title":"Lower Bound for Randomized First Order Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.03594","snapshot_observed_at":"2026-08-01T20:45:28.179176Z","title":"arXiv preprint arXiv:1709.03594 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16558","last_updated":"2026-07-30T16:36:33Z","snapshot_observed_at":"2026-08-17T00:46:12.964990Z","submitted_at":"2026-07-18T00:04:07Z","title":"Near-Optimal Lower Bounds for Randomized Algorithms in Exact Value Zeroth-Order Convex Optimization","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.179176Z"},"links":{"cited_paper":"/paper/1709.03594","citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:dccf3e2a6f175bae1c50bd4555acd7ccccffdcf39126c0a53a0693cf3b8d964c","observation_id":"5ca466e7-de04-40e9-996e-ddc101175466","resolution":{"observed_at":"2026-08-01T20:45:28.179176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1709.03594/citation-record","integrity":"/paper/1709.03594/integrity","json":"/paper/1709.03594/citation-record.json","paper":"/paper/1709.03594"},"outbound":[],"paper":{"arxiv_id":"1709.03594","last_updated":"2017-11-03T19:30:10Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T20:34:12.600151Z","submitted_at":"2017-09-11T20:59:25Z","title":"Lower Bound for Randomized First Order 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1709.03594."}