{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008154062,0.001143493,0.003101263,0.00157947,0.004841215,0.005659546,0.005997446,0.008398717,0.01666111],"category_scores_gemma":[0.0855145,0.001447576,0.002243729,0.00333192,0.0113349,0.02426214,0.008999481,0.01200392,0.002045022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003463664,"about_ca_system_score_gemma":0.003276679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002427786,"about_ca_topic_score_gemma":0.001829485,"domain_scores_codex":[0.9872367,0.005367597,0.0003779617,0.002766864,0.002842339,0.001408331],"domain_scores_gemma":[0.8720502,0.1000027,0.003213078,0.01938128,0.003354875,0.001997983],"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.000178631,0.00006504924,0.0003556382,0.0001355982,0.00003017438,0.00008370166,0.0002366681,0.01011802,0.0004177574,0.9697331,0.01240546,0.006240277],"study_design_scores_gemma":[0.00008199614,0.00001173552,0.00009962807,0.00001751189,0.00001188253,0.00005943024,0.00003361003,0.02612687,0.000279497,0.9710966,0.002165212,0.00001618494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1500906,0.002699331,0.585812,0.1299593,0.0019702,0.0003652954,0.002667073,0.003157117,0.1232791],"genre_scores_gemma":[0.9252267,0.001306706,0.0488224,0.008017691,0.002091476,0.0006072169,0.0008132677,0.0008185511,0.01229594],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01666111,"threshold_uncertainty_score":0.05573696,"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."}}