{"as_of":"2026-08-15T20:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30d49424a15d6421397e0b56c16917c0fef6fbf348f6576c5b8e2c427009e7b5","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:00:29.483520Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T17:33:00.747846Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T17:33:09.432270Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"cited_work":{"arxiv_id":"2502.01014","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01014","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Refining adaptive zeroth-order optimization at ease.arXiv preprint arXiv:2502.01014","venue":null,"work_id":"a93aaf2f-5a83-4127-9516-6ef630fe17e8","year":null},"citing_paper":{"arxiv_id":"2510.00761","last_updated":"2026-04-18T07:30:06Z","snapshot_observed_at":"2026-08-11T09:04:40.878407Z","submitted_at":"2025-10-01T10:50:14Z","title":"Downgrade to Upgrade: Optimizer Simplification Enhances Robustness in LLM Unlearning","version":5},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-18T10:44:53.516653Z"},"links":{"cited_paper":"/paper/2502.01014","citing_paper":"/paper/2510.00761"},"observation_digest":"sha256:f7907a27cb41742b45e4e95bd93d59fe847540e6e1e53e5940a6ab40f66625ab","observation_id":"c65c9fe0-cb47-49e7-8a96-d778bdb0d10e","resolution":{"observed_at":"2026-05-18T10:46:16.977775Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"cited_work":{"arxiv_id":"2502.01014","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01014","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Refining adaptive zeroth-order optimization at ease.arXiv preprint arXiv:2502.01014","venue":null,"work_id":"a93aaf2f-5a83-4127-9516-6ef630fe17e8","year":null},"citing_paper":{"arxiv_id":"2605.09034","last_updated":"2026-05-15T13:21:07Z","snapshot_observed_at":"2026-08-12T12:25:59.287871Z","submitted_at":"2026-05-09T16:16:45Z","title":"Accelerating Zeroth-Order Spectral Optimization with Partial Orthogonalization from Power Iteration","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-12T02:18:17.478817Z"},"links":{"cited_paper":"/paper/2502.01014","citing_paper":"/paper/2605.09034"},"observation_digest":"sha256:6f595b03581f31ed65d6dba573f8b17afc676ae22be14853819651bd19269994","observation_id":"23021111-53cb-49c5-902d-c30b7e950184","resolution":{"observed_at":"2026-05-12T02:21:16.962261Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"cited_work":{"arxiv_id":"2502.01014","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01014","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Refining adaptive zeroth-order optimization at ease.arXiv preprint arXiv:2502.01014","venue":null,"work_id":"a93aaf2f-5a83-4127-9516-6ef630fe17e8","year":null},"citing_paper":{"arxiv_id":"2605.09034","last_updated":"2026-05-15T13:21:07Z","snapshot_observed_at":"2026-08-12T12:25:59.287871Z","submitted_at":"2026-05-09T16:16:45Z","title":"Accelerating Zeroth-Order Spectral Optimization with Partial Orthogonalization from Power Iteration","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-19T17:33:00.747846Z"},"links":{"cited_paper":"/paper/2502.01014","citing_paper":"/paper/2605.09034"},"observation_digest":"sha256:48ea6761439bb1ac8c23b457800114056c06ba6f5194662e1f203c387f9b51f3","observation_id":"797ddb56-6f2b-4323-b66e-4b5416b35c05","resolution":{"observed_at":"2026-05-19T17:33:09.434746Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.01014/citation-record","integrity":"/paper/2502.01014/integrity","json":"/paper/2502.01014/citation-record.json","paper":"/paper/2502.01014"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:30.046542Z","title":"C., Foster, D","venue":null,"work_id":"5fce9970-d3e3-4ec2-b6ec-84b1fceba708","year":2023},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.318141Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:91a329f8d9888e26381e8dcb3fd7af8936a9dd1933a3bb993829e8e377fb2e22","observation_id":"854a7abe-da7f-46c9-9b68-85be225aba15","resolution":{"observed_at":"2026-08-09T17:00:30.052568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:30.029144Z","title":"Zo-adamm: Zeroth-order adaptive momentum method for black-box optimization","venue":null,"work_id":"120cc3f7-1f66-4d79-b2b6-63a1a7be8102","year":2019},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.323850Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:3e88eb17a1969ee81808e70dd82478d44b4db33ce42d61928dfa82654e572ec4","observation_id":"00b3c4c0-7539-4a74-9ebf-1340fb3a29c2","resolution":{"observed_at":"2026-08-09T17:00:30.034194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:30.013526Z","title":"On the convergence of prior-guided zeroth-order optimization algorithms","venue":null,"work_id":"3469d9e3-b769-43d9-88fc-a1db48d831d6","year":2021},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.330368Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:b9e5581aeeaea7461c40066daecd39762f55e98856d1044ef4ed662650ae02c6","observation_id":"f8dc7a7f-4080-4920-8315-67fa2cd17026","resolution":{"observed_at":"2026-08-09T17:00:30.018807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.996997Z","title":"C., Bartlett, P","venue":null,"work_id":"d44e0247-6bd6-4312-982a-6edd27f1952c","year":2012},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.336081Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:48069b6d54b194d037b45e61c40c5b054dd4db57a222872727cb2333dc700981","observation_id":"d6f7910e-847a-40b7-8705-5708a250631d","resolution":{"observed_at":"2026-08-09T17:00:30.002217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.979877Z","title":"T., and McMahan, H","venue":null,"work_id":"30f70c2c-c2af-4e74-a2ef-39ea3ad3a6ff","year":2005},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.344209Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:f392b592c4859b6e20fe1f2e703ec8a1c0815f391e71375a5ba62389a703dc13","observation_id":"42a2d684-c888-454d-9135-3030cc48e8d6","resolution":{"observed_at":"2026-08-09T17:00:29.984984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"cs/0408007","last_updated":"2004-08-02T21:24:41Z","snapshot_observed_at":"2026-08-15T18:59:00.318508Z","submitted_at":"2004-08-02T21:24:41Z","title":"Online convex optimization in the bandit setting: gradient descent without a gradient","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0408007","snapshot_observed_at":"2026-08-09T17:00:29.350038Z","title":"D., Kalai, A","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.350038Z"},"links":{"cited_paper":"/paper/cs/0408007","citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:3899a550adf17ac23e42905fe05573d5061ab01021dd52790b0e625a47db86b4","observation_id":"97f137c5-11ef-4a1a-a999-3c621b822f90","resolution":{"observed_at":"2026-08-09T17:00:29.350038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.963855Z","title":"and Lan, G","venue":null,"work_id":"fc82bc34-7783-4edb-b17c-5fe3daf88db8","year":2013},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.357630Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:27e4e17ee5b80c25c5e96a2154fcf7309e2429af3fb453764ccd90ae20f0d1e2","observation_id":"c782f137-dfc1-4857-b1dc-cdd0f5cedd43","resolution":{"observed_at":"2026-08-09T17:00:29.969062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.948275Z","title":"Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization","venue":null,"work_id":"87d2d1b3-f4a1-447b-a59a-7cc0ea0cb1a0","year":2016},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.363223Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:72551f5c5d44f20ff83dc91d22c91c15962fc2b1bcc9d06e5f8285491ddb8cc5","observation_id":"a3b9ab25-3877-401d-a9ad-ed61c4f4aa9a","resolution":{"observed_at":"2026-08-09T17:00:29.953219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.932780Z","title":"Neural networks for machine learning - lecture 6a, 2012","venue":null,"work_id":"7b000a2f-fbc4-4981-9302-db5c5441736a","year":2012},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.368200Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:92336c29ab92ed4490d1ba3c5b9c57776f508298db724ca48b31f0c33db59ba3","observation_id":"665fd06d-fc5f-4d98-a263-86840253f1a0","resolution":{"observed_at":"2026-08-09T17:00:29.937785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.917140Z","title":"M., and Koyejo, S","venue":null,"work_id":"23ccfba0-95bd-4e51-86e9-ca1c23d902eb","year":2021},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.373604Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:6a9ba415b9b6f7b26dfb5d09b17b862f2319369962aeddc31a1e073d36d389a3","observation_id":"1afd5f44-5cdc-4369-a191-7962439d40bd","resolution":{"observed_at":"2026-08-09T17:00:29.921740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.901331Z","title":"Zo-adamu optimizer: Adapting perturbation by the momentum and uncertainty in zeroth-order optimization","venue":null,"work_id":"f11b971c-9a2f-47b3-8c47-319a367e3245","year":2024},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.378492Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:0f720b943794595e2337d755040e1a296698f24857498538a29223de3ca08807","observation_id":"173b16fd-4fc0-484a-83b7-1a5d1846f208","resolution":{"observed_at":"2026-08-09T17:00:29.906465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.886669Z","title":null,"venue":null,"work_id":"5ba77102-9e1a-4a95-9e0d-985268ea5871","year":2015},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.383219Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:ba0c2906481455c946b47603cc94dbbc0fb95948925ce7815372d4c69424b022","observation_id":"bafe7a2f-1f50-40d9-8ac7-9bed4a60169c","resolution":{"observed_at":"2026-08-09T17:00:29.891325Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.871057Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":"80aae2c9-e11b-4269-a948-692a2eea40f0","year":1998},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.388132Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:6efe58e5bc310e9ded1e23961d08ef461956a185f50ee8b675eb24e997c06cfa","observation_id":"4eb1379c-c817-4987-ac1d-3380f8dafba5","resolution":{"observed_at":"2026-08-09T17:00:29.876162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.854953Z","title":"A comprehensive linear speedup analysis for asynchronous stochastic parallel optimization from zeroth-order to first-order","venue":null,"work_id":"208246d3-0551-4e91-b3a8-627836b832de","year":2016},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.392757Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:53bcf3e2662a46aee547981dfd9c188cddeee59690bc908358705a94f549d056","observation_id":"3cbc9c87-97b6-4fdf-adec-6ec1e218ec2e","resolution":{"observed_at":"2026-08-09T17:00:29.860213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.839306Z","title":"Zeroth-order stochastic variance reduction for nonconvex optimization","venue":null,"work_id":"15f84902-0c99-476f-96be-e7a41111258d","year":2018},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.397412Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:385bd4f048d0411daae7f9611da3639428c9a27969ce7fedbcfc9d61b85d55ad","observation_id":"26ced2df-781e-4be4-9d81-d02fa7f8ba70","resolution":{"observed_at":"2026-08-09T17:00:29.844867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.820002Z","title":"D., and Amini, L","venue":null,"work_id":"3d3dfe37-26fc-49cc-b177-d0e4b691c8ab","year":2018},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.402234Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:cef9548a81efc91b7c7a3d28f2c984eced5d736bc97e42e4cb1211c7eaa9fb01","observation_id":"29f767c0-f685-4da3-a43c-36835ccb8794","resolution":{"observed_at":"2026-08-09T17:00:29.825053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.804286Z","title":"signsgd via zeroth-order oracle","venue":null,"work_id":"29c8b864-b826-46b9-b621-273eeab1bda8","year":2019},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.406935Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:a2db02391f458caec5d4e5d1b4e49f53539574cbb47b9d4bac185cf54058f09f","observation_id":"eb99cae0-d86b-4b96-9f8b-4022b6f20818","resolution":{"observed_at":"2026-08-09T17:00:29.809294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.788398Z","title":"An improved analysis of stochastic gradient descent with momentum","venue":null,"work_id":"ef6cbe28-b818-4d29-b7ea-c3c6bc3d99a8","year":2020},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.411614Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:8669cc3576474d9aca513e952419cad944dea46118f777dde28d99c92240b892","observation_id":"17fc3b33-515f-4bfe-b409-25bb4d0fa5e1","resolution":{"observed_at":"2026-08-09T17:00:29.793517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.771342Z","title":"D., Chen, D., and Arora, S","venue":null,"work_id":"3b9e8c10-3977-4654-b756-e8713367ab7a","year":2023},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.416549Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:695a9f827fc861b0f4e3214b47d30208ad80833c6a34d69cc65d55e3ba63cfe4","observation_id":"7f1e0dbd-69b0-4416-848e-678986579dbe","resolution":{"observed_at":"2026-08-09T17:00:29.776287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2005.09261","last_updated":"2020-05-24T15:14:43Z","snapshot_observed_at":"2026-08-10T01:13:32.660024Z","submitted_at":"2020-05-19T07:44:52Z","title":"Adaptive First-and Zeroth-order Methods for Weakly Convex Stochastic Optimization Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.09261","snapshot_observed_at":"2026-08-09T17:00:29.421440Z","title":"A., and Michailidis, G","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.421440Z"},"links":{"cited_paper":"/paper/2005.09261","citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:f7d01b0c8b7b13d6af00efa65398d3cc06b3852c857024cd463a8306cd11a537","observation_id":"c07a6bbc-a637-4fc3-9b14-fcf3e2ab9889","resolution":{"observed_at":"2026-08-09T17:00:29.421440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.753782Z","title":null,"venue":null,"work_id":"7e5aae30-d79e-4048-aadc-0086bea1e877","year":2017},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.427222Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:a0fa8bd855691eff0bd1b6c49e60514925d00785301deea3d5e179641c91b999","observation_id":"6194ed4e-9155-4c71-9ab6-f479e98c4390","resolution":{"observed_at":"2026-08-09T17:00:29.760026Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.736989Z","title":"A., and Gordon, A","venue":null,"work_id":"e1be06d8-afd9-4e5b-8b8e-5bbb939b4024","year":2011},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.432293Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:a2712f5fb06dacf82ccd47e2b47734ef5657008b10e54346b853ada28389dbd0","observation_id":"16fc0449-00a1-4f20-be99-e5b7036abbe0","resolution":{"observed_at":"2026-08-09T17:00:29.742330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.720776Z","title":"D., Blaas, A., and Gal, Y","venue":null,"work_id":"bd5ba393-d57c-45cf-9c27-64f056806e7b","year":2020},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.437736Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:311798724b0d266b81b19bcd2cfb38eb0282c103411c2de3c65d933ac0139d1f","observation_id":"d8e5ddc8-396f-4ccf-9931-50a9f4d12b30","resolution":{"observed_at":"2026-08-09T17:00:29.725776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.700861Z","title":null,"venue":null,"work_id":"a6615a88-3a57-4915-b71e-21940fddcb50","year":2023},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.442644Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:87f1c1229f5e905b7d95704134d85c3cb0a8d06494901af627ca86d5b3395820","observation_id":"f1de0993-4eb2-4494-95ba-60a5da89ed14","resolution":{"observed_at":"2026-08-09T17:00:29.707751Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.682099Z","title":null,"venue":null,"work_id":"7b91889b-ac2a-4a41-a4ca-1f9f42f11629","year":2024},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.447755Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:f9a94e2fe485dde750f95f4e3b62470b74a42f24883457417ee30ec619761fc6","observation_id":"6a4df85e-240b-41a3-9622-f86e859678e8","resolution":{"observed_at":"2026-08-09T17:00:29.687203Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.665518Z","title":"D., Ng, A","venue":null,"work_id":"38c98fdb-cb01-4722-b94a-f0b23438c195","year":2013},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.452813Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:6338d3417f434e8820b8c46645b0eeed616b455aad92e5c8b06bf43496d96155","observation_id":"eeab547d-0dda-4349-9047-c40d5b32ca8f","resolution":{"observed_at":"2026-08-09T17:00:29.670515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.645228Z","title":"Closing the gap between the upper bound and lower bound of adam's iteration complexity","venue":null,"work_id":"fd165485-c514-4df5-8fe9-d513333a11b1","year":2024},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.457568Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:a6a3bc31373606409b2d5f932a5e81acbf628ad33c3f6e0ec85aca09f948e0d8","observation_id":"bf5e238e-2432-4369-82a5-fb1aa654397d","resolution":{"observed_at":"2026-08-09T17:00:29.651910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.626646Z","title":"Relizo: Sample reusable linear interpolation-based zeroth-order optimization","venue":null,"work_id":"b7717b75-db39-412c-8f5c-6b137f2a6bd5","year":2024},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.462454Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:2ea87dbdfc43d8776aef3c9f4f366a1de2a092ec76b36bc0d573a9258a372ae0","observation_id":"9a9ff6b4-2b7a-4a7f-a4cc-f5ad30cacca9","resolution":{"observed_at":"2026-08-09T17:00:29.633152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2404.01436","last_updated":"2025-03-08T20:11:54Z","snapshot_observed_at":"2026-08-13T00:39:50.198624Z","submitted_at":"2024-04-01T19:17:45Z","title":"Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01436","snapshot_observed_at":"2026-08-09T17:00:29.467654Z","title":"Convergence guarantees for rmsprop and adam in generalized-smooth non-convex optimization with affine noise variance","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.467654Z"},"links":{"cited_paper":"/paper/2404.01436","citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:4227318025da4e9d5a013a84dd57ae18f9916f4ef93355dccc0382d2eda2ccd3","observation_id":"537537c3-3ada-4c6c-99bd-86d2ec285909","resolution":{"observed_at":"2026-08-09T17:00:29.467654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01068","last_updated":"2022-06-21T17:04:40Z","snapshot_observed_at":"2026-08-06T03:13:37.403059Z","submitted_at":"2022-05-02T17:49:50Z","title":"OPT: Open Pre-trained Transformer Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.01068","snapshot_observed_at":"2026-08-09T17:00:29.472971Z","title":"V., et al","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.472971Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:b1a50111d0539c61ec114ba41191aff2767afff2937513393d7ca1f4488fc9ee","observation_id":"b231feec-ecd8-4d0b-9d79-dc166ea8742c","resolution":{"observed_at":"2026-08-09T17:00:29.472971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:00:29.608202Z","title":"D., Yin, W., Hong, M., Wang, Z., Liu, S., and Chen, T","venue":null,"work_id":"669e61fd-cb67-4dbe-a19f-f5319eb2cebb","year":2024},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.478403Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:2521daf3dc38603f80171f64328b629b48734f128d5e32df62b1b62e6dadbba0","observation_id":"0d38ff84-3811-4f32-a126-2f5a117a5a4d","resolution":{"observed_at":"2026-08-09T17:00:29.614910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-09T17:00:29.483520Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T17:00:29.483520Z"},"links":{"citing_paper":"/paper/2502.01014"},"observation_digest":"sha256:c18f4da09666eaa1e1b234773b64e115da00ded916f78a5ea6211801ee964840","observation_id":"ccdec6c6-d0e9-4818-9012-7a74b4bcf480","resolution":{"observed_at":"2026-08-09T17:00:29.483520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.01014","last_updated":"2025-06-07T13:30:46Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T08:00:44.333752Z","submitted_at":"2025-02-03T03:10:44Z","title":"Refining Adaptive Zeroth-Order Optimization at Ease"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":32},"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 15 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 3 inbound Pith citation observations for arXiv:2502.01014."}