{"id":"W2166585241","doi":"10.1109/tvlsi.2008.2000244","title":"L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bloom filter; Computer science; Energy (signal processing); Set (abstract data type); Parallel computing; Filter (signal processing); Power (physics); Computer hardware; Detector; Real-time computing; Electronic engineering; Algorithm; Mathematics; Telecommunications; Engineering","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004208054,0.0004008923,0.0004137878,0.0004172086,0.0008398446,0.0003731728,0.0006872083,0.0002243457,0.0000565747],"category_scores_gemma":[0.00001198263,0.0003547716,0.0003590343,0.0005999559,0.0000776664,0.0008007377,0.000006998469,0.0007557851,0.0003250749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001678,"about_ca_system_score_gemma":0.0001222649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003239395,"about_ca_topic_score_gemma":0.0002878728,"domain_scores_codex":[0.9970499,0.0002551169,0.0006462745,0.000744593,0.0007498451,0.0005542189],"domain_scores_gemma":[0.9983049,0.0001675579,0.0001943266,0.0008783988,0.0002735578,0.0001812641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001185832,0.009659397,0.001274498,0.0009204893,0.001812857,0.001332975,0.07544699,0.5093365,0.2178893,0.007336811,0.04121422,0.1325901],"study_design_scores_gemma":[0.003269923,0.0006919662,0.0004041907,0.00133991,0.00009437584,0.001652749,0.002293169,0.9457469,0.03005444,0.00009211384,0.0125186,0.001841675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1312218,0.0001391964,0.8626302,0.0002425415,0.00377994,0.0003838549,0.00009285562,0.000518746,0.0009908816],"genre_scores_gemma":[0.9944519,0.00003576746,0.0007241823,0.0004141491,0.0001858436,0.0001162939,0.00001276382,0.00003527321,0.004023865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.86323,"threshold_uncertainty_score":0.9998904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01201630668168172,"score_gpt":0.209290464734775,"score_spread":0.1972741580530933,"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."}}