{"id":"W2537901922","doi":"","title":"Better balance by being biased: A 0.8776-approximation for max bisection","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Bisection; Bisection method; Approximation algorithm; Conjecture; Mathematics; Combinatorics; Constraint (computer-aided design); Discrete mathematics; Algorithm; Geometry","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.000136315,0.00009826147,0.00009431989,0.0000798517,0.0001640934,0.0002608316,0.000359942,0.00004470533,0.0000887784],"category_scores_gemma":[0.00001861518,0.00008826172,0.00006217318,0.0002628621,0.00002387121,0.0008411498,0.00007796778,0.00006546576,0.00007616568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000218603,"about_ca_system_score_gemma":0.000009644376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001042722,"about_ca_topic_score_gemma":0.000005042189,"domain_scores_codex":[0.9991562,0.00002100901,0.0001612889,0.0002894239,0.000147316,0.0002247789],"domain_scores_gemma":[0.9994485,0.0000840864,0.00005187271,0.0002854679,0.00007843204,0.00005168607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004848063,0.0001672815,0.001588682,0.00007256962,0.00003224126,7.717868e-7,0.0005002806,0.00003003002,0.01352277,0.1408622,0.1621989,0.6810194],"study_design_scores_gemma":[0.0004200236,0.00009408938,0.00170685,0.00001763765,0.000003405215,0.000006112524,0.00001901224,0.7964461,0.01150687,0.1700103,0.01951968,0.0002498511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02181233,0.00001790513,0.9717947,0.002842212,0.0003342174,0.0003681569,0.00000301381,0.0002299905,0.002597512],"genre_scores_gemma":[0.3498285,0.000005608603,0.6455339,0.002562778,0.0001727249,0.0003056917,0.00002261269,0.00001216817,0.001556002],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7964162,"threshold_uncertainty_score":0.3599208,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.013430548456824,"score_gpt":0.2254449468753431,"score_spread":0.2120143984185191,"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."}}