{"id":"W2068790982","doi":"10.1145/1073814.1073872","title":"A scheme for load balancing in heterogenous distributed hash tables","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Joins; Computer science; Hash function; Node (physics); Scheme (mathematics); Distributed computing; Distributed hash table; Merkle tree; Computer network; Join (topology); Hash table; Hash chain; Theoretical computer science; Mathematics; Peer-to-peer; Computer security; Combinatorics","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.00465384,0.0006579323,0.001360325,0.001634024,0.003190597,0.002645045,0.005143709,0.001660421,0.005578648],"category_scores_gemma":[0.007454799,0.000718936,0.0006699529,0.001965751,0.002196009,0.006073566,0.007598753,0.001631262,0.00235637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587026,"about_ca_system_score_gemma":0.001256986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005094504,"about_ca_topic_score_gemma":0.0005924569,"domain_scores_codex":[0.9963463,0.001012383,0.0002722294,0.0005723911,0.001445249,0.0003515336],"domain_scores_gemma":[0.9924936,0.001392254,0.0005594251,0.004295653,0.000713733,0.0005452887],"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.002803275,0.0004441521,0.002712228,0.0004452875,0.0002174126,0.0004193941,0.001698908,0.1010282,0.0581108,0.3946633,0.01852787,0.4189292],"study_design_scores_gemma":[0.001151933,0.0007934946,0.001112819,0.00006988252,0.0001824319,0.0008727313,0.0002792657,0.6541077,0.03413329,0.2462003,0.06086808,0.0002279809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01759028,0.0002552982,0.9771953,0.0003370248,0.0001462794,0.0002801766,0.0001393645,0.001619695,0.002436564],"genre_scores_gemma":[0.5360467,0.000288295,0.4516032,0.0004010899,0.000496992,0.0007795726,0.0004741645,0.0003061393,0.009603851],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005578648,"threshold_uncertainty_score":0.02461219,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01537367574269511,"score_gpt":0.2497174017020115,"score_spread":0.2343437259593164,"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."}}