{"id":"W2115589427","doi":"10.1016/j.jctb.2011.07.004","title":"The disjoint paths problem in quadratic time","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"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.004588527,0.000156564,0.0002957657,0.0001712384,0.0002129462,0.0001430023,0.001843815,0.00006248014,0.00004689876],"category_scores_gemma":[0.0005065114,0.00009840664,0.0001345395,0.000539051,0.0003014266,0.001350912,0.0003035661,0.0004994656,0.00003043933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007867871,"about_ca_system_score_gemma":0.000192281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001839601,"about_ca_topic_score_gemma":0.000001505776,"domain_scores_codex":[0.997382,0.0009029455,0.0006502079,0.0001602164,0.000515205,0.0003894156],"domain_scores_gemma":[0.9979442,0.000704257,0.0004088959,0.0005218076,0.0002872405,0.000133614],"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.0006246002,0.0001187953,0.00008569042,0.000006017131,0.00002578567,0.00008620477,0.002006743,0.000006264797,0.0004680037,0.9901106,0.0001007641,0.006360515],"study_design_scores_gemma":[0.0006763188,0.0008073314,0.0002641143,0.00004455778,0.00000420122,0.0001019173,0.0002397059,0.00006841685,0.002375111,0.9928981,0.002399557,0.0001206792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.506521,0.006730231,0.3023675,0.006385008,0.04040901,0.003920821,0.000009920644,0.0005407917,0.1331157],"genre_scores_gemma":[0.9852391,0.0001415446,0.01324956,0.00005524397,0.0002712675,0.00001633171,1.841457e-7,0.00002725031,0.0009994494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4787182,"threshold_uncertainty_score":0.4012906,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01470044315439314,"score_gpt":0.2461503881490396,"score_spread":0.2314499449946465,"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."}}