{"id":"W3028209208","doi":"10.1007/s10107-020-01513-1","title":"Maximum edge-disjoint paths in planar graphs with congestion 2","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia; Cegep Edouard Montpetit","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Constant (computer programming); Discrete mathematics; Omega; Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Path (computing); Graph; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0004570988,0.0001775146,0.0002655085,0.000118722,0.0000775386,0.0001629487,0.0006358014,0.00006044522,0.00001894161],"category_scores_gemma":[0.0002549896,0.0001368194,0.00005450002,0.000939743,0.0001581033,0.000360748,0.0001649148,0.0003450879,0.0001153303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003173836,"about_ca_system_score_gemma":0.00003419093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002168996,"about_ca_topic_score_gemma":0.000003825936,"domain_scores_codex":[0.9981723,0.0001019804,0.0002971575,0.0004625698,0.0004498143,0.000516196],"domain_scores_gemma":[0.9990202,0.0002235914,0.00006434351,0.0003763285,0.00005415705,0.0002613474],"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.00005895135,0.000220233,0.0007917375,0.0002587792,0.00001771494,0.0002938472,0.002328468,0.00007397134,0.0003262094,0.775732,0.00003164511,0.2198665],"study_design_scores_gemma":[0.001093043,0.000830141,0.0003802928,0.0002546994,0.000009523955,0.00007872465,0.000477184,0.06301403,0.0007908098,0.9310123,0.001551198,0.0005080138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01847664,0.00006674868,0.9772338,0.002304257,0.00002302929,0.0006107511,7.977387e-7,0.0003325068,0.0009514311],"genre_scores_gemma":[0.6133837,0.00000263228,0.3862287,0.0002088166,0.00002166879,0.0001131934,0.000002202823,0.00002215358,0.00001687733],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5949071,"threshold_uncertainty_score":0.5579333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03352946441831534,"score_gpt":0.2769085679406327,"score_spread":0.2433791035223174,"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."}}