{"as_of":"2026-08-17T06:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8ccceca31974115aad41e7d91898295ab78312fd0e09b65e301ea1e4cf3a2ca","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T20:45:30.858610Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.16558/citation-record","integrity":"/paper/2607.16558/integrity","json":"/paper/2607.16558/citation-record.json","paper":"/paper/2607.16558"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:25.990744Z","title":"Foundations of Computational Mathematics , volume=","venue":null,"work_id":null,"year":2017},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:25.990744Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:0f10c1af2b4cd612723bb5698e1fdeb6bcdfc504100ff43b719bad37c72ec24a","observation_id":"daea7883-ef02-4f4d-8360-29ce4ed71f8a","resolution":{"observed_at":"2026-08-01T20:45:25.990744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.103466Z","title":"Conference on Learning Theory , 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":2,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.103466Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:e86bcfe4a325e74f024a0ee779bf30be4fff4f1a9c354cd7e02f5f129937d4ab","observation_id":"5ff808a3-db42-4439-a6e7-3cf23c8b3ec2","resolution":{"observed_at":"2026-08-01T20:45:26.103466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.189434Z","title":"2009 , publisher=","venue":null,"work_id":null,"year":2009},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.189434Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:9c5ed5137ebc6f98c9f03db928189391e2ba0e327afea224d12c6517ae6634c0","observation_id":"4bdfddfe-758c-4d28-8cc1-ece0081c0fdb","resolution":{"observed_at":"2026-08-01T20:45:26.189434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.377969Z","title":"Automation and Remote Control , volume=","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":4,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.377969Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:64e4aee2cc251f3bcc99cba325b8d69aedcfc7b71e9f863ecaf1c4fa7322e886","observation_id":"987eb17a-e9c7-4bd0-97b1-9b7a64f99b53","resolution":{"observed_at":"2026-08-01T20:45:26.377969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.511697Z","title":"Black-box optimization of noisy functions with unknown smoothness , 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":5,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.511697Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:2d5260dc0eae9b2d8f4c786ef982ac933295fcdbd398693953e0d3e196d06e9e","observation_id":"00cd46a2-1803-44ae-a99c-c868f83ef31f","resolution":{"observed_at":"2026-08-01T20:45:26.511697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.645704Z","title":null,"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":6,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.645704Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:e0119ac93f8608424759af5b931b8da42115aca16545e3421e41a0b72bf8f25f","observation_id":"0e59124c-c87d-48ce-841d-20db55b2530e","resolution":{"observed_at":"2026-08-01T20:45:26.645704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.732137Z","title":"Journal of Machine Learning Research , volume=","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":7,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.732137Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:a9301c085353ecd7dbc563d40d4a5623d704c3a24c1d5c66ba8c991143d605b4","observation_id":"fd2c3913-cef8-4f9b-9077-1e8a68b7d158","resolution":{"observed_at":"2026-08-01T20:45:26.732137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.799562Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2021},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.799562Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:f677f0112758daea88c7040ea3252f97d24a0c13f3013bd24bc0c8cac062d59c","observation_id":"e393b695-4219-422d-bacd-f7e1137ce9d6","resolution":{"observed_at":"2026-08-01T20:45:26.799562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.865265Z","title":null,"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":9,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.865265Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:ce8df6b8d9c93817e8a76290c2e5047e35ce277ed8ffdaeaaa494f1f1115be65","observation_id":"d41fda6b-7097-49f2-be1a-a018f93e3708","resolution":{"observed_at":"2026-08-01T20:45:26.865265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:26.942545Z","title":"Hessian-Aware Zeroth-Order Optimization , 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":10,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:26.942545Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:449a2cf5bf71055a26fe23f265879c41cf94cadf2ab1e246780698052d1405eb","observation_id":"f9567133-4a3c-4657-9720-0c3a3b005977","resolution":{"observed_at":"2026-08-01T20:45:26.942545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.018917Z","title":"International Conference on Machine Learning , 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":11,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.018917Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:b08ddb27d6b1f711ca1a7f3c8ae29fc7800511d2af747954cf70b5bea554eefc","observation_id":"641b4288-04d0-4e70-9b3a-c2b475a144ae","resolution":{"observed_at":"2026-08-01T20:45:27.018917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.072140Z","title":"Clip-tuning:","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":12,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.072140Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:366050ee1d1bdd00641be0cbbd795e5b756b08a538ad37f76273c3f1a9c1e231","observation_id":"d95281e4-ed6c-427f-ac47-72fde9f983f8","resolution":{"observed_at":"2026-08-01T20:45:27.072140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.160137Z","title":"Neural Information Processing Systems , 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":13,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.160137Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:57914e7a66b4da625e7bb451c5bb4f8477dc3c36d52c54017ef3be0a4662a184","observation_id":"111f2947-fd10-4255-84da-1c518f027e41","resolution":{"observed_at":"2026-08-01T20:45:27.160137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.234653Z","title":"Elasticzo:","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":14,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.234653Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:dc15d4b4e3c52f3c2370603c6030035f261267fd1594e4016960e09882347a05","observation_id":"df48c014-e9d9-4ad9-8aa1-bac17cd00b73","resolution":{"observed_at":"2026-08-01T20:45:27.234653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.336849Z","title":"Lee and Wotao Yin and Mingyi Hong and Zhangyang Wang and Sijia Liu and Tianlong Chen , booktitle=","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":15,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.336849Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:e1618c8474dce7819aa65920ace9be7f39fc1961c3c7b297929867cc9a7ddf4e","observation_id":"cc7ac1e1-0106-48d2-9927-146c706bfb35","resolution":{"observed_at":"2026-08-01T20:45:27.336849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.422744Z","title":"Keyes and Di Wang , booktitle=","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":16,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.422744Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:7d7c805f4437fa47c2eaa35b1540adcd74200cff8f490af4b85159c1710584a8","observation_id":"94f2600c-08cf-402b-96b5-23306e8facb2","resolution":{"observed_at":"2026-08-01T20:45:27.422744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.491812Z","title":"Optimal rates for zero-order convex optimization:","venue":null,"work_id":null,"year":2015},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.491812Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:c4426efa1d84a6d81aba4de97965f314063634931c608761538b8c922a4cecf1","observation_id":"7da56785-2057-4769-a68d-8522fafe8401","resolution":{"observed_at":"2026-08-01T20:45:27.491812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.635968Z","title":"SIAM Journal on Optimization , volume=","venue":null,"work_id":null,"year":2013},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.635968Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:05e2df0dac33e7ed32999d0aba9d1bb0fa8d3361d8796e11e190de4e495c6a34","observation_id":"63c3d7e6-8c15-442a-a31e-83597062a016","resolution":{"observed_at":"2026-08-01T20:45:27.635968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.766513Z","title":"2018 , publisher=","venue":null,"work_id":null,"year":2018},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.766513Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:3e77f8c71db88e5a5bcbad311a277948072242574312dd356f91153902fda81a","observation_id":"5d6eccea-bf48-4cb4-abf3-91a162124187","resolution":{"observed_at":"2026-08-01T20:45:27.766513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.908214Z","title":"Journal of Machine Learning Research , volume=","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":20,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.908214Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:7065a8de33e0176d8215c6077673d5bf633fac0e14c0448e2701e6f4ad80f290","observation_id":"415d188f-973b-41cb-a01b-78ca7db998b5","resolution":{"observed_at":"2026-08-01T20:45:27.908214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:27.978909Z","title":"Journal of Machine Learning Research , 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":21,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:27.978909Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:ad062e6691168dcffde0cb466e5250977a2ea91e4a812ff00a1b29c41957fccd","observation_id":"80809cee-1b95-4227-9056-c2d76485fb6b","resolution":{"observed_at":"2026-08-01T20:45:27.978909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:28.028050Z","title":"Lower bounds for finding stationary points","venue":null,"work_id":null,"year":2020},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.028050Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:c2f4ac985e205d15e697484066f11eb755011e43473d2fd9ef46fa385d082b92","observation_id":"ab9a7774-a8a2-4e61-aae9-d0bbc0abff32","resolution":{"observed_at":"2026-08-01T20:45:28.028050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:28.117054Z","title":"and Hinder, Oliver and Sidford, Aaron , title =","venue":null,"work_id":null,"year":2021},"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":23,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.117054Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:a1fe76e528bbbe76ec3a78307f2c8675e2d44f384869f4a0b3ace3f4f0226265","observation_id":"fc42eaea-3e5f-425b-96b9-00867462ac2e","resolution":{"observed_at":"2026-08-01T20:45:28.117054Z","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":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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:28.285815Z","title":"Finite Sample Convergence Rates of Zero-Order Stochastic Optimization Methods , 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":25,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.285815Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:b601de655699e40fc63e8f2cf303bb176f43cbc5cc485c504456bf16b840cc01","observation_id":"5d502faa-f03d-474d-8623-329343ba487c","resolution":{"observed_at":"2026-08-01T20:45:28.285815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:28.402590Z","title":"Neural Information Processing Systems , 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":26,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.402590Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:f856bfa42942a96c3844275f20b4d8ebd136ea1405456fcd7d7353cdf9372439","observation_id":"aa34c04c-e4a2-4df3-869b-681f59a04856","resolution":{"observed_at":"2026-08-01T20:45:28.402590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:28.525031Z","title":"SIAM Journal on Optimization , volume=","venue":null,"work_id":null,"year":2012},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.525031Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:c40b9bc2f2c893ee456d8aeb31683e4dbe8cbf8028ce06303678ad64edaae937","observation_id":"3d1e2452-2511-497d-9c9f-9b442ee16064","resolution":{"observed_at":"2026-08-01T20:45:28.525031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:28.631786Z","title":"Convex optimization:","venue":null,"work_id":null,"year":2015},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.631786Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:42db69dc9fe8e36cda6fb24f3c5a2f9e3f5aa4e4ddb844bd961455f05666ac53","observation_id":"7f48b5e4-1969-4170-b9a1-88573fdb0301","resolution":{"observed_at":"2026-08-01T20:45:28.631786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:28.764402Z","title":"International Conference on Machine Learning , 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":29,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.764402Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:237fb7ef1817f776b8a944ebab0972592ec05916df275aabe8e2a6e52e54c1aa","observation_id":"25c8f75a-e713-4a22-9284-2d46d97c4d67","resolution":{"observed_at":"2026-08-01T20:45:28.764402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:28.929462Z","title":"Neural Information Processing Systems , 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":30,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:28.929462Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:157119060dd617b342d58e6f1c44fbd550e1a73e0e63f4a78ba8a55730aff7a6","observation_id":"e7339868-a800-4dc1-90ef-fc1ad273a2fa","resolution":{"observed_at":"2026-08-01T20:45:28.929462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.004423Z","title":"On the complexity of finite-sum smooth optimization under the","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":31,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.004423Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:0e9217159c74f9a47d84e7bf84da2fa7ddbe7cce86a2c755f863c3e8eefca957","observation_id":"a6213173-3f31-4175-b50b-08c30184d8ad","resolution":{"observed_at":"2026-08-01T20:45:29.004423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.062989Z","title":"On the lower bound of minimizing","venue":null,"work_id":null,"year":2023},"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":32,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.062989Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:4731bf731e316a82397194b2495950e1abe8f26c7f60dea333fe7494f7f5f831","observation_id":"0f2fb261-3721-495c-9dca-93c0804b402f","resolution":{"observed_at":"2026-08-01T20:45:29.062989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.127073Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2019},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.127073Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:b047a045a2b344cda80a407418d897ddf56d35d58d16c94b6d78727b278d40ab","observation_id":"7d9c9407-9f53-4ad9-925f-d5b1c9fd8922","resolution":{"observed_at":"2026-08-01T20:45:29.127073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.205770Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2023},"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":34,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.205770Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:975d6801116c064bbc0f152e0e98d23008ba5c31e57658dfbbea1dd658c6b131","observation_id":"bba77698-3335-4873-9141-9be7b9f22603","resolution":{"observed_at":"2026-08-01T20:45:29.205770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.320560Z","title":"Second-order information in non-convex stochastic optimization:","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":35,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.320560Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:ceaee28a584ac74227c7f5e9a6c31ee4419f54bf5f054a81c48278aecef26efc","observation_id":"1248566e-ba88-4656-8cb5-f2f3b4fbf59a","resolution":{"observed_at":"2026-08-01T20:45:29.320560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.430204Z","title":null,"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":36,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.430204Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:0280c5b4dc9e555cef872b7f97a92b2ee43db34119bf5e0ea81c2a3369f79e2b","observation_id":"b6208ae1-ea6d-4d24-9077-c1f84fa0c469","resolution":{"observed_at":"2026-08-01T20:45:29.430204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.603725Z","title":"Acta Sci","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":37,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.603725Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:93bd77a867039dea3a5310655b4c60f865684a705bdced35c9caa5edfd0c5285","observation_id":"d2fefe44-62ca-40d2-ad41-46eb56a12db8","resolution":{"observed_at":"2026-08-01T20:45:29.603725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.740060Z","title":"On extensions of the","venue":null,"work_id":null,"year":1976},"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":38,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.740060Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:db49a7a661e33967587f0b0132cba2d8994be3a3f198812e1192698bcac0938b","observation_id":"ac7e14d4-95d7-4a31-a8ed-81c7be41cc4f","resolution":{"observed_at":"2026-08-01T20:45:29.740060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:29.848657Z","title":"Transportation cost for","venue":null,"work_id":null,"year":1996},"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":39,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:29.848657Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:6ccab4a4115536a856c5e78fedc5ee12ab3c03dc76c88f7d73962eecf2646c75","observation_id":"1ffba34c-e55f-4340-a3c3-4167cac2db00","resolution":{"observed_at":"2026-08-01T20:45:29.848657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:30.021188Z","title":null,"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":40,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:30.021188Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:e317a024534add87b5579177112e1108fc26fb4927633c598a119ee5823d8763","observation_id":"38353d11-66ed-46ba-bf00-a21172de9768","resolution":{"observed_at":"2026-08-01T20:45:30.021188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:30.111652Z","title":"Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory , 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":41,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:30.111652Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:d2935f70933f3e71620ab389fd5dc67c271e7d52c6ed4b607e28222b01ed5a35","observation_id":"79ec3275-49b9-4753-9dd3-1d5b5d94ac58","resolution":{"observed_at":"2026-08-01T20:45:30.111652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:30.226892Z","title":"Corrections to “","venue":null,"work_id":null,"year":2024},"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":42,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:30.226892Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:aca5d81b0f3668d9def6fba3ba6229305e169f0ecef0f4818949fdc89e51a52b","observation_id":"69eaaee6-e50a-456b-bf06-fb7d6c9503b3","resolution":{"observed_at":"2026-08-01T20:45:30.226892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:30.345952Z","title":"2017 , publisher=","venue":null,"work_id":null,"year":2017},"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":43,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:30.345952Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:7b50bef7d6013e2a73cc1315fec2c586af34c307757f8139f9a9679f3238f928","observation_id":"90ad3c67-e0df-4a99-96ad-252eeef7e03b","resolution":{"observed_at":"2026-08-01T20:45:30.345952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:30.456587Z","title":"Probabilistic computations:","venue":null,"work_id":null,"year":1977},"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":44,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:30.456587Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:510bbaa26bceafa4569039c218ac0297d2902bcb0412b369f23d56d04c6aa228","observation_id":"c46731fc-0158-419e-9a6e-132ac9e8be18","resolution":{"observed_at":"2026-08-01T20:45:30.456587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:30.566869Z","title":"Generalization of an inequality by","venue":null,"work_id":null,"year":2000},"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":45,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:30.566869Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:edccacd5ee8c31007d8a0cdf54fee5fc82b29004b123ad4c4dc78713948fc5ee","observation_id":"123eefe7-8e0a-4bd1-9a3c-a6a7c45bca63","resolution":{"observed_at":"2026-08-01T20:45:30.566869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:30.724545Z","title":"Mathematical Notes , volume=","venue":null,"work_id":null,"year":1996},"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":46,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:30.724545Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:1d3f29cd431aeb34bc4225abd046de44aa3e8e0ff207c0d67f8318e5fdc58c5e","observation_id":"c46d8e71-4fd6-4843-88b9-fa0e260e0b9f","resolution":{"observed_at":"2026-08-01T20:45:30.724545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:45:30.858610Z","title":"Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization:","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":47,"source":"arxiv_source","source_observed_at":"2026-08-01T20:45:30.858610Z"},"links":{"citing_paper":"/paper/2607.16558"},"observation_digest":"sha256:fdf55b187c3c9d85a9b107ccb0e3e02289ffe14ec84c77fea405bd416233673b","observation_id":"28d6396c-7c27-4326-a861-bb5ed3d09500","resolution":{"observed_at":"2026-08-01T20:45:30.858610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16558","last_updated":"2026-07-30T16:36:33Z","latest_version":2,"primary_category":"math.OC","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"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":47},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2607.16558."}