{"as_of":"2026-08-11T10:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:937ec8967172f15ab30f308b00bd4ba3932fe92a3118c46b03d3128df6e1c280","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:59:12.954685Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2506.20546/citation-record","integrity":"/paper/2506.20546/integrity","json":"/paper/2506.20546/citation-record.json","paper":"/paper/2506.20546"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.742247Z","title":"Safe zeroth-order optimization using quadratic local approximations","venue":null,"work_id":"007afbc7-0461-4d8d-8177-cb1bef06e1ff","year":2025},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:07.979932Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:42579227e03484def698b64f2edc98892f052aca1ffdadf17c403fd14b0c56b7","observation_id":"cdde3014-25a1-4cf7-8f3b-b3916d20e4b1","resolution":{"observed_at":"2026-08-06T22:59:19.746012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.733312Z","title":"Handbook of simulation optimization , volume 216","venue":null,"work_id":"c044de76-e2a4-436f-8aa3-4809f6cb0be2","year":2015},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.064736Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:b283e2f73f93446da0e8ec4f5f3393090db75875742c84f93015748afc516697","observation_id":"859b020c-5de8-4454-88ab-58cf10e1acde","resolution":{"observed_at":"2026-08-06T22:59:19.736472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.723866Z","title":"Stoc hastic zeroth-order functional constrained optimization: Oracle complexity and applications","venue":null,"work_id":"dfa9739a-c343-413d-9f76-1989db1356c7","year":2023},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.143361Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:56aecbc96d8defa685bb74a38790826f64273000ab18139a32d9979099befd2a","observation_id":"27b596f2-91f0-4f34-942f-12f1145cb5b2","resolution":{"observed_at":"2026-08-06T22:59:19.727280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.14703","last_updated":"2021-03-26T19:33:56Z","snapshot_observed_at":"2026-08-10T10:46:41.605043Z","submitted_at":"2021-03-26T19:33:56Z","title":"Model-Free Optimal Voltage Control via Continuous-Time Zeroth-Order Methods","version":1},"cited_work":{"arxiv_id":"2103.14703","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.14703","snapshot_observed_at":"2026-08-06T22:59:13.363139Z","title":"Model-Free Optimal Voltage Control via Continuous-Time Zeroth-Order Methods","venue":"math.OC","work_id":"41c4d4cd-0ef9-4026-bedc-9064bdfd4b25","year":2021},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.241877Z"},"links":{"cited_paper":"/paper/2103.14703","citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:d4d2302b086fdfd82fffd814697534edecae9452522148714ca021506048365b","observation_id":"54c8fb14-edc9-4ce9-b835-df6ad68f48ef","resolution":{"observed_at":"2026-08-06T22:59:13.437930Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00372","last_updated":"2023-11-01T08:53:11Z","snapshot_observed_at":"2026-08-06T17:30:55.865410Z","submitted_at":"2023-11-01T08:53:11Z","title":"Zeroth-Order Feedback-Based Optimization for Distributed Demand Response","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.00372","snapshot_observed_at":"2026-08-06T22:59:08.341566Z","title":"Zeroth-order feed back-based optimization for distributed de- mand response","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.341566Z"},"links":{"cited_paper":"/paper/2311.00372","citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:903147764b3b7d618feb9238139dc98cab2dc0370769af2aab075dbc307a49b0","observation_id":"18c1865b-8cb5-417c-86b0-8f17f963dfb7","resolution":{"observed_at":"2026-08-06T22:59:08.341566Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.714749Z","title":"direct search","venue":null,"work_id":"e95bfc26-9543-417f-bd69-86e4ef993159","year":1961},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.482480Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:723dc631be9e0679e8754e0baca8fe808da9cf4ae437addfd0b5217018d09287","observation_id":"bbb66b82-3477-44be-9ee0-4631cef6875d","resolution":{"observed_at":"2026-08-06T22:59:19.717827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.705011Z","title":"A simplex method for functio n minimization","venue":null,"work_id":"c8da776f-a68c-4179-b271-15affec32cd2","year":1965},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.591179Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:70bf26d004ea59278e2fb5dafd38132e3aa2e90d90dedacbc2dc9f45f13affbe","observation_id":"ed5e84a2-7588-43e8-8ac1-b420dcb2f3f3","resolution":{"observed_at":"2026-08-06T22:59:19.708661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.696012Z","title":"Numerical solution of a minimum problem","venue":null,"work_id":"f2611744-e4a1-414e-bd13-243a24740a41","year":1952},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.704466Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:9b8225726003206394720c34401ecd44793fafa700d2c7dd448a2c62799b3ff6","observation_id":"c30c1eab-3914-4dfb-9996-c39c06235387","resolution":{"observed_at":"2026-08-06T22:59:19.699450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.687685Z","title":"On the convergence of pattern search a lgorithms","venue":null,"work_id":"5a63ceb0-9c35-4985-9449-ed519a128c6b","year":1997},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.855655Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:3a6ecb6ccdab58a3070a1d9c35eba193926307053ac195d6bc5503dffc7e0018","observation_id":"7b089519-47df-4993-8d73-636794fb14ec","resolution":{"observed_at":"2026-08-06T22:59:19.690675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.679139Z","title":"Pattern s earch algorithms for bound constrained mini- mization","venue":null,"work_id":"c9cdd815-e3a0-4729-8ecf-85600420c015","year":1999},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:08.962858Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:4b858b2f2477bbe5862f23b23e9b9e06b0d5116d9f981a46d03a5af4b16e4ed5","observation_id":"ea5e34c5-59ee-433e-8db9-e4fe57137c78","resolution":{"observed_at":"2026-08-06T22:59:19.682090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.670859Z","title":"Mesh adaptive direct search algorithms for constrained optimiza- tion","venue":null,"work_id":"0d9c1af8-434d-495b-8652-b2fb661fc25d","year":2006},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.059736Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:ecc8f2b4e9e450220dea83900aded3b00d9fd4069031e95f9a91ea142cdebae1","observation_id":"35238cc1-d6c0-417e-bdb4-fee6fe6f0b60","resolution":{"observed_at":"2026-08-06T22:59:19.673839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.662738Z","title":"A g lobally convergent augmented lagrangian algorithm for optimization with general constraints and si mple bounds","venue":null,"work_id":"efa0ba9e-90bb-4e25-8e33-6c2d215ff011","year":1991},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.165636Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:8e0b38c9ea3800558a134d2d6469b910d5d77c6934dc3e9da6001e60b1313040","observation_id":"29e8f5f6-0e10-4ecc-b413-9a897811de26","resolution":{"observed_at":"2026-08-06T22:59:19.665475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.635482Z","title":"Bayesian optimisati on for constrained problems","venue":null,"work_id":"65a5ad23-ee0d-450a-a6c8-79c5dde7f060","year":2024},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.316436Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:cbe7b20426bc6e039279dfcbcec8e4fdd6bdbe707913a932b3a995e64be56076","observation_id":"a4be301f-95e1-4741-9651-0f30d2bd1e95","resolution":{"observed_at":"2026-08-06T22:59:19.656884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.458080Z","title":"Stochastic radial basis function algor ithms for large-scale optimization involving expensive black-box objective and constraint functions","venue":null,"work_id":"598d1da3-bdaa-4221-ae80-15d7e64db64b","year":2011},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.411927Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:23c401de5a1153fc805186905404419a6d0ed145a01d6e3bb2112b13f43e19d6","observation_id":"1309bd6e-f14c-4a1d-84e7-07051b5997dd","resolution":{"observed_at":"2026-08-06T22:59:19.586862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.205926Z","title":"A survey of surrogate approaches for exp ensive constrained black-box optimization","venue":null,"work_id":"4f8826ef-b281-4670-adc9-fec0ba395197","year":2020},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.500120Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:6f4f594ca1dffdd9045643f835cbcb0dc63bf5e785850455f359b46bb0056016","observation_id":"606738a9-7963-4d5a-8716-edf8b6633ad3","resolution":{"observed_at":"2026-08-06T22:59:19.313893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:19.052270Z","title":"Constrained stochastic black- box optimization using a progressive barrier and probabili stic estimates","venue":null,"work_id":"8a94159d-e728-4c49-9cea-002588dce9a4","year":2023},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.609966Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:77befba86e8a7b239addcaac95e8f62daf1c5d71bb6f872f5219016fd4931360","observation_id":"17d67bc7-d281-4d8f-ac39-dd285c9165e3","resolution":{"observed_at":"2026-08-06T22:59:19.147552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:18.900411Z","title":"Fi lter-based adaptive kriging method for black-box optimization problems with expensive object ive and constraints","venue":null,"work_id":"259bd504-414f-41c2-b148-6e9f82abba5d","year":2019},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.701546Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:5c89917a5e8792f47e5d40a029c2b6ffde701068d13a22f817bbe9b507a1796a","observation_id":"cdec47bb-b6f8-4a4e-86fb-ba2701ddce4e","resolution":{"observed_at":"2026-08-06T22:59:18.961524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:18.689676Z","title":"Conorbit: constrained optimization by radial basis function interpolation in trust regions","venue":null,"work_id":"da260dac-1011-4250-8917-bdd3ae966a46","year":2017},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.877732Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:08920f777dfbee67fd91bd039ae192ca103a6c028fcc9fcc0ded65526a8d0072","observation_id":"cd83e39d-5bb7-4af6-8c78-2cc1602a9f5d","resolution":{"observed_at":"2026-08-06T22:59:18.788374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:18.500119Z","title":"Stochastic zeroth-order optimiza- tion in high dimensions","venue":null,"work_id":"2538e215-bf6d-4f19-8c49-cdaaa25341ef","year":2018},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:09.946096Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:345fa7cea6f7490d7bf29f3ae777ca209c647ef0292479d87c427db26d0b2281","observation_id":"946ce52d-e3dc-477e-9778-fb071f7a02fa","resolution":{"observed_at":"2026-08-06T22:59:18.585728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:18.273291Z","title":"A theoretical and em- pirical comparison of gradient approximations in derivative-free optimization","venue":null,"work_id":"fd6297f1-af4e-49eb-a70b-ac0715e160ac","year":2022},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:10.101129Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:ae71109bc5f24db274e7bfaebe3530a8831b2b4c9f50bf63bb11840dd0139f30","observation_id":"45c6dec1-8d51-4d7f-ad5f-9dd8a1e48438","resolution":{"observed_at":"2026-08-06T22:59:18.369738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:18.069151Z","title":"Derivat ive-free alternating projection algorithms for general nonconvex-concave minimax problems","venue":null,"work_id":"d95ae3aa-cf61-487c-a612-5f83364c7ed8","year":1908},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:10.227876Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:c1463600db8710fecb14dc580527756d0874067f242bf591b9d1fe5fa8e67460","observation_id":"8eca339e-6d5c-43f5-805e-cf9405e80cc5","resolution":{"observed_at":"2026-08-06T22:59:18.173756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:17.929081Z","title":"An i nexact preconditioned zeroth-order proximal method for composite optimization","venue":null,"work_id":"13efc154-bf60-4d35-b1f5-51fbd17da7dd","year":2025},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:10.292126Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:38bcc382850bd51949bc24963413e8d615a442ba6efb2b0429b8ed2951e3a221","observation_id":"b5e98315-0dd8-4f4f-a1cc-98b2aa66af3e","resolution":{"observed_at":"2026-08-06T22:59:17.992925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:17.731898Z","title":"Boosting one-point derivative-free online optimization via residual feedback","venue":null,"work_id":"5267245d-9541-4ca8-ae14-22d6b8770437","year":2024},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:10.371210Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:fe1e6193b311362fabfc0ff2c12601c808ee9b6f477261200ede9cd3631eb8c5","observation_id":"698fec52-20a4-4770-af7a-264b19cd45fc","resolution":{"observed_at":"2026-08-06T22:59:17.822008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:17.395220Z","title":"Online convex optimization in the bandit setting: gradient descent without a gradient","venue":null,"work_id":"7c90905d-02f7-44d9-bba9-6763ac7f01e7","year":2005},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:10.504181Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:a3770bc1ae1c00b66c107d94e64d545f08d1e5e46a7f8f716636f1958b21027a","observation_id":"fa18edac-f974-443c-b9d1-5e48f8066808","resolution":{"observed_at":"2026-08-06T22:59:17.531059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:17.151384Z","title":"Random gradient-free minimization of convex functions","venue":null,"work_id":"0b75fa3f-bb99-426b-9216-8659627e7e6e","year":2017},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:10.656141Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:a209cdb28c40cd9629bd40d3017f585e76e72770d94c7088d64ff97678e82a94","observation_id":"4bbee2d3-6604-4778-9c77-f39a28286e90","resolution":{"observed_at":"2026-08-06T22:59:17.277836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:16.931747Z","title":"Zeroth-order feedba ck optimization for cooperative multi-agent systems","venue":null,"work_id":"65aeff15-6673-4fdc-9be2-2a8bd89c00d1","year":2023},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:10.801007Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:889e538327ed0da7fdc18fd0b9d7d67bd797a52d6e29404f4ca772a284a4ef3a","observation_id":"dc35a73e-cf1f-41ca-a785-dfb4905871a1","resolution":{"observed_at":"2026-08-06T22:59:17.038321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:16.667926Z","title":"Optimal rates for zero- order convex optimization: The power of two function evalua tions","venue":null,"work_id":"57399863-8fe7-4dd6-9d90-38038763bfbe","year":2015},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:10.926156Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:d248517da61419b7680e5c243a9dab5e98ff119b43296b72e61213cf05f14203","observation_id":"15842f0c-36da-4653-9f77-b8d5f4f4c63d","resolution":{"observed_at":"2026-08-06T22:59:16.794669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:16.419580Z","title":"A primer on zeroth-order optimization in signal proces sing and machine learning: Principals, recent advances, and applications","venue":null,"work_id":"3441a200-bc9d-44a2-a9db-927ce1b3aee9","year":2020},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.009882Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:630d1b34fe7b10ba31ee65d1da50426b4bd394d1623274de7ce0c5f4d74cb2ef","observation_id":"87e401ee-241b-403d-858e-a0fb8d77bdc3","resolution":{"observed_at":"2026-08-06T22:59:16.552667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:16.137152Z","title":"Mini- batch stochastic approximation methods for nonconvex stochastic composite optimization","venue":null,"work_id":"f1e12d2b-340b-467b-ba71-bc67b62479b4","year":2016},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.099177Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:e40ce53f66b18394c124c8e135fc85180cc19777b7c18234c07aaa9996534369","observation_id":"a91e105b-d3b2-4753-ae65-c27c222e8d2e","resolution":{"observed_at":"2026-08-06T22:59:16.295109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:15.854320Z","title":"Distributed rand omized gradient-free mirror descent algorithm for constrained optimization","venue":null,"work_id":"cacfc401-92cf-46ad-b318-933799570773","year":2021},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.194362Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:0f7916a17ba901618f648b43e2b50acad2b664fb915c19068c4ed9c1b4b0218f","observation_id":"cb76ac47-48f8-46bc-aeb4-c27f3d407a6c","resolution":{"observed_at":"2026-08-06T22:59:15.983343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:15.599548Z","title":"A frank-wolfe framework for efficient and effective adversarial attacks","venue":null,"work_id":"9766207d-1342-493d-ae06-d45602a635f2","year":2020},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.337614Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:223602ebfae59b3d209e15d35dd137ea7cd51d374ff46fd1869cd9479a06ee2c","observation_id":"451afbb0-b9a7-4a64-941a-c62df4ee7d21","resolution":{"observed_at":"2026-08-06T22:59:15.732193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.07201","last_updated":"2025-01-23T03:47:19Z","snapshot_observed_at":"2026-08-10T20:45:29.103524Z","submitted_at":"2025-01-13T10:53:19Z","title":"An Enhanced Zeroth-Order Stochastic Frank-Wolfe Framework for Constrained Finite-Sum Optimization","version":2},"cited_work":{"arxiv_id":"2501.07201","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.07201","snapshot_observed_at":"2026-08-06T22:59:13.121844Z","title":"An Enhanced Zeroth-Order Stochastic Frank-Wolfe Framework for Constrained Finite-Sum Optimization","venue":"cs.LG","work_id":"7ba8634c-34bb-4674-b6f8-c6b297760a4b","year":2025},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.464130Z"},"links":{"cited_paper":"/paper/2501.07201","citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:ae1bdddbcb83a2d8483c87a7708395e09782c59b22225f1a6908e37ad51ed690","observation_id":"d5c5f3b4-6853-467f-be3c-f8255853998c","resolution":{"observed_at":"2026-08-06T22:59:13.236151Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:15.270824Z","title":"Gradient-free a ccelerated event-triggered scheme for constrained network optimization in smart grids","venue":null,"work_id":"81a57b26-0d94-41c1-9d0d-7e83573cae32","year":2023},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.583505Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:027acbbeb417cfe0b19230d5011ce2e322ac6ab5c7d69cc048f5fafb5349e282","observation_id":"88cfe82c-e879-4076-9f6d-5d781c30ab76","resolution":{"observed_at":"2026-08-06T22:59:15.435292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:15.058669Z","title":"Min-max optimization without gradients : Convergence and applications to black- box evasion and poisoning attacks","venue":null,"work_id":"485d3e97-4cea-4d98-9f23-e86956671dfc","year":null},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.696185Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:e09581d95dcceeb89d004936e452774ba71f400d4d7409240c8ae193afe47f40","observation_id":"c118e282-7fe9-4380-9863-f63826c54f69","resolution":{"observed_at":"2026-08-06T22:59:15.183256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:14.912702Z","title":"Zeroth- order methods for convex-concave min-max problems: Applic ations to decision-dependent risk min- imization","venue":null,"work_id":"e22965a2-0f49-4602-a1de-611385e6e121","year":2022},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.806858Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:591ce46b9b547b4c7b5ccf412ac3e68164fa267a40c9e86a6fb568950a2da26b","observation_id":"64a37139-655d-4a53-be78-9e7a489e3740","resolution":{"observed_at":"2026-08-06T22:59:14.953082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:14.749469Z","title":"Prox-method with rate of convergen ce o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex -concave saddle point problems","venue":null,"work_id":"6cd8f7c9-637a-4ef8-9ab6-f6502bfea683","year":2004},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:11.951793Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:5ee670e0d219920744bfa8cecee644d9f6709d5c05d904d19f0afee8708d2b8b","observation_id":"3c7aca1a-9377-4fe6-8c6a-2ef29da04774","resolution":{"observed_at":"2026-08-06T22:59:14.819199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:14.657833Z","title":"Subgradient methods for saddle-poin t problems","venue":null,"work_id":"fde79863-2fbb-43f0-8a16-15cb779df463","year":2009},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.047427Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:b7f2a60865e33e7a6e596c875cda88cfebce63b844fd1114a367b99ba4d0db4e","observation_id":"1f4599d7-c71a-4c5f-89eb-0ea927dbb795","resolution":{"observed_at":"2026-08-06T22:59:14.699258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:14.561136Z","title":"Derivative-free methods for policy optimization: Guarantees for linear quadratic systems","venue":null,"work_id":"7b7c3b98-e88d-479e-9f09-2702af1edab7","year":2020},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.136518Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:2d96bb069c4a75732f5ee031941d4565cfa64589a522a2bcfd8d33761d917d2c","observation_id":"f3803fb3-a92d-44c4-92fe-7b5abfb3aca0","resolution":{"observed_at":"2026-08-06T22:59:14.609094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:14.470699Z","title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Pro ximal point approach","venue":null,"work_id":"361b21a5-fc8d-4795-9d4b-c9c3ac8463dc","year":2020},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.271957Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:955a2ed25348897f3f851eab4b68292842f7ca37443a70e990800de7487a1b08","observation_id":"46576a8c-49bc-427d-8d18-1814376eae79","resolution":{"observed_at":"2026-08-06T22:59:14.516311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:14.368802Z","title":"A zeroth-order block coordi- nate gradient descent method for cellular network optimiza tion","venue":null,"work_id":"72651e73-d860-4b5f-9b54-78e4bef90b33","year":2022},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.363980Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:2ee816f19c5f608258180823fe536f0ba1bbd93fb79b741673b5eff9fcf699e9","observation_id":"a6a97aad-fdb9-4b89-b1e1-f476dc7b5732","resolution":{"observed_at":"2026-08-06T22:59:14.426798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:14.272122Z","title":"Stochastic fir st-order methods for convex and nonconvex functional constrained optimization","venue":null,"work_id":"bb159a73-f90d-4652-ad3d-4be8beb3e0c7","year":2023},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.496842Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:e14292e8b0b4ce5cd61f808ca9869e8ff52b7f48bf03c78039c0a52cc28513d9","observation_id":"6ef3c504-e2cd-4041-b4a5-af60fdb8ba75","resolution":{"observed_at":"2026-08-06T22:59:14.315997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:14.087986Z","title":"Robust stochastic ap- proximation approach to stochastic programming","venue":null,"work_id":"9ab33e17-a6d0-4549-b8ca-64b9365932f5","year":2009},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.616954Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:0fae595a2b1f0181c8de111f5d9f05de7bc82f4c1e1575afb7c1a04a9ffa10a8","observation_id":"f6bb2816-5514-4607-b4c1-582cfc147251","resolution":{"observed_at":"2026-08-06T22:59:14.170711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:13.940305Z","title":"Taking expectation over vk gives: E [⟨ ηF (z+ k ), z+ k− z ⟩ |F k ] ≤ E [⟨ ηg+ k , z+ k− z ⟩ |F k ] + ηL ˜Drk","venue":null,"work_id":"0214ae1d-135f-461d-8472-7fbec4ee385e","year":null},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.725627Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:fddbe926c7a3c94f76cfd0b792d2eaf8acfa39b28d87f990c39bbb912d20e1e1","observation_id":"c6527ea0-0995-48df-a06d-bd48fedfb348","resolution":{"observed_at":"2026-08-06T22:59:14.001703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:13.763400Z","title":"Then, E [ ‖gk− g+ k‖2|F k ] is bounded as follows: E [ ‖gk− g+ k‖2|F k ] ≤ ˆ∆k, (19) where ˆ∆k = 108d2G2 d+2 + 9d2L2r2 k + 12L2r2 k + 12G2","venue":null,"work_id":"737239af-b55d-4891-9c8e-36471f9ff0ad","year":null},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.841730Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:4c42dae021a1d29debcee37ae7b2f92a225ebd95fc1494799ada581b3dbba192","observation_id":"cac1a9d3-b685-4f53-96a7-93c2b1f4c680","resolution":{"observed_at":"2026-08-06T22:59:13.870958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:59:13.554198Z","title":"24 C Proof of Theorem 4.3 Similarly, We start by defining a filtration F b k := σ (z0,I x 0 ,I y 0 ,J x 0 ,J y 0 , z1, ..., zk)","venue":null,"work_id":"fffaf87d-ebf1-4185-8c3a-1a077169ee18","year":null},"citing_paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.954685Z"},"links":{"citing_paper":"/paper/2506.20546"},"observation_digest":"sha256:d001145ecc8f0a5630432f40f214bbdaa8230cef850bba7cc75b1b1d7d302f47","observation_id":"0aa96285-08c5-4334-b3f1-05927aabfe13","resolution":{"observed_at":"2026-08-06T22:59:13.628135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.20546","last_updated":"2025-07-15T15:31:57Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T21:35:17.942465Z","submitted_at":"2025-06-25T15:42:39Z","title":"A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":42},"total_outbound_references":45},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2506.20546."}