Pith. sign in

Paper Citation Record · LEDGER

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries

As of 15 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 1 inbound Pith citation observation for arXiv:2502.05723.

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

pith.paper-citation-record.v1
2502.05723 v1

Coverage vector

measured 64 of 64 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T18:31:43.592562Z

measured 65 of 65 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 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T02:14:35.725931Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

64 of 64 outbound references displayed

  • verified exact19
  • verified fuzzy27
  • unresolved16
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6da31ded-f7cf-4da7-9aa7-d2a0165c8c72 · outbound

This paper cites write newline.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries write newline

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.292719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.292719Z digest=sha256:55ef963eda5ce8b89be49191218aa91e1f051b8b8ec394c899b06986aeedece9

Observation ea612212-1f2f-4eb9-bd5e-3c2db6e62f75 · outbound

This paper cites Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs

Reference 2

Resolution
verified exact
local_arxiv, observed 2026-08-08T18:31:43.770029Z

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.298928Z digest=sha256:32896a181b78000f8d2f700fa8a12d48ceac5a78cde28df20f343b1c06ac3201

Observation 30baae9f-10d9-4aac-9a0e-2a6a430f22ca · outbound

This paper cites J., Guha, S., and McGregor, A.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries J., Guha, S., and McGregor, A

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.304918Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.304918Z digest=sha256:01e07853f9086e091ade72c53cf9ea054b823624f53444e790018ff29495f5d0

Observation 15c6be56-fad2-42d3-b71b-e0a8494bdefe · outbound

This paper cites The space complexity of approximating the frequency moments.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries The space complexity of approximating the frequency moments

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.479559Z

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.309851Z digest=sha256:c5a1802cd9014c614e24bc487c7e6be061e79b06617108142dad2fded7ee2c27

Observation f52b24c0-ef2c-45ac-9974-83d7267cd975 · outbound

This paper cites DataSketches , Accessed: 2024.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries DataSketches , Accessed: 2024

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.466070Z

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.314775Z digest=sha256:132068ea25b0d4626671a4b6e7ba770a282b1174dc57e1d172d9e7bd881b6ff5

Observation db08dca0-bd56-4aa7-aade-e6d4187ace07 · outbound

This paper cites Synthesizing robust adversarial examples.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Synthesizing robust adversarial examples

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.451996Z

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.319449Z digest=sha256:62a8c2f7889a5d9d2c09c41624bd16ed58bef0c9472d41b11abd12a53aa72ef0

Observation 44227cfd-699f-4e34-a5f2-114d7c8421c2 · outbound

This paper cites A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators

Reference 7

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

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.324225Z digest=sha256:0177846d75e0b05720018388d7ceced7014cf296fb8b6e4c56ec46a8e5042b5c

Observation a11cd1ac-f6ba-4862-820c-13e08294fd98 · outbound

This paper cites S., Kumar, R., Sivakumar, D., and Trevisan, L.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries S., Kumar, R., Sivakumar, D., and Trevisan, L

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.438405Z

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.329542Z digest=sha256:6583aaab7b3fde4f84808de03a84855568e40c9f1a7db73d6994dc6452862e6d

Observation a38be7fd-4ac5-4384-8bc4-e30cc3cbf196 · outbound

This paper cites D., Steinke, T., Stemmer, U., and Ullman, J.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries D., Steinke, T., Stemmer, U., and Ullman, J

Reference 9

Resolution
verified exact
doi, observed 2026-08-08T18:31:43.738467Z

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.334271Z digest=sha256:b49e83d54e72ea110d6a772a3ba63a592dc85a801227667558fd02af53824c7a

Observation 1d2c8f47-f55b-4643-866a-45df35420e3b · outbound

This paper cites Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds

Reference 10

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

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.338761Z digest=sha256:a479895910acc04a21b4948ef0c8add032fe4375643a0d43aaf71a9c02ff9b4e

Observation e81ed5d8-c09c-4ddc-b198-2e69535ad79f · outbound

