{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002046656,0.0003896128,0.0003936771,0.0004285263,0.0003230728,0.0003180817,0.003161166,0.0003123794,0.00005169953],"category_scores_gemma":[0.00002393787,0.0004593802,0.0005167467,0.0006598968,0.000146699,0.0004783256,0.002262131,0.0004690514,0.00008822124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001054602,"about_ca_system_score_gemma":0.000139563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002699374,"about_ca_topic_score_gemma":0.00004344305,"domain_scores_codex":[0.997734,0.00007028724,0.0002286336,0.00133239,0.0001049303,0.0005297327],"domain_scores_gemma":[0.9974943,0.0001787428,0.0002323878,0.001651198,0.000224088,0.0002192815],"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.00001145461,0.0001099076,0.0003548867,0.0001044614,0.0001152304,0.00004426313,0.0002382237,0.006870989,0.00001560116,0.9854841,0.003696077,0.002954755],"study_design_scores_gemma":[0.000413584,0.00007046831,0.0004254246,0.00005554529,0.00004345767,0.000003727758,0.00004831507,0.347526,0.0001080344,0.645002,0.005737532,0.0005658684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1149032,0.00008838495,0.8801559,0.0001687084,0.001386516,0.0005935775,0.00003415662,0.0003680839,0.002301491],"genre_scores_gemma":[0.9732835,0.0001222514,0.02241837,0.000216762,0.0001753024,0.00001249567,0.00002943947,0.00002560507,0.003716324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8583803,"threshold_uncertainty_score":0.9997858,"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."}}