{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012938,0.0003288434,0.0003748933,0.001052474,0.0005971779,0.0007520166,0.001793057,0.0006462837,0.002882742],"category_scores_gemma":[0.001421019,0.0002254258,0.0002313835,0.0008615453,0.0004277909,0.001544262,0.0003551527,0.0004007805,0.0006749256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001694402,"about_ca_system_score_gemma":0.001957931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008644341,"about_ca_topic_score_gemma":0.01487321,"domain_scores_codex":[0.999708,0.00005384658,0.00001803648,0.00005411752,0.000118518,0.00004751454],"domain_scores_gemma":[0.9991467,0.000254924,0.0001363342,0.0001601811,0.0002588748,0.00004293666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00118772,0.0002005371,0.0075234,0.0003931538,0.00009353347,0.0002520068,0.0002929397,0.06631847,0.1552797,0.0488984,0.01820783,0.7013524],"study_design_scores_gemma":[0.0002293242,0.0009317848,0.002453779,0.0000763999,0.00009918263,0.0009241661,0.0001104162,0.775889,0.1484861,0.01624444,0.05441828,0.0001371743],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07232141,0.0009952277,0.9114461,0.000462196,0.0000805787,0.0001417644,0.0003507545,0.008071453,0.00613052],"genre_scores_gemma":[0.5772683,0.0004792154,0.4151424,0.0004159459,0.00005527465,0.0001223035,0.0003796362,0.0001549551,0.005982041],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008644341,"threshold_uncertainty_score":0.01718807,"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."}}