{"id":"W124355607","doi":"","title":"Computing Disjoint Paths on Polytopes","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Polytope; Disjoint sets; Mathematics; Digraph; Vertex (graph theory); Degeneracy (biology); Convex polytope; Time complexity; Path (computing); Discrete mathematics; Graph; Regular polygon; Computer science; Convex set","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252959,0.001494218,0.002034127,0.00287646,0.001759574,0.004085925,0.002104347,0.002164135,0.01109603],"category_scores_gemma":[0.009334286,0.001882619,0.002401274,0.003385088,0.002590348,0.009877164,0.005900221,0.002534027,0.001213731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002225668,"about_ca_system_score_gemma":0.001310245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004029749,"about_ca_topic_score_gemma":0.00680329,"domain_scores_codex":[0.9971672,0.000417182,0.0002109276,0.001025114,0.00066061,0.0005190394],"domain_scores_gemma":[0.9930719,0.004690675,0.0005320426,0.000905972,0.0004302654,0.0003691898],"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.001358615,0.00062074,0.01016796,0.001854582,0.0004439994,0.001105057,0.001906023,0.3856737,0.01535155,0.3923161,0.01068655,0.1785153],"study_design_scores_gemma":[0.0001964506,0.0001453821,0.0009498378,0.000116622,0.0001089607,0.0001951783,0.0004698738,0.3189076,0.006054436,0.6661193,0.00668946,0.0000468993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5124801,0.001037549,0.4621504,0.001317658,0.0001483886,0.0004884523,0.004752276,0.002854023,0.01477112],"genre_scores_gemma":[0.6667708,0.0005787342,0.3189731,0.0002408151,0.00008821776,0.000255951,0.006580687,0.0005037157,0.006007974],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01109603,"threshold_uncertainty_score":0.03711993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04494770261357156,"score_gpt":0.3367892288829932,"score_spread":0.2918415262694216,"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."}}