This paper cites Adversarially Robust Streaming via Dense--Sparse Trade-offs.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Adversarially Robust Streaming via Dense--Sparse Trade-offs

Reference 11

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

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.343805Z digest=sha256:4c6d8a3a4e0001fc06d1311c429983b1f2d677338730b80d05168063cf20a7f8

Observation 0ac15b9f-2515-4cef-8ca4-0fd1f509af8f · outbound

This paper cites P., and Yogev, E.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries P., and Yogev, E

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.424767Z

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.348684Z digest=sha256:602d901ddb23a0766a4ef1ad0904c4a4d7ae97416b63c7d4f7392f37397f966d

Observation 92d661bc-dde4-4923-8130-c86f9c8d05bd · outbound

This paper cites Optimal streaming and tracking distinct elements with high probability.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Optimal streaming and tracking distinct elements with high probability

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.410901Z

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.353227Z digest=sha256:dce78b3cd8f41f976a9d1f5edc2cc5b4ce85b25544d843dc5d7d04a7fb19c392

Observation 32681675-752d-495e-99c2-6b51e1d0b424 · outbound

This paper cites and Shaw, J.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Shaw, J

Reference 14

Resolution
verified exact
doi, observed 2026-08-08T18:31:43.723779Z

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.357782Z digest=sha256:6c0066df29bb2ccbc9b2fa9f66d7e9f6a9e29d908e4643658d09f050cf111972

Observation a3b160c7-22f2-4d87-8563-637d4bd65b42 · outbound

This paper cites an unresolved cited work.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-08-08T18:32:45.397057Z

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.362857Z digest=sha256:7826b4151c6767cf0f6784a76ecfa2a9735d1e4ca381b7590ddf966e8c9ea893

Observation 0f2568f3-2451-4f3c-9ff8-b742ccc97323 · outbound

This paper cites an unresolved cited work.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unresolved cited work

Reference 16

Resolution
unresolved
raw_fallback, observed 2026-08-08T18:32:45.383023Z

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.367780Z digest=sha256:1b8fdf56bacb3ee43c292e24ae0925d9a14cb6c5d14d42374de12392ba1231de

Observation cc072ef9-953c-4cc6-a915-aeb29a71651a · outbound

This paper cites Finding frequent items in data streams.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Finding frequent items in data streams

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.369008Z

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.372388Z digest=sha256:fbe932d3dfb844063c1f97ef9955d770da9a263b0ab73a7bba7e4ab56dbacf3f

Observation d842672f-7a4e-4b45-bd89-8c9dddc40d03 · outbound

This paper cites and Nelson, J.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Nelson, J

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.355263Z

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.377065Z digest=sha256:ab1058bd21b839343b2ab4b7997bfa5a9bae4f0c7f42fb0889e1beab26c464d6

Observation 1e90299f-d4f1-4596-8f26-6fc19021e646 · outbound

This paper cites Size-estimation framework with applications to transitive closure and reachability.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Size-estimation framework with applications to transitive closure and reachability

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.340965Z

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.381798Z digest=sha256:20a71360179a42ed0fc5655520e2a758b49e20480d34ffa32dbc9c19ac7178e0

Observation e8640df0-abf7-497a-a553-f2e312208a59 · outbound

This paper cites Min-Hash Sketches, pp.\ 1--7.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Min-Hash Sketches, pp.\ 1--7

Reference 20

Resolution
verified exact
doi, observed 2026-08-08T18:31:43.707893Z

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.386142Z digest=sha256:902c6825bc98ecd8a8359a5e9012897c4070523a789543d0c3f16b99a8e8c0c2

Observation 2dce67e1-e18a-4280-87fd-984a79d73e5c · outbound

This paper cites All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis

Reference 21

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

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.390665Z digest=sha256:f4f6b4f780930725101eccf4ae5853bf4c4b1473b3ce1d4e7505ed08221b8aea

Observation 7d62714f-457d-49f0-9acf-e4f851d4b1c0 · outbound

