{"id":"W4230636836","doi":"10.1002/rsa.20234","title":"Multiple choice tries and distributed hash tables","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"String (physics); Mathematics; Constant (computer programming); Hash function; Combinatorics; Bounded function; Perfect hash function; Binary logarithm; Hash table; Reduction (mathematics); Discrete mathematics; Trie; Simple (philosophy); Computation; Randomized algorithm; Online algorithm; Asymptotically optimal algorithm; Data structure; Computer science; Algorithm; Mathematical analysis; Geometry","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.003921335,0.0005693014,0.001182556,0.001081241,0.001094492,0.00216419,0.002443112,0.001621944,0.004159608],"category_scores_gemma":[0.01272898,0.0007449247,0.0008590651,0.002168986,0.002774673,0.00557527,0.00299119,0.001481017,0.0008817465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001407735,"about_ca_system_score_gemma":0.0009249648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005772659,"about_ca_topic_score_gemma":0.00057828,"domain_scores_codex":[0.996384,0.001640139,0.0001619671,0.0005134531,0.0008172276,0.0004831507],"domain_scores_gemma":[0.9845951,0.01084415,0.001028328,0.00214172,0.0008502341,0.000540484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001185003,0.0001567365,0.004756951,0.0002483971,0.0001416938,0.0005917381,0.0003956384,0.5415034,0.00626371,0.3918761,0.003569523,0.04931104],"study_design_scores_gemma":[0.000164934,0.0001791575,0.0003736086,0.00002765229,0.00003357741,0.0002552948,0.00009204279,0.8039824,0.003696291,0.1882851,0.002872485,0.0000375638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2273253,0.001245172,0.7629328,0.0008890335,0.0001653118,0.000190748,0.000399868,0.001166378,0.005685331],"genre_scores_gemma":[0.8940355,0.0002585334,0.1005054,0.0001400836,0.00009187478,0.0002378362,0.0002713723,0.0001272541,0.004332001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004159608,"threshold_uncertainty_score":0.02073824,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01424389141719585,"score_gpt":0.2283696813647353,"score_spread":0.2141257899475395,"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."}}