{"as_of":"2026-08-16T03:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21ff4e4ed5ea1ddc9cedc4003dc32b9be639184914ac8640d25174b3bebae1ab","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:25:36.347370Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2608.08979/citation-record","integrity":"/paper/2608.08979/integrity","json":"/paper/2608.08979/citation-record.json","paper":"/paper/2608.08979"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.949885Z","title":"arXiv , note =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.949885Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:83aeda9d9fc44c82f70200e69d6189747357293922138c6528fd52cf40301bde","observation_id":"52fe2359-825d-4056-92f7-602099266233","resolution":{"observed_at":"2026-08-14T04:25:35.949885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.954427Z","title":"arXiv , note =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.954427Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:3df2971dea5451dd285a539f99df5fedcc87bb945b939acf5f386d3290da0e05","observation_id":"7929ed94-5686-4034-a3ee-93fd5793da3e","resolution":{"observed_at":"2026-08-14T04:25:35.954427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.958571Z","title":"2026 , month = aug, pdf =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.958571Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:86229d059be0c099498d1f15a87ac71fdf5332ffa17aff4d882c41eca26f9669","observation_id":"8cb61062-1c96-4ff2-a000-2d806a26d66f","resolution":{"observed_at":"2026-08-14T04:25:35.958571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.962732Z","title":"arXiv , note =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.962732Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:e186d4167619638eb8b8fc88821c48df34ea3d4ecdb04736de7bbe72583c2f12","observation_id":"d898116a-a8ce-4af0-9e4e-c13a294680a7","resolution":{"observed_at":"2026-08-14T04:25:35.962732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.969532Z","title":"arXiv , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.969532Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:eea91ce758dd03a2d2cde6f761c42928d6be9d1f48bfcfadeaa851c69fd91ec2","observation_id":"87ec65c8-9b92-4125-b363-64083806321b","resolution":{"observed_at":"2026-08-14T04:25:35.969532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.973809Z","title":"ACS Synthetic Biology , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.973809Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:f27b2fda4c651ba45f404adf16b68bf40a523b57616343108d43f787a6c66d8a","observation_id":"7d55251f-99bf-49b2-92a9-af964bff9a08","resolution":{"observed_at":"2026-08-14T04:25:35.973809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.978898Z","title":"2026 , month = aug, pdf =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.978898Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:b085a242400b8a10538aaa92b6bd35f4f14e6d21c62c047678538da7847ddec0","observation_id":"629bbea0-d88f-45f2-90da-302a4a3a3de3","resolution":{"observed_at":"2026-08-14T04:25:35.978898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.983171Z","title":"arXiv preprint , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.983171Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:3905e26d6f8ed450366f7b7a79488f17333c44d5689961bff516d1040323a3f8","observation_id":"cba37907-acef-4ef3-87db-c5647a1e4c62","resolution":{"observed_at":"2026-08-14T04:25:35.983171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.986968Z","title":"Mehrnoosh and G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.986968Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:1a03eadccb0af99db11c7adae4c738075793df352b74ca75737b785145ae9b18","observation_id":"ec782545-a34d-4a86-8b4d-565da7dcebbf","resolution":{"observed_at":"2026-08-14T04:25:35.986968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.990209Z","title":"arXiv preprint , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.990209Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:1f43986cac10b0bef3b4b2c6dbb8a044815b100b738ac2929adce530dd877a93","observation_id":"ad91131d-fe37-463d-a96e-f3f08ea270e8","resolution":{"observed_at":"2026-08-14T04:25:35.990209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:35.994150Z","title":"Mehrnoosh and G","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:35.994150Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:86a23c836c94568d0f984b14d53fc055a34dcdcd3c677bfa9c4d1502007f9721","observation_id":"7023f115-43e4-427f-85d1-42a6eb10feaa","resolution":{"observed_at":"2026-08-14T04:25:35.994150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.000383Z","title":"Bianchin and B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.000383Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:877829cac844685d2209bfe168737e06f77185db04badb273e089f62dc048ad0","observation_id":"dc8be12b-95bb-4d46-b269-a183e4253d77","resolution":{"observed_at":"2026-08-14T04:25:36.000383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.004973Z","title":"2024 , month = jul, volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.004973Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:bae5b0c3c7b17aa086132d5b8e2e5e1cd94991b020ac8a91f89cfac43b997359","observation_id":"63821f41-7f54-4d18-9751-48ea98bb0ff7","resolution":{"observed_at":"2026-08-14T04:25:36.004973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.008695Z","title":"2026 , month = aug, pdf =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.008695Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:7ae95dd1c310a99c4379dd6c8a88679eb89b4f004d8c6690216760b51a7eca91","observation_id":"8fc70b83-0d13-4e46-8993-b7bf776689b4","resolution":{"observed_at":"2026-08-14T04:25:36.008695Z","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":"2024.33972","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:38.884528Z","title":"2024 , pdf =","venue":null,"work_id":"5c2d6713-54b3-4f3a-a423-871b555e3182","year":2024},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.012755Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:d8a5b227e8e6845b30924efdc291f1526dde912d4ae1c4ed73532b3d66ef7f5b","observation_id":"c716897e-84eb-45f5-859b-1ab30e43b399","resolution":{"observed_at":"2026-08-14T04:25:38.890493Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.017281Z","title":"Perotti and A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.017281Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:be77382d36f5ed9b95720d7a3a37abb74b2ae8c9e323469a9e55d416b0e9c03d","observation_id":"dd0ce0ef-1b54-482c-9aca-141128fe397e","resolution":{"observed_at":"2026-08-14T04:25:36.017281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.021263Z","title":"Bianchin and J.-C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.021263Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:aa64164cded7550881538596b16897a970493c128ea539e5cbbf73e5c856c7e0","observation_id":"7803c6c5-0dc6-48ab-a6aa-c316ec55ea66","resolution":{"observed_at":"2026-08-14T04:25:36.021263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.025469Z","title":"Bianchin , title =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.025469Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:ba971afddc3e1f1e0dc885bf359356277d199bd15e0d5c5263ea60b25a5f82cb","observation_id":"5205a3af-db9c-4bad-a5f3-a293ac446cc6","resolution":{"observed_at":"2026-08-14T04:25:36.025469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.029610Z","title":"Asilomar Conference on Signals, Systems, and Computers , pages =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.029610Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:c2394128518e8769243da098555aaa25611ecec9a3fd05c9589b3331ae42e593","observation_id":"aa75ab18-8c5d-4644-b227-2d3132b7f199","resolution":{"observed_at":"2026-08-14T04:25:36.029610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.033720Z","title":"in preparation , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.033720Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:5fcd028468b54b35962468077cb1adace1a5a4afb811864284dc273c97087623","observation_id":"3053a203-c6e7-429a-8809-65741396cf49","resolution":{"observed_at":"2026-08-14T04:25:36.033720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.038355Z","title":"arXiv preprint , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.038355Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:98aa45315c4c4c41e5271c7568daa620f69c93da622972ae75f2ca718586cb4d","observation_id":"a73e5882-ead0-4b75-9377-3d04c8c50d7b","resolution":{"observed_at":"2026-08-14T04:25:36.038355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.042760Z","title":"2022 , volume =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.042760Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:f256d1ae70221e0fd5358dc26f99cac59709acb3e3a47db51a5e8e99f7fbc788","observation_id":"45a9dd74-7a20-47b5-8a85-e936748bfe62","resolution":{"observed_at":"2026-08-14T04:25:36.042760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.046781Z","title":"Avram and R","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.046781Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:62ab88f2b1c57bd2298eb777370eccbe371c6f802955aad65cca6af933fbad33","observation_id":"b71249d6-3a3f-4c12-8bc5-6c2ac434e406","resolution":{"observed_at":"2026-08-14T04:25:36.046781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.050883Z","title":"2022 , address =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.050883Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:672feb1c4f46aa3abf7745f8717a8a99d00c028d563322a07ea2296b590c8759","observation_id":"d0fd1387-0f47-4498-98da-7b1a3570bf52","resolution":{"observed_at":"2026-08-14T04:25:36.050883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.055216Z","title":"Avram and R","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.055216Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:a6e7de4158bed0ac6fff0a9bed9ce4449885eedb5b1ad3c539685055e7bb7566","observation_id":"827bf548-a2a0-4d87-b68f-d84b22f594f2","resolution":{"observed_at":"2026-08-14T04:25:36.055216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.059306Z","title":"2024 , month = jul, volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.059306Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:273e62d1da8986a6db5f783dcf6a0439d6ccc0f61863c8be1eefd202755695d0","observation_id":"4f67cef9-a471-4761-a238-060d9f20f2bf","resolution":{"observed_at":"2026-08-14T04:25:36.059306Z","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":"2021.31241","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:38.740699Z","title":"Wood and G","venue":null,"work_id":"ea383bcd-7805-4920-977a-e0862f47c385","year":2021},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.063435Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:e0a168d27d94fb1e3f8a5360fe98ea106ad583fe0adb60d50544943cd35a91ed","observation_id":"95f8e7ad-9b8e-4e11-8ac8-1de98a8d2d3a","resolution":{"observed_at":"2026-08-14T04:25:38.747143Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.067239Z","title":"2021 , howpublished = \"","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.067239Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:2088671b42c8032ab72899ca9cc0983d17e5f784ff17f010119d22fa2b54f77d","observation_id":"0ceea173-8a40-4bf8-bacc-0a4bc78e1c93","resolution":{"observed_at":"2026-08-14T04:25:36.067239Z","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":"10.1038/s41598-022-08389-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:37.321598Z","title":"Bianchin and E","venue":null,"work_id":"136c3d6c-94b7-4f8e-b695-9a028dc01898","year":2022},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.071270Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:13a06efc51c7ced0ead074c277b25525e7953944b8027d61cc949fac5699306b","observation_id":"42c3d925-c387-491e-ab49-8afb1aa8df47","resolution":{"observed_at":"2026-08-14T04:25:37.325832Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.075275Z","title":"Bianchin and E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.075275Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:9970be05d3842eca108c56c4ff34c28fa685551e960097d0ed0e5883fb82c9bd","observation_id":"f57a0402-13f9-48fb-b34e-262b003397a1","resolution":{"observed_at":"2026-08-14T04:25:36.075275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.079150Z","title":"2021 , pages =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.079150Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:6d22c4558a00671530b778ac133b9c46ec291c1b0df9ac469cfb33072304fe4f","observation_id":"6a372fb4-8b83-40f8-9262-de25f773325e","resolution":{"observed_at":"2026-08-14T04:25:36.079150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.082645Z","title":"Galarza-Jimenez and G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.082645Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:bb6c636bb249171bbd5d53f8e318a0aa9c26585c9612c4a14f9aca0c7683059c","observation_id":"73d347b4-65be-4c96-8dec-c1184c9ef1cb","resolution":{"observed_at":"2026-08-14T04:25:36.082645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.086156Z","title":"2020 , howpublished = \"","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.086156Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:0fb6c741d742e6d5b7aaba01913bc3c4074451ba5ac4cfa52eda5d3a9ace2cfa","observation_id":"a08a681b-ad7f-4ad2-929c-e545b8c071fa","resolution":{"observed_at":"2026-08-14T04:25:36.086156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.089810Z","title":"Bianchin and J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.089810Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:0ab83c88c45a4c58585f1e8eb46105604f2bdc1b49045a367635ea4828d64f73","observation_id":"a64f51b3-bd12-4f85-9dd5-0a8913edc71f","resolution":{"observed_at":"2026-08-14T04:25:36.089810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.093674Z","title":"Galarza-Jimenez and J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.093674Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:31c8f2eda920786b4f506bf7031a14c3af11cf84b6463ee5b855f1f81d5666dc","observation_id":"df038ead-0384-4ac0-ad7a-d3fc32388d15","resolution":{"observed_at":"2026-08-14T04:25:36.093674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.097481Z","title":"Bianchin and J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.097481Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:cc2b6dbe871f5bc1f7bb1c4bf5165187ba160e54fd78752db94ea589af68e9e2","observation_id":"eee654e3-45d0-4789-a26a-85b61a0b6566","resolution":{"observed_at":"2026-08-14T04:25:36.097481Z","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":"docview/2404628","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:38.412538Z","title":"Bianchin , school =","venue":null,"work_id":"27675683-1833-4ea9-81cb-547c89517f23","year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.101026Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:036dd1205475c9ac4ed059dd326df4f45ac3c2ea83c7a49911d2f8327caa48ef","observation_id":"e63867ec-b991-4ae9-a88c-eea283c33ff2","resolution":{"observed_at":"2026-08-14T04:25:38.418658Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.104699Z","title":"2020 , address =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.104699Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:3a64086d15bbfd5aa33f14933fd3411384c7cb0e4273628b1cea0c8c796c6c65","observation_id":"ec34de86-e1b2-438f-bb79-65e0a3f08d54","resolution":{"observed_at":"2026-08-14T04:25:36.104699Z","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":"2019.10865","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:38.342618Z","title":"Liu and G","venue":null,"work_id":"5af306f8-6fe8-4eed-999b-8a8290849f5b","year":2020},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.108646Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:686b63c6757bb7a7d9177e1f12e4d3b24df4f8296affbc5764b0eedf05fa0f75","observation_id":"09eb715a-209e-4a02-965c-41b0215fd44f","resolution":{"observed_at":"2026-08-14T04:25:38.349315Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.112489Z","title":"Bianchin and Y.-C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.112489Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:834a5cb1a7e06e73110b7a0087f04dc96869c2305653442fac2dde828b2a82ae","observation_id":"7f7106e6-3a8b-4372-89c7-e949a707a259","resolution":{"observed_at":"2026-08-14T04:25:36.112489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.115706Z","title":"Bianchin and F","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.115706Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:ff0f77e2ed535dffb2f7e64b7f3091562bc96e50a76348e81a3a6d2c8a7bf959","observation_id":"2fa930df-b486-4d12-a5e4-e3de1727801c","resolution":{"observed_at":"2026-08-14T04:25:36.115706Z","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":"2019.88152","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:38.208896Z","title":"Bianchin and F","venue":null,"work_id":"d9723293-85c6-46fc-9f2a-2e70d47d174c","year":2019},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.118972Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:db54b94dade1a9ee7350a396169097b2fa00b4015bb04c0ae64220ccff500608","observation_id":"b9feff79-4a42-4b07-8a99-ebb29948e0b9","resolution":{"observed_at":"2026-08-14T04:25:38.214757Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.122343Z","title":"Bianchin and F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.122343Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:c7d71b20a83435b7c2597e84a17019a5392bddfabb0d036b1ae1bde80c68d796","observation_id":"a06866d3-bb20-4474-bd71-391d369007e9","resolution":{"observed_at":"2026-08-14T04:25:36.122343Z","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":"10.1007/978-3-319-98935-8_8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":"Bianchin and F","venue":null,"work_id":"4bc83a70-5178-4e44-abf7-cb1039916566","year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.125995Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:3746b87b5c4401ff5d2e0b4d04b9740a0ffb2dc1a3cc536c647ca128ef1cf71d","observation_id":"d811955c-431a-4b1c-bf32-486b27ca647b","resolution":{"observed_at":"2026-08-14T04:25:37.313347Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2018.86193","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:38.140125Z","title":"Bianchin and F","venue":null,"work_id":"da66e005-a9f9-4d63-8994-78ddc0724afe","year":2018},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.129461Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:7beabbce72b9ea28941c529d29af5ebbfb298a3d4298bc6995e92e0b4923a8ba","observation_id":"813e55b5-16f4-4f64-ac56-ec05601f6be2","resolution":{"observed_at":"2026-08-14T04:25:38.146333Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2017.79629","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:38.062767Z","title":"Menara and G","venue":null,"work_id":"fb13192d-1b0e-4dea-bc4e-0e9e791594df","year":2017},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.132667Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:afdae01c6f546125ad2b1cfabb1126c30bae68e9c315161d824d551ef4d3be4e","observation_id":"eec063bd-949d-4eab-b648-b0c04a601cd1","resolution":{"observed_at":"2026-08-14T04:25:38.068894Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.136344Z","title":"Bianchin and P","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.136344Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:66bc446164c6dac0d269d7ce07562663dd4109d2bbd0d3ea10c07a156c081212","observation_id":"c376b4ad-25ac-4a29-97b0-3a41313c86a2","resolution":{"observed_at":"2026-08-14T04:25:36.136344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.140975Z","title":"Bianchin and P","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.140975Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:9f820a40422f1980733fa2ca34772620fc83968748008aad4fe78846eac64003","observation_id":"e3a891f1-9a6a-45a9-a1e2-69b4df4c42aa","resolution":{"observed_at":"2026-08-14T04:25:36.140975Z","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":"2015.74020","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:37.927991Z","title":"Bianchin and F","venue":null,"work_id":"c7d42543-ed7d-4ab7-b9fc-94912a998736","year":2015},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.145274Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:83b317f6984b160e67f520d70805d90f5f99cb348c41f805f94a0576bb3f19bb","observation_id":"4639222a-6595-4ca3-9dae-a602f5502e53","resolution":{"observed_at":"2026-08-14T04:25:37.933966Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.74028","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:37.860048Z","title":"Bianchin and A","venue":null,"work_id":"33d54bd9-958e-42dd-9800-ee96975845be","year":2015},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.149355Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:08ac62c4a64b7fdb6b9842ebaa77fc48748a14a8b0e95cf70e132f27d8b90104","observation_id":"e17168a4-c981-42f4-87a1-969e745744cc","resolution":{"observed_at":"2026-08-14T04:25:37.866915Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.153221Z","title":"Bianchin , school =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.153221Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:df68f7c1551fb077e7553370248e329878020b522862286edc33f45e16f5715f","observation_id":"2e9632d7-e1fc-40c5-8062-8192bd4843d7","resolution":{"observed_at":"2026-08-14T04:25:36.153221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.157030Z","title":"Internal Model-Based Online Optimization , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.157030Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:5045787d3eed3c03eebcedfd9ae5cb905bfb7f2ee541c889803f6ea9f795faf4","observation_id":"1c058b29-876a-4aab-b6b2-873795a8e850","resolution":{"observed_at":"2026-08-14T04:25:36.157030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.161080Z","title":", title =","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.161080Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:b7da154d9231ece85ef46be588a9de64cde131d60315737ccad04280d633c2ed","observation_id":"57d698bf-01cc-4d11-909f-9de786183607","resolution":{"observed_at":"2026-08-14T04:25:36.161080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.165017Z","title":"and Isidori, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.165017Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:592245071fd7d417b0df6ed90dbc48cbccb0962f95f9a3be2bdeb1c70e71eb2c","observation_id":"7935633c-93b1-48ca-bda7-27fd0d2d5a8f","resolution":{"observed_at":"2026-08-14T04:25:36.165017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.168951Z","title":"2004 , isbn =","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.168951Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:8f3ab2d6b65ffb8b4e2bfac50ca44f98df3d7472b51a4ed0611eb8e9d43d76f6","observation_id":"a5709364-f1d3-4db1-a50a-f84522490bf7","resolution":{"observed_at":"2026-08-14T04:25:36.168951Z","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":"10.1007/978-1-4614-1806-1_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":"Center Manifolds","venue":null,"work_id":"353bca9f-3427-4fa2-abd5-425effd5c04c","year":2011},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.172815Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:1b9815e5ae4bd11ca333457b52f4b4e8c5fc7dd6d3cb96de0d6a5ef4ff35ee5f","observation_id":"f5edb7ee-1d6f-40eb-8676-acb646edffe3","resolution":{"observed_at":"2026-08-14T04:25:37.300552Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.178017Z","title":"Journal of the Franklin Institute , volume =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.178017Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:c7723a9a7e04943252ab32d1a3ccd52f47a1e14d8cdd2921a72f0afb5c25f1c9","observation_id":"808403d7-5299-42c4-aec7-e009daf495c3","resolution":{"observed_at":"2026-08-14T04:25:36.178017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.182149Z","title":"2019 , doi=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.182149Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:68a4452533f374c0e0f2ca8f50e53c9fc3270bcc1aabed84aa2dd6a4609035bc","observation_id":"5bdf1ae2-b5fc-4250-8db0-6651451fb480","resolution":{"observed_at":"2026-08-14T04:25:36.182149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.186195Z","title":"and Mayne, D.Q","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.186195Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:a9501ffe0565f775ae750a6a075ab2f89d3796087116a69ad12707f2cd712720","observation_id":"4ffb4550-ff47-4c15-b607-c80ba1d13764","resolution":{"observed_at":"2026-08-14T04:25:36.186195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.190112Z","title":", publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.190112Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:494be95d8d008f6266abed640338f4886613050854c00f4d293b3607f6745e50","observation_id":"5ceeefb5-cf9f-452a-8b41-bd31e3cbb04a","resolution":{"observed_at":"2026-08-14T04:25:36.190112Z","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":"10.1016/0167-6911(93)90087-m","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:37.280736Z","title":"1993 , issn =","venue":null,"work_id":"f1e9dcdb-3d42-4d82-bddd-3704db9b9b60","year":1993},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.194271Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:8d08da6d0ece9d56addcc8094e90ebc97fb06d7f27b54a13a8c56a255d87edc5","observation_id":"b573e60c-806b-48b1-ae0a-2aae2c80ad60","resolution":{"observed_at":"2026-08-14T04:25:37.285800Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.199115Z","title":"and Vaidya, Umesh , journal=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.199115Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:c965dbd4bdbae84f4ef8b051d62fbdae4795ef0040259bc0196866e1d1c07966","observation_id":"eae5815d-eea8-457e-a53d-2bf958a16031","resolution":{"observed_at":"2026-08-14T04:25:36.199115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.203146Z","title":"Fixed-Time Stable Gradient Flows: Applications to Continuous-Time Optimization , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.203146Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:fadc8766b502d1fd4f9c2b677fe602fc777e94d13b0dcb2fbb3cfcf0c4029110","observation_id":"4b000d54-ef09-43fe-b80a-a51e13754cf5","resolution":{"observed_at":"2026-08-14T04:25:36.203146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.206762Z","title":"2023 , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.206762Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:dd820d40b4580fdb00429e039b6c664840893d08c0f379e39b16a0694ac05988","observation_id":"f0e58fea-c1c2-4ef7-905b-019cbff3ad5b","resolution":{"observed_at":"2026-08-14T04:25:36.206762Z","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":"10.1016/j.ifacol.2023.02.062","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:37.266582Z","title":"2023 , note =","venue":null,"work_id":"ab6d9819-edd1-41f8-add1-f15443607537","year":2023},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.210546Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:fe2fbe02f3e605b0eef08d14a5fc2d526afc26feb577eaa4520c02ef69b8e338","observation_id":"c47b327a-0309-42d1-8752-583613b8bcf7","resolution":{"observed_at":"2026-08-14T04:25:37.271022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.214748Z","title":"2024 , issn =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.214748Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:cc0f68e4fdf8142c82fedba602e4db79cd80281a65a00b1cd0e88ac563050146","observation_id":"9caeb151-7203-445d-92b5-871738959b19","resolution":{"observed_at":"2026-08-14T04:25:36.214748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.218507Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.218507Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:5b2e7a393de98c6748fd8d46bcde34309b689eb8c9d7ee1f4767cde48475a026","observation_id":"b1df33a0-96da-491b-b7f6-15676dd7e2de","resolution":{"observed_at":"2026-08-14T04:25:36.218507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.221686Z","title":"Saddle-Point Dynamics:","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.221686Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:23ad4fc17bf27761689401907b06579b1aef83fb2fe8ecf73c96070cbe07c9e6","observation_id":"8c291440-a230-4f5a-ad2d-3ea5752e9c8e","resolution":{"observed_at":"2026-08-14T04:25:36.221686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.225092Z","title":"and Khong, Sei Zhen and Jovanovi\\'","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.225092Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:1a1472c72b74879585c214a3047f5bf360169526ca2df284b71a94f3b339f3d7","observation_id":"189b0ca8-6599-4a4e-9978-5f19e653e85c","resolution":{"observed_at":"2026-08-14T04:25:36.225092Z","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":"3013.00027","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:37.653695Z","title":"On a Class of Smooth Optimization Algorithms with Applications in Control , journal =","venue":null,"work_id":"b8831fab-1669-4d1e-9e31-a34dc82f1c33","year":2012},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.228496Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:4a0a4f203fb3df84165ba3e415b8feafa4ac4fede9906e7996c1698879248239","observation_id":"92220090-aab3-4cea-8553-8939e9586645","resolution":{"observed_at":"2026-08-14T04:25:37.662468Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.232184Z","title":"Accelerated Mirror Descent in Continuous and Discrete Time , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.232184Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:abab13aa8e94406e4d5a35902d800c77c7740069a4556aa61027ec1b42a7dc4f","observation_id":"3b634ba8-d6e6-4eb8-8b78-f95542a6a577","resolution":{"observed_at":"2026-08-14T04:25:36.232184Z","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":"10.1007/978-1-4471-3467-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":"doi:10.1007/978-1-4471-3467-1 , publisher =","venue":"Communications and control engineering/Communications and control engineering series","work_id":"5d554a22-2824-43ac-8372-7f28b655a46f","year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.236487Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:f4044963b49e9e3a6fff12a12e28243879ca1f2d30cfae1ed7b3226a3dda6bfd","observation_id":"2753915b-d514-4952-a958-eb32806a5d66","resolution":{"observed_at":"2026-08-14T04:25:37.247829Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.240325Z","title":"The Gradient Tracking Is a Distributed Integral Action , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.240325Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:c08460864142803ea7a10039f8d2d4f60cb37903c1fcf62cb257c039b54428a2","observation_id":"bba4c4bb-3f59-4448-931f-7ab41fe0d717","resolution":{"observed_at":"2026-08-14T04:25:36.240325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.244973Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.244973Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:6080249331ba8d344d338c10f4a5ae9f150a31895df34f7e9030cade5dfeb752","observation_id":"7e42c977-d3ce-4d44-a0f6-8705886c72a3","resolution":{"observed_at":"2026-08-14T04:25:36.244973Z","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":"10.1016/j.physd.2004.07.011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:37.228143Z","title":"Qin and G","venue":null,"work_id":"0f05aa99-d3b3-4ad3-a6e2-cc134c9edf9c","year":2004},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.249870Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:2133c08d790be4a844dfb923fe578437f566a9c011632832de47be66e1c7ac0b","observation_id":"2e77f0ac-4a84-4253-851f-65139f68b7aa","resolution":{"observed_at":"2026-08-14T04:25:37.234092Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.254143Z","title":"2006 , journal =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.254143Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:c11af2639b5b727b18cc0f8a664e34b5a6466acaaa0cfb559581cb701d693467","observation_id":"acf203d5-11de-4ad2-bd21-8ae9135db0c3","resolution":{"observed_at":"2026-08-14T04:25:36.254143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.258110Z","title":"Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.258110Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:e9f27d7477b27a4c522ee4dcb63f2318bf37131d6cf5f4eb35a8a63b068b26b9","observation_id":"52b6bab7-19f4-456c-813f-fdd8f7486aee","resolution":{"observed_at":"2026-08-14T04:25:36.258110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.262671Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.262671Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:ee51e2ef755cf99a6cbd323ff63582e007df36cba9e6ab5be7acd31a6f366a78","observation_id":"c1fceeba-b21c-4180-9b7b-1dc6a1f344da","resolution":{"observed_at":"2026-08-14T04:25:36.262671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.266596Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.266596Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:9b116524c51cdb398170aa88ddb9e880e36a0df8e390faef83cb10c356e86039","observation_id":"4d0b2e72-0438-48b1-8e7d-925fd4fd255d","resolution":{"observed_at":"2026-08-14T04:25:36.266596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.271415Z","title":"2012 , publisher=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.271415Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:5c44275dfaf4076a0d332948f9d6b08155c7e4352520bbd1d89af26465159c33","observation_id":"6a594daa-9ede-4041-b5f2-7ed14352474a","resolution":{"observed_at":"2026-08-14T04:25:36.271415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.275198Z","title":"1993 , publisher=","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.275198Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:326350fed97d4bf4970d31a3a854dd8637914c7364f6a83d86893ad2360afe8e","observation_id":"03568a71-719a-41f2-a876-b475b3eb2418","resolution":{"observed_at":"2026-08-14T04:25:36.275198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.278902Z","title":"2007 , publisher=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.278902Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:b571279c7130164dbadb8e6cb10277c5cd3fd14bff5f97d9815e1d915171cb6b","observation_id":"3ffd5d40-7803-4802-9684-4f8c8151c805","resolution":{"observed_at":"2026-08-14T04:25:36.278902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.282618Z","title":"Huang and Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.282618Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:9ca71029c186d141047eb156f22422e84dd790b76fcbddd57faea32f2e28a1b6","observation_id":"796981b0-f1ef-4496-8da8-c812d51b5254","resolution":{"observed_at":"2026-08-14T04:25:36.282618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.289156Z","title":"Acemoglu and V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.289156Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:ad3232a30513f4a667d27b42b5a1be2134716adb80ec020731d36a7c66e10065","observation_id":"68892018-9c44-4f17-9404-f0792398da2f","resolution":{"observed_at":"2026-08-14T04:25:36.289156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.292850Z","title":"1988 , publisher=","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.292850Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:7de1a68d97ee3836fa802117c7c09fad3e764360e6352f678304b361ae4673e9","observation_id":"ae882ab8-fa31-4ff5-ae74-9e373d98125d","resolution":{"observed_at":"2026-08-14T04:25:36.292850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.296488Z","title":"Nature , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.296488Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:4b19b4b3377aa13f8948ecc069e495208da00dc8762b66965256609a23eb1bdd","observation_id":"933530f4-e7cc-40fa-ada4-525b0aeedf5b","resolution":{"observed_at":"2026-08-14T04:25:36.296488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.299750Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.299750Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:ccfd900b2268500341e5e9be340a07a8fcbd4818c178e0ef9270b471688a567f","observation_id":"1107d82d-8f8f-4c9c-800d-473c0a6e5448","resolution":{"observed_at":"2026-08-14T04:25:36.299750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.302627Z","title":"2019 , note =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.302627Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:6bf542cc14fda69475f467573123a209b7488bab57f7cec53658f8e275375082","observation_id":"787f32c5-47c4-41de-8545-d6bbcc4edc78","resolution":{"observed_at":"2026-08-14T04:25:36.302627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.306058Z","title":"Epilepsy Research , pages =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.306058Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:510ca8af923b148210d87cbb2d4585952688da4ff845118d68896308d879adf9","observation_id":"d026a64d-b692-4950-972a-4b55f92fec65","resolution":{"observed_at":"2026-08-14T04:25:36.306058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.309594Z","title":"Nature Reviews Physics , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.309594Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:69f2143c6108e09a65d1b299a9b2ba7bb25cb08fc0f7494f90c5afa17f5d12ee","observation_id":"78203ad6-1e82-4df6-8d2f-09a26266d148","resolution":{"observed_at":"2026-08-14T04:25:36.309594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.313364Z","title":"2013 , publisher=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.313364Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:93d7f8b7aec6c3b2946df47f80c5f66e1c078b8cfd95d8315a3a81e44da5bdd0","observation_id":"2bc8de70-5a17-41ff-9e87-65d13039221e","resolution":{"observed_at":"2026-08-14T04:25:36.313364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.317082Z","title":"Nature Ecology & Evolution , volume=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.317082Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:cd085ea234e50cc4743be0e1a35ec6148558ca340c57bdc98db06fb68ec2d108","observation_id":"08767582-d749-4e25-bb19-a8aa530a711f","resolution":{"observed_at":"2026-08-14T04:25:36.317082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.320929Z","title":"The neuroscientist , volume=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.320929Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:90ab93a89d7a656be8b3ba8d9a6be0b115e32327e9f48ad14743212573e93ba4","observation_id":"3b2fc01c-7811-4213-a004-7259e98ba800","resolution":{"observed_at":"2026-08-14T04:25:36.320929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.324911Z","title":"Nature , volume=","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.324911Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:de3d5c994bce2b4601b13fa45dff90ae69f4f525c551b60c7de4a2da879fb408","observation_id":"389fd0f1-e8fa-48a1-84b1-118e2c0e5086","resolution":{"observed_at":"2026-08-14T04:25:36.324911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.328836Z","title":"Nature , volume=","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.328836Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:7c14bcfe46d1cbf24fe57019f129ed3ec42cb288fb38318e117067b93f015097","observation_id":"54ba70c2-e88f-449f-b393-b68f33c47577","resolution":{"observed_at":"2026-08-14T04:25:36.328836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.332440Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.332440Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:ccb136b7b28994d7ccc4749eedd73c8eada29f4585751ffc6c6145297517fdcf","observation_id":"e8ec01a6-d387-4bb8-bc2e-dc0974c41ac7","resolution":{"observed_at":"2026-08-14T04:25:36.332440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.336179Z","title":"Talagrand , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.336179Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:948856f2ea4a814c7abcd47056bf46f6b09671fdb4fd2c10526322f6843ed86f","observation_id":"3c00fa5f-7e16-4e60-8745-57a15c61a88b","resolution":{"observed_at":"2026-08-14T04:25:36.336179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.339880Z","title":"Gratton and D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.339880Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:bc8a827ba716a36cb6faf7bdde1f516b92721c8369003dc256865e33e01f9281","observation_id":"67131493-d488-46e4-a2d4-fc72e24c9d0c","resolution":{"observed_at":"2026-08-14T04:25:36.339880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.343600Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.343600Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:b66dd66946b954b034689e0216da820bcd4a4a93d682f0e1a582f853511715b4","observation_id":"9e71bfbb-647d-4a3e-bc02-00c6939755d3","resolution":{"observed_at":"2026-08-14T04:25:36.343600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:25:36.347370Z","title":"1990 , publisher=","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-14T04:25:36.347370Z"},"links":{"citing_paper":"/paper/2608.08979"},"observation_digest":"sha256:6734953a5ec7e8b16987b02f3fd6bdeddd744693d27cd27e1e003b20f88595c0","observation_id":"8eeba34a-cbab-4934-9d60-3cce90021fcd","resolution":{"observed_at":"2026-08-14T04:25:36.347370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.08979","last_updated":"2026-08-12T04:53:50Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T23:09:38.695397Z","submitted_at":"2026-08-10T00:50:31Z","title":"Direct Search Methods for Online Nonconvex Optimization Under Inexact Bandit Feedback"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":8,"parse_uncertain":0,"unresolved":83,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":300},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2608.08979."}