{"id":"W2081869611","doi":"10.5555/1070432.1070548","title":"An optimal Bloom filter replacement","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bloom filter; Hash function; Data structure; Set (abstract data type); Computer science; Element (criminal law); Representation (politics); Amortized analysis; Filter (signal processing); Algorithm; Theoretical computer science; Function (biology); Perfect hash function; Constant (computer programming); Bloom; Hash table","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225759,0.0002546499,0.0001966103,0.0001237978,0.0001981793,0.0003478378,0.001038953,0.00007651644,0.00007311129],"category_scores_gemma":[0.000006158427,0.0002217141,0.0001361422,0.0001700241,0.00004052916,0.0007879948,0.0001871991,0.0002192614,0.0003556858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008691705,"about_ca_system_score_gemma":0.00004053808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004045701,"about_ca_topic_score_gemma":0.000004396045,"domain_scores_codex":[0.997909,0.0001000076,0.0002899154,0.0007453719,0.0004897884,0.0004658806],"domain_scores_gemma":[0.9983472,0.00003996153,0.00008396807,0.001238605,0.00005711985,0.000233211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009791845,0.003362804,0.0009802654,0.00006871014,0.0006161195,0.0004473019,0.009192023,0.110181,0.1215122,0.052549,0.05121813,0.6488932],"study_design_scores_gemma":[0.001112651,0.001319132,0.0002552042,0.00004219684,0.00002149407,0.00005046865,0.0000657363,0.9515504,0.01388033,0.00008627826,0.03098694,0.0006291275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2524948,0.0005367532,0.688049,0.02278543,0.002534866,0.0008416076,0.00006504972,0.001810663,0.03088186],"genre_scores_gemma":[0.9514112,0.00005956242,0.04084374,0.003032931,0.0008461546,0.00005181735,0.00003055543,0.00003453334,0.003689533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8413695,"threshold_uncertainty_score":0.9041238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01162427078857109,"score_gpt":0.2517560130831717,"score_spread":0.2401317422946007,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}