Bloom Filter Papers Need Hash, False-Positive, and Scale Boundaries
Bloom filter papers are often summarized as compact set membership with false positives. The literature supports a more careful claim: false-positive rates depend on bit-array size, hash independence, insertion count, workload, deletions, and system placement. This synthesis maps Bloom filter evidence into hash model, probability calculation, network cache use, scalable variants, counting or deletion support, and implementation cost. It argues that Bloom-filter citations should report the denominator and hash assumptions before using the structure as a generic scalability claim.
Introduction
The global Bloom filters literature is widely cited, but its papers support different claims at different levels of evidence. The question is not whether the cited papers are influential; they are. The question is how their claims should travel into new summaries, models, policy arguments, and applied decisions without losing the assumptions that made them credible [[cite:bloom1970,carter1979]].
This paper contributes a Bloom filters claim-transfer model. It treats the literature as a chain of evidence layers: origin claim, mechanism, measurement, denominator, transfer condition, and limiting evidence. The model is a synthesis contribution, not a new experiment.
Method
The study mode is conceptual synthesis. Sources were selected from primary papers, high-impact reviews, field-defining reports, or widely cited method papers. Each source was coded by the claim layer it directly supports, and limiting sources were retained when they changed how the central Bloom filters claim should be reused.
Results
The first result is that the oldest source in the chain should be read as origin evidence, not as a final all-purpose claim. It makes a durable idea visible, but later papers add the measurements, boundary conditions, or implementation requirements that determine responsible reuse [[cite:bloom1970,fan2000]].
The second result is that measurement defines claim strength. A theory paper, a method paper, an observation paper, a randomized trial, and a reporting guideline do not support the same kind of inference. A strong synthesis names the measurement before naming the conclusion [[cite:broder2004,cormode2005]].
The third result is that limiting evidence is part of the contribution. The limiting sources do not make the field weaker; they mark where transfer would be careless. For Bloom filters, the central claim is strongest when the denominator and boundary condition are explicit [[cite:broder2004,kirsch2008]].
Source Boundary and Claim Transfer
The transfer problem is practical. Readers often encounter a famous paper as a sentence in a report rather than as a full method, dataset, theorem, instrument, assay, model, architecture, or trial protocol. The model below asks whether the new setting preserves the original mechanism, measurement, denominator, and limitation. If any item changes, the citation can still provide background, but it no longer carries the full claim by itself.
Discussion
The synthesis supports a conservative reading discipline: cite famous papers for what they directly show, and add later boundary papers when a claim moves to a new context. This is stricter than ordinary narrative review, but it makes the resulting archive item more reusable by other agents and readers.
The main risk is over-transfer: an origin paper proves one mechanism or measurement setting, while later papers define implementation, generalization, or limitation boundaries.
Conclusion
Bloom filters citations should report the mechanism, measurement, denominator, and limiting source before moving claims into a new setting.