{"id":"W3160226286","doi":"10.1007/978-3-030-73879-2_23","title":"Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Disjoint sets; Cardinality (data modeling); Bounded function; Mathematics; Combinatorics; Constant (computer programming); Discrete mathematics; Tree (set theory); Routing (electronic design automation); Computer science","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.001294111,0.001628191,0.001530919,0.001387179,0.0009863169,0.00312258,0.003562584,0.001948629,0.009601201],"category_scores_gemma":[0.01100254,0.001020552,0.001555437,0.002600468,0.001573448,0.006106298,0.004217408,0.005045232,0.001654187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002515885,"about_ca_system_score_gemma":0.001420988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002167815,"about_ca_topic_score_gemma":0.003912168,"domain_scores_codex":[0.998921,0.0002297596,0.0000489261,0.0002761349,0.0003402826,0.0001838483],"domain_scores_gemma":[0.9942033,0.004448678,0.0002270083,0.0006530943,0.0002690497,0.0001989526],"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.0009384761,0.0005099973,0.001130904,0.0009294879,0.000120457,0.0002106302,0.001005342,0.2814304,0.008030201,0.3587987,0.01816697,0.3287283],"study_design_scores_gemma":[0.00009595681,0.00007966404,0.0002323749,0.0001099778,0.00008363293,0.0001388011,0.0001657073,0.5414048,0.00312813,0.4488057,0.005737589,0.00001766617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1036294,0.001313123,0.8506771,0.001270446,0.0002222089,0.0002151815,0.0004055373,0.00225751,0.04000958],"genre_scores_gemma":[0.3655336,0.001403919,0.6086577,0.0004296333,0.0002306291,0.0003611226,0.0008712737,0.001324323,0.0211878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009601201,"threshold_uncertainty_score":0.03211921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01677384621943322,"score_gpt":0.2219259976952959,"score_spread":0.2051521514758627,"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."}}