This paper cites Stream sampling framework and application for frequency cap statistics.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Stream sampling framework and application for frequency cap statistics

Reference 22

Resolution
verified exact
doi, observed 2026-08-08T18:31:43.692234Z

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.395358Z digest=sha256:349799582e1e9fe603393e094c3ea1778a7ab69f3df8b69eb98e3a226ef017d9

Observation 654d89c9-d452-441a-b01c-5693a6e8bf81 · outbound

This paper cites Sampling big ideas in query optimization.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Sampling big ideas in query optimization

Reference 23

Resolution
metadata mismatch
raw_fallback, observed 2026-08-08T18:32:44.909982Z

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.399959Z digest=sha256:1e5fb4748ad899e2cdf1ddaec4d110ce907e02fcb7af24c0f27777012f4c9d53

Observation 43b1a1fd-101a-4851-9131-173e7b40c7aa · outbound

This paper cites and Geri, O.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Geri, O

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.326469Z

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.404356Z digest=sha256:cbac178e94ce9cc57d4036ad223051b9caffeacb8bddcdfcdbd5c9e316708b82

Observation 39b01473-a2c4-497d-99dc-759fc86ed02d · outbound

This paper cites The Target-Charging Technique for Privacy Accounting across Interactive Computations.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries The Target-Charging Technique for Privacy Accounting across Interactive Computations

Reference 26

Resolution
verified exact
local_arxiv, observed 2026-08-08T18:31:43.675809Z

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.414266Z digest=sha256:caf4eb00c8e48b2bcf229ead2ad07902b6f66c4b3eb4fd64eda21e7390371ffa

Observation dafc162a-f876-4897-aced-e7487aed8324 · outbound

This paper cites On the Robustness of CountSketch to Adaptive Inputs.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries On the Robustness of CountSketch to Adaptive Inputs

Reference 27

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

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.419228Z digest=sha256:77cb578f1afda0ce2134f496a76e0dd5be0ae21813802876ec6b2514029ed919

Observation 9dfd710a-07c2-450e-8833-fe4091830031 · outbound

This paper cites On the robustness of countsketch to adaptive inputs.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries On the robustness of countsketch to adaptive inputs

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.312385Z

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.424089Z digest=sha256:a5e7692bc2f0005480e3b9759c2bacb6e14104b4d8789f64acb405950cebed58

Observation 46c63b4e-8831-4380-a3f7-47a6d7e0c638 · outbound

This paper cites Tricking the hashing trick: A tight lower bound on the robustness of countsketch to adaptive inputs.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Tricking the hashing trick: A tight lower bound on the robustness of countsketch to adaptive inputs

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.428596Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.428596Z digest=sha256:65366054b35cc5f20f3f66f720952444228598c374e95d23a65bf070d272ceca

Observation c9fed449-645c-403d-8edf-141c1facfae5 · outbound

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

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 7cbf0dbb-0f59-4b97-9301-75a410b9dd2f · outbound

This paper cites Calibrating noise to sensitivity in private data analysis.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Calibrating noise to sensitivity in private data analysis

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.297860Z

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.437582Z digest=sha256:94b80a4552578919a15f6396a036563895b7d107884b2e362092b7bb2a475d14

Observation 6d0b285f-0155-4fb8-bd62-aaa6c7ca1ba2 · outbound

This paper cites N., and Vadhan, S.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries N., and Vadhan, S

Reference 32

Resolution
verified exact
arxiv_id_nonexistent, observed 2026-08-08T18:32:29.813145Z

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.442085Z digest=sha256:946ff52a0325c653709c29afa3fe33f1db60218a7037f48346fb6b7f556cafc6

Observation 20df9bf1-7ed1-4e00-9385-a7cc1f49d498 · outbound

This paper cites an unresolved cited work.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unresolved cited work

Reference 33

Resolution
unresolved
raw_fallback, observed 2026-08-08T18:32:45.283530Z

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.446293Z digest=sha256:13a05c1126cd4537408d488f732fabd41659be59f4593c4944579f9b5f96332e

