{"id":"W2132147722","doi":"10.1007/s10107-015-0944-8","title":"Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Parametric statistics; Rank (graph theory); Maximum cut; Polynomial; Time complexity; Pareto principle; Graph; Discrete mathematics; Mathematical optimization; Mathematical analysis","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.0006116635,0.0002056659,0.0003272261,0.0002227857,0.00012603,0.0003831527,0.0003235994,0.0000973924,7.644548e-7],"category_scores_gemma":[0.0003991835,0.0001879147,0.00007686193,0.0009086039,0.0002648531,0.0003419316,0.0002764362,0.0001391531,0.000002150043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005518801,"about_ca_system_score_gemma":0.000052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004225226,"about_ca_topic_score_gemma":0.00003177436,"domain_scores_codex":[0.9983958,0.0000546654,0.0003294648,0.0004838571,0.0002584436,0.0004777675],"domain_scores_gemma":[0.9989671,0.0003629826,0.00007536188,0.0002570708,0.00007494223,0.0002625352],"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.00007781886,0.0006679196,0.01067775,0.0002173223,0.00006250491,0.00002455847,0.002485708,0.00001577708,0.000010682,0.5027271,0.0001954282,0.4828375],"study_design_scores_gemma":[0.002880679,0.0007458851,0.003547073,0.00009085636,0.00002996239,0.0001232692,0.0007350554,0.195049,0.00003408129,0.7949361,0.001315228,0.0005128231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5391811,0.0008428317,0.4570085,0.0004315674,0.0002652908,0.001266817,0.00001185425,0.0002540193,0.0007380206],"genre_scores_gemma":[0.6792136,0.000003335404,0.3206242,0.00002693001,0.00002047485,0.00008969046,0.000001326316,0.000007263986,0.00001319376],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4823246,"threshold_uncertainty_score":0.7662939,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04022054374351302,"score_gpt":0.2952712546187547,"score_spread":0.2550507108752417,"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."}}