{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002222098,0.0008566884,0.0008182789,0.00144324,0.001171936,0.00188481,0.001917616,0.001140545,0.01926525],"category_scores_gemma":[0.007876341,0.0004683754,0.001026526,0.001453169,0.004067715,0.01166397,0.004802803,0.005020993,0.001756475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001794794,"about_ca_system_score_gemma":0.000985112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001314259,"about_ca_topic_score_gemma":0.001042097,"domain_scores_codex":[0.9986147,0.000347112,0.00006021775,0.0004029545,0.0003897489,0.0001852737],"domain_scores_gemma":[0.9934872,0.004140724,0.0003597206,0.0008443963,0.000747981,0.0004199316],"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.00003051034,0.00002743289,0.0002321066,0.00008161123,0.000009689247,0.00006006929,0.0001719525,0.0008184482,0.001559114,0.9868117,0.003378067,0.006819277],"study_design_scores_gemma":[0.00002997671,0.00008685744,0.000623011,0.00003428099,0.00002323873,0.0002786663,0.00009154372,0.01101046,0.002872531,0.9586256,0.02628687,0.00003676966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0737733,0.004205092,0.6530944,0.01972811,0.0009682066,0.0001010237,0.001088664,0.0009854082,0.2460558],"genre_scores_gemma":[0.8226587,0.003046231,0.1215167,0.006272044,0.001893432,0.0003922701,0.0004770857,0.0003733499,0.04337011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01926525,"threshold_uncertainty_score":0.06444871,"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."}}