Observation fa0f74a9-5772-4e00-a627-2a51a2b7e233 · outbound

This paper cites and Steinke, T.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Steinke, T

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.269404Z

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.450643Z digest=sha256:07ad408580d4806a5e96e8a31147fc09790d2dae5b791bdf6cb706252dbc0707

Observation da5bf435-89ed-4ec7-9d21-c849ac6c80d5 · outbound

This paper cites and Zrnic, T.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Zrnic, T

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.255153Z

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.455337Z digest=sha256:38037abaef5b0914734a45cf6974220f9601b9a9801f8e49746c958b9832a3b5

Observation 00bb1130-b4ee-4d94-b44e-ed8b14e328b9 · outbound

This paper cites and Martin, G.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Martin, G

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.241130Z

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.459796Z digest=sha256:4bf69f7a88413182739fd06f4ea6b96f29a2d2e599f92ae8391afa436d293485

Observation d6863bf1-2bf5-4b9b-b349-c7785ea9f67d · outbound

This paper cites Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.227143Z

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.464448Z digest=sha256:c85a088335ff9d1977a2111a287d2f5566da73810e711fca4005debf0ecc2504

Observation d9e2f7f5-ddbb-45d0-93ad-61fe90d861c1 · outbound

This paper cites Restricted Admissible Limit for Domains of Finite Type.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Restricted Admissible Limit for Domains of Finite Type

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.469051Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.469051Z digest=sha256:8b06af45cdaceb1e9e0fe604f53a3a72086c02ec36f639f50d3da315a1d1011f

Observation f2a85956-cad4-4632-b99f-62a00d8ff9a0 · outbound

This paper cites Minimum cut in o(m log \( ^2 \) n) time.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Minimum cut in o(m log \( ^2 \) n) time

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.213265Z

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.473784Z digest=sha256:16bf9996d29cb9f92d69044b665ff717d45fbd9849cb7e459f381c83c0b9bdcd

Observation d808891b-91d0-44a0-8783-53344d3a9c1e · outbound

This paper cites Explaining and Harnessing Adversarial Examples.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Explaining and Harnessing Adversarial Examples

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.478253Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.478253Z digest=sha256:46247b1435d9b7c83739366f4a507eb5d9955fbbc3f4213d0dd581c1f24c96d1

Observation 7ddee6e3-a756-47a6-93ee-8164daecfa46 · outbound

This paper cites BigQuery Documentation: Approximate Aggregate Functions , Accessed: 2024.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries BigQuery Documentation: Approximate Aggregate Functions , Accessed: 2024

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.198833Z

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.483093Z digest=sha256:26f100c91cd59ea9d59927f3e55ede7cc6308b0848d56be4db393ab6ffe6b424

Observation 3730e0d1-689d-45d8-be4f-9b86e5470120 · outbound

This paper cites A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches

Reference 42

Resolution
metadata mismatch
local_arxiv, observed 2026-08-08T18:32:17.612718Z

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.487317Z digest=sha256:cf6fb09998e4ba0d60b8eb41b92dc407dcdc553bbed9c028c6ca2198dfe1c38f

Observation 7adf3e50-a35f-4bd7-88d9-74d809eb5532 · outbound

This paper cites an unresolved cited work.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unresolved cited work

Reference 43

Resolution
unresolved
raw_fallback, observed 2026-08-08T18:32:45.183629Z

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.492235Z digest=sha256:28156d6d88f954cddd091c6008b1d31e14e4fdccf900ffb9f266cc40d247635a

Observation e4f52c8d-5a54-4741-bb99-4e28c8035f54 · outbound

This paper cites and Rothblum, G.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Rothblum, G

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.496574Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.496574Z digest=sha256:17b63e625fab9f0a286183a0c1f65bdf84cae73e7bee6f1e90ed5a8f012c505a

Observation fb81bed7-4808-4a5c-949b-618df0be5e44 · outbound

