{"id":"W2116910210","doi":"10.1109/icdcs.2010.31","title":"Practical Robust Communication in DHTs Tolerating a Byzantine Adversary","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Mitacs","keywords":"Computer science; Protocol (science); Binary logarithm; Cryptography; Communication complexity; Bounded function; Theoretical computer science; Quantum Byzantine agreement; Byzantine fault tolerance; Key (lock); Discrete logarithm; Distributed computing; Algorithm; Computer network; Fault tolerance; Public-key cryptography; Computer security; Discrete mathematics; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.005802111,0.001033544,0.001972218,0.0009511952,0.001977634,0.003594914,0.003251865,0.002599388,0.003321986],"category_scores_gemma":[0.01670684,0.0008698932,0.001164192,0.001981962,0.003382232,0.01100135,0.006868877,0.003458391,0.001333562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002590082,"about_ca_system_score_gemma":0.001782492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007878045,"about_ca_topic_score_gemma":0.0004002525,"domain_scores_codex":[0.9912451,0.002963322,0.0006425255,0.00169581,0.002454393,0.0009988954],"domain_scores_gemma":[0.9835397,0.008076927,0.001577589,0.005685907,0.0007737702,0.0003462267],"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.001386466,0.0001851019,0.001233802,0.0009525237,0.0001891668,0.0009106589,0.001249868,0.319319,0.04591773,0.5267862,0.006758899,0.09511061],"study_design_scores_gemma":[0.0002755829,0.0004062637,0.0003180276,0.00007522344,0.0001008455,0.00058096,0.0003593302,0.6868103,0.03351311,0.2603613,0.01711554,0.00008347792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04593492,0.0006790769,0.9450181,0.001197127,0.00008394461,0.0002412928,0.0002262017,0.001367233,0.005252123],"genre_scores_gemma":[0.8081445,0.001008635,0.1826603,0.0003832222,0.0001812297,0.0005103831,0.0004505232,0.0002254102,0.006435909],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005802111,"threshold_uncertainty_score":0.03068483,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02906925497245377,"score_gpt":0.2944271993237668,"score_spread":0.265357944351313,"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."}}