{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001012028,0.001038888,0.001136783,0.002108614,0.0003402381,0.0009458281,0.005294994,0.0005436745,0.00004741091],"category_scores_gemma":[0.00007770766,0.001001271,0.0004106258,0.002098695,0.00116547,0.0009178241,0.00299906,0.001684014,0.00003882426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004629087,"about_ca_system_score_gemma":0.000508109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006908456,"about_ca_topic_score_gemma":0.0008348904,"domain_scores_codex":[0.9928449,0.0001102724,0.001108257,0.002940765,0.001645109,0.001350642],"domain_scores_gemma":[0.9958823,0.0005227014,0.000428335,0.002566186,0.0002520987,0.0003483937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008441216,0.0002175661,0.0003734958,0.0000992131,0.00002714785,0.001276175,0.00114486,0.002026128,0.0001374875,0.07627025,0.00003440324,0.9183849],"study_design_scores_gemma":[0.0004919682,0.0002216755,0.0002951829,0.0009018847,0.00001139112,0.0003183771,7.880508e-7,0.2813377,0.001233808,0.7110087,0.002748689,0.001429812],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002616557,0.001018697,0.9895966,0.0008847848,0.003931522,0.00051168,0.00001479873,0.0002588874,0.003521342],"genre_scores_gemma":[0.05866551,0.0001883207,0.9370964,0.002681776,0.0007273657,0.00004315315,0.00004454721,0.0001200475,0.0004328438],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.916955,"threshold_uncertainty_score":0.9992438,"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."}}