{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01079665,0.0007436458,0.002081352,0.002719917,0.003954832,0.007977011,0.003632052,0.003034384,0.004957381],"category_scores_gemma":[0.05237002,0.001402367,0.001607858,0.002922176,0.006838098,0.02218309,0.006372483,0.003976848,0.0009776219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007024486,"about_ca_system_score_gemma":0.005094569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006664615,"about_ca_topic_score_gemma":0.003303479,"domain_scores_codex":[0.9879623,0.003595175,0.0007457042,0.002013895,0.004295561,0.001387317],"domain_scores_gemma":[0.9574032,0.02630252,0.003748293,0.008502554,0.003281065,0.0007623131],"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.0002517824,0.00007594571,0.002603292,0.00006570209,0.00003809933,0.0001613699,0.000731648,0.06112826,0.002529725,0.9017488,0.001409951,0.02925546],"study_design_scores_gemma":[0.00002862939,0.00004777605,0.0002742131,0.00003263324,0.00004013945,0.0002203701,0.0001753239,0.4820637,0.007873072,0.5050433,0.004152887,0.00004785622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03684122,0.0002663404,0.9570691,0.0007428684,0.00003218489,0.0001100083,0.0001310299,0.000653479,0.004153911],"genre_scores_gemma":[0.7311054,0.0004373015,0.2629807,0.0004096483,0.0001714692,0.0003718977,0.0002893053,0.0003276911,0.003906554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01079665,"threshold_uncertainty_score":0.05709881,"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."}}