{"id":"W2035099047","doi":"10.1109/focs.2011.30","title":"Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Royal Military College Saint-Jean","funders":"","keywords":"Disjoint sets; Logarithm; Computer science; Linear programming relaxation; Constant (computer programming); Network congestion; Approximation algorithm; Combinatorics; Steiner tree problem; Cluster analysis; Mathematics; Discrete mathematics; Linear programming; Algorithm; Computer network; Network packet","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":[],"consensus_categories":[],"category_scores_codex":[0.0003335047,0.0001136238,0.0001193733,0.0002686059,0.00004904363,0.00003235285,0.0006120498,0.00004206492,0.0000665529],"category_scores_gemma":[0.00002019209,0.00008374104,0.00002551559,0.000640037,0.0001130538,0.0004937019,0.0001009778,0.0001740371,0.00008316525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002509044,"about_ca_system_score_gemma":0.00004005228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008812957,"about_ca_topic_score_gemma":0.000219674,"domain_scores_codex":[0.9988387,0.00008368703,0.0001420138,0.0003555217,0.0002379874,0.0003420834],"domain_scores_gemma":[0.9992236,0.00005423399,0.00003500515,0.0005194932,0.00006151999,0.0001061775],"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.00008329297,0.0001234933,0.01722362,0.000008963344,0.000008984605,0.0001703864,0.00102011,0.00001849797,0.0003686056,0.9502702,0.0001211786,0.03058264],"study_design_scores_gemma":[0.0009979623,0.0006440255,0.07971098,0.00004721304,0.000002410549,0.000070234,0.0002249724,0.003284378,0.005540104,0.9086787,0.000411095,0.0003879877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1073616,0.00007418959,0.850624,0.0002443522,0.0001331103,0.0003749683,0.000001590128,0.0002958225,0.04089035],"genre_scores_gemma":[0.8995988,0.00001378973,0.09988927,0.0001335704,0.000007015051,0.00003328749,0.000001271385,0.00001032788,0.0003126823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7922372,"threshold_uncertainty_score":0.341486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03368651481046178,"score_gpt":0.2538789957105406,"score_spread":0.2201924809000788,"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."}}