{"id":"W4297907868","doi":"10.48550/arxiv.1305.1451","title":"Explicit bounds for graph minors","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Sigma; Mathematics; Disjoint sets; Vertex (graph theory); Graph; Homeomorphism (graph theory); Discrete mathematics; Path (computing); Physics; Computer science; Quantum mechanics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.002937932,0.002052803,0.001710159,0.002127214,0.002607428,0.006408501,0.005487466,0.002780377,0.01440656],"category_scores_gemma":[0.03304452,0.001357933,0.002190447,0.00272127,0.004514237,0.01900704,0.007536569,0.005955847,0.002818549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004736749,"about_ca_system_score_gemma":0.001994499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001482564,"about_ca_topic_score_gemma":0.002955141,"domain_scores_codex":[0.9942219,0.001013516,0.0003161891,0.001871648,0.001451044,0.001125652],"domain_scores_gemma":[0.9713739,0.01704057,0.001732747,0.007225868,0.001435851,0.001191036],"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.0008356297,0.0004162187,0.008254196,0.001168384,0.0001502271,0.0003592174,0.002508977,0.0619224,0.01591887,0.798365,0.01354214,0.09655887],"study_design_scores_gemma":[0.0001211413,0.0001775813,0.001987406,0.000167688,0.0002182145,0.0005699942,0.0004839278,0.1957529,0.0157735,0.7631081,0.02153332,0.0001063391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.3429719,0.001837193,0.5877283,0.005569542,0.0003088443,0.0003553332,0.001707997,0.005180474,0.05434043],"genre_scores_gemma":[0.8018032,0.000849002,0.1802851,0.0006185737,0.0002308947,0.0004865271,0.001745088,0.001789489,0.01219207],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01440656,"threshold_uncertainty_score":0.04819477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1054478203215825,"score_gpt":0.1936928289527236,"score_spread":0.088245008631141,"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."}}