{"id":"W2063550827","doi":"10.1145/1989493.1989551","title":"Understanding bloom filter intersection for lazy address-set disambiguation","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bloom filter; Intersection (aeronautics); Set (abstract data type); Hash function; Computer science; Probabilistic logic; Filter (signal processing); Algorithm; Theoretical computer science; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0001587424,0.000067865,0.00006271249,0.00007243586,0.0001012943,0.00008432154,0.0002201594,0.00003300667,0.00004694772],"category_scores_gemma":[0.00001807208,0.00005923826,0.00006345012,0.00008185999,0.00001297851,0.0004128786,0.00006113133,0.00004742799,0.00002153053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006842377,"about_ca_system_score_gemma":0.00001060883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002104924,"about_ca_topic_score_gemma":0.0001301202,"domain_scores_codex":[0.9994413,0.00002014632,0.0001100732,0.000202529,0.00009126347,0.0001346528],"domain_scores_gemma":[0.9996532,0.00004301601,0.00003811845,0.0001994971,0.00003140035,0.00003474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001382038,0.0001911786,0.003182956,0.00004269757,0.0001129213,0.000007447134,0.009636154,0.00005834473,0.007643443,0.9302142,0.03065297,0.01811954],"study_design_scores_gemma":[0.002302798,0.0007637322,0.004219785,0.0001139959,0.00005468719,0.00003649217,0.002789258,0.8643423,0.01167618,0.1110631,0.001812952,0.0008247455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01446542,0.000007196048,0.9742941,0.0001666664,0.0006256379,0.000117355,0.000002718103,0.000170288,0.01015067],"genre_scores_gemma":[0.994078,0.000001733738,0.004587167,0.0002859354,0.00005108371,0.00001682408,0.000005952973,0.000004894971,0.0009683755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9796126,"threshold_uncertainty_score":0.2415666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3985624610440917,"score_gpt":0.2840977546055879,"score_spread":0.1144647064385038,"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."}}