{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M2XRSEBVNWI56IICOJKRY43J4D","short_pith_number":"pith:M2XRSEBV","schema_version":"1.0","canonical_sha256":"66af1910356d91df210272551c7369e0c3e4149acbd90879c0340bb724ed2d04","source":{"kind":"arxiv","id":"1804.04777","version":2},"attestation_state":"computed","paper":{"title":"Optimizing Bloom Filter: Challenges, Solutions, and Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deke Guo, Lailong Luo, Ori Rottenstreich, Richard T.B. Ma, Xueshan Luo","submitted_at":"2018-04-13T02:57:19Z","abstract_excerpt":"Bloom filter (BF) has been widely used to support membership query, i.e., to judge whether a given element x is a member of a given set S or not. Recent years have seen a flourish design explosion of BF due to its characteristic of space-efficiency and the functionality of constant-time membership query. The existing reviews or surveys mainly focus on the applications of BF, but fall short in covering the current trends, thereby lacking intrinsic understanding of their design philosophy. To this end, this survey provides an overview of BF and its variants, with an emphasis on the optimization "},"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":"1804.04777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-13T02:57:19Z","cross_cats_sorted":[],"title_canon_sha256":"80b73ae6e77994ceaaf51c9bbdb2411197313ebeda77dd0985e98a46a615529a","abstract_canon_sha256":"c455f298dad4f5f3ca2271d4343fa3ad0449e0abcc95abf1a04e4dbfd25c9bf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:53.480141Z","signature_b64":"BeJGgG+QcZnH0UjBCtb5sNy2K4o1zfrIpuB7jWGEaL4y7IE74cX++YzZIJ2UxeP5jyxftiNVLopwQl10lycbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66af1910356d91df210272551c7369e0c3e4149acbd90879c0340bb724ed2d04","last_reissued_at":"2026-05-17T23:56:53.479422Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:53.479422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Bloom Filter: Challenges, Solutions, and Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deke Guo, Lailong Luo, Ori Rottenstreich, Richard T.B. Ma, Xueshan Luo","submitted_at":"2018-04-13T02:57:19Z","abstract_excerpt":"Bloom filter (BF) has been widely used to support membership query, i.e., to judge whether a given element x is a member of a given set S or not. Recent years have seen a flourish design explosion of BF due to its characteristic of space-efficiency and the functionality of constant-time membership query. The existing reviews or surveys mainly focus on the applications of BF, but fall short in covering the current trends, thereby lacking intrinsic understanding of their design philosophy. To this end, this survey provides an overview of BF and its variants, with an emphasis on the optimization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04777","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":""},"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":"1804.04777","created_at":"2026-05-17T23:56:53.479544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04777v2","created_at":"2026-05-17T23:56:53.479544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04777","created_at":"2026-05-17T23:56:53.479544+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2XRSEBVNWI5","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2XRSEBVNWI56IIC","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2XRSEBV","created_at":"2026-05-18T12:32:37.024351+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/M2XRSEBVNWI56IICOJKRY43J4D","json":"https://pith.science/pith/M2XRSEBVNWI56IICOJKRY43J4D.json","graph_json":"https://pith.science/api/pith-number/M2XRSEBVNWI56IICOJKRY43J4D/graph.json","events_json":"https://pith.science/api/pith-number/M2XRSEBVNWI56IICOJKRY43J4D/events.json","paper":"https://pith.science/paper/M2XRSEBV"},"agent_actions":{"view_html":"https://pith.science/pith/M2XRSEBVNWI56IICOJKRY43J4D","download_json":"https://pith.science/pith/M2XRSEBVNWI56IICOJKRY43J4D.json","view_paper":"https://pith.science/paper/M2XRSEBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04777&json=true","fetch_graph":"https://pith.science/api/pith-number/M2XRSEBVNWI56IICOJKRY43J4D/graph.json","fetch_events":"https://pith.science/api/pith-number/M2XRSEBVNWI56IICOJKRY43J4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2XRSEBVNWI56IICOJKRY43J4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2XRSEBVNWI56IICOJKRY43J4D/action/storage_attestation","attest_author":"https://pith.science/pith/M2XRSEBVNWI56IICOJKRY43J4D/action/author_attestation","sign_citation":"https://pith.science/pith/M2XRSEBVNWI56IICOJKRY43J4D/action/citation_signature","submit_replication":"https://pith.science/pith/M2XRSEBVNWI56IICOJKRY43J4D/action/replication_record"}},"created_at":"2026-05-17T23:56:53.479544+00:00","updated_at":"2026-05-17T23:56:53.479544+00:00"}