Pith. sign in

Paper Citation Record · LEDGER

Do we really need the Rademacher complexities?

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.15118.

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

pith.paper-citation-record.v1
2502.15118 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-18T06:34:40.430872+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-16T00:10:44.224567Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-16T00:10:45.874454Z

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 e41442ad-2089-4fe2-8d1a-5211f4c68f3d · inbound

Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits cites this paper.

Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits Do we really need the Rademacher complexities?

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-03T05:00:55.259789Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T05:00:55.259789Z digest=sha256:3222c0acbfb0f4bcb40d4465c431976b369926c715cff453c169ba74ea94e1ee

Observation f1ff6ce5-c61d-4c0f-9bf4-1858bb25dab5 · inbound

DYSANOS Generative Dynamic Smooth Arbitrage-free Non-parametric Option Surfaces cites this paper.

DYSANOS Generative Dynamic Smooth Arbitrage-free Non-parametric Option Surfaces Do we really need the Rademacher complexities?

Reference 20

Resolution
metadata mismatch
local_arxiv, observed 2026-08-16T00:10:45.879144Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-16T00:10:44.224567Z digest=sha256:b171837e4362bd450859a4d7fb42534b923c5c52d4179b9e139fe557c26bbde2