Pith. sign in

Paper Citation Record · LEDGER

Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2508.12228 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-04T15:51:50.474133Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T20:46:13.815727Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation bef05490-f67a-4c5b-9893-d5855e5acebc · inbound

Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions cites this paper.

Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?

Reference 31

Resolution
verified exact
arxiv_id, observed 2026-05-11T20:46:13.819313Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-05-08T08:03:06.383381Z digest=sha256:3b9d781ecd0cb35d51658ffa9f98b98c4602810d3ba28e2267dfdc30367a4b41

Observation bbd62bd5-5b01-4967-a45c-38dc0efc79b8 · inbound

Accelerating Evolutionary Strategy via Rao-Blackwellizing Realization of Uncertain Input cites this paper.

Accelerating Evolutionary Strategy via Rao-Blackwellizing Realization of Uncertain Input Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-04T15:51:50.474133Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T15:51:50.474133Z digest=sha256:0cdf7cccf31f2f2a914b075e0a10f8312e34272f85536776ddfa3adb658a3012