{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001688554,0.001418076,0.002073354,0.001213578,0.001067503,0.002799091,0.003004831,0.001718435,0.01095728],"category_scores_gemma":[0.005809124,0.0008420905,0.001193936,0.002245805,0.0006825419,0.002373691,0.002394653,0.004241768,0.002453747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001536714,"about_ca_system_score_gemma":0.002717015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003675889,"about_ca_topic_score_gemma":0.005878716,"domain_scores_codex":[0.998355,0.000455816,0.0000833158,0.0003103823,0.0005635771,0.0002319328],"domain_scores_gemma":[0.997332,0.001324026,0.0001568802,0.0005050192,0.000508556,0.0001735154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007964123,0.000855046,0.0006285053,0.0003209145,0.00008595701,0.0001302787,0.000193869,0.4800971,0.00495294,0.05832988,0.02678322,0.4268259],"study_design_scores_gemma":[0.00006982725,0.00006104892,0.00006460491,0.00001558855,0.0000113717,0.00003426941,0.00002629588,0.9838259,0.0008532375,0.01334763,0.001679413,0.00001085116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02090414,0.0003379503,0.9625652,0.0005694221,0.0002912664,0.0002075003,0.0002417056,0.001827806,0.01305498],"genre_scores_gemma":[0.1566677,0.0002267559,0.8340885,0.0003978069,0.0001518112,0.0003588351,0.0007702765,0.0004013173,0.006937055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01095728,"threshold_uncertainty_score":0.03665572,"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."}}