{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156445,0.002107824,0.002876995,0.002276751,0.001698669,0.003317737,0.002910534,0.002824359,0.01865266],"category_scores_gemma":[0.009826774,0.002007357,0.002484788,0.003761086,0.001744796,0.008858945,0.00419208,0.003282981,0.001462469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001998792,"about_ca_system_score_gemma":0.00155084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005240497,"about_ca_topic_score_gemma":0.01270018,"domain_scores_codex":[0.9984157,0.0003520229,0.00008646518,0.0005334481,0.0003286422,0.0002837638],"domain_scores_gemma":[0.9928495,0.005440923,0.0003579219,0.0005560424,0.0003784182,0.0004172608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001629397,0.0009972343,0.006584678,0.001776978,0.0003997174,0.00051917,0.0007517565,0.5925155,0.009283179,0.1064264,0.02053373,0.2585823],"study_design_scores_gemma":[0.0002300729,0.0002735899,0.0009069326,0.0001129231,0.00009727081,0.000157763,0.0004895725,0.7228134,0.002804204,0.26804,0.004042338,0.00003199045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5537844,0.001317265,0.414411,0.002106325,0.0002238076,0.0007427228,0.004573226,0.002991804,0.01984947],"genre_scores_gemma":[0.5321891,0.0007042318,0.4507408,0.0003879839,0.0001238397,0.0003308913,0.006746495,0.0008414497,0.007935199],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01865266,"threshold_uncertainty_score":0.06239945,"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."}}