{"id":"W2396539498","doi":"","title":"Asymptotic upper bounds for K 1, m, k complete graph Ramsey Numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Graph; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003190043,0.00027943,0.0003964604,0.0001060753,0.0004666494,0.0001209159,0.0004561204,0.0001742378,0.0004376365],"category_scores_gemma":[0.0002842189,0.0002367613,0.0002721618,0.0001978368,0.0001842661,0.0002015437,0.0001369875,0.0002085976,0.00007930868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004449257,"about_ca_system_score_gemma":0.00002491354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003774882,"about_ca_topic_score_gemma":0.000003131119,"domain_scores_codex":[0.9983945,0.00008186624,0.0003912421,0.0003406664,0.0002747627,0.0005169019],"domain_scores_gemma":[0.9980789,0.0007573173,0.0001509513,0.0006545013,0.0002035394,0.0001547839],"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.0000139392,0.00007727805,0.001879622,0.00007425507,0.0001022169,0.000001154272,0.0004837557,3.633285e-7,0.0001375078,0.9579589,0.03893068,0.0003403132],"study_design_scores_gemma":[0.001259778,0.0001126135,0.002219668,0.0000282813,0.00005932291,0.000009805982,0.0001174479,0.0001053028,0.000182501,0.988961,0.006623459,0.0003208173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9822845,0.00009969656,0.0002757435,0.0003250859,0.003778701,0.001018338,0.00002174869,0.0002138698,0.01198227],"genre_scores_gemma":[0.993295,0.000008360003,0.005023559,0.0004142348,0.00003706151,0.0001694522,0.0000150398,0.00006864683,0.000968627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03230722,"threshold_uncertainty_score":0.9654846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02442332463205251,"score_gpt":0.2725156611201017,"score_spread":0.2480923364880492,"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."}}