{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005053652,0.0006956885,0.001466026,0.002575887,0.001364332,0.002993429,0.001947822,0.001375303,0.002657634],"category_scores_gemma":[0.0203777,0.0009013591,0.0007298012,0.002461809,0.0009666253,0.006012799,0.00299524,0.001048767,0.002003437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002435209,"about_ca_system_score_gemma":0.002424337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003968146,"about_ca_topic_score_gemma":0.004246617,"domain_scores_codex":[0.9949781,0.001131228,0.000533176,0.0006230072,0.002233722,0.0005007921],"domain_scores_gemma":[0.9809967,0.006961912,0.001403606,0.006290502,0.003993983,0.0003532581],"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.001209308,0.0002728227,0.009937874,0.0003456652,0.0002148025,0.0002437687,0.0009003368,0.1129852,0.06326333,0.05975552,0.009213068,0.7416583],"study_design_scores_gemma":[0.0001965757,0.0004182991,0.001603285,0.00006983276,0.00009685069,0.0005589869,0.0002727165,0.785017,0.1406218,0.05258419,0.01843815,0.0001224143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02931304,0.0003139632,0.9644467,0.0001883995,0.00004918859,0.0002386318,0.0002868901,0.003363983,0.001799343],"genre_scores_gemma":[0.2517904,0.0002614177,0.7435699,0.0001989165,0.00005831594,0.0002526637,0.0006349347,0.0001391365,0.003094392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005053652,"threshold_uncertainty_score":0.0267266,"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."}}