{"as_of":"2026-08-19T15:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0456f17b0b1ee52f0454f3135331a07d72030ace595bbb87094ceb32ded8ebe","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T15:51:50.474133Z","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-11T20:46:13.815727Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.12228","last_updated":"2025-08-17T04:01:51Z","snapshot_observed_at":"2026-08-05T19:36:20.997940Z","submitted_at":"2025-08-17T04:01:51Z","title":"Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?","version":1},"cited_work":{"arxiv_id":"2508.12228","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.12228","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Can a one-point feedback zeroth-order algorithm achieve linear dimension dependent sample complexity?","venue":null,"work_id":"62326f3a-2e41-4d08-9892-d111742a7c15","year":2025},"citing_paper":{"arxiv_id":"2605.06549","last_updated":"2026-05-07T16:46:07Z","snapshot_observed_at":"2026-08-02T09:57:20.432684Z","submitted_at":"2026-05-07T16:46:07Z","title":"Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-08T08:03:06.383381Z"},"links":{"cited_paper":"/paper/2508.12228","citing_paper":"/paper/2605.06549"},"observation_digest":"sha256:3b9d781ecd0cb35d51658ffa9f98b98c4602810d3ba28e2267dfdc30367a4b41","observation_id":"bef05490-f67a-4c5b-9893-d5855e5acebc","resolution":{"observed_at":"2026-05-11T20:46:13.819313Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.12228","last_updated":"2025-08-17T04:01:51Z","snapshot_observed_at":"2026-08-05T19:36:20.997940Z","submitted_at":"2025-08-17T04:01:51Z","title":"Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.12228","snapshot_observed_at":"2026-08-04T15:51:50.474133Z","title":"Can a one-point feedback zeroth-order algorithm achieve linear dimension dependent sample complexity?, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02073","last_updated":"2026-08-03T11:21:30Z","snapshot_observed_at":"2026-08-13T20:07:23.234749Z","submitted_at":"2026-08-03T11:21:30Z","title":"Accelerating Evolutionary Strategy via Rao-Blackwellizing Realization of Uncertain Input","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.474133Z"},"links":{"cited_paper":"/paper/2508.12228","citing_paper":"/paper/2608.02073"},"observation_digest":"sha256:0cdf7cccf31f2f2a914b075e0a10f8312e34272f85536776ddfa3adb658a3012","observation_id":"bbd62bd5-5b01-4967-a45c-38dc0efc79b8","resolution":{"observed_at":"2026-08-04T15:51:50.474133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.12228/citation-record","integrity":"/paper/2508.12228/integrity","json":"/paper/2508.12228/citation-record.json","paper":"/paper/2508.12228"},"outbound":[],"paper":{"arxiv_id":"2508.12228","last_updated":"2025-08-17T04:01:51Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T19:36:20.997940Z","submitted_at":"2025-08-17T04:01:51Z","title":"Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2508.12228."}