{"id":"W1648726702","doi":"10.1007/s10589-015-9779-8","title":"Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Semidefinite programming; Maximum cut; Eigenvalues and eigenvectors; Quadratic programming; Adjacency matrix; Graph partition; Combinatorics; Laplacian matrix; Vertex (graph theory); Quadratic equation; Mathematical optimization; Graph","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.0001377799,0.0001560054,0.0001407396,0.0001459399,0.0002094732,0.0001537973,0.00006449102,0.00008798767,0.000003873482],"category_scores_gemma":[0.00003125504,0.000170099,0.00002728208,0.0003430713,0.00006823007,0.0002250702,0.00001966765,0.00006885027,0.000003075233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004198962,"about_ca_system_score_gemma":0.00005205214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002122586,"about_ca_topic_score_gemma":0.000002390331,"domain_scores_codex":[0.9991293,0.00001965008,0.0003207537,0.0002343913,0.0001350647,0.0001608451],"domain_scores_gemma":[0.9992577,0.0001105419,0.00008615823,0.000103789,0.0002944063,0.0001474247],"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.000003580603,0.00004630533,0.0001670925,0.00008714847,0.00002231743,1.100149e-7,0.0004817412,0.9393222,0.000009079987,0.03102045,0.0008103662,0.02802957],"study_design_scores_gemma":[0.0004611123,0.00005740945,0.00003758018,0.00002427785,0.0000410676,0.00001287183,0.0002039368,0.9645697,0.00003105199,0.01119789,0.02314329,0.0002197767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002056299,0.0003723974,0.9960442,0.0001883607,0.00002255335,0.001757365,0.00002659024,0.0006107082,0.0007722166],"genre_scores_gemma":[0.09691165,0.00009280728,0.8991252,0.00007879864,0.00007337723,0.002765552,0.0008101478,0.00004517791,0.00009726897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09691896,"threshold_uncertainty_score":0.6936436,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02330850243936596,"score_gpt":0.2572272012488267,"score_spread":0.2339186988094607,"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."}}