{"id":"W4238261333","doi":"10.1145/1269899.1254916","title":"Building high accuracy bloom filters using partitioned hashing","year":2007,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Bloom filter; Hash function; Computer science; False positive paradox; Network packet; Probabilistic logic; Bit array; Set (abstract data type); Filter (signal processing); Algorithm; Artificial intelligence; Computer network; Computer security","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.009174989,0.0002114363,0.0003175739,0.0005205452,0.0003963947,0.0002198335,0.001193444,0.00006592227,0.0000686459],"category_scores_gemma":[0.005357318,0.0002018162,0.0001326311,0.002898338,0.00002461237,0.001780465,0.0003403173,0.0002519733,0.00008036083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003467545,"about_ca_system_score_gemma":0.0001828844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003808028,"about_ca_topic_score_gemma":0.000001995608,"domain_scores_codex":[0.9969355,0.0001817876,0.0007128837,0.0004726461,0.001260211,0.0004368989],"domain_scores_gemma":[0.9969093,0.0008011669,0.0004433259,0.001142236,0.0005787211,0.0001252706],"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.000005814155,0.00006685066,0.001673977,0.0005728148,0.00004034054,0.000006392511,0.0001034322,0.003704592,0.001986837,0.001861493,0.001317638,0.9886598],"study_design_scores_gemma":[0.001165145,0.0001559619,0.009033253,0.004818998,0.0003484532,0.00007463997,0.00001968486,0.9697841,0.003015947,0.001125764,0.00955731,0.0009007012],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4993672,0.03068177,0.4667663,0.0007735384,0.001203923,0.0007179569,0.000001642196,0.0001898515,0.0002978298],"genre_scores_gemma":[0.9289888,0.01291166,0.05461427,0.003246481,0.0001591862,0.00002689198,0.00001410013,0.00001569459,0.0000229842],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9877591,"threshold_uncertainty_score":0.8229827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1163070956704445,"score_gpt":0.3670505173864834,"score_spread":0.2507434217160389,"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."}}