{"id":"W2086871104","doi":"10.1007/s10878-013-9673-1","title":"An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rounding; Combinatorics; Semidefinite programming; Approximation algorithm; Mathematics; Maximum cut; Theory of computation; Semidefinite embedding; Bisection; Vertex (graph theory); Discrete mathematics; Graph; Algorithm; Mathematical optimization; Computer science","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.001132117,0.0002038778,0.0003057068,0.0005848362,0.0003786696,0.0009711463,0.0006065385,0.0001268691,0.000005894145],"category_scores_gemma":[0.0001200407,0.0001906169,0.0001857673,0.0008548516,0.00005282599,0.004055687,0.00006032497,0.0002511411,9.392726e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001051602,"about_ca_system_score_gemma":0.00009694017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002550823,"about_ca_topic_score_gemma":4.706136e-7,"domain_scores_codex":[0.9980664,0.0001706459,0.0007609035,0.0002668342,0.0004195202,0.0003156478],"domain_scores_gemma":[0.9974551,0.0001610191,0.0008777716,0.000272547,0.001079068,0.0001544821],"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.00004517688,0.0007728573,0.00008809759,0.0001074344,0.0001193775,0.000001976622,0.001488205,0.1519718,0.00159496,0.0425571,0.0001446754,0.8011083],"study_design_scores_gemma":[0.001308853,0.0009285496,0.00003476502,0.00005492702,0.00002097655,0.00003281417,0.00006222641,0.82174,0.0004705068,0.1748736,0.0002811594,0.0001916157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001288514,0.00007186984,0.9926343,0.0002135492,0.004796506,0.0008446702,0.000001857158,0.0001132194,0.00003549974],"genre_scores_gemma":[0.03244502,0.00004500635,0.9666787,0.00003008492,0.0006588617,0.00008995759,0.000020829,0.00002313202,0.000008403312],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8009167,"threshold_uncertainty_score":0.9364786,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01505656837877617,"score_gpt":0.2445863574433526,"score_spread":0.2295297890645764,"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."}}