{"as_of":"2026-08-18T12:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e2c69bd2c088958d37498d2d061809c095b71d8a71f85f3c7faf5fb7c9f74735","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:14:14.321149Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T18:14:14.444201Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.05824","last_updated":"2023-03-24T01:08:50Z","snapshot_observed_at":"2026-08-18T11:17:07.062248Z","submitted_at":"2022-10-11T23:15:43Z","title":"Adapting Zeroth Order Algorithms for Comparison-Based Optimization","version":2},"cited_work":{"arxiv_id":"2210.05824","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.05824","snapshot_observed_at":"2026-08-10T18:14:14.444201Z","title":"Adapting Zeroth Order Algorithms for Comparison-Based Optimization","venue":"math.OC","work_id":"dbb97f53-adfb-4e0c-a37b-8073eec563aa","year":2022},"citing_paper":{"arxiv_id":"2501.11616","last_updated":"2025-07-14T21:39:17Z","snapshot_observed_at":"2026-08-17T01:08:43.593561Z","submitted_at":"2025-01-20T17:27:03Z","title":"Fully Adaptive Zeroth-Order Method for Minimizing Functions with Compressible Gradients","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:14.321149Z"},"links":{"cited_paper":"/paper/2210.05824","citing_paper":"/paper/2501.11616"},"observation_digest":"sha256:7df2b374b055acf17971d624cc9ab9e9c5093c71509edf5520f50a0c86e9a9dc","observation_id":"4432b234-9cf6-48a2-957c-b625a5ce06d0","resolution":{"observed_at":"2026-08-10T18:14:14.452028Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2210.05824/citation-record","integrity":"/paper/2210.05824/integrity","json":"/paper/2210.05824/citation-record.json","paper":"/paper/2210.05824"},"outbound":[],"paper":{"arxiv_id":"2210.05824","last_updated":"2023-03-24T01:08:50Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T11:17:07.062248Z","submitted_at":"2022-10-11T23:15:43Z","title":"Adapting Zeroth Order Algorithms for Comparison-Based Optimization"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2210.05824."}