{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004021193,0.001811707,0.003213329,0.002302045,0.003229123,0.006295982,0.004265562,0.002416887,0.0170685],"category_scores_gemma":[0.03077605,0.001843114,0.00294565,0.00265286,0.00372846,0.01610162,0.005918266,0.006590003,0.003347907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002565986,"about_ca_system_score_gemma":0.001317877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001280205,"about_ca_topic_score_gemma":0.001148004,"domain_scores_codex":[0.9962231,0.0007570723,0.0002086525,0.001177887,0.0008541963,0.0007790225],"domain_scores_gemma":[0.9642817,0.0233837,0.002256638,0.004809144,0.002207784,0.003061012],"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.002559994,0.0006520219,0.008878295,0.001380695,0.0003642952,0.001340595,0.001899105,0.05340027,0.04469012,0.7884045,0.04075258,0.05567755],"study_design_scores_gemma":[0.0002247177,0.000333038,0.002218153,0.0001900883,0.000273842,0.001745347,0.0004062685,0.1862353,0.01068081,0.7790874,0.01846743,0.0001375564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3945881,0.00554057,0.5155463,0.0108946,0.0009086442,0.0004842843,0.004159653,0.003076914,0.06480102],"genre_scores_gemma":[0.9051137,0.002527488,0.07613949,0.001430191,0.001174995,0.0004582164,0.002134355,0.001065745,0.009955898],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0170685,"threshold_uncertainty_score":0.05709982,"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."}}