{"id":"W2919026095","doi":"","title":"On the Erdos-Sos Conjecture for spiders in graphs having no path with 2k+1 vertices.","year":2018,"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; Conjecture; Combinatorics; Path (computing); Computer science; Computer network","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.003016922,0.0006831983,0.001759453,0.002590467,0.003703297,0.00481365,0.001860821,0.003008824,0.01021041],"category_scores_gemma":[0.01770075,0.000772409,0.001259355,0.002617191,0.006517657,0.0157958,0.005130897,0.004175561,0.002114238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001998631,"about_ca_system_score_gemma":0.001170502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002249074,"about_ca_topic_score_gemma":0.001845256,"domain_scores_codex":[0.9984262,0.0004041462,0.000109416,0.0003417736,0.0003506443,0.0003679225],"domain_scores_gemma":[0.9873876,0.008212005,0.001059444,0.001324901,0.0009515233,0.001064481],"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.0001224385,0.00005019974,0.001123629,0.0001213097,0.00001466591,0.0001251237,0.0003940892,0.002663481,0.0003365599,0.9841222,0.005096543,0.005829718],"study_design_scores_gemma":[0.00001777965,0.000008273166,0.0001879429,0.00002697801,0.000006436859,0.00008228869,0.0001573614,0.003575312,0.00008725502,0.9940975,0.001742104,0.00001084698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6002835,0.006225819,0.1095889,0.02523416,0.001272559,0.0001432209,0.001898389,0.0007223829,0.2546311],"genre_scores_gemma":[0.9628739,0.00332779,0.0132741,0.001360976,0.0008786647,0.0001464824,0.001280054,0.0001684212,0.01668963],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01021041,"threshold_uncertainty_score":0.03415728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01852102284121044,"score_gpt":0.2659698895284222,"score_spread":0.2474488666872118,"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."}}