{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004251547,0.0001894537,0.0001502142,0.0001224261,0.0001858013,0.000209184,0.0006936507,0.00006827224,0.00006986094],"category_scores_gemma":[0.00001741883,0.0001601772,0.00009001925,0.000352597,0.00004213738,0.0008707475,0.0002265847,0.0001863779,0.0004970516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004660123,"about_ca_system_score_gemma":0.00002942625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001055365,"about_ca_topic_score_gemma":7.418863e-7,"domain_scores_codex":[0.9983156,0.00009842888,0.0002138877,0.0003323712,0.0004023577,0.0006373072],"domain_scores_gemma":[0.9988844,0.00005532175,0.00006488777,0.0006084582,0.0000501917,0.0003366782],"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.00007972529,0.001654241,0.005764138,0.0001948627,0.0003499952,0.00007382613,0.02530325,0.02924728,0.04413137,0.670208,0.00926118,0.2137321],"study_design_scores_gemma":[0.002271391,0.000903554,0.005104564,0.0001728472,0.00002657181,0.0000860542,0.0002174575,0.801528,0.02243518,0.002581316,0.1627318,0.001941257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002897792,0.0002882412,0.9321342,0.003466149,0.001159669,0.0003735338,0.000006415185,0.0005371552,0.05913684],"genre_scores_gemma":[0.6709684,0.0002987124,0.3176371,0.00266212,0.0008876772,0.0001228779,0.00002122479,0.0000865507,0.007315294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7722808,"threshold_uncertainty_score":0.6531836,"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."}}