{"id":"W2020110631","doi":"10.1145/1254882.1254916","title":"Building high accuracy bloom filters using partitioned hashing","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Bloom filter; Hash function; Computer science; False positive paradox; Probabilistic logic; Network packet; Bit array; Set (abstract data type); Filter (signal processing); Algorithm; Artificial intelligence; Computer network; Computer security","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":[],"consensus_categories":[],"category_scores_codex":[0.0005050767,0.0001020754,0.0001017419,0.000114449,0.0002350576,0.0002894047,0.000445488,0.00003833602,0.00002176586],"category_scores_gemma":[0.0000747545,0.00009589911,0.00006536541,0.000242951,0.00001776782,0.0008341215,0.0001750986,0.0001152901,0.000024729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005447129,"about_ca_system_score_gemma":0.00002510834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005953588,"about_ca_topic_score_gemma":0.00002265763,"domain_scores_codex":[0.998945,0.00002553607,0.0002066624,0.0002779693,0.000218215,0.0003266375],"domain_scores_gemma":[0.9992392,0.0002108145,0.00006719173,0.000340191,0.00004829828,0.00009430961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003351403,0.0001845785,0.002842607,0.00002520607,0.00009576929,0.0002994115,0.000993569,0.008434823,0.4486003,0.4242351,0.002246697,0.1120084],"study_design_scores_gemma":[0.00167258,0.0001238688,0.005970029,0.0002221907,0.00004691268,0.0002150317,0.000283731,0.8747643,0.09527869,0.01531503,0.004858274,0.00124938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4151443,0.00001916941,0.583364,0.0002164898,0.0003312309,0.00003337738,2.958078e-7,0.0001814456,0.0007096378],"genre_scores_gemma":[0.890579,0.000001709611,0.1079868,0.001187135,0.0001069424,8.201121e-7,7.322931e-7,0.000005867342,0.0001309432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8663294,"threshold_uncertainty_score":0.3910652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03399805375754046,"score_gpt":0.2805886564246253,"score_spread":0.2465906026670849,"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."}}