{"id":"W2963239606","doi":"10.4230/lipics.disc.2020.31","title":"Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Computer network; Byzantine architecture; Node (physics); Byzantine fault tolerance; Latency (audio); Leader election; Distributed computing; Quantum Byzantine agreement; Theoretical computer science; Computer security; Telecommunications; Fault tolerance","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.004692903,0.0008533079,0.001567367,0.0008881206,0.002234512,0.002739991,0.00267595,0.001654937,0.002580341],"category_scores_gemma":[0.01319593,0.0004343532,0.0009403958,0.001378868,0.003892884,0.008009648,0.004817926,0.002454859,0.0007912053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001805319,"about_ca_system_score_gemma":0.001817159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001026247,"about_ca_topic_score_gemma":0.001088865,"domain_scores_codex":[0.9947619,0.00237878,0.0002551975,0.0008386305,0.0013168,0.0004487436],"domain_scores_gemma":[0.9909925,0.004394701,0.0009609137,0.002487465,0.0006161347,0.0005483016],"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.001092809,0.0002088182,0.0008153337,0.0002893579,0.0001012456,0.0004177736,0.001553057,0.1475065,0.02578077,0.7531126,0.004821619,0.06430005],"study_design_scores_gemma":[0.0002072921,0.000128593,0.0001447039,0.00003230587,0.00003411168,0.0001418579,0.000138128,0.6722377,0.01355019,0.3049905,0.008350672,0.00004401265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07272078,0.0002845147,0.9176766,0.001491497,0.0000720004,0.0003508803,0.00009618175,0.001157876,0.006149685],"genre_scores_gemma":[0.7567778,0.0003020585,0.2362644,0.0002494597,0.00009815337,0.0006087062,0.0001915538,0.0001683056,0.005339564],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004692903,"threshold_uncertainty_score":0.02481872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03223599983900074,"score_gpt":0.2015651070737585,"score_spread":0.1693291072347578,"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."}}