{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MP6YFKG37YQDPICT24EKIHD26A","short_pith_number":"pith:MP6YFKG3","schema_version":"1.0","canonical_sha256":"63fd82a8dbfe2037a053d708a41c7af000b67683d5493f08aa82b332a116a8be","source":{"kind":"arxiv","id":"2204.00650","version":1},"attestation_state":"computed","paper":{"title":"Double-Hashing Algorithm for Frequency Estimation in Data Streams","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"C. Bayan Bruss, Nikita Seleznev, Senthil Kumar","submitted_at":"2022-04-01T18:40:56Z","abstract_excerpt":"Frequency estimation of elements is an important task for summarizing data streams and machine learning applications. The problem is often addressed by using streaming algorithms with sublinear space data structures. These algorithms allow processing of large data while using limited data storage. Commonly used streaming algorithms, such as count-min sketch, have many advantages, but do not take into account properties of a data stream for performance optimization. In the present paper we introduce a novel double-hashing algorithm that provides flexibility to optimize streaming algorithms depe"},"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":"2204.00650","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-01T18:40:56Z","cross_cats_sorted":[],"title_canon_sha256":"216074d5a7232376565dafcfa839b42a74e1b4651f0c5cbe1f8a89b2399902e9","abstract_canon_sha256":"00c0fcda22ff2376f389ba66a1ffe8d6d802460337589b7e8bcdb6a5687be789"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:54.596277Z","signature_b64":"wIHDWnyZyXxN9S1heXUxw5rdbDV/1t2QFYSWbMKGUatHT4RYJmF+75EMdvjvgLM0Iw5HS3MgtnVW6110dMNDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63fd82a8dbfe2037a053d708a41c7af000b67683d5493f08aa82b332a116a8be","last_reissued_at":"2026-07-05T04:10:54.595828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:54.595828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double-Hashing Algorithm for Frequency Estimation in Data Streams","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"C. Bayan Bruss, Nikita Seleznev, Senthil Kumar","submitted_at":"2022-04-01T18:40:56Z","abstract_excerpt":"Frequency estimation of elements is an important task for summarizing data streams and machine learning applications. The problem is often addressed by using streaming algorithms with sublinear space data structures. These algorithms allow processing of large data while using limited data storage. Commonly used streaming algorithms, such as count-min sketch, have many advantages, but do not take into account properties of a data stream for performance optimization. In the present paper we introduce a novel double-hashing algorithm that provides flexibility to optimize streaming algorithms depe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.00650","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/2204.00650/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":"2204.00650","created_at":"2026-07-05T04:10:54.595899+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.00650v1","created_at":"2026-07-05T04:10:54.595899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.00650","created_at":"2026-07-05T04:10:54.595899+00:00"},{"alias_kind":"pith_short_12","alias_value":"MP6YFKG37YQD","created_at":"2026-07-05T04:10:54.595899+00:00"},{"alias_kind":"pith_short_16","alias_value":"MP6YFKG37YQDPICT","created_at":"2026-07-05T04:10:54.595899+00:00"},{"alias_kind":"pith_short_8","alias_value":"MP6YFKG3","created_at":"2026-07-05T04:10:54.595899+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/MP6YFKG37YQDPICT24EKIHD26A","json":"https://pith.science/pith/MP6YFKG37YQDPICT24EKIHD26A.json","graph_json":"https://pith.science/api/pith-number/MP6YFKG37YQDPICT24EKIHD26A/graph.json","events_json":"https://pith.science/api/pith-number/MP6YFKG37YQDPICT24EKIHD26A/events.json","paper":"https://pith.science/paper/MP6YFKG3"},"agent_actions":{"view_html":"https://pith.science/pith/MP6YFKG37YQDPICT24EKIHD26A","download_json":"https://pith.science/pith/MP6YFKG37YQDPICT24EKIHD26A.json","view_paper":"https://pith.science/paper/MP6YFKG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.00650&json=true","fetch_graph":"https://pith.science/api/pith-number/MP6YFKG37YQDPICT24EKIHD26A/graph.json","fetch_events":"https://pith.science/api/pith-number/MP6YFKG37YQDPICT24EKIHD26A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MP6YFKG37YQDPICT24EKIHD26A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MP6YFKG37YQDPICT24EKIHD26A/action/storage_attestation","attest_author":"https://pith.science/pith/MP6YFKG37YQDPICT24EKIHD26A/action/author_attestation","sign_citation":"https://pith.science/pith/MP6YFKG37YQDPICT24EKIHD26A/action/citation_signature","submit_replication":"https://pith.science/pith/MP6YFKG37YQDPICT24EKIHD26A/action/replication_record"}},"created_at":"2026-07-05T04:10:54.595899+00:00","updated_at":"2026-07-05T04:10:54.595899+00:00"}