{"id":"W3045332431","doi":"10.1007/s10107-022-01780-0","title":"Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","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":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Disjoint sets; Combinatorics; Cardinality (data modeling); Bounded function; Constant (computer programming); Discrete mathematics; Routing (electronic design automation); Tree (set theory)","routes":{"ca_aff":true,"ca_fund":true,"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.0008664282,0.0003031272,0.0004314475,0.000367935,0.0004012054,0.0002673351,0.00145035,0.000062945,0.0001162348],"category_scores_gemma":[0.00006201916,0.0002866318,0.000229213,0.001284892,0.0001469206,0.0003294692,0.001306928,0.0005588736,0.00004487735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001314444,"about_ca_system_score_gemma":0.00003072276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001684281,"about_ca_topic_score_gemma":0.00001577745,"domain_scores_codex":[0.9969298,0.0001864837,0.0006532926,0.0006757283,0.0007815243,0.0007731728],"domain_scores_gemma":[0.9985968,0.0002219183,0.0001515643,0.0008106835,0.00002973894,0.0001892842],"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.00001045987,0.001701447,0.0006086294,0.0001713575,0.00003133166,0.0003015897,0.002810333,0.00002910867,0.00008182845,0.4406905,0.0001189198,0.5534445],"study_design_scores_gemma":[0.000476125,0.0002693836,0.00009277869,0.00006273074,0.00001145486,0.0002091016,0.0003278384,0.1176488,0.0001742565,0.8709057,0.009315182,0.0005066249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01681942,0.0001355427,0.9782333,0.0008705757,0.0004462895,0.000718041,0.000004937045,0.0005361818,0.002235752],"genre_scores_gemma":[0.4606234,0.00000224097,0.5384268,0.0002572504,0.00005528844,0.0004775377,0.00001242717,0.00004261806,0.0001023921],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5529379,"threshold_uncertainty_score":0.9999586,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02104034210721657,"score_gpt":0.233712265783995,"score_spread":0.2126719236767785,"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."}}