{"id":"W2154903757","doi":"10.5555/2095116.2095161","title":"Gathering despite mischief","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Byzantine architecture; Computer science; Node (physics); Upper and lower bounds; Matching (statistics); Byzantine fault tolerance; Theoretical computer science; Combinatorics; Mathematics; Distributed computing; Fault tolerance; Physics","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.003117352,0.001353504,0.001363854,0.0006527484,0.003329417,0.002178737,0.003138431,0.002179665,0.006499572],"category_scores_gemma":[0.02085341,0.0009223937,0.00105967,0.0009416963,0.002465697,0.00525531,0.005333432,0.002320329,0.001743675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001440121,"about_ca_system_score_gemma":0.001793642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002640005,"about_ca_topic_score_gemma":0.003617061,"domain_scores_codex":[0.9964842,0.0009078447,0.0002062926,0.001221765,0.0005384692,0.000641406],"domain_scores_gemma":[0.9819641,0.007132697,0.001753196,0.006802524,0.001443886,0.0009035899],"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.002038427,0.0003391536,0.01309516,0.001624149,0.0003810379,0.001997157,0.006405028,0.2808651,0.04526488,0.3238992,0.02668265,0.297408],"study_design_scores_gemma":[0.0001840011,0.0006146212,0.002752403,0.0001912497,0.0001948693,0.001411675,0.001303713,0.6478388,0.02427148,0.2608461,0.06030554,0.00008545243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1474614,0.0005210744,0.8219665,0.003511198,0.0001528255,0.0003044873,0.0004563186,0.002331206,0.02329505],"genre_scores_gemma":[0.7301435,0.0003503804,0.2522759,0.0006318966,0.000106549,0.0003286571,0.0006889958,0.0004468897,0.01502735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006499572,"threshold_uncertainty_score":0.02174318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01828212569785315,"score_gpt":0.2676465739180216,"score_spread":0.2493644482201685,"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."}}