Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.06911.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-06T21:02:19.344955Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-22T08:41:17.128288Z
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 99016054-cfa5-475d-a30d-fab0a926297f · inbound
Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition cites this paper.
Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T21:02:19.344955Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 56aa90c1-775c-442b-8e19-abdaf9d0b2d3 · inbound
Near-Optimal Generalized Private Testing cites this paper.
Near-Optimal Generalized Private Testing Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
Reference 1
- Resolution
- verified exact
- arxiv_id, observed 2026-05-22T08:41:17.130871Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.