{"id":"W3217052763","doi":"10.1016/j.dam.2022.07.023","title":"A counter-example to the probabilistic universal graph conjecture via randomized communication complexity","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Sleep Foundation; National Science Foundation","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics; Bounded function; Probabilistic logic; Randomized algorithm; Graph; Regular graph; Graph power; 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":[],"consensus_categories":[],"category_scores_codex":[0.001520701,0.0002438327,0.000496775,0.0001206951,0.001154212,0.0001990157,0.002705313,0.00003563374,0.0001291007],"category_scores_gemma":[0.00004820319,0.0001818694,0.0001920298,0.0008380451,0.0003929048,0.00009870256,0.001793706,0.0004109658,0.00002868542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009343415,"about_ca_system_score_gemma":0.0000543102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001516261,"about_ca_topic_score_gemma":0.00007301435,"domain_scores_codex":[0.997977,0.0002556722,0.0004430253,0.0003893581,0.0006030775,0.0003318631],"domain_scores_gemma":[0.9970039,0.0009260742,0.0001834272,0.001726952,0.00006220374,0.00009746027],"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.0002322534,0.0001122137,4.172005e-7,0.00003446303,0.00005357242,0.000001677997,0.008321955,0.002541887,0.000059799,0.987151,0.0008764834,0.0006143237],"study_design_scores_gemma":[0.006943023,0.00004580784,0.000006886454,0.00001200947,0.00004412444,0.00002664836,0.0009919397,0.2230562,0.00003690333,0.7629591,0.005605516,0.0002718827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003115828,0.0000618524,0.985971,0.002942696,0.0001547205,0.002039011,0.00004616645,0.0002506286,0.00541805],"genre_scores_gemma":[0.7065393,0.000008769975,0.2912214,0.00115619,0.00003669152,0.0008535975,0.00007439734,0.00002981385,0.00007980134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7034235,"threshold_uncertainty_score":0.8877382,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02575564518320266,"score_gpt":0.2395518102705439,"score_spread":0.2137961650873413,"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."}}