{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KMYWKCF7VWTPX3FHLAMWJYBMNZ","short_pith_number":"pith:KMYWKCF7","schema_version":"1.0","canonical_sha256":"53316508bfada6fbeca7581964e02c6e7b98b9d534b440bd462b01fdedc436ca","source":{"kind":"arxiv","id":"2405.12034","version":2},"attestation_state":"computed","paper":{"title":"Count-Min Sketch with Conservative Updates: Worst-Case Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DS","authors_text":"Othmane Marfoq, Younes Ben Mazziane","submitted_at":"2024-05-20T14:01:38Z","abstract_excerpt":"Count-Min Sketch with Conservative Updates (CMS-CU) is a memory-efficient hash-based data structure used to estimate the occurrences of items within a data stream. CMS-CU stores $m$ counters and employs $d$ hash functions to map items to these counters. We first argue that the estimation error in CMS-CU is maximal when each item appears at most once in the stream. Next, we study CMS-CU in this setting. In the case where $d=m-1$, we prove that the average estimation error and the average counter rate converge almost surely to $\\frac{1}{2}$, contrasting with the vanilla Count-Min Sketch, where t"},"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":"2405.12034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-20T14:01:38Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"467b6191147ebcccb2376d7a9e9665347ed23e5cd58078e9f7febe54500303b8","abstract_canon_sha256":"43e3f0eb89475e2a3970c83bb0bc20bb83e5346f441c06b6692d318f71efcacf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:17.044125Z","signature_b64":"b9GtdDToBAgv3323OITaIOJm1cnGalT3H4BMfCt9u8lKxC8XQa/w7XRXmA/Z983zBmsHZWI7LhnZQXbtPoFSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53316508bfada6fbeca7581964e02c6e7b98b9d534b440bd462b01fdedc436ca","last_reissued_at":"2026-07-05T08:21:17.043706Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:17.043706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Count-Min Sketch with Conservative Updates: Worst-Case Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DS","authors_text":"Othmane Marfoq, Younes Ben Mazziane","submitted_at":"2024-05-20T14:01:38Z","abstract_excerpt":"Count-Min Sketch with Conservative Updates (CMS-CU) is a memory-efficient hash-based data structure used to estimate the occurrences of items within a data stream. CMS-CU stores $m$ counters and employs $d$ hash functions to map items to these counters. We first argue that the estimation error in CMS-CU is maximal when each item appears at most once in the stream. Next, we study CMS-CU in this setting. In the case where $d=m-1$, we prove that the average estimation error and the average counter rate converge almost surely to $\\frac{1}{2}$, contrasting with the vanilla Count-Min Sketch, where t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12034","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/2405.12034/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":"2405.12034","created_at":"2026-07-05T08:21:17.043761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.12034v2","created_at":"2026-07-05T08:21:17.043761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12034","created_at":"2026-07-05T08:21:17.043761+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMYWKCF7VWTP","created_at":"2026-07-05T08:21:17.043761+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMYWKCF7VWTPX3FH","created_at":"2026-07-05T08:21:17.043761+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMYWKCF7","created_at":"2026-07-05T08:21:17.043761+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18919","citing_title":"Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ","json":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ.json","graph_json":"https://pith.science/api/pith-number/KMYWKCF7VWTPX3FHLAMWJYBMNZ/graph.json","events_json":"https://pith.science/api/pith-number/KMYWKCF7VWTPX3FHLAMWJYBMNZ/events.json","paper":"https://pith.science/paper/KMYWKCF7"},"agent_actions":{"view_html":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ","download_json":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ.json","view_paper":"https://pith.science/paper/KMYWKCF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.12034&json=true","fetch_graph":"https://pith.science/api/pith-number/KMYWKCF7VWTPX3FHLAMWJYBMNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KMYWKCF7VWTPX3FHLAMWJYBMNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ/action/storage_attestation","attest_author":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ/action/author_attestation","sign_citation":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ/action/citation_signature","submit_replication":"https://pith.science/pith/KMYWKCF7VWTPX3FHLAMWJYBMNZ/action/replication_record"}},"created_at":"2026-07-05T08:21:17.043761+00:00","updated_at":"2026-07-05T08:21:17.043761+00:00"}