{"id":"W2016667694","doi":"10.1007/s004930200014","title":"Ramsey Numbers for Trees of Small Maximum Degree","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Degree (music); Ramsey's theorem; Vertex (graph theory); Graph; Upper and lower bounds; Complete bipartite graph; Tree (set theory); Discrete mathematics","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.002340275,0.0005305454,0.001136796,0.003854741,0.002547058,0.004813596,0.001479483,0.001529922,0.006509124],"category_scores_gemma":[0.0131321,0.0008430323,0.000612936,0.002503698,0.004027597,0.01220062,0.002309205,0.003563518,0.0006464793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002131519,"about_ca_system_score_gemma":0.0007668673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007211163,"about_ca_topic_score_gemma":0.001299126,"domain_scores_codex":[0.9992293,0.0002468163,0.00004559177,0.000177501,0.0001797177,0.0001210189],"domain_scores_gemma":[0.9891394,0.008273629,0.000878954,0.0004688367,0.0004147142,0.000824526],"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.00003937782,0.00001664959,0.0002587579,0.00005059839,0.000004328432,0.0000240676,0.0002968406,0.0009505855,0.0003850716,0.993543,0.001185005,0.003245691],"study_design_scores_gemma":[0.000009003977,0.000006518793,0.0001952474,0.00001657829,0.000007870758,0.00006311561,0.00007651132,0.003343272,0.0001972302,0.9945461,0.001528955,0.000009759093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6687508,0.006584154,0.1800903,0.008512049,0.0004660596,0.0001038359,0.0006899511,0.0006440713,0.1341587],"genre_scores_gemma":[0.9577808,0.002399005,0.02578915,0.0006557163,0.000476739,0.0002417989,0.0002799284,0.0001240028,0.01225295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006509124,"threshold_uncertainty_score":0.02177519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1102685928597671,"score_gpt":0.2864809694619955,"score_spread":0.1762123766022284,"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."}}