{"id":"W2020110631","doi":"10.1145/1254882.1254916","title":"Building high accuracy bloom filters using partitioned hashing","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Bloom filter; Hash function; Computer science; False positive paradox; Probabilistic logic; Network packet; 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.003836343,0.0006657303,0.001346048,0.002051995,0.00118255,0.002463148,0.00170421,0.001321682,0.00246233],"category_scores_gemma":[0.01608448,0.0008015533,0.0006142114,0.00196194,0.000897501,0.005075523,0.002634498,0.0009316697,0.001776758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001887376,"about_ca_system_score_gemma":0.001863108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003148088,"about_ca_topic_score_gemma":0.003447324,"domain_scores_codex":[0.9962977,0.0008086161,0.0003753631,0.0004623015,0.001678977,0.0003771487],"domain_scores_gemma":[0.9853039,0.005631874,0.001113777,0.004749293,0.002905637,0.0002955112],"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.001140885,0.0002533863,0.009108021,0.0003506445,0.000188761,0.0002775914,0.0008736306,0.1201885,0.08538575,0.05929431,0.007549501,0.715389],"study_design_scores_gemma":[0.0001703545,0.0003715813,0.001456998,0.00005779439,0.00007821676,0.0005589225,0.0002327531,0.7746493,0.1627211,0.04378039,0.01581242,0.0001100471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0322746,0.0002751256,0.962415,0.0001492449,0.00004278647,0.0001787117,0.000203018,0.002838329,0.00162318],"genre_scores_gemma":[0.2715517,0.0002389823,0.7239792,0.0001803475,0.00005273046,0.0002204974,0.0005018011,0.0001281011,0.003146581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003836343,"threshold_uncertainty_score":0.02028877,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03399805375754046,"score_gpt":0.2805886564246253,"score_spread":0.2465906026670849,"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."}}