{"id":"W2062486876","doi":"10.1017/s096354831400056x","title":"An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Monochromatic color; Graph; Linearity; Integer (computer science); Discrete mathematics; Upper and lower bounds; Computer science; Physics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002279648,0.0001815235,0.0004657629,0.00001754804,0.0002202598,0.000009895136,0.001151207,0.00012296,0.000008657107],"category_scores_gemma":[0.004142177,0.0001051743,0.0002527634,0.0004025024,0.0005711693,0.00005371336,0.0007446563,0.0003710541,1.017875e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004836243,"about_ca_system_score_gemma":0.00006733276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003871381,"about_ca_topic_score_gemma":0.0000040562,"domain_scores_codex":[0.9974286,0.0008341742,0.0007557051,0.0002709005,0.0005022931,0.0002083289],"domain_scores_gemma":[0.9952974,0.001747438,0.0009348403,0.001379138,0.0005978529,0.00004335686],"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.00001395555,0.0005061454,0.09961752,0.0005843995,0.00003789696,6.94603e-8,0.003402797,0.0001996033,0.0001971534,0.8940825,0.00001134919,0.001346581],"study_design_scores_gemma":[0.0003595606,0.00007626237,0.01667482,0.0001261337,0.00003648491,0.000002480714,0.00006506275,0.007414504,0.02876616,0.9463587,0.0000148023,0.0001050368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.994812,0.00001233396,0.001866738,0.00004366006,0.0008974982,0.0006058029,0.000009266389,0.00002159336,0.001731139],"genre_scores_gemma":[0.9966392,3.991761e-7,0.003260014,0.0000205119,0.00004464575,0.000002556098,3.409207e-7,0.00001748254,0.00001487405],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0829427,"threshold_uncertainty_score":0.4958872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02437239546565568,"score_gpt":0.296762292521978,"score_spread":0.2723898970563223,"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."}}