{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173001,0.000098215,0.0001194056,0.000141335,0.00008288341,0.0001309808,0.001168008,0.0001086913,0.00002632909],"category_scores_gemma":[0.0006778327,0.00009028442,0.00002033514,0.000621026,0.00003705654,0.0006359358,0.001048593,0.0005641849,0.0001202052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001286525,"about_ca_system_score_gemma":0.00005064578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009284748,"about_ca_topic_score_gemma":0.0008059544,"domain_scores_codex":[0.99901,0.00004690241,0.0002161298,0.0002766362,0.0001863186,0.0002639763],"domain_scores_gemma":[0.9983884,0.0003050299,0.00005569943,0.001133332,0.00006237756,0.00005521707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001244147,0.0003414523,0.0126568,0.00001137213,0.00001353302,0.00007849047,0.0008887958,0.002153077,0.01526442,0.8365264,0.04493649,0.08711673],"study_design_scores_gemma":[0.0005638479,0.0001059606,0.01666194,0.00006953516,0.000004128905,0.0001331103,0.0002135229,0.9376981,0.01280058,0.003865389,0.02733171,0.0005521423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1679372,0.00002588339,0.7281267,0.07536499,0.0003117456,0.0003166254,5.954316e-7,0.001287842,0.02662841],"genre_scores_gemma":[0.5026761,0.000002856686,0.4968202,0.000382086,0.00001364075,0.00001173833,0.000001261924,0.000003319747,0.00008882215],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9355451,"threshold_uncertainty_score":0.3681692,"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."}}