{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004261892,0.001619558,0.001599448,0.005180042,0.002601912,0.005520666,0.004577263,0.002299292,0.01864403],"category_scores_gemma":[0.04721404,0.0008972842,0.001080491,0.003765306,0.003838051,0.01371464,0.00601144,0.005783226,0.004371054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004274603,"about_ca_system_score_gemma":0.001567912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001302569,"about_ca_topic_score_gemma":0.002520285,"domain_scores_codex":[0.9971538,0.0007196479,0.0001117877,0.0004668504,0.0009276955,0.0006203356],"domain_scores_gemma":[0.9713705,0.02108374,0.001361063,0.00265132,0.001760929,0.001772471],"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.0003468987,0.0001593007,0.001443826,0.0004378712,0.00005535414,0.0001376143,0.0004419147,0.01245538,0.002205409,0.9283506,0.02646543,0.02750059],"study_design_scores_gemma":[0.00002671795,0.00004451266,0.0009334045,0.0001727256,0.00004818965,0.0003235839,0.000137362,0.03554527,0.001300203,0.9518314,0.009592252,0.00004429872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1840616,0.02485744,0.3153675,0.0169053,0.001913061,0.0002040756,0.003016453,0.003218399,0.4504562],"genre_scores_gemma":[0.9156342,0.006384251,0.04792886,0.001880619,0.001580936,0.0004968566,0.001471183,0.0006223135,0.02400076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01864403,"threshold_uncertainty_score":0.06237054,"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."}}