{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002892223,0.0001444472,0.0001916721,0.0001136896,0.00007075135,0.000138126,0.001136371,0.00008890116,0.000006768003],"category_scores_gemma":[0.0001477496,0.0001337765,0.00004618464,0.0006376511,0.00002379035,0.0003280558,0.0004681966,0.0001021352,0.00005635298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000259504,"about_ca_system_score_gemma":0.0000752863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007138503,"about_ca_topic_score_gemma":0.001149117,"domain_scores_codex":[0.9985754,0.00001075997,0.0002362777,0.0004089181,0.0002091693,0.0005594443],"domain_scores_gemma":[0.9991409,0.0000835622,0.00004059328,0.0005827993,0.00008287877,0.00006923336],"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.00006584165,0.0007327296,0.02498282,0.00009043734,0.00009929296,0.00008873265,0.001552184,0.02281092,0.03110154,0.09170506,0.1698168,0.6569537],"study_design_scores_gemma":[0.001660483,0.0002774287,0.003445505,0.00009650289,0.00000518015,0.00004630664,0.00008505554,0.6582504,0.05980858,0.006302803,0.2691464,0.0008753004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1215338,0.0001855011,0.8697949,0.006779088,0.00009519784,0.0003464759,0.00001432623,0.0008831338,0.0003675996],"genre_scores_gemma":[0.5869706,0.000003341541,0.4121898,0.0005255633,0.00003982109,0.00007509572,0.000005549035,0.000006895035,0.0001833106],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6560783,"threshold_uncertainty_score":0.5455247,"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."}}