Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Count on Your Elders: Laplace vs Gaussian Noise
As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2408.07021.
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-11T06:34:44.6726+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-02T03:25:04.165095Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-10T06:15:00.866473Z
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 1f70c56e-fd69-446a-9cb4-c77a73525530 · inbound
A Fast Gaussian Mechanism under Continual Observation, with Applications cites this paper.
A Fast Gaussian Mechanism under Continual Observation, with Applications Count on Your Elders: Laplace vs Gaussian Noise
Reference 4
- Resolution
- verified exact
- arxiv_id, observed 2026-06-28T07:01:44.459567Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 99cb5293-9f10-4a7e-9ce8-19d3b56bd823 · inbound
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting cites this paper.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Count on Your Elders: Laplace vs Gaussian Noise
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T04:26:34.991568Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 1802989b-393d-4340-b4b4-c3badebfbe8a · inbound
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting cites this paper.
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting Count on Your Elders: Laplace vs Gaussian Noise
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-07-03T18:08:45.585947Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 81708fab-68f3-4fa4-8811-a4607512a539 · inbound
Plausible Deniability Guarantees for Whistleblowers cites this paper.
Plausible Deniability Guarantees for Whistleblowers Count on Your Elders: Laplace vs Gaussian Noise
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T03:25:04.165095Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.