Pith. sign in

Paper Citation Record · LEDGER

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches

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

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

pith.paper-citation-record.v1
2411.06370 v2

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-15T06:32:42.880941+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-08T18:31:43.433010Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-08T18:32:29.830610Z

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 c9fed449-645c-403d-8edf-141c1facfae5 · inbound

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries cites this paper.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches

Reference 30

Resolution
verified exact
local_arxiv, observed 2026-08-08T18:32:29.835913Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-08T18:31:43.433010Z digest=sha256:41c4d41d54ef42d9c259017d84d39f6a5a317531945bd033684ca310ab21f279

Observation adac528d-698d-4d8c-a56b-e07b043c3941 · inbound

The Adversarial Robustness of Sketching and Streaming Algorithms cites this paper.

The Adversarial Robustness of Sketching and Streaming Algorithms One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches

Reference 1997

Resolution
unresolved
no resolver link, observed 2026-08-02T02:14:35.563623Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T02:14:35.563623Z digest=sha256:c37cc436f364cf6f0d2b4f9f5a48005f1b6bbe909f2ea9009e558075b2c66c38