{"id":"W4289599795","doi":"10.4230/lipics.disc.2023.26","title":"Cordial Miners: Fast and Efficient Consensus for Every Eventuality","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Equivocation; Asynchrony (computer programming); Computer science; Byzantine fault tolerance; Latency (audio); Byzantine architecture; Block (permutation group theory); Atomic broadcast; Computer network; Distributed computing; Broadcasting (networking); Fault tolerance; Mathematics; History; Telecommunications; Combinatorics; Asynchronous communication; Philosophy","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199356,0.0005677398,0.0008318024,0.0006933722,0.001007819,0.001142944,0.001738374,0.0009195125,0.00688726],"category_scores_gemma":[0.005905031,0.0004397698,0.0003971719,0.0007683577,0.0009693077,0.003045273,0.003078261,0.001453111,0.002044969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007004651,"about_ca_system_score_gemma":0.001451717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001116346,"about_ca_topic_score_gemma":0.002161733,"domain_scores_codex":[0.9989436,0.0002448045,0.00008402702,0.0002349223,0.0003629422,0.0001296085],"domain_scores_gemma":[0.9975616,0.0005885565,0.000202747,0.001100519,0.0003437917,0.0002027677],"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.002089716,0.0002834713,0.00189035,0.0007625653,0.000101031,0.0005226781,0.0007475328,0.1307662,0.05192291,0.2267908,0.0389981,0.5451247],"study_design_scores_gemma":[0.0003875299,0.0003320075,0.0002641021,0.00006996487,0.00003647709,0.0003231588,0.0001056039,0.7603843,0.04147239,0.1559494,0.04061749,0.00005756762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06249766,0.0006422994,0.9057094,0.0007769837,0.0003328855,0.000442103,0.0006053718,0.01434482,0.01464837],"genre_scores_gemma":[0.6448607,0.0004480525,0.3313841,0.0002705115,0.0001433811,0.0003703718,0.001236337,0.0008777421,0.02040882],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00688726,"threshold_uncertainty_score":0.02304018,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06788937075502022,"score_gpt":0.2045272714509784,"score_spread":0.1366379006959582,"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."}}