{"as_of":"2026-08-11T02:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d675dd5d8835c7fab2e8fab8dcdee5283231d285fd6695212852d4eca140b29","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-10T06:31:04.303077+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-10T18:17:52.871404Z","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-07-06T02:11:23.670680Z","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:223969ffa042acc277c5b17469cf88a0ff479a13cfdd9ea52fc6e635a98a127d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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-08T15:31:50.504808Z","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:ea4282004e0e584f379b55b9ad94bd717612d8fbd345419eb93cb49262cfb13a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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-08T15:31:50.504808Z","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:33491cab56d72c0c25dae27afb13232166e7e40c2a4f441f588fffaa2c74c1b1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:a384e7d1f6a22f2b5930290672c99efebf3449becb1128c1fe2942810ecb3c5d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:2c6fca24e61eb510b935245ffadd7830375d98afc6aa2bd594d6dcef9cc2a9e5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:4ca02f163dd8d77a8eecf694b582bf2bb8e0daf7519ace2382067cc9fd12d19a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:d467ff4ebf55d70fc55be701e7663c82340a60e87cfd9b88ad31b9dacaefe88a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:2a36ec71e92c82728bd33b1aef2fda0d88d1e9db0943d477b7833a9da757cacf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-07T03:05:55.751870Z","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-10T18:17:52.871404Z","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:24dcc53152c619aafc3b4e3730241ff4723747f611ac3e2417cdcdc55c51b615","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-10T18:17:52.871404Z","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:3bb51c08f7a676fe1e95dd248cb274901b769f66e6b0d3bb5ed267cca0a61b77","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:79da90eebfb26007fec2e17fb99046c8aa67151e7879041d9132e558715cf911","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:c13a32aa43984f9be0d811b100db4c3c6241adbb828e85952a902f56743b7214","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:ec49eca024311f98624934e4a34eac94b0ee1c3b06d27b8d17af213bcfac6fbd","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:f5c5d0e33faebbdced55dfa889e5022119cee6fb0cccce7dcfc1909dbdd3e26d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:88324cf7509fbc9f76fa75553ae2eaeb6bbdb2ebed30989b9d37ca1299c96ff6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:d265ebb8d9cb9ad3d2c486713faa5d321437969824fbcaf19e7180e91878f50c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:e268ec0ae287940f26edaf518699f84e54b5cbe2044e678633db27397c37e8ce","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:f6d7ad78d0e60f27032908f1d2acac1d8d167831132f132c515aaf4fc4a73b10","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:d6752f8921c4c11676854e07a8cb18ed1529dc39a2a3c5d1e3f8c9624d8bd13a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:2eac246dd6afb4beca29e4bffd6d04f4334c151607716bd47054eeb21cb85ff2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:26048fd40799e5a2fc9e632026ec57aafcdf69b68d506b2287a6865bad078df4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:7696050d0e43aa1a157293574266af2c6412a8b9b18bc04f067801024afb2daf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:85837bd4774b5b09db2c8a734772564c81663f70c4024a7ef8fc2321b97ce2c1","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-10T18:17:52.871404Z","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:dd853a4f6699e0fc3d8ce5814318bfb3e87d4dae40483b1831f5657dba4dd748","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:9e4778f67d196f00bc65c7ec29027cb59e00567ab1300c2ff2077ddd35077c31","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:8d05d327da261f6353368515fb8b89d4bcd570868c3a91776c44930849bf7fd3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:50ee510bec4700fc4ee9d0dd99618ffd2ae1e68737a333bfbf9c3404da3db255","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:3223bb14bc78cfaa1988a2f55b7f08d0f94d15c6311238dc122add3c0310052b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:ed1d7dee229e60f3e86a5d1bc5599da6b84ee45986eca0e1fd35adb365d067d9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:bd7bb566f7243f86b563860611d2c1878f1ad66730a2b1ec5ec620f98a435393","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:ef5a686e4c256f2daf64f8ec138b9bbb14785722daa2a722c87833e50dfdf7c5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T18:53:05.094643Z","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-10T18:17:52.871404Z","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:75c479c90891b8608934f6a0996d314ee53daf4f85ed13da4503ba6cbb969ce6","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-10T18:17:52.871404Z","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:9f92693ec293e86657c9c6473c420a2bd3e76d32aeb2fc9d0e440eabd3558a1f","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-10T18:17:52.871404Z","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:deb78a02f8bf43e87fda3833cc343c6d0e5bc4dbdfff4727252fb079c36d7026","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:52.871404Z","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:17c1fddef5c72461bd32bd9ca03ab8165c8d5d42c6637147403aa71266b0ab78","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-10T18:17:52.871404Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 3 inbound Pith citation observations for arXiv:2502.01014."}