{"id":"W2034389879","doi":"10.5555/1109557.1109605","title":"Asymmetric balanced allocation with simple hash functions","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hash function; Computer science; Simple (philosophy); Extension (predicate logic); Hash table; Double hashing; Hash chain; Function (biology); Theoretical computer science; Programming language","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.0001994941,0.0003205422,0.0002570834,0.0003045057,0.0004078305,0.0003698482,0.0008370175,0.0001030352,0.00002342609],"category_scores_gemma":[0.00001096198,0.0002421451,0.00008829184,0.0012856,0.00007017443,0.0009218325,0.0002273822,0.0002210201,0.0002193009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009959088,"about_ca_system_score_gemma":0.00008509133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003932851,"about_ca_topic_score_gemma":0.00002934847,"domain_scores_codex":[0.9975722,0.00007487318,0.0003367503,0.0008207485,0.0006788641,0.0005165826],"domain_scores_gemma":[0.9982786,0.0001028009,0.000171717,0.001140595,0.0001516319,0.00015464],"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.000398487,0.002910957,0.006383965,0.0001619263,0.0003987529,0.0003413048,0.0005523019,0.06426985,0.02376972,0.1874132,0.2557336,0.457666],"study_design_scores_gemma":[0.003718073,0.002015228,0.02832482,0.0001462371,0.00007555727,0.0001091944,0.00007188054,0.7826589,0.01214031,0.005878045,0.1630497,0.001812047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001832578,0.0001499517,0.9777534,0.001572839,0.000513373,0.0003577599,0.00006449077,0.0004905098,0.01726511],"genre_scores_gemma":[0.8635343,0.00007940918,0.1286435,0.0007639183,0.00105601,0.0002237302,0.0008955357,0.00008734554,0.004716273],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8617017,"threshold_uncertainty_score":0.987439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007456395841719261,"score_gpt":0.2256655254684238,"score_spread":0.2182091296267046,"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."}}