{"id":"W4405231961","doi":"10.1017/s0963548324000415","title":"Tight bound for the Erdős–Pósa property of tree minors","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; University of Ottawa","keywords":"Combinatorics; Mathematics; Disjoint sets; Upper and lower bounds; Minor (academic); Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics; Integer (computer science); Pairwise comparison; Computer science; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.002799839,0.0002284693,0.0003013884,0.0001412528,0.0004413193,0.0003021309,0.002117881,0.00008657003,0.000003601086],"category_scores_gemma":[0.00069111,0.000134934,0.0002303525,0.001514254,0.0003607282,0.0003705582,0.0009379998,0.0003911364,0.000009510112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001924125,"about_ca_system_score_gemma":0.0002948247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001516413,"about_ca_topic_score_gemma":0.000005281884,"domain_scores_codex":[0.997429,0.0002121243,0.0005165519,0.0007488333,0.000524621,0.0005688314],"domain_scores_gemma":[0.9953952,0.002706305,0.0001111626,0.001245386,0.000436475,0.0001055008],"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.00001306522,0.0001419096,0.0005340612,0.0005045357,0.00004817551,0.000003820995,0.001044633,0.0003064451,0.0003230376,0.896683,0.0003613777,0.1000359],"study_design_scores_gemma":[0.0002301604,0.0001677273,0.0003741757,0.00007852906,0.00001163367,0.000007943224,0.00002776828,0.3026074,0.002326589,0.6877053,0.006290491,0.0001722699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05059786,0.002469235,0.9387618,0.001959356,0.001966264,0.001888948,0.000005335349,0.0004525721,0.001898687],"genre_scores_gemma":[0.9823351,0.00001077869,0.01707389,0.000035137,0.00007008469,0.00005178588,0.000001719068,0.00002455212,0.0003969827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9317372,"threshold_uncertainty_score":0.5502449,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04345359317651996,"score_gpt":0.3042557150052427,"score_spread":0.2608021218287227,"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."}}