{"as_of":"2026-08-13T06:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:660fd073a097585788856100d08be8e90d7feaed11dcda37712fdd62435e4d4e","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:09:46.602526Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.16745/citation-record","integrity":"/paper/2411.16745/integrity","json":"/paper/2411.16745/citation-record.json","paper":"/paper/2411.16745"},"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-12T14:09:47.526489Z","title":"Disciplined quasiconvex programmin g, Optim Lett, 2020, vol","venue":null,"work_id":"7dec16ca-26b8-4b72-9f88-d686bd6822f3","year":2020},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.323821Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:cdb8d4cdaff19b1bfc586e0d4f99af69ee81af9bfd6deecfe989703c5a2c905a","observation_id":"04d7d138-6b7e-4636-82c4-6b164a66950f","resolution":{"observed_at":"2026-08-12T14:09:47.531249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.511383Z","title":"A gradient e stimator via l1- randomization for online zero-order optimization with two point feedback, in Ad- vances in Neural Information Processing Systems, vol","venue":null,"work_id":"84e011f0-d432-4c67-9405-98862b490e6c","year":2022},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.329215Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:6ce2e6c3fb58527bca402eb5cdc9b5e81e040b1ab33b325174b1912caaf4c5fc","observation_id":"2cf47a67-2041-4e50-8d3a-7db539a2649f","resolution":{"observed_at":"2026-08-12T14:09:47.516335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.495798Z","title":null,"venue":null,"work_id":"a01efc01-0112-4408-a112-4bde2ba1ad6e","year":2023},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.334196Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:826cd84ba98bd177a9df142cc7746dcfee4309c731b403020d059e938742801f","observation_id":"8551cc11-f428-498c-aa27-cdfa6a93ef62","resolution":{"observed_at":"2026-08-12T14:09:47.500653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.480703Z","title":"Mesh adaptive direct search algorith ms for constrained optimiza- tion, SIAM Journal on Optimization, 2006, vol","venue":null,"work_id":"2f051d97-218b-452b-a40b-18a69338e5a1","year":2006},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.339596Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:56d8db37c5517616175447fedcab52e035cc9989d595c868c627e421416dacff","observation_id":"6f31f007-4780-4fe8-b8dd-b78a42fa9c79","resolution":{"observed_at":"2026-08-12T14:09:47.485622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.464896Z","title":"Goal -driven dynamics learning via bayesian optimization, in IEEE 56th Annual Conference on Decision and Control (CDC), 2017, pp","venue":null,"work_id":"471ab963-1258-4120-bb8a-d900c48f525e","year":2017},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.344661Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:a64671c8c551f949b45a0aff80f9c7327a9d7893c58a71b3a305ae26e6ce1203","observation_id":"b2ec14c2-ac2b-4dff-be29-eb22f70f00e5","resolution":{"observed_at":"2026-08-12T14:09:47.469972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.448393Z","title":"Highly-smooth zero-th order online o ptimization, in Conference on Learning Theory, PMLR, 2016, pp","venue":null,"work_id":"03f6e24d-8aa6-494a-be9b-37e15d2f0dba","year":2016},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.349921Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:6e30d64b51fcf1e1ec4e40d8e5664edd4622c0b0fa2089aaad17378cf8ab1402","observation_id":"9780427a-cb28-4c10-9212-18b3fe9f3e72","resolution":{"observed_at":"2026-08-12T14:09:47.454462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.433004Z","title":"Zeroth-order nonconvex stochastic optimization: Handling constraints, high dimensionality, and saddle poi nts, Found Comput Math, 2022, vol","venue":null,"work_id":"3a6b3e8c-3cf0-4eb2-b0e9-d1a967abe53e","year":2022},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.355477Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:7c1e248a6da1d91bb22f566e24798dd1f2812aba776692d70e453f8e2c4506fd","observation_id":"5b0fc460-98f0-4dbe-9224-d93717f5170d","resolution":{"observed_at":"2026-08-12T14:09:47.438173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.417425Z","title":"Stochastic three p oints method for uncon- strained smooth minimization, SIAM Journal on Optimizatio n, 2020, vol","venue":null,"work_id":"898f6f9b-7a1c-42cb-9794-1c391f03a98e","year":2020},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.359715Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:34f1aa67f6517e565cae358dbe4f4a3a8e68acc1070b15ed0d5f370fb34b2edb","observation_id":"3616f1f7-090e-4ed0-ae88-c84c9c396d9c","resolution":{"observed_at":"2026-08-12T14:09:47.422599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.402395Z","title":"Convex Optimization , New York: Cambridge University Press, 2004","venue":null,"work_id":"8810a97c-74ac-4066-a9b6-f2a6111969e8","year":2004},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.364636Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:9bd11004f562f77cf73b96b176550b28424871a532b2f54996fa83ce3bcb25ae","observation_id":"0eda4c73-c3f7-40b6-9d36-d01525b78b89","resolution":{"observed_at":"2026-08-12T14:09:47.407140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.386926Z","title":"Algorithms for Minimization Without Derivatives , Dover Books on Mathe- matics, Dover Publications, 1973","venue":null,"work_id":"0e8b22fe-6875-41e1-8997-b6b7fd1e836f","year":1973},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.369509Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:1123dff6c3da9884c0ea75d382fd66397516410d981ed2285bf7eea863dda9c0","observation_id":"d2d8ba18-1738-4d4a-aee3-04ca803bf1bc","resolution":{"observed_at":"2026-08-12T14:09:47.391799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.370985Z","title":"Regret analysis of stochast ic and nonstochastic multi- armed bandit problems, Foundations and Trends in Machine Le arning, 2012, vol","venue":null,"work_id":"726ddc2b-0547-4193-8d2d-aae387439681","year":2012},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.374078Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:e735a27f70b0f6bdea838f7a3a45c9f4eeb0e08fde7e02175f6207ac19f8b03c","observation_id":"135c969a-b066-4899-bd74-2cac851923d5","resolution":{"observed_at":"2026-08-12T14:09:47.375789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.355808Z","title":"Zoo: Zeroth o rder optimization based black-box attacks to deep neural networks without training substitute models, in Proc","venue":null,"work_id":"8f22131a-bd88-4e7d-990d-e4041722e50f","year":2017},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.379012Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:72a2cf93d3a4fed38b9a079da26c69f483d7336954919b5a37de240204986792","observation_id":"3a79f390-1afd-4c5b-9d46-4be7ed46fa7a","resolution":{"observed_at":"2026-08-12T14:09:47.360678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.339970Z","title":"Optimizing simula- tions with noise-tolerant structured exploration, in IEEE International Conference on Robotics and Automation (ICRA), 2018, pp","venue":null,"work_id":"dcd6288d-eb3f-49c7-a75c-0a93d2401f50","year":2018},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.383602Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:6a97f11dc34825a6d3c9e9c15d9adce021db3b95a5b2dcdc6ad4726455fbc6c5","observation_id":"2ebb3309-7a27-4e4a-b651-2f0e3781a80b","resolution":{"observed_at":"2026-08-12T14:09:47.345486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.324767Z","title":"Introduction to Derivative-Free Optimization , MOS-SIAM Series on Optimization, 2009","venue":null,"work_id":"8346b441-87f2-4b22-b0a4-dd8c4bf318be","year":2009},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.388936Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:6c16cbfb4b0adbed7a1b9c75e78a565587863c6cf975f03f249b3b47556fb4ac","observation_id":"377d60e1-a8a5-4160-9e54-479271c0d6cc","resolution":{"observed_at":"2026-08-12T14:09:47.329850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.308128Z","title":"Federated bayesian optimizat ion via thompson sampling, in Advances in Neural Information Processing Systems, vol","venue":null,"work_id":"61b03d56-634e-414d-b37f-80eb5d5395d0","year":2020},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.394512Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:4c800ae6502df4b6f6b712623b21e645922128b17c0b87f4a2ff9be3937f164a","observation_id":"e4490136-4c70-429f-85c9-667a4b272cd5","resolution":{"observed_at":"2026-08-12T14:09:47.313744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.292796Z","title":"Direct search methods on parallel machines, SIAM Journal on Optimization, 1991, vol","venue":null,"work_id":"84a46e25-13c0-4c82-9419-933b9ed6f2f5","year":1991},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.398923Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:1f3c8e6b0c9c80cbfb35981ad51d0e96a05b8a3e02e1d832f9d7cdcc956e7219","observation_id":"4af81b9e-d47b-42f0-88d8-e793632f6f8d","resolution":{"observed_at":"2026-08-12T14:09:47.297436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.277973Z","title":"Optimal rates for zero-order con- vex optimization: The power of two function evaluations, IE EE Transactions on Information Theory, 2015, vol","venue":null,"work_id":"34b0285c-550e-44b6-9019-fd2bac125a5d","year":2015},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.403557Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:c1981e73a74c5e47f56591f3d83be885ef3ca88223fc2bde1821fe3bb76b7140","observation_id":"adb5b548-3914-49da-a37f-48f924cf66b6","resolution":{"observed_at":"2026-08-12T14:09:47.283289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.262868Z","title":"Adaptive subgradient meth ods for online learning and stochastic optimization, Journal of Machine Learning Research , 2011, vol","venue":null,"work_id":"e87cebae-11d9-439a-81b4-eb25d6b26ec4","year":2011},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.408154Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:922674ebb22d468770227b9767be6342ab70b37291bb8db8606ddb3b105fd4d6","observation_id":"3cc82a82-5ded-47dd-b233-241bac1c25bb","resolution":{"observed_at":"2026-08-12T14:09:47.268189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.247720Z","title":null,"venue":null,"work_id":"878b88a5-d1f9-4b4c-bb19-50be99345ef4","year":null},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.412764Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:d3c88a61c6c95cdfe40100145445be848541c50092379c07e93fadbd8af8d36f","observation_id":"05c6bc32-77ff-44c6-84ca-911e185123ab","resolution":{"observed_at":"2026-08-12T14:09:47.253132Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.232446Z","title":"SPIDER: Near-optimal non -convex optimization via stochastic path-integrated differential estimator, in Advances in Neural Information Processing Systems, vol","venue":null,"work_id":"8bb3a4fc-2db8-49c5-8584-b347b72e7e00","year":2018},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.417567Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:546cf6f4f7d8ca6c9aa95caf72dd7f1ee0d655866bbb264cc2b90d4cd307f873","observation_id":"d279d7ed-46fd-4a2d-949e-14b8d8bf3dc8","resolution":{"observed_at":"2026-08-12T14:09:47.237296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.217072Z","title":"Stochastic approximation of minima with impr oved asymptotic speed, Ann","venue":null,"work_id":"c1e7004b-7c1b-4fbf-9b6b-1557cb9c7297","year":1967},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.422823Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:0109cc4bde8a0469cdadc9c044644706c038548cee08f588234267bdf3ff262d","observation_id":"9512aa7a-0e2c-4f74-a8f0-5ac7b03f49ce","resolution":{"observed_at":"2026-08-12T14:09:47.222290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.202787Z","title":"Convex cones, sets, and functions , Lecture Notes","venue":null,"work_id":"c69e6ccf-5e99-4563-9d73-19530e6f260f","year":1953},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.427562Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:a5e9ba8def91b8edca34efa7fc29bde5bc05e8a579a920ea05187da0c6878ad9","observation_id":"73669949-b0b2-4c30-a63e-d85bd1271b6b","resolution":{"observed_at":"2026-08-12T14:09:47.207535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.186825Z","title":null,"venue":null,"work_id":"baea6deb-258c-49b7-9fd6-b8ebbeef9eb0","year":2018},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.432241Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:a5e131bd49c79a516d5a01e9b9a00919eb97a70eb8c4eb39c0267f87c3f1bbb0","observation_id":"30590c59-5c2f-46e6-9c18-841ddd2ef181","resolution":{"observed_at":"2026-08-12T14:09:47.192182Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14989","last_updated":"2024-12-25T15:02:32Z","snapshot_observed_at":"2026-08-12T22:39:36.700158Z","submitted_at":"2024-09-23T13:11:37Z","title":"Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14989","snapshot_observed_at":"2026-08-12T14:09:46.436887Z","title":"Methods for Convex ( L0, L 1)-Smooth Optimization: Clipping, Acceleration, and Adaptivity, arXiv:2409.14989 (23 Sep 2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.436887Z"},"links":{"cited_paper":"/paper/2409.14989","citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:ab890c1cc80ad97fa69bcb0a28a7f1fe69f0cac2b31050e50e5da1f043e51684","observation_id":"e59368ca-e8da-406d-8fd1-bb8d3b86082b","resolution":{"observed_at":"2026-08-12T14:09:46.436887Z","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-12T14:09:47.171753Z","title":"A stochastic derivative free optimization method with momentum, in International Conference on Learning Representations, 2020","venue":null,"work_id":"8ea40821-4378-4ee7-80a9-004f218dab8a","year":2020},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.442090Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:2a79cb2a833bf087433a537c4471d78928a79a0e356da9d505438e855c718785","observation_id":"6ed37a07-dcbb-4400-9478-1e9a46354798","resolution":{"observed_at":"2026-08-12T14:09:47.177003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.156856Z","title":"28, 2015","venue":null,"work_id":"940e4e7e-2c0e-4722-bbae-6ef20f127fec","year":2015},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.446822Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:36c52dd4f6d7d6c04bfb6fcaedbb9a6a9c6475b7de3c299e78e664580f4801e5","observation_id":"4513e4bd-3d33-47f7-930f-1e1f645ba370","resolution":{"observed_at":"2026-08-12T14:09:47.161640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.141650Z","title":"Improved zeroth-order v ariance reduced algorithms and analysis for nonconvex optimization, in International Conference on Machine Learning, PMLR, 2019, pp","venue":null,"work_id":"e1dc5ff2-620e-4cf5-a35e-aebc112b9400","year":2019},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.452070Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:4087a90d64f67930b5373d0adaeba7f227978a34a6762e2d73915784f626b0e5","observation_id":"86e6b735-3645-4141-9b4a-7b73b49688f4","resolution":{"observed_at":"2026-08-12T14:09:47.146817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.126530Z","title":"Uncertainty models in quasiconvex opti mization for geometric re- construction, in IEEE Computer Society Conference on Computer Vision and Pat tern Recognition (CVPR’06), vol","venue":null,"work_id":"ef7ff8ef-15ee-47df-99e4-151be8c10b7e","year":2006},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.457558Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:00b532b90f6b066c4ab97437d1e7ad526446000062070840fd7c85247839ba35","observation_id":"0c18f2b2-9784-4adf-9dda-83fef7e09ff7","resolution":{"observed_at":"2026-08-12T14:09:47.131374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.110656Z","title":"Quasiconvex optimization for robust ge ometric reconstruction, in Tenth IEEE International Conference on Computer Vision (Be ijing, China), vol","venue":null,"work_id":"a571cf1c-db3f-4bdc-866c-ad1efb5b524a","year":2005},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.462216Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:37a18c37f7dfc32614607ff72f4f60c2c1ba67fe265a22a2a42a38aeb28f66dd","observation_id":"66c57723-f7d3-48a4-9b59-502a2241cf89","resolution":{"observed_at":"2026-08-12T14:09:47.115630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.094261Z","title":"Online to offline conversions, universality and ad aptive minibatch sizes, in Advances in Neural Information Processing Systems, vol","venue":null,"work_id":"ab2d2e29-9554-4950-87ba-21cbd855212f","year":2017},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.466698Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:ff3f45c86d873d1dab97f4f4120065320f785f36866a25595694e8a91f7b36ac","observation_id":"e74918c3-13d5-458f-9b3e-6a2fd38b9428","resolution":{"observed_at":"2026-08-12T14:09:47.100226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.079178Z","title":"Convergence and efficiency of subgradient meth ods for quasiconvex mini- mization, Math","venue":null,"work_id":"ab5f086c-85dc-4f5a-9bfe-2af643ffa69a","year":2001},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.471576Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:a77325b9d81d855a6ece07ad15a9a2be69e0649c68481c5291fddef8fa3f6936","observation_id":"ab29cd03-9594-4a1d-b5d1-6b1c3bbb0b53","resolution":{"observed_at":"2026-08-12T14:09:47.084097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.062883Z","title":"Adam: A method for stochastic optimizat ion, in International Conference on Learning Representations, 2015","venue":null,"work_id":"460ff380-b7ae-4b7a-8100-cdfd90a9e65b","year":2015},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.476512Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:5b6bf7559bc7309ee20e2f2b790ae7fe144512d1fc9ad0bf47503c188d1f01b5","observation_id":"407616ff-5139-4925-afe2-0402a1ef0aa9","resolution":{"observed_at":"2026-08-12T14:09:47.068377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.046597Z","title":"Optimization by direct se arch: New perspectives on some classical and modern methods, SIAM Review, 2003, vol","venue":null,"work_id":"349a7c66-4b46-4aea-bb91-57ace47da32f","year":2003},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.482161Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:73234cd666327f69f99867ceb6aee5efc6d1c8184b644e41f996c22c8acbf664","observation_id":"c0411971-c7f6-4c84-9227-bdadd2d7f1cf","resolution":{"observed_at":"2026-08-12T14:09:47.052126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.030358Z","title":"On convergence properties of a subgradient me thod, Optimization Methods and Software, 2003, vol","venue":null,"work_id":"295728fd-b3d2-40df-98ed-b6eafd81eae7","year":2003},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.487607Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:c58fde7dd8376b5a31c1c90e684e0112df64cc9ab95464728f182a8a231c87a5","observation_id":"941b3cd0-5239-4379-b440-22f510c10523","resolution":{"observed_at":"2026-08-12T14:09:47.036049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:47.013754Z","title":"The theory of incentives: the principal-agent model , Prince- ton university press, 2009","venue":null,"work_id":"03d2d687-cd74-433d-a06d-1bc9e6e4f494","year":2009},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.492952Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:7d9a6c7765efe39df15a1ab541e754294f84e19cd6772ad56efab9fc0f5efe20","observation_id":"4d4f7a6b-65ff-4e0f-bbfd-d048e6ec7913","resolution":{"observed_at":"2026-08-12T14:09:47.018773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09014","last_updated":"2024-12-25T12:04:38Z","snapshot_observed_at":"2026-08-13T04:19:16.814150Z","submitted_at":"2024-02-14T08:44:26Z","title":"Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09014","snapshot_observed_at":"2026-08-12T14:09:46.498317Z","title":"Acceleration Exist s! Optimization Problems When Oracle Can Only Compare Objective Function Values","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.498317Z"},"links":{"cited_paper":"/paper/2402.09014","citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:f7217f76b7a42d2182db0b80434a46cc53173e4942c9e1ae8be1d78416b148ec","observation_id":"c9c6371a-933c-49f7-9720-29c778d21164","resolution":{"observed_at":"2026-08-12T14:09:46.498317Z","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-12T14:09:46.998162Z","title":"overparametrization","venue":null,"work_id":"f9a50296-2be9-43bc-b5e7-cbd59973dce4","year":2023},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.504599Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:93ea66942a4b46bd437bcc308755c36e3ef8ae0925e7b6c18d8749b7cc730def","observation_id":"3a3ae49b-e8cf-4173-8563-6773ed5c0946","resolution":{"observed_at":"2026-08-12T14:09:47.002966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.982808Z","title":"Quasi-convex programming, SIAM J","venue":null,"work_id":"ca7cd49e-715c-41e2-a0bd-13fb5836129f","year":1968},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.509295Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:aa7ef8644847dbc596734af9ccf7e0339d47e24a32c31fb8a347f1fa4827b5d2","observation_id":"16014308-4dcc-4494-8306-c58cb2368bb6","resolution":{"observed_at":"2026-08-12T14:09:46.988225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.966336Z","title":"To wards deep learning models resistant to adversarial attacks, in International Conference on Learning Rep- resentations, 2018","venue":null,"work_id":"3d6bb055-eeec-43b3-83d3-f7250cdcb260","year":2018},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.514761Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:25f906296469def8ecbdb93f6ff3bf9e77b459960b24e019f98e83c41a52c60c","observation_id":"2c52f8e2-e3a0-441d-b0c4-dfd13157a0a8","resolution":{"observed_at":"2026-08-12T14:09:46.971619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.951518Z","title":"Smooth convex optimizat ion using sub-zeroth- order oracles, in Proc","venue":null,"work_id":"3f0b7aca-1c0a-427b-bbd6-bf1c149fb951","year":2021},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.519891Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:7907c6c19bef8197952f881b00f5a7cb0a7c53532dee5eaa15e536be84873eac","observation_id":"c25776ed-4c16-476a-bfe3-edb84272941a","resolution":{"observed_at":"2026-08-12T14:09:46.956447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.936825Z","title":"Lectures on convex optimization , Switzerland: Springer Optimization and Its Applications, 2018","venue":null,"work_id":"51889eaa-845d-421d-8218-8d5d61e85ef3","year":2018},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.524587Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:29581476b09ae4fcfdedb2d7d7d3f63fc0df7d635d3d068bea5fcdc943bdccd2","observation_id":"2a2c8402-e6c6-4c4c-9c9c-7b4fd47f96be","resolution":{"observed_at":"2026-08-12T14:09:46.941604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.920887Z","title":"Random gradient-free minimi zation of convex functions, Foundations of Computational Mathematics , 2017, 17, pp","venue":null,"work_id":"828378b9-64f9-4acb-82d2-8ca520fb4b4a","year":2017},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.530117Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:abb5de924bc4b7cceaac5594979d780d469e5f828ea23d0b365c6f6ac6e4f302","observation_id":"f3de2b23-9b3b-40d6-8038-5f6ffbe45222","resolution":{"observed_at":"2026-08-12T14:09:46.926271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.906034Z","title":"Minimization methods for nonsmooth conve x and quasiconvex functions, Matekon, 1984, vol","venue":null,"work_id":"0fbab2ea-be5e-4168-a862-892bd00835d6","year":1984},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.534938Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:0b7eba5f2bbe1f65e454814d51c9dc694210eb1e612000978f0a8032438f040f","observation_id":"46c0d28f-324d-4c3e-a62a-963ab2f66e6e","resolution":{"observed_at":"2026-08-12T14:09:46.910856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.891117Z","title":"A simplex method for function minimiz ation, The Computer Journal, 1965, vol","venue":null,"work_id":"bc257271-f51e-48db-8f1a-33e253caba8d","year":1965},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.539852Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:c5d4aaa752cb43aafa4b08dab9ac6044a4c3aa3b055262536efa4e5a01fdcbf6","observation_id":"b5b6f834-754f-4e0f-86ea-73e22be50cf3","resolution":{"observed_at":"2026-08-12T14:09:46.896018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.874742Z","title":"On von Neumann’s minimax theorem, Pac","venue":null,"work_id":"1c7f2756-d367-4bcd-9d0d-30ce432c5c52","year":1954},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.544289Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:68a033d5ca0c266119bfd1894c02589df0c29c97c3a4b28f5936530e67b34f05","observation_id":"eff1cf49-7d40-4337-9ad8-69d73e8d0a79","resolution":{"observed_at":"2026-08-12T14:09:46.880481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.858414Z","title":"Distributed online and bandit convex optimiza- tion, in OPT 2022: Optimization for Machine Learning (NeurIPS 2022 W orkshop), 2022","venue":null,"work_id":"61b8af4b-a02f-46df-9460-e35d319870c1","year":2022},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.548668Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:9d63663b5e85931e08aab05e2ad08fe261a4891c2a9321c05132fe6af73e0f85","observation_id":"0d405b7b-b53f-46cd-b8b4-ba242118eabc","resolution":{"observed_at":"2026-08-12T14:09:46.863458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.841515Z","title":"Practical black- box attacks against machine learning, in Proc","venue":null,"work_id":"6df099ec-fd85-47ff-85a2-1c58b41e9b94","year":2017},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.553277Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:4ff04fad6579c72b26876969b0eea47b14053fa47ab867a414910d92c44844c7","observation_id":"acc584f3-bbd1-4ec5-8718-412514536c97","resolution":{"observed_at":"2026-08-12T14:09:46.847072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.823599Z","title":"An automatic method for finding the greate st or least value of a function, The Computer Journal, 1960, vol","venue":null,"work_id":"3630a4b8-9527-4983-b24f-e2b5b881654b","year":1960},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.557784Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:7e3b5c335c4b47a5bbf346dc0b762a04881c64019b6edb30ba49b32bbbfdaf70","observation_id":"cf1cf69f-0a9f-4d3f-a79b-62367cba70a3","resolution":{"observed_at":"2026-08-12T14:09:46.828774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.03864","last_updated":"2017-09-07T23:28:48Z","snapshot_observed_at":"2026-07-06T05:33:17.404544Z","submitted_at":"2017-03-10T23:02:19Z","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.03864","snapshot_observed_at":"2026-08-12T14:09:46.562305Z","title":"Evolu tion strategies as a scalable alternative to reinforcement learning, arXiv:1703.03864 (7 Sep 2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.562305Z"},"links":{"cited_paper":"/paper/1703.03864","citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:de6f5897e40046c595cd2bafc57e8a8d349b085f81f9b535a88b08fc1a2adaf1","observation_id":"18e05a10-d741-47a7-8aab-dfa57d4bcb3c","resolution":{"observed_at":"2026-08-12T14:09:46.562305Z","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-12T14:09:46.805531Z","title":"Quasiconvex sum-of-squares progra mming, in 49th IEEE Confer- ence on Decision and Control (CDC), 2010, pp","venue":null,"work_id":"f02e58a1-7d4b-471f-92fd-0adb4e1666dd","year":2010},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.567104Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:eac1369e5e05ecf3ff2a263e663e1bdf1edda5ab265b8d13aa30467725ae44f2","observation_id":"bed9b634-3fa4-4ab1-ac39-f892f197af1e","resolution":{"observed_at":"2026-08-12T14:09:46.811557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.787281Z","title":"Zeroth-order optimization m eets human feedback: Provable learning via ranking oracles, in ICML 2023 Workshop The Many Facets of Preference-Based Learning, 2023","venue":null,"work_id":"91437c92-e7b2-450d-bbc0-c2c20aab0bb8","year":2023},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.571624Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:eaa14ce94bdf0e7f87c3af8a8cfff7a5b09570a8f1378aa00aa545220ec54a77","observation_id":"cf3e002a-a9ab-4912-863a-fc0c9d5dba78","resolution":{"observed_at":"2026-08-12T14:09:46.792581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10800","last_updated":"2025-03-07T20:23:27Z","snapshot_observed_at":"2026-08-12T22:23:27.034752Z","submitted_at":"2024-10-14T17:57:33Z","title":"Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10800","snapshot_observed_at":"2026-08-12T14:09:46.576636Z","title":"O ptimizing ( L0, L 1)- Smooth Functions by Gradient Methods, arXiv:2410.10800 (14 Oct 2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.576636Z"},"links":{"cited_paper":"/paper/2410.10800","citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:366e9b9f59f8bd1611ec7fbe089b0d0b515180fe113945c860b2f07743504ace","observation_id":"226d8fc2-8fb1-4c37-8f4d-ed80246c9b59","resolution":{"observed_at":"2026-08-12T14:09:46.576636Z","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-12T14:09:46.769728Z","title":"Price discrimination and social welfare, The American Economic Review, 1985, pp","venue":null,"work_id":"5632dc40-8c10-4f38-859a-296006ece02f","year":1985},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.581505Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:f338463dd84a54bca0a411dd949d023ea98e3cf279db58c67be0bed1b0d76b27","observation_id":"4b948445-3451-452f-9dc8-3d19b65eb889","resolution":{"observed_at":"2026-08-12T14:09:46.775823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.752062Z","title":"Vabo: Violation- aware bayesian optimization for closed-loop control perfo rmance optimization with unmodeled constraints, in 2022 American Control Conference (ACC), IEEE, 2022, pp","venue":null,"work_id":"a8cdbdce-a176-4500-8a34-2cc28b7c3e97","year":2022},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.586893Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:6e688e389f9ff935e0fc32ed32ba593aa5bbd56f3f8e7eefddf7ff83626ea107","observation_id":"456c80b5-8d5e-4956-b400-ece5b913cd56","resolution":{"observed_at":"2026-08-12T14:09:46.758158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:09:46.735679Z","title":"Topics in microeconomics: Industrial organization, aucti ons, and in- centives, Cambridge University Press, 1999","venue":null,"work_id":"f76b6ccc-e0bb-42fe-b060-f32e151bf395","year":1999},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.592242Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:a3cf659ecce07ec35e8aeb4c03534c8ce548fa510fc82c1d8b3875c78bda2b9a","observation_id":"127c15fd-ce3d-466d-ac9d-dda3268eeae4","resolution":{"observed_at":"2026-08-12T14:09:46.740983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11454","last_updated":"2026-06-25T14:21:00Z","snapshot_observed_at":"2026-08-13T00:04:25.757004Z","submitted_at":"2024-05-19T05:39:46Z","title":"Gradient Testing and Estimation by Comparisons","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11454","snapshot_observed_at":"2026-08-12T14:09:46.597240Z","title":"Comparisons Are All You Need for Optimizi ng Smooth Functions, arXiv:2405.11454 (19 May 2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.597240Z"},"links":{"cited_paper":"/paper/2405.11454","citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:b608103c7c40822eabe6c5cedfe5cfb301e05e5afaf562037a3f7485573cab0a","observation_id":"ddc07f5e-2b1e-4dcf-ac67-8a1ab64ec943","resolution":{"observed_at":"2026-08-12T14:09:46.597240Z","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-12T14:09:46.716913Z","title":"Zeroth-order negative curvatu re finding: Escaping saddle points without gradients, in Advances in Neural Information Processing Systems, vol","venue":null,"work_id":"adb4acb3-b1d4-4a33-9117-357f907f1bd3","year":2022},"citing_paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T14:09:46.602526Z"},"links":{"citing_paper":"/paper/2411.16745"},"observation_digest":"sha256:a39a7016bb49c7f94c26a3225b68162e0fc949219a6dca2f50f6105497527088","observation_id":"59cc1fe1-74c5-4837-9de6-5491d53c1a77","resolution":{"observed_at":"2026-08-12T14:09:46.724171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16745","last_updated":"2024-11-23T20:24:56Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T03:24:04.245399Z","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":49},"total_outbound_references":57},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2411.16745."}