{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7FG63APZ5XF2UYMJGBJJJEL2HK","short_pith_number":"pith:7FG63APZ","canonical_record":{"source":{"id":"2502.05723","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-08T23:42:30Z","cross_cats_sorted":[],"title_canon_sha256":"27e633fca3d9a88c74fae9002edfd845315178d0a4948cefdda02bcfbd8c1e53","abstract_canon_sha256":"65b7680c3387665e9fdf948b929e21feafdd936ccdb63084493d6bbbf32b50fb"},"schema_version":"1.0"},"canonical_sha256":"f94ded81f9edcbaa6189305294917a3abf8372f5c643230e7c41d0afe81adbe6","source":{"kind":"arxiv","id":"2502.05723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05723","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05723v1","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05723","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"pith_short_12","alias_value":"7FG63APZ5XF2","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"pith_short_16","alias_value":"7FG63APZ5XF2UYMJ","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"pith_short_8","alias_value":"7FG63APZ","created_at":"2026-07-05T10:11:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7FG63APZ5XF2UYMJGBJJJEL2HK","target":"record","payload":{"canonical_record":{"source":{"id":"2502.05723","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-08T23:42:30Z","cross_cats_sorted":[],"title_canon_sha256":"27e633fca3d9a88c74fae9002edfd845315178d0a4948cefdda02bcfbd8c1e53","abstract_canon_sha256":"65b7680c3387665e9fdf948b929e21feafdd936ccdb63084493d6bbbf32b50fb"},"schema_version":"1.0"},"canonical_sha256":"f94ded81f9edcbaa6189305294917a3abf8372f5c643230e7c41d0afe81adbe6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:42.563432Z","signature_b64":"fTDskqOw053FHOWCLKu7dSdzooJiq3iHBVRTbSSpv6ZUMEAfEXuA96Af+hi+66ZfZNinoMC278TwIvWPfOHiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f94ded81f9edcbaa6189305294917a3abf8372f5c643230e7c41d0afe81adbe6","last_reissued_at":"2026-07-05T10:11:42.562996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:42.562996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.05723","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:11:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68Tcl9dHk5EkY4ZZUU9aamreAPnDkjm5tJ+bd9WySzYQ/UaY8wyb3GFgedaRc5Oix+CYwtE41QJErc3xrOy3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:45:53.996163Z"},"content_sha256":"eaf6b20983ce6e7a927e52cd974a5c55f96f74cfb4c0053f97814065c51cbe76","schema_version":"1.0","event_id":"sha256:eaf6b20983ce6e7a927e52cd974a5c55f96f74cfb4c0053f97814065c51cbe76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7FG63APZ5XF2UYMJGBJJJEL2HK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edith Cohen, Mihir Singhal, Uri Stemmer","submitted_at":"2025-02-08T23:42:30Z","abstract_excerpt":"Cardinality sketches are compact data structures that efficiently estimate the number of distinct elements across multiple queries while minimizing storage, communication, and computational costs. However, recent research has shown that these sketches can fail under {\\em adaptively chosen queries}, breaking down after approximately $\\tilde{O}(k^2)$ queries, where $k$ is the sketch size.\n  In this work, we overcome this \\emph{quadratic barrier} by designing robust estimators with fine-grained guarantees. Specifically, our constructions can handle an {\\em exponential number of adaptive queries},"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05723","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.05723/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:11:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2iZJ7G/djMg4vNcc6iIYx8WFBkEC2+l7SQIfNFK9jH+zWijWaZli8NubNcj94V6TaK+Fr3V8HccYRkZQJ9xaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:45:53.996729Z"},"content_sha256":"04634c5107754d071c640d2a24a6e23766cc989c0428f973400237b704a90cd6","schema_version":"1.0","event_id":"sha256:04634c5107754d071c640d2a24a6e23766cc989c0428f973400237b704a90cd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FG63APZ5XF2UYMJGBJJJEL2HK/bundle.json","state_url":"https://pith.science/pith/7FG63APZ5XF2UYMJGBJJJEL2HK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FG63APZ5XF2UYMJGBJJJEL2HK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T20:45:53Z","links":{"resolver":"https://pith.science/pith/7FG63APZ5XF2UYMJGBJJJEL2HK","bundle":"https://pith.science/pith/7FG63APZ5XF2UYMJGBJJJEL2HK/bundle.json","state":"https://pith.science/pith/7FG63APZ5XF2UYMJGBJJJEL2HK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FG63APZ5XF2UYMJGBJJJEL2HK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7FG63APZ5XF2UYMJGBJJJEL2HK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"65b7680c3387665e9fdf948b929e21feafdd936ccdb63084493d6bbbf32b50fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-08T23:42:30Z","title_canon_sha256":"27e633fca3d9a88c74fae9002edfd845315178d0a4948cefdda02bcfbd8c1e53"},"schema_version":"1.0","source":{"id":"2502.05723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05723","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05723v1","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05723","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"pith_short_12","alias_value":"7FG63APZ5XF2","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"pith_short_16","alias_value":"7FG63APZ5XF2UYMJ","created_at":"2026-07-05T10:11:42Z"},{"alias_kind":"pith_short_8","alias_value":"7FG63APZ","created_at":"2026-07-05T10:11:42Z"}],"graph_snapshots":[{"event_id":"sha256:04634c5107754d071c640d2a24a6e23766cc989c0428f973400237b704a90cd6","target":"graph","created_at":"2026-07-05T10:11:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.05723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cardinality sketches are compact data structures that efficiently estimate the number of distinct elements across multiple queries while minimizing storage, communication, and computational costs. However, recent research has shown that these sketches can fail under {\\em adaptively chosen queries}, breaking down after approximately $\\tilde{O}(k^2)$ queries, where $k$ is the sketch size.\n  In this work, we overcome this \\emph{quadratic barrier} by designing robust estimators with fine-grained guarantees. Specifically, our constructions can handle an {\\em exponential number of adaptive queries},","authors_text":"Edith Cohen, Mihir Singhal, Uri Stemmer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-08T23:42:30Z","title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05723","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eaf6b20983ce6e7a927e52cd974a5c55f96f74cfb4c0053f97814065c51cbe76","target":"record","created_at":"2026-07-05T10:11:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"65b7680c3387665e9fdf948b929e21feafdd936ccdb63084493d6bbbf32b50fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-08T23:42:30Z","title_canon_sha256":"27e633fca3d9a88c74fae9002edfd845315178d0a4948cefdda02bcfbd8c1e53"},"schema_version":"1.0","source":{"id":"2502.05723","kind":"arxiv","version":1}},"canonical_sha256":"f94ded81f9edcbaa6189305294917a3abf8372f5c643230e7c41d0afe81adbe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f94ded81f9edcbaa6189305294917a3abf8372f5c643230e7c41d0afe81adbe6","first_computed_at":"2026-07-05T10:11:42.562996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:42.562996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fTDskqOw053FHOWCLKu7dSdzooJiq3iHBVRTbSSpv6ZUMEAfEXuA96Af+hi+66ZfZNinoMC278TwIvWPfOHiCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:42.563432Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaf6b20983ce6e7a927e52cd974a5c55f96f74cfb4c0053f97814065c51cbe76","sha256:04634c5107754d071c640d2a24a6e23766cc989c0428f973400237b704a90cd6"],"state_sha256":"f0e4b4d9a7a8cc7a157e34023e8786f318437980a0e09caaf084d9fee03c7c4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJ8j+SkN0bMy6dWKa13Wsf0Ppp8JYPPnDdRlngTU82hNHr+4uUUhNJl/I8znWahxZU00cBalAC42hWL0nr8PCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T20:45:54.000643Z","bundle_sha256":"5a4689d5643852435da11b794436c615db57d4bf61bdeb9339854fbed3b2995a"}}