{"id":"W3211499386","doi":"","title":"Randomized Communication and the Implicit Graph Conjecture.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Conjecture; Constant (computer programming); Mathematics; Bipartite graph; Adjacency list; Cartesian product; Randomized algorithm; Graph; Bounded function; Discrete mathematics; Upper and lower bounds; Computer science","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.007968053,0.001522181,0.002150964,0.001162193,0.003593452,0.004715945,0.00497787,0.004963303,0.01520129],"category_scores_gemma":[0.07439101,0.001390089,0.002632996,0.002509399,0.006094162,0.02360318,0.005342417,0.008782977,0.002042459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005541633,"about_ca_system_score_gemma":0.003914158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002950194,"about_ca_topic_score_gemma":0.003526368,"domain_scores_codex":[0.9862223,0.005941484,0.0006028982,0.003201544,0.00249966,0.001532004],"domain_scores_gemma":[0.8530526,0.1184559,0.005452246,0.01845037,0.00249149,0.002097417],"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.001094976,0.0004503855,0.003072726,0.0007980517,0.0001686563,0.0002163068,0.0007668434,0.09269895,0.003860107,0.8225285,0.02201231,0.05233222],"study_design_scores_gemma":[0.0001583042,0.00009149728,0.0004636114,0.00006386109,0.00005139581,0.0001580964,0.0001469589,0.1567319,0.001382793,0.8352706,0.005441661,0.00003923636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1822218,0.004085681,0.7081748,0.04512277,0.000811891,0.000829605,0.003711896,0.002403066,0.05263837],"genre_scores_gemma":[0.8206027,0.001855217,0.154245,0.004150578,0.001240212,0.001695503,0.002844095,0.001011429,0.0123553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01520129,"threshold_uncertainty_score":0.05085343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05097654668574888,"score_gpt":0.2189111423400982,"score_spread":0.1679345956543493,"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."}}