{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005830251,0.0002327949,0.00026331,0.00008689093,0.0003611245,0.00005164263,0.0003792018,0.0001257251,0.00007766712],"category_scores_gemma":[0.0006663658,0.0001341878,0.00009386097,0.0002349834,0.0002744748,0.00007939369,0.0000670187,0.0002709221,0.00001005741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004151612,"about_ca_system_score_gemma":0.00003464112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779808,"about_ca_topic_score_gemma":0.0000380739,"domain_scores_codex":[0.998726,0.0001105754,0.0002465821,0.0002969513,0.000249289,0.0003706339],"domain_scores_gemma":[0.9977828,0.001316267,0.0001321728,0.000581265,0.0001277322,0.00005982329],"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.0001682272,0.00006735558,0.001371816,0.00004386749,0.00005149572,0.000005506377,0.00180295,0.000001131966,0.00005989221,0.9909812,0.005306724,0.0001398246],"study_design_scores_gemma":[0.00134451,0.0005806446,0.0009677086,0.0001292317,0.00003795544,0.000004103779,0.0002237013,0.000130056,0.0008969346,0.9946768,0.0007941964,0.0002141634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9927383,0.00003327863,0.00005336824,0.0002768763,0.001459995,0.0006991118,0.000007811555,0.0000621591,0.004669081],"genre_scores_gemma":[0.9983495,0.00000382813,0.0007212184,0.0006796593,0.00002863809,0.00006636813,0.000002079706,0.0000442384,0.0001044841],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005611168,"threshold_uncertainty_score":0.547202,"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."}}