This paper cites and Ullman, J.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Ullman, J

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.501334Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.501334Z digest=sha256:37cccea92aa34f1ebf81ca77ace536ca027ca26ae415515629e7876887ec21c2

Observation 388b0607-ada1-463a-b928-097361f87090 · outbound

This paper cites and Woodruff, D.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Woodruff, D

Reference 46

Resolution
verified exact
arxiv_id_nonexistent, observed 2026-08-08T18:32:17.592308Z

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.505963Z digest=sha256:445aa7bee30de23f99d5c7a6013171ca31eee5eca4b8dd7cb4cc50c8b39e22d1

Observation 68ea5ea7-8f10-4fdc-966b-5b059c19d92d · outbound

This paper cites Adversarially robust streaming algorithms via differential privacy.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Adversarially robust streaming algorithms via differential privacy

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.169100Z

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.510678Z digest=sha256:fff433f204c265dc8893005b72342b6a6afa586d3cb22b566949c4fd6a3f1537

Observation f1bee459-c2f9-4ac4-8009-4d26309d29eb · outbound

This paper cites HyperLogLog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries HyperLogLog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.154150Z

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.515077Z digest=sha256:026e18f8abe1119aaf978da329592d1949364ace94e18a3c92d94788945156e2

Observation 5d9d660e-70de-4607-b910-976cac2e672f · outbound

This paper cites an unresolved cited work.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unresolved cited work

Reference 49

Resolution
unresolved
raw_fallback, observed 2026-08-08T18:32:45.138806Z

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.519596Z digest=sha256:34eed0f7ba05eed001af9bd720f6b1cfc9a4f87a239a17f08265b8b2bb8a7655

Observation 114ff739-f6fa-4184-8c6d-7790711e5fae · outbound

This paper cites M., Nelson, J., and Woodruff, D.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries M., Nelson, J., and Woodruff, D

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.124018Z

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.523987Z digest=sha256:14a8df8a4c61f0cf7ccd64f46bc3fd3d9ac7f0e66af7b6f6f657bc7781db699d

Observation 059e1a77-e7e7-4687-92e7-7d406094fb00 · outbound

This paper cites The sparse vector technique, revisited.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries The sparse vector technique, revisited

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.109043Z

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.528485Z digest=sha256:60860d2db90f33a2898077d891cb6c32d93677535c7e2a448f99c9ccc24ca2af

Observation 2bb64f8c-5e88-409e-ba35-8f18606b3b6f · outbound

This paper cites Adaptive data analysis with correlated observations, 2022.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Adaptive data analysis with correlated observations, 2022

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.094087Z

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.532979Z digest=sha256:6c138dba785828fe91fa88da5a616124dd9e8faa42a9cd47a50adae692727809

Observation 3898ff9b-6f01-48d1-8563-2aabd087ebf3 · outbound

This paper cites M., Burnham, K.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries M., Burnham, K

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.079093Z

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.537257Z digest=sha256:5bd286828591bf3ad5df86b7ef33675ca6e71677b25393278038384ac2643605

Observation 30d4f307-ccc6-4c89-8fd1-8b0952c82c5f · outbound

This paper cites Sketching in adversarial environments.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Sketching in adversarial environments

Reference 54

Resolution
verified exact
arxiv_id_nonexistent, observed 2026-08-08T18:32:07.260115Z

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.541660Z digest=sha256:73932e791b53d56a344298142e894696a3b538d2ca2ce1fcb75fa87fbd872f48

Observation c37ff3fe-8e33-42ab-bacf-d8e63017814c · outbound

This paper cites B., and Swami, A.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries B., and Swami, A

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.065236Z

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.545889Z digest=sha256:9fa8f5330359d50cb1aa588f683eb9c485a7baa911d637165bac2da62f5ddac0

Observation 688e2cfe-7d38-4243-a9c0-e10a8c9e2468 · outbound

This paper cites an unresolved cited work.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unresolved cited work

Reference 56

