{"id":"W2170258443","doi":"10.5555/1283383.1283479","title":"Multiple choice tries and distributed hash tables","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Trie; Sorting; Hash function; Mathematics; String (physics); Simple (philosophy); Computation; Reduction (mathematics); Combinatorics; Discrete mathematics; Binary logarithm; Hash table; Greedy algorithm; Computer science; Data structure; Algorithm","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.002140523,0.0006591958,0.0009433203,0.001142306,0.0007643339,0.002026567,0.001722073,0.001035669,0.006437987],"category_scores_gemma":[0.007283518,0.0005673233,0.000581092,0.002826057,0.001938633,0.004838002,0.002252538,0.001172879,0.001689304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086902,"about_ca_system_score_gemma":0.0009374454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004654615,"about_ca_topic_score_gemma":0.00044634,"domain_scores_codex":[0.9977707,0.0007563247,0.0001013657,0.0003243387,0.0006965132,0.0003508098],"domain_scores_gemma":[0.9954302,0.002880918,0.0003724941,0.0007905716,0.0003656352,0.0001602242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006778619,0.00007541016,0.00187733,0.0003311448,0.00007445559,0.0002990573,0.0003035264,0.2151792,0.006416154,0.6805488,0.004227906,0.0899892],"study_design_scores_gemma":[0.000181319,0.0002868099,0.0004347281,0.00006620229,0.00005613401,0.0006177354,0.0001389827,0.4076238,0.00840667,0.5636668,0.01846596,0.00005499208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06849262,0.002891823,0.9133341,0.0004857078,0.000110217,0.0001745323,0.0003337092,0.001109417,0.01306783],"genre_scores_gemma":[0.7341164,0.002397348,0.2488956,0.0002502305,0.0002335659,0.000530364,0.0005902118,0.0002753294,0.01271095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006437987,"threshold_uncertainty_score":0.02153718,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01614489138482636,"score_gpt":0.2265816408227295,"score_spread":0.2104367494379031,"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."}}