{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4DKEG7YHAIS7PD37WOMKAMQZME","short_pith_number":"pith:4DKEG7YH","schema_version":"1.0","canonical_sha256":"e0d4437f070225f78f7fb398a03219611d34a4aff220c749ce87159607a4450d","source":{"kind":"arxiv","id":"2411.06370","version":2},"attestation_state":"computed","paper":{"title":"One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edith Cohen, Jelani Nelson, Mihir Singhal, Tam\\'as Sarl\\'os, Uri Stemmer","submitted_at":"2024-11-10T06:10:34Z","abstract_excerpt":"Cardinality sketches are compact data structures for representing sets or vectors. These sketches are space-efficient, typically requiring only logarithmic storage in the input size, and enable approximation of cardinality (or the number of nonzero entries). A crucial property in applications is \\emph{composability}, meaning that the sketch of a union of sets can be computed from individual sketches. Existing designs provide strong statistical guarantees, ensuring that a randomly sampled sketching map remains robust for an exponential number of queries in terms of the sketch size $k$. However,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.06370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-10T06:10:34Z","cross_cats_sorted":[],"title_canon_sha256":"8fb078ad899fe5792db95544448457a5ee8f37d8f696f94ed4048dd2cb3a6f11","abstract_canon_sha256":"1f3f112edb257b81b5083911fb5c1b881e994863e83634a4694d894b4ae01579"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:57.896770Z","signature_b64":"r2fuRwfubLeq84wY35aAcPmlTrHU3oTsjnTlfETmx21WGo1PBcCaLkxuevkKIzaOuIIFcevn8oFLvMEksI4pAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d4437f070225f78f7fb398a03219611d34a4aff220c749ce87159607a4450d","last_reissued_at":"2026-07-05T10:30:57.895998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:57.895998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edith Cohen, Jelani Nelson, Mihir Singhal, Tam\\'as Sarl\\'os, Uri Stemmer","submitted_at":"2024-11-10T06:10:34Z","abstract_excerpt":"Cardinality sketches are compact data structures for representing sets or vectors. These sketches are space-efficient, typically requiring only logarithmic storage in the input size, and enable approximation of cardinality (or the number of nonzero entries). A crucial property in applications is \\emph{composability}, meaning that the sketch of a union of sets can be computed from individual sketches. Existing designs provide strong statistical guarantees, ensuring that a randomly sampled sketching map remains robust for an exponential number of queries in terms of the sketch size $k$. However,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.06370","kind":"arxiv","version":2},"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/2411.06370/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.06370","created_at":"2026-07-05T10:30:57.896238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.06370v2","created_at":"2026-07-05T10:30:57.896238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.06370","created_at":"2026-07-05T10:30:57.896238+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DKEG7YHAIS7","created_at":"2026-07-05T10:30:57.896238+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DKEG7YHAIS7PD37","created_at":"2026-07-05T10:30:57.896238+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DKEG7YH","created_at":"2026-07-05T10:30:57.896238+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME","json":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME.json","graph_json":"https://pith.science/api/pith-number/4DKEG7YHAIS7PD37WOMKAMQZME/graph.json","events_json":"https://pith.science/api/pith-number/4DKEG7YHAIS7PD37WOMKAMQZME/events.json","paper":"https://pith.science/paper/4DKEG7YH"},"agent_actions":{"view_html":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME","download_json":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME.json","view_paper":"https://pith.science/paper/4DKEG7YH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.06370&json=true","fetch_graph":"https://pith.science/api/pith-number/4DKEG7YHAIS7PD37WOMKAMQZME/graph.json","fetch_events":"https://pith.science/api/pith-number/4DKEG7YHAIS7PD37WOMKAMQZME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME/action/storage_attestation","attest_author":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME/action/author_attestation","sign_citation":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME/action/citation_signature","submit_replication":"https://pith.science/pith/4DKEG7YHAIS7PD37WOMKAMQZME/action/replication_record"}},"created_at":"2026-07-05T10:30:57.896238+00:00","updated_at":"2026-07-05T10:30:57.896238+00:00"}