Resolution
unresolved
raw_fallback, observed 2026-08-08T18:32:45.050465Z

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.550037Z digest=sha256:19b714c331a0ed5be3bb3cf29ba815bd201d5082365d66c4cc8b8e35387dccb9

Observation b9ddbcb4-62e7-4271-a119-7f63d1cf629f · outbound

This paper cites and Ting, D.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Ting, D

Reference 57

Resolution
verified exact
arxiv_id_nonexistent, observed 2026-08-08T18:32:00.737254Z

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.554470Z digest=sha256:90f6014b799a3061ada7e14320f0673c0426d60a41e5a554f307dc174c6991d7

Observation c3aa4023-10e8-499d-b0c7-c0287517f931 · outbound

This paper cites Asymptotic theory for order sampling.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Asymptotic theory for order sampling

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.036152Z

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.558803Z digest=sha256:ebe8b215eed6b32659bc3942e0ec8845a8250155b850aedf1e81fd7d2d93c5b2

Observation c6b25af3-c628-46ba-b635-879f412338b1 · outbound

This paper cites and Roughgarden, T.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Roughgarden, T

Reference 59

Resolution
verified exact
arxiv_id_nonexistent, observed 2026-08-08T18:31:58.817803Z

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.564452Z digest=sha256:4276e4c85066f1cf4c5737f4ad7d8d1b126f491630e3030e8417bc4dc1fadffa

Observation c2f66044-978b-4463-ac50-6bd2ced6ee0e · outbound

This paper cites and Even, S.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Even, S

Reference 60

Resolution
verified exact
arxiv_id_nonexistent, observed 2026-08-08T18:31:52.694657Z

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.569752Z digest=sha256:20aa2190f8c1adf9199057160fa548c0d763c86b79499b13709c0a754e98a7af

Observation 8480aff0-76c6-42b2-927d-fb0ae8fea335 · outbound

This paper cites and Ullman, J.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries and Ullman, J

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T18:32:45.021570Z

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.574319Z digest=sha256:c5194b67713e827a093d61b02ac506fb58403662049ca52557cdd170603730d5

Observation 3e6d6767-501a-4540-8368-bd1a167d880a · outbound

This paper cites Intriguing properties of neural networks.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Intriguing properties of neural networks

Reference 62

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.578853Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.578853Z digest=sha256:c7d14a55de4aa7b4e6d383a710fc793648e12ef6f2095acffe95db8254a2abf5

Observation 545b478c-b4ac-4d1d-93ec-bf3434ecfda2 · outbound

This paper cites an unresolved cited work.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unresolved cited work

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-08T18:31:43.583754Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T18:31:43.583754Z digest=sha256:f0b1b6e941cac62e68e188751e3808123dd08076e3fdd60e3c24c4dc6a7a0aa3

Observation 0d358886-a311-4a51-b58f-b8f901cb9b54 · outbound

This paper cites Rounding Dynamic Matchings against an Adaptive Adversary.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Rounding Dynamic Matchings against an Adaptive Adversary

Reference 64

Resolution
verified exact
arxiv_id_nonexistent, observed 2026-08-08T18:31:47.543320Z

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.588264Z digest=sha256:acaeb10b3f6f3755bf91de1a84ce923b1d697eb9cd4d8e8dc75344f261c4d01e

Observation 08f22235-4c74-4b56-881b-69b1c207ba17 · outbound

This paper cites an unresolved cited work.

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries Unresolved cited work

Reference 65

Resolution
unresolved
raw_fallback, observed 2026-08-08T18:32:45.006971Z

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.592562Z digest=sha256:77bc2601efff1ef37fc2d44e8a2d28ef0eda2290dbe73ebf8675d4eaecca6e5a

Pith citing papers

Observation 1d16d2c2-eeef-48c3-9b6d-9aa794f901fd · inbound

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

The Adversarial Robustness of Sketching and Streaming Algorithms Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries

Reference 2023

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T02:14:35.725931Z digest=sha256:8f5a9536241eec957609736b4ac4f6a1ef46c4f643b7021bf1057e86843cc230