Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Automated Techniques for Efficient Sampling of Piecewise-Deterministic Markov Processes
As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.03682.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-07-31T08:09:27.586104Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-04T05:49:37.962565Z
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 0d1dbb8e-636c-4387-8ccc-e107131bca65 · inbound
Establishing an $\Omega(\sqrt{d})$ complexity lower bound for PDMP samplers and how to break it: a sub-$\sqrt{d}$ algorithm for Gaussian-tailed targets cites this paper.
Establishing an $\Omega(\sqrt{d})$ complexity lower bound for PDMP samplers and how to break it: a sub-$\sqrt{d}$ algorithm for Gaussian-tailed targets Automated Techniques for Efficient Sampling of Piecewise-Deterministic Markov Processes
Reference 1
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T05:49:37.965050Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 978e7c8c-96ea-4c9b-8326-2e3399eb6e58 · inbound
Windowed thinning and query complexity for the bouncy particle and Zigzag samplers cites this paper.
Windowed thinning and query complexity for the bouncy particle and Zigzag samplers Automated Techniques for Efficient Sampling of Piecewise-Deterministic Markov Processes
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T08:09:27.586104Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.