{"as_of":"2026-08-15T22:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4fbf166777bd1f47f19fa8c934fba3ceb0f9da603f35a6d5ffc6fd1a21b5e1f0","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:31:43.592562Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T02:14:35.725931Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05723","snapshot_observed_at":"2026-08-02T02:14:35.725931Z","title":"Elements of information theory","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.14432","last_updated":"2026-07-15T23:55:51Z","snapshot_observed_at":"2026-08-14T18:05:38.733756Z","submitted_at":"2026-07-15T23:55:51Z","title":"The Adversarial Robustness of Sketching and Streaming Algorithms","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T02:14:35.725931Z"},"links":{"cited_paper":"/paper/2502.05723","citing_paper":"/paper/2607.14432"},"observation_digest":"sha256:8f5a9536241eec957609736b4ac4f6a1ef46c4f643b7021bf1057e86843cc230","observation_id":"1d16d2c2-eeef-48c3-9b6d-9aa794f901fd","resolution":{"observed_at":"2026-08-02T02:14:35.725931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05723/citation-record","integrity":"/paper/2502.05723/integrity","json":"/paper/2502.05723/citation-record.json","paper":"/paper/2502.05723"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:43.292719Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.292719Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:55ef963eda5ce8b89be49191218aa91e1f051b8b8ec394c899b06986aeedece9","observation_id":"6da31ded-f7cf-4da7-9aa7-d2a0165c8c72","resolution":{"observed_at":"2026-08-08T18:31:43.292719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17780","last_updated":"2024-05-28T03:20:05Z","snapshot_observed_at":"2026-08-12T23:56:34.843460Z","submitted_at":"2024-05-28T03:20:05Z","title":"Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs","version":1},"cited_work":{"arxiv_id":"2405.17780","doi":"10.48550/arxiv.2405.17780","metadata_source":"pith","pith_arxiv_id":"2405.17780","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs","venue":"cs.DS","work_id":"968f302d-c9c0-4723-ac24-201dd9515c4e","year":2024},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.298928Z"},"links":{"cited_paper":"/paper/2405.17780","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:32896a181b78000f8d2f700fa8a12d48ceac5a78cde28df20f343b1c06ac3201","observation_id":"ea612212-1f2f-4eb9-bd5e-3c2db6e62f75","resolution":{"observed_at":"2026-08-08T18:31:43.770029Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:43.304918Z","title":"J., Guha, S., and McGregor, A","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.304918Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:01e07853f9086e091ade72c53cf9ea054b823624f53444e790018ff29495f5d0","observation_id":"30baae9f-10d9-4aac-9a0e-2a6a430f22ca","resolution":{"observed_at":"2026-08-08T18:31:43.304918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.475202Z","title":"The space complexity of approximating the frequency moments","venue":null,"work_id":"c6ae20a1-9979-429a-a837-473f1d4e775a","year":1999},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.309851Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:c5a1802cd9014c614e24bc487c7e6be061e79b06617108142dad2fded7ee2c27","observation_id":"15c6be56-fad2-42d3-b71b-e0a8494bdefe","resolution":{"observed_at":"2026-08-08T18:32:45.479559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.461691Z","title":"DataSketches , Accessed: 2024","venue":null,"work_id":"ab5f6abe-baee-4845-aacf-45a4ebab86b5","year":2024},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.314775Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:132068ea25b0d4626671a4b6e7ba770a282b1174dc57e1d172d9e7bd881b6ff5","observation_id":"f52b24c0-ef2c-45ac-9974-83d7267cd975","resolution":{"observed_at":"2026-08-08T18:32:45.466070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.447670Z","title":"Synthesizing robust adversarial examples","venue":null,"work_id":"c470a5e4-7914-445b-9838-133b89dafe49","year":2018},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.319449Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:62a8c2f7889a5d9d2c09c41624bd16ed58bef0c9472d41b11abd12a53aa72ef0","observation_id":"db08dca0-bd56-4aa7-aade-e6d4187ace07","resolution":{"observed_at":"2026-08-08T18:32:45.451996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.14527","last_updated":"2022-09-26T12:08:43Z","snapshot_observed_at":"2026-08-13T18:37:08.793146Z","submitted_at":"2021-07-30T10:20:38Z","title":"A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators","version":2},"cited_work":{"arxiv_id":"2107.14527","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.14527","snapshot_observed_at":"2026-08-08T18:32:44.987303Z","title":"A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators","venue":"cs.DS","work_id":"60fc61ce-a167-4780-b73b-0f4950f449bf","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.324225Z"},"links":{"cited_paper":"/paper/2107.14527","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:0177846d75e0b05720018388d7ceced7014cf296fb8b6e4c56ec46a8e5042b5c","observation_id":"44227cfd-699f-4e34-a5f2-114d7c8421c2","resolution":{"observed_at":"2026-08-08T18:32:44.992050Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.433939Z","title":"S., Kumar, R., Sivakumar, D., and Trevisan, L","venue":null,"work_id":"53c0f2a9-4f58-4628-ad9d-096b7cfde238","year":2002},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.329542Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:6583aaab7b3fde4f84808de03a84855568e40c9f1a7db73d6994dc6452862e6d","observation_id":"a11cd1ac-f6ba-4862-820c-13e08294fd98","resolution":{"observed_at":"2026-08-08T18:32:45.438405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/16m1103646","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"D., Steinke, T., Stemmer, U., and Ullman, J","venue":"SIAM Journal on Computing","work_id":"e33437cd-4e1b-49a4-a9ba-a29c436bb473","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.334271Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:b49e83d54e72ea110d6a772a3ba63a592dc85a801227667558fd02af53824c7a","observation_id":"a38be7fd-4ac5-4384-8bc4-e30cc3cbf196","resolution":{"observed_at":"2026-08-08T18:31:43.738467Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.03980","last_updated":"2021-11-07T01:15:07Z","snapshot_observed_at":"2026-08-13T17:38:28.934731Z","submitted_at":"2021-11-07T01:15:07Z","title":"Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds","version":1},"cited_work":{"arxiv_id":"2111.03980","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.03980","snapshot_observed_at":"2026-08-08T18:32:44.967046Z","title":"Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds","venue":"cs.DS","work_id":"d667c7cc-2106-41a5-9dad-4278a0875649","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.338761Z"},"links":{"cited_paper":"/paper/2111.03980","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:a479895910acc04a21b4948ef0c8add032fe4375643a0d43aaf71a9c02ff9b4e","observation_id":"1d2c8f47-f55b-4643-866a-45df35420e3b","resolution":{"observed_at":"2026-08-08T18:32:44.972528Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.03785","last_updated":"2021-09-08T17:15:44Z","snapshot_observed_at":"2026-08-08T18:39:43.035142Z","submitted_at":"2021-09-08T17:15:44Z","title":"Adversarially Robust Streaming via Dense--Sparse Trade-offs","version":1},"cited_work":{"arxiv_id":"2109.03785","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.03785","snapshot_observed_at":"2026-08-08T18:32:44.945602Z","title":"Adversarially Robust Streaming via Dense--Sparse Trade-offs","venue":"cs.DS","work_id":"8f2b71e3-aece-4a33-b578-92d9c23f5cb8","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.343805Z"},"links":{"cited_paper":"/paper/2109.03785","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:4c6d8a3a4e0001fc06d1311c429983b1f2d677338730b80d05168063cf20a7f8","observation_id":"e81ed5d8-c09c-4ddc-b198-2e69535ad79f","resolution":{"observed_at":"2026-08-08T18:32:44.950916Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.420396Z","title":"P., and Yogev, E","venue":null,"work_id":"97327b8f-dd14-45fd-bef1-1993e7f91519","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.348684Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:602d901ddb23a0766a4ef1ad0904c4a4d7ae97416b63c7d4f7392f37397f966d","observation_id":"0ac15b9f-2515-4cef-8ca4-0fd1f509af8f","resolution":{"observed_at":"2026-08-08T18:32:45.424767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.406193Z","title":"Optimal streaming and tracking distinct elements with high probability","venue":null,"work_id":"6d2cc5b6-b2ab-498a-bd33-7573ef0d2d7a","year":2020},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.353227Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:dce78b3cd8f41f976a9d1f5edc2cc5b4ce85b25544d843dc5d7d04a7fb19c392","observation_id":"92d661bc-dde4-4923-8130-c86f9c8d05bd","resolution":{"observed_at":"2026-08-08T18:32:45.410901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/18.705568","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"and Shaw, J","venue":"IEEE Transactions on Information Theory","work_id":"a322b74c-2853-4f80-964d-f747a22e9187","year":1905},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.357782Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:6c0066df29bb2ccbc9b2fa9f66d7e9f6a9e29d908e4643658d09f050cf111972","observation_id":"32681675-752d-495e-99c2-6b51e1d0b424","resolution":{"observed_at":"2026-08-08T18:31:43.723779Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.392690Z","title":null,"venue":null,"work_id":"189fdc26-742a-466b-a47f-8cd6c384c299","year":1997},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.362857Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:7826b4151c6767cf0f6784a76ecfa2a9735d1e4ca381b7590ddf966e8c9ea893","observation_id":"a3b160c7-22f2-4d87-8563-637d4bd65b42","resolution":{"observed_at":"2026-08-08T18:32:45.397057Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.378237Z","title":null,"venue":null,"work_id":"9d8ce3d8-b346-4487-9cec-45ed00f1fcc0","year":2000},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.367780Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:1b8fdf56bacb3ee43c292e24ae0925d9a14cb6c5d14d42374de12392ba1231de","observation_id":"0f2568f3-2451-4f3c-9ff8-b742ccc97323","resolution":{"observed_at":"2026-08-08T18:32:45.383023Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.364323Z","title":"Finding frequent items in data streams","venue":null,"work_id":"d04f741b-a674-49b5-bd47-53ecd4621226","year":2002},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.372388Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:fbe932d3dfb844063c1f97ef9955d770da9a263b0ab73a7bba7e4ab56dbacf3f","observation_id":"cc072ef9-953c-4cc6-a915-aeb29a71651a","resolution":{"observed_at":"2026-08-08T18:32:45.369008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.350821Z","title":"and Nelson, J","venue":null,"work_id":"4c1be796-7425-4d04-98a1-f1aae18f494d","year":2020},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.377065Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:ab1058bd21b839343b2ab4b7997bfa5a9bae4f0c7f42fb0889e1beab26c464d6","observation_id":"d842672f-7a4e-4b45-bd89-8c9dddc40d03","resolution":{"observed_at":"2026-08-08T18:32:45.355263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.336247Z","title":"Size-estimation framework with applications to transitive closure and reachability","venue":null,"work_id":"251c56fd-89fb-4f8b-ad80-aa84330c0545","year":1997},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.381798Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:20a71360179a42ed0fc5655520e2a758b49e20480d34ffa32dbc9c19ac7178e0","observation_id":"1e90299f-d4f1-4596-8f26-6fc19021e646","resolution":{"observed_at":"2026-08-08T18:32:45.340965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-27848-8_573-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Min-Hash Sketches, pp.\\ 1--7","venue":"Encyclopedia of Algorithms","work_id":"b578b862-54eb-464e-953e-30d55c5c3384","year":2008},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.386142Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:902c6825bc98ecd8a8359a5e9012897c4070523a789543d0c3f16b99a8e8c0c2","observation_id":"e8640df0-abf7-497a-a553-f2e312208a59","resolution":{"observed_at":"2026-08-08T18:31:43.707893Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1306.3284","last_updated":"2015-01-17T07:55:41Z","snapshot_observed_at":"2026-08-15T00:14:06.643190Z","submitted_at":"2013-06-14T03:33:05Z","title":"All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis","version":7},"cited_work":{"arxiv_id":"1306.3284","doi":null,"metadata_source":"pith","pith_arxiv_id":"1306.3284","snapshot_observed_at":"2026-08-08T18:32:44.925120Z","title":"All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis","venue":"cs.DS","work_id":"20eda385-1402-484f-bfb2-81e13531f9cf","year":2013},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.390665Z"},"links":{"cited_paper":"/paper/1306.3284","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:f4f6b4f780930725101eccf4ae5853bf4c4b1473b3ce1d4e7505ed08221b8aea","observation_id":"2dce67e1-e18a-4280-87fd-984a79d73e5c","resolution":{"observed_at":"2026-08-08T18:32:44.930351Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3234338","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Stream sampling framework and application for frequency cap statistics","venue":"ACM Transactions on Algorithms","work_id":"ba8a5321-4179-40b1-8437-3b4a61346e0b","year":2018},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.395358Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:349799582e1e9fe603393e094c3ea1778a7ab69f3df8b69eb98e3a226ef017d9","observation_id":"7d62714f-457d-49f0-9acf-e4f851d4b1c0","resolution":{"observed_at":"2026-08-08T18:31:43.692234Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4372.35899","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:44.902085Z","title":"Sampling big ideas in query optimization","venue":null,"work_id":"07d13a92-5223-45ca-9e3c-2fa9d8aad15a","year":2023},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.399959Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:1e5fb4748ad899e2cdf1ddaec4d110ce907e02fcb7af24c0f27777012f4c9d53","observation_id":"654d89c9-d452-441a-b01c-5693a6e8bf81","resolution":{"observed_at":"2026-08-08T18:32:44.909982Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.321937Z","title":"and Geri, O","venue":null,"work_id":"aaa4c160-5673-4f77-bbac-e7c5d84be3dc","year":2019},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.404356Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:cbac178e94ce9cc57d4036ad223051b9caffeacb8bddcdfcdbd5c9e316708b82","observation_id":"43b1a1fd-101a-4851-9131-173e7b40c7aa","resolution":{"observed_at":"2026-08-08T18:32:45.326469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11044","last_updated":"2023-04-11T23:59:07Z","snapshot_observed_at":"2026-08-13T12:39:52.823423Z","submitted_at":"2023-02-21T22:57:14Z","title":"The Target-Charging Technique for Privacy Accounting across Interactive Computations","version":2},"cited_work":{"arxiv_id":"2302.11044","doi":"10.48550/arxiv.2302.11044","metadata_source":"pith","pith_arxiv_id":"2302.11044","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The Target-Charging Technique for Privacy Accounting across Interactive Computations","venue":"cs.DS","work_id":"deef2df8-9504-45b8-aa84-bed6d8a30650","year":2023},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.414266Z"},"links":{"cited_paper":"/paper/2302.11044","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:caf4eb00c8e48b2bcf229ead2ad07902b6f66c4b3eb4fd64eda21e7390371ffa","observation_id":"39b01473-a2c4-497d-99dc-759fc86ed02d","resolution":{"observed_at":"2026-08-08T18:31:43.675809Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.13736","last_updated":"2022-02-28T13:04:41Z","snapshot_observed_at":"2026-08-13T16:33:01.681353Z","submitted_at":"2022-02-28T13:04:41Z","title":"On the Robustness of CountSketch to Adaptive Inputs","version":1},"cited_work":{"arxiv_id":"2202.13736","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.13736","snapshot_observed_at":"2026-08-08T18:32:29.851904Z","title":"On the Robustness of CountSketch to Adaptive Inputs","venue":"cs.DS","work_id":"30670624-8d19-49b5-9c6d-8c42f182148a","year":2022},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.419228Z"},"links":{"cited_paper":"/paper/2202.13736","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:77cb578f1afda0ce2134f496a76e0dd5be0ae21813802876ec6b2514029ed919","observation_id":"dafc162a-f876-4897-aced-e7487aed8324","resolution":{"observed_at":"2026-08-08T18:32:29.856875Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.307876Z","title":"On the robustness of countsketch to adaptive inputs","venue":null,"work_id":"61f5da44-23f8-4c23-853e-82ddd5eec602","year":2022},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.424089Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:a5e7692bc2f0005480e3b9759c2bacb6e14104b4d8789f64acb405950cebed58","observation_id":"9dfd710a-07c2-450e-8833-fe4091830031","resolution":{"observed_at":"2026-08-08T18:32:45.312385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:43.428596Z","title":"Tricking the hashing trick: A tight lower bound on the robustness of countsketch to adaptive inputs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.428596Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:65366054b35cc5f20f3f66f720952444228598c374e95d23a65bf070d272ceca","observation_id":"46c63b4e-8831-4380-a3f7-47a6d7e0c638","resolution":{"observed_at":"2026-08-08T18:31:43.428596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.06370","last_updated":"2025-03-14T02:06:38Z","snapshot_observed_at":"2026-08-15T04:53:39.882622Z","submitted_at":"2024-11-10T06:10:34Z","title":"One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches","version":2},"cited_work":{"arxiv_id":"2411.06370","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.06370","snapshot_observed_at":"2026-08-08T18:32:29.830610Z","title":"One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches","venue":"cs.DS","work_id":"d018b3cd-444f-4e98-a4a4-e20c179ec852","year":2024},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.433010Z"},"links":{"cited_paper":"/paper/2411.06370","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:41c4d41d54ef42d9c259017d84d39f6a5a317531945bd033684ca310ab21f279","observation_id":"c9fed449-645c-403d-8edf-141c1facfae5","resolution":{"observed_at":"2026-08-08T18:32:29.835913Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.293104Z","title":"Calibrating noise to sensitivity in private data analysis","venue":null,"work_id":"5c8472ab-d6b3-4916-a76e-c89923eb1fcc","year":2006},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.437582Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:94b80a4552578919a15f6396a036563895b7d107884b2e362092b7bb2a475d14","observation_id":"7cbf0dbb-0f59-4b97-9301-75a410b9dd2f","resolution":{"observed_at":"2026-08-08T18:32:45.297860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:29.808292Z","title":"N., and Vadhan, S","venue":null,"work_id":"92b975c5-eaed-472e-a2f5-553c1fa63fae","year":2009},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.442085Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:946ff52a0325c653709c29afa3fe33f1db60218a7037f48346fb6b7f556cafc6","observation_id":"6d0b285f-0155-4fb8-bd62-aaa6c7ca1ba2","resolution":{"observed_at":"2026-08-08T18:32:29.813145Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.278984Z","title":null,"venue":null,"work_id":"fc27060d-0aff-4d75-be87-2317f915d258","year":2015},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.446293Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:13a05c1126cd4537408d488f732fabd41659be59f4593c4944579f9b5f96332e","observation_id":"20df9bf1-7ed1-4e00-9385-a7cc1f49d498","resolution":{"observed_at":"2026-08-08T18:32:45.283530Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.264501Z","title":"and Steinke, T","venue":null,"work_id":"09af0f48-5305-435c-b1d2-ded9c8eb8d3b","year":2017},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.450643Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:07ad408580d4806a5e96e8a31147fc09790d2dae5b791bdf6cb706252dbc0707","observation_id":"fa0f74a9-5772-4e00-a627-2a51a2b7e233","resolution":{"observed_at":"2026-08-08T18:32:45.269404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.250647Z","title":"and Zrnic, T","venue":null,"work_id":"8cc3087c-89ed-4219-b78f-bec2954539ad","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.455337Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:38037abaef5b0914734a45cf6974220f9601b9a9801f8e49746c958b9832a3b5","observation_id":"da5bf435-89ed-4ec7-9d21-c849ac6c80d5","resolution":{"observed_at":"2026-08-08T18:32:45.255153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.236820Z","title":"and Martin, G","venue":null,"work_id":"0e23413e-874e-4757-ba38-09d6fee9582b","year":1985},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.459796Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:4bf69f7a88413182739fd06f4ea6b96f29a2d2e599f92ae8391afa436d293485","observation_id":"00bb1130-b4ee-4d94-b44e-ed8b14e328b9","resolution":{"observed_at":"2026-08-08T18:32:45.241130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.222616Z","title":"Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm","venue":null,"work_id":"1085a928-009f-47ea-b7e9-5ac8bdc51b35","year":2007},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.464448Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:c85a088335ff9d1977a2111a287d2f5566da73810e711fca4005debf0ecc2504","observation_id":"d6863bf1-2bf5-4b9b-b349-c7785ea9f67d","resolution":{"observed_at":"2026-08-08T18:32:45.227143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1305.1983","last_updated":"2013-05-09T00:37:19Z","snapshot_observed_at":"2026-08-15T00:18:27.344102Z","submitted_at":"2013-05-09T00:37:19Z","title":"Restricted Admissible Limit for Domains of Finite Type","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.1983","snapshot_observed_at":"2026-08-08T18:31:43.469051Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.469051Z"},"links":{"cited_paper":"/paper/1305.1983","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:8b06af45cdaceb1e9e0fe604f53a3a72086c02ec36f639f50d3da315a1d1011f","observation_id":"d9e2f7f5-ddbb-45d0-93ad-61fe90d861c1","resolution":{"observed_at":"2026-08-08T18:31:43.469051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.208548Z","title":"Minimum cut in o(m log \\( ^2 \\) n) time","venue":null,"work_id":"4b61d9df-109e-4832-a900-dda58bb75844","year":2020},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.473784Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:16bf9996d29cb9f92d69044b665ff717d45fbd9849cb7e459f381c83c0b9bdcd","observation_id":"f2a85956-cad4-4632-b99f-62a00d8ff9a0","resolution":{"observed_at":"2026-08-08T18:32:45.213265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6572","last_updated":"2015-03-20T20:19:16Z","snapshot_observed_at":"2026-08-12T17:13:46.394331Z","submitted_at":"2014-12-20T01:17:12Z","title":"Explaining and Harnessing Adversarial Examples","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6572","snapshot_observed_at":"2026-08-08T18:31:43.478253Z","title":"J., Shlens, J., and Szegedy, C","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.478253Z"},"links":{"cited_paper":"/paper/1412.6572","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:46247b1435d9b7c83739366f4a507eb5d9955fbbc3f4213d0dd581c1f24c96d1","observation_id":"d808891b-91d0-44a0-8783-53344d3a9c1e","resolution":{"observed_at":"2026-08-08T18:31:43.478253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.193807Z","title":"BigQuery Documentation: Approximate Aggregate Functions , Accessed: 2024","venue":null,"work_id":"7bf5d6e7-cfd2-463b-a390-63eb30e6b56c","year":2024},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.483093Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:26f100c91cd59ea9d59927f3e55ede7cc6308b0848d56be4db393ab6ffe6b424","observation_id":"7ddee6e3-a756-47a6-93ee-8164daecfa46","resolution":{"observed_at":"2026-08-08T18:32:45.198833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.16153","last_updated":"2024-09-24T14:56:49Z","snapshot_observed_at":"2026-08-12T22:38:33.869682Z","submitted_at":"2024-09-24T14:56:49Z","title":"A Strong Separation for Adversarially Robust $\\ell_0$ Estimation for Linear Sketches","version":1},"cited_work":{"arxiv_id":"2409.16153","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.16153","snapshot_observed_at":"2026-08-08T18:32:17.607446Z","title":"A Strong Separation for Adversarially Robust $\\ell_0$ Estimation for Linear Sketches","venue":"cs.DS","work_id":"c826b113-d914-4b86-8f95-81b6d8ce453f","year":2024},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.487317Z"},"links":{"cited_paper":"/paper/2409.16153","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:cf6fb09998e4ba0d60b8eb41b92dc407dcdc553bbed9c028c6ca2198dfe1c38f","observation_id":"3730e0d1-689d-45d8-be4f-9b86e5470120","resolution":{"observed_at":"2026-08-08T18:32:17.612718Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.179026Z","title":null,"venue":null,"work_id":"2a203b6b-f56c-40a0-95a9-9d177723b583","year":2020},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.492235Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:28156d6d88f954cddd091c6008b1d31e14e4fdccf900ffb9f266cc40d247635a","observation_id":"7adf3e50-a35f-4bd7-88d9-74d809eb5532","resolution":{"observed_at":"2026-08-08T18:32:45.183629Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:43.496574Z","title":"and Rothblum, G","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.496574Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:17b63e625fab9f0a286183a0c1f65bdf84cae73e7bee6f1e90ed5a8f012c505a","observation_id":"e4f52c8d-5a54-4741-bb99-4e28c8035f54","resolution":{"observed_at":"2026-08-08T18:31:43.496574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:43.501334Z","title":"and Ullman, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.501334Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:37cccea92aa34f1ebf81ca77ace536ca027ca26ae415515629e7876887ec21c2","observation_id":"fb81bed7-4808-4a5c-949b-618df0be5e44","resolution":{"observed_at":"2026-08-08T18:31:43.501334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:17.587516Z","title":"and Woodruff, D","venue":null,"work_id":"8ab1724f-8d6e-49d7-8d8b-e167942104ff","year":2013},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.505963Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:445aa7bee30de23f99d5c7a6013171ca31eee5eca4b8dd7cb4cc50c8b39e22d1","observation_id":"388b0607-ada1-463a-b928-097361f87090","resolution":{"observed_at":"2026-08-08T18:32:17.592308Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.164309Z","title":"Adversarially robust streaming algorithms via differential privacy","venue":null,"work_id":"ef2d76b4-5bd9-4528-a876-8aad403e1210","year":2020},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.510678Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:fff433f204c265dc8893005b72342b6a6afa586d3cb22b566949c4fd6a3f1537","observation_id":"68ea5ea7-8f10-4fdc-966b-5b059c19d92d","resolution":{"observed_at":"2026-08-08T18:32:45.169100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.148985Z","title":"HyperLogLog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm","venue":null,"work_id":"37614b38-0839-44cd-8038-6b38bf9672cd","year":2013},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.515077Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:026e18f8abe1119aaf978da329592d1949364ace94e18a3c92d94788945156e2","observation_id":"f1bee459-c2f9-4ac4-8009-4d26309d29eb","resolution":{"observed_at":"2026-08-08T18:32:45.154150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.133986Z","title":null,"venue":null,"work_id":"518ad1a2-9d19-4896-aed1-ca6ac8b65ddf","year":2005},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.519596Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:34eed0f7ba05eed001af9bd720f6b1cfc9a4f87a239a17f08265b8b2bb8a7655","observation_id":"5d9d660e-70de-4607-b910-976cac2e672f","resolution":{"observed_at":"2026-08-08T18:32:45.138806Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.119460Z","title":"M., Nelson, J., and Woodruff, D","venue":null,"work_id":"a3bc335a-c040-4e38-a35f-f59ada5b8cda","year":2010},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.523987Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:14a8df8a4c61f0cf7ccd64f46bc3fd3d9ac7f0e66af7b6f6f657bc7781db699d","observation_id":"114ff739-f6fa-4184-8c6d-7790711e5fae","resolution":{"observed_at":"2026-08-08T18:32:45.124018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.104210Z","title":"The sparse vector technique, revisited","venue":null,"work_id":"3d41e45a-aef9-4610-92cf-271159ee8a06","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.528485Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:60860d2db90f33a2898077d891cb6c32d93677535c7e2a448f99c9ccc24ca2af","observation_id":"059e1a77-e7e7-4687-92e7-7d406094fb00","resolution":{"observed_at":"2026-08-08T18:32:45.109043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.089230Z","title":"Adaptive data analysis with correlated observations, 2022","venue":null,"work_id":"750c04b3-6bae-48d0-bb6a-3bf0110025d4","year":2022},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.532979Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:6c138dba785828fe91fa88da5a616124dd9e8faa42a9cd47a50adae692727809","observation_id":"2bb64f8c-5e88-409e-ba35-8f18606b3b6f","resolution":{"observed_at":"2026-08-08T18:32:45.094087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.074747Z","title":"M., Burnham, K","venue":null,"work_id":"2dae8f92-69ef-4e62-9584-966a3c582b09","year":2009},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.537257Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:5bd286828591bf3ad5df86b7ef33675ca6e71677b25393278038384ac2643605","observation_id":"3898ff9b-6f01-48d1-8563-2aabd087ebf3","resolution":{"observed_at":"2026-08-08T18:32:45.079093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:07.255084Z","title":"Sketching in adversarial environments","venue":null,"work_id":"e325a710-20c3-45f1-8ce6-b4d7f5c3d651","year":2008},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.541660Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:73932e791b53d56a344298142e894696a3b538d2ca2ce1fcb75fa87fbd872f48","observation_id":"30d4f307-ccc6-4c89-8fd1-8b0952c82c5f","resolution":{"observed_at":"2026-08-08T18:32:07.260115Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.060735Z","title":"B., and Swami, A","venue":null,"work_id":"166fa92b-1961-4598-84c7-42fe801c5480","year":2017},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.545889Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:9fa8f5330359d50cb1aa588f683eb9c485a7baa911d637165bac2da62f5ddac0","observation_id":"c37ff3fe-8e33-42ab-bacf-d8e63017814c","resolution":{"observed_at":"2026-08-08T18:32:45.065236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.045908Z","title":null,"venue":null,"work_id":"d5e40141-27d0-40be-bb39-280d8c1743f9","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.550037Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:19b714c331a0ed5be3bb3cf29ba815bd201d5082365d66c4cc8b8e35387dccb9","observation_id":"688e2cfe-7d38-4243-a9c0-e10a8c9e2468","resolution":{"observed_at":"2026-08-08T18:32:45.050465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:00.732596Z","title":"and Ting, D","venue":null,"work_id":"ec6cce6b-fd4f-4865-a31f-c30f7d4b4c12","year":2020},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.554470Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:90f6014b799a3061ada7e14320f0673c0426d60a41e5a554f307dc174c6991d7","observation_id":"b9ddbcb4-62e7-4271-a119-7f63d1cf629f","resolution":{"observed_at":"2026-08-08T18:32:00.737254Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.031306Z","title":"Asymptotic theory for order sampling","venue":null,"work_id":"ec114467-1a05-40da-a23c-614813011948","year":1997},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.558803Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:ebe8b215eed6b32659bc3942e0ec8845a8250155b850aedf1e81fd7d2d93c5b2","observation_id":"c3aa4023-10e8-499d-b0c7-c0287517f931","resolution":{"observed_at":"2026-08-08T18:32:45.036152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:58.812488Z","title":"and Roughgarden, T","venue":null,"work_id":"994aa2eb-aa10-431f-a044-363c2d898fd0","year":2010},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.564452Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:4276e4c85066f1cf4c5737f4ad7d8d1b126f491630e3030e8417bc4dc1fadffa","observation_id":"c6b25af3-c628-46ba-b635-879f412338b1","resolution":{"observed_at":"2026-08-08T18:31:58.817803Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:52.689198Z","title":"and Even, S","venue":null,"work_id":"e8008444-cb3b-4e42-8c4b-c77a26dfe024","year":1981},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.569752Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:20aa2190f8c1adf9199057160fa548c0d763c86b79499b13709c0a754e98a7af","observation_id":"c2f66044-978b-4463-ac50-6bd2ced6ee0e","resolution":{"observed_at":"2026-08-08T18:31:52.694657Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.017027Z","title":"and Ullman, J","venue":null,"work_id":"b6267af4-d7bc-4b11-898a-5fde49ea1806","year":2015},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.574319Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:c5194b67713e827a093d61b02ac506fb58403662049ca52557cdd170603730d5","observation_id":"8480aff0-76c6-42b2-927d-fb0ae8fea335","resolution":{"observed_at":"2026-08-08T18:32:45.021570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6199","last_updated":"2014-02-19T16:33:14Z","snapshot_observed_at":"2026-08-15T16:41:15.505782Z","submitted_at":"2013-12-21T03:36:08Z","title":"Intriguing properties of neural networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6199","snapshot_observed_at":"2026-08-08T18:31:43.578853Z","title":"Intriguing properties of neural networks","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.578853Z"},"links":{"cited_paper":"/paper/1312.6199","citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:c7d14a55de4aa7b4e6d383a710fc793648e12ef6f2095acffe95db8254a2abf5","observation_id":"3e6d6767-501a-4540-8368-bd1a167d880a","resolution":{"observed_at":"2026-08-08T18:31:43.578853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:43.583754Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.583754Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:f0b1b6e941cac62e68e188751e3808123dd08076e3fdd60e3c24c4dc6a7a0aa3","observation_id":"545b478c-b4ac-4d1d-93ec-bf3434ecfda2","resolution":{"observed_at":"2026-08-08T18:31:43.583754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:31:47.538279Z","title":"Rounding Dynamic Matchings against an Adaptive Adversary","venue":null,"work_id":"5a3d05c6-52f4-4079-885c-f05bc690aba6","year":2020},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.588264Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:acaeb10b3f6f3755bf91de1a84ce923b1d697eb9cd4d8e8dc75344f261c4d01e","observation_id":"0d358886-a311-4a51-b58f-b8f901cb9b54","resolution":{"observed_at":"2026-08-08T18:31:47.543320Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:32:45.002269Z","title":null,"venue":null,"work_id":"b76704e8-485d-4543-bdb9-b58971813a33","year":2021},"citing_paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-08T18:31:43.592562Z"},"links":{"citing_paper":"/paper/2502.05723"},"observation_digest":"sha256:77bc2601efff1ef37fc2d44e8a2d28ef0eda2290dbe73ebf8675d4eaecca6e5a","observation_id":"08f22235-4c74-4b56-881b-69b1c207ba17","resolution":{"observed_at":"2026-08-08T18:32:45.006971Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05723","last_updated":"2025-02-08T23:42:30Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T18:04:54.154394Z","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":16,"verified_exact":19,"verified_fuzzy":27},"total_outbound_references":64},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"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."}