{"id":"W4317933801","doi":"10.1016/j.tcs.2023.113733","title":"Wait-free approximate agreement on graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; H2020 European Research Council; H2020 Marie Skłodowska-Curie Actions; Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Combinatorics; Mathematics; Longest path problem; Pathwidth; Maximal independent set; Discrete mathematics; Lemma (botany); Impossibility; Computer science; Graph; 1-planar graph; Line graph","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001991974,0.00023658,0.0002505987,0.0003197267,0.0005260922,0.0006256133,0.005329793,0.0000545487,0.00002547434],"category_scores_gemma":[0.00009130709,0.0001841134,0.00009981704,0.003359496,0.001370543,0.0004887468,0.001906494,0.0001991503,0.0009175637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005747458,"about_ca_system_score_gemma":0.00007679136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003393092,"about_ca_topic_score_gemma":3.655955e-7,"domain_scores_codex":[0.9963564,0.00009149265,0.0003422954,0.0009909235,0.001302012,0.0009168798],"domain_scores_gemma":[0.997193,0.0001670088,0.00007644259,0.002064518,0.0001563331,0.0003426544],"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.000004490264,0.00004964723,0.0000212654,0.00000921571,0.000003855503,0.00003512876,0.0002013031,0.0003395148,0.0001867296,0.972512,0.002281633,0.02435522],"study_design_scores_gemma":[0.0003368526,0.0002402794,0.001234947,0.00005583169,0.000001949975,0.00001626758,0.000007230689,0.6579536,0.001278246,0.3374949,0.001103101,0.0002768301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02569609,0.00001303215,0.9543314,0.002986433,0.00155087,0.0002824214,0.00001253528,0.0008254467,0.0143018],"genre_scores_gemma":[0.9777929,0.000005486549,0.02122401,0.0007791788,0.0001016061,0.00002395581,0.000002895352,0.000008804595,0.00006120802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9520968,"threshold_uncertainty_score":0.9998603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01361083066908813,"score_gpt":0.2486185129397474,"score_spread":0.2350076822706593,"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."}}