{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001824786,0.001385525,0.001504668,0.001552688,0.001010463,0.003526065,0.003356955,0.001948815,0.007489313],"category_scores_gemma":[0.01753215,0.001007934,0.001451929,0.002233142,0.001845739,0.006618007,0.00379037,0.004739425,0.0009404172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002716122,"about_ca_system_score_gemma":0.001693595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002557949,"about_ca_topic_score_gemma":0.004591237,"domain_scores_codex":[0.9988079,0.0003236995,0.00005005298,0.0002903528,0.0003270448,0.0002009137],"domain_scores_gemma":[0.9892628,0.008984467,0.0004379721,0.0006787939,0.0003739463,0.0002620736],"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.0006035948,0.0003959094,0.001631234,0.0005536925,0.0001010122,0.0001715561,0.0007862052,0.4088746,0.00323931,0.4446771,0.009411941,0.1295537],"study_design_scores_gemma":[0.00004418344,0.00003444937,0.0001437036,0.00005015826,0.00004442081,0.00006090916,0.00009134955,0.6111422,0.001093504,0.3856282,0.001657212,0.000009745699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1237381,0.000810176,0.8508767,0.00142217,0.0001182619,0.000151904,0.0002884682,0.001047773,0.02154645],"genre_scores_gemma":[0.5521841,0.0009872649,0.4307545,0.0004354013,0.000177496,0.0003199338,0.0005635205,0.0007500301,0.0138278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007489313,"threshold_uncertainty_score":0.02505428,"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."}}