{"id":"W4246690268","doi":"10.1109/lpe.2006.4271845","title":"L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Semiconductor Research Corporation","keywords":"Bloom filter; Computer science; Parallel computing; Latency (audio); Static random-access memory; Energy (signal processing); Computer hardware; Algorithm; Mathematics; Telecommunications; Statistics","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.0001294213,0.0001283867,0.0001138776,0.00007948871,0.0001172616,0.000268955,0.0005342739,0.00004457685,0.0000620085],"category_scores_gemma":[0.00000974928,0.0001044591,0.00008918247,0.0001801347,0.00002366183,0.0001936283,0.0001821943,0.0001604656,0.0001491298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001654153,"about_ca_system_score_gemma":0.00002447704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005066694,"about_ca_topic_score_gemma":0.00008975509,"domain_scores_codex":[0.9989586,0.00002605776,0.0001639989,0.0003226789,0.0002402715,0.0002884109],"domain_scores_gemma":[0.9993945,0.00005384681,0.0000444909,0.0004163187,0.00004704623,0.00004378497],"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.00006289306,0.001175861,0.01613171,0.000129851,0.0001720155,0.0007082067,0.00263213,0.01145487,0.1249996,0.2850098,0.26018,0.2973431],"study_design_scores_gemma":[0.005421393,0.0005417889,0.03522431,0.0004633769,0.00006439679,0.0008391105,0.0003081639,0.6806533,0.02061697,0.03290826,0.2189471,0.004011874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2729812,0.0001458965,0.6619402,0.001545616,0.0003985502,0.00009233315,0.000002773155,0.000512748,0.06238066],"genre_scores_gemma":[0.9857149,0.000001135408,0.005118677,0.001278989,0.0001375695,0.000004319462,0.000002644198,0.000008074988,0.007733752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7127336,"threshold_uncertainty_score":0.4259717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004837930033852265,"score_gpt":0.1816530303819941,"score_spread":0.1768151003481418,"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."}}