{"id":"W2034408278","doi":"10.1007/s10878-008-9151-3","title":"Computing monotone disjoint paths on polytopes","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Polytope; Digraph; Combinatorics; Disjoint sets; Mathematics; Monotone polygon; Vertex (graph theory); Polyhedron; Discrete mathematics; Cardinality (data modeling); Submodular set function; Time complexity; Degeneracy (biology); Convex polytope; Regular polygon; Graph; Computer science; Convex set; Convex optimization","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.0006166931,0.0001298448,0.0002616892,0.0003053512,0.0002382223,0.00007502234,0.000686359,0.00006310232,0.000009619931],"category_scores_gemma":[0.000313465,0.0001118916,0.0001167337,0.000562472,0.00006647621,0.0007676795,0.000130537,0.0003172548,0.000007317194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022985,"about_ca_system_score_gemma":0.0001363695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001377003,"about_ca_topic_score_gemma":2.155593e-8,"domain_scores_codex":[0.9982192,0.0001954631,0.0004926187,0.0001683302,0.0006917095,0.0002326854],"domain_scores_gemma":[0.9983836,0.0002335783,0.0004627686,0.0002840394,0.0004925589,0.0001434472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001799981,0.0003336844,0.0003329546,0.00000598902,0.00003171669,0.0001395714,0.0005990589,0.7661259,0.0003308215,0.2267188,0.0003632673,0.004838241],"study_design_scores_gemma":[0.005311951,0.00280663,0.001443429,0.0001688059,0.00001515078,0.0005615011,0.00006105692,0.8986103,0.009255153,0.08033807,0.000916405,0.0005115244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02450704,0.00007695166,0.971706,0.0003561499,0.002540525,0.0001180732,4.328996e-7,0.00004143739,0.0006534178],"genre_scores_gemma":[0.8456479,0.0000988763,0.1537551,0.00008086668,0.0003736723,8.485318e-7,7.749786e-7,0.00001379137,0.00002813941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8211409,"threshold_uncertainty_score":0.4562808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01828959481610301,"score_gpt":0.272463716427228,"score_spread":0.254174121611125,"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."}}