{"id":"W1994002660","doi":"10.1007/s10107-008-0242-9","title":"Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Mathematics; Submodular set function; Algorithm; Function (biology); Minification; Polynomial; Combinatorial algorithms; Time complexity; Extension (predicate logic); Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","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.0003128197,0.0001671492,0.0002390922,0.00009807357,0.0004104793,0.0001769417,0.0002904962,0.00009153891,0.000007379198],"category_scores_gemma":[0.0001431431,0.0001580261,0.00009448514,0.0002598412,0.0001505968,0.0004574168,0.0001519409,0.0001140528,0.000007768657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002576577,"about_ca_system_score_gemma":0.00003560077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002320352,"about_ca_topic_score_gemma":4.779352e-7,"domain_scores_codex":[0.9986123,0.00004068682,0.0003298929,0.0003806291,0.0002874231,0.000349096],"domain_scores_gemma":[0.9991979,0.0002092199,0.00009385109,0.0002791088,0.00009225218,0.0001276631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004997817,0.0004650903,0.00009610211,0.0001618021,0.00005528892,0.00001185633,0.0009612343,0.00002633174,0.00009099994,0.6793762,0.0005701486,0.3181349],"study_design_scores_gemma":[0.00266195,0.001072666,0.0003734803,0.00006208017,0.00005124039,0.0001599884,0.000115836,0.6707599,0.0004015546,0.3065881,0.01716553,0.0005877447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0178906,0.00006852872,0.9802254,0.0003054364,0.0005842748,0.0005553965,0.000002208482,0.0002426736,0.0001254882],"genre_scores_gemma":[0.3561151,0.000005647114,0.6432174,0.00004969195,0.0003821598,0.0001381048,0.00001050147,0.00001954848,0.00006180001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6707335,"threshold_uncertainty_score":0.6444117,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03894664690511204,"score_gpt":0.2594211731772316,"score_spread":0.2204745262721196,"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."}}