{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001873661,0.0001583295,0.0002267087,0.00004609481,0.00008479282,0.00002778898,0.0001765578,0.00005195756,0.0001678008],"category_scores_gemma":[0.0004587214,0.0001254354,0.00006839485,0.00009454988,0.00002398553,0.00008192395,0.00008804975,0.0001386027,0.0003371027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007663964,"about_ca_system_score_gemma":0.00001323606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001469853,"about_ca_topic_score_gemma":0.000003834724,"domain_scores_codex":[0.9989781,0.00002626562,0.0003139343,0.0001825693,0.0002479166,0.0002511833],"domain_scores_gemma":[0.9988113,0.0005799088,0.0001075848,0.0003875394,0.00004072829,0.00007295118],"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.000004916553,0.0002073686,0.00001319453,0.00002590513,0.000009755334,0.000002512725,0.0003438387,0.000049156,0.0001925256,0.9794785,0.002123265,0.01754908],"study_design_scores_gemma":[0.00054234,0.0001089756,0.00002984857,0.00009209401,0.00001489522,0.000009496306,0.0001934285,0.006331138,0.009799209,0.9752454,0.007342512,0.000290712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4621142,0.00004913748,0.3004695,0.001979518,0.0009710439,0.0007365468,0.000004055934,0.001380084,0.2322958],"genre_scores_gemma":[0.7738371,0.000001715555,0.2234042,0.0002882422,0.0003463769,0.000003983133,5.602368e-7,0.00003476933,0.002082965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.311723,"threshold_uncertainty_score":0.5115106,"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."}}