{"id":"W2312191997","doi":"10.3138/infor.53.1.40","title":"A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems","year":2015,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Semidefinite programming; Mathematics; Relaxation (psychology); Hierarchy; Combinatorics; Benchmark (surveying); Projection (relational algebra); Maximum cut; Graph; Mathematical optimization; Discrete mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.003520843,0.002098541,0.001489138,0.001181961,0.0007875965,0.002045593,0.001919544,0.001213697,0.005028543],"category_scores_gemma":[0.007814801,0.0009607885,0.001710749,0.001642444,0.001412638,0.003015951,0.002399676,0.006235645,0.001113911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001576618,"about_ca_system_score_gemma":0.001678712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001167073,"about_ca_topic_score_gemma":0.00248517,"domain_scores_codex":[0.9980791,0.0007717254,0.00009970495,0.0002950736,0.0005250453,0.0002293501],"domain_scores_gemma":[0.9954395,0.002959255,0.0003402388,0.0004789418,0.0005009779,0.0002811982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002894976,0.0005281496,0.0007833869,0.0009682439,0.00009930188,0.0002319807,0.0003632249,0.6222599,0.007781086,0.2291032,0.01552361,0.1220684],"study_design_scores_gemma":[0.00005670236,0.0001561218,0.0002327776,0.00007346115,0.00002133649,0.0001171796,0.00007053904,0.8828767,0.001592977,0.1107784,0.003994699,0.00002914707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02936123,0.001272526,0.9458376,0.00106781,0.00007960284,0.0002654324,0.0004492644,0.0005474256,0.02111898],"genre_scores_gemma":[0.2895418,0.002414147,0.6971976,0.000968027,0.0002551558,0.0007482208,0.001969401,0.000357813,0.006547834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005028543,"threshold_uncertainty_score":0.01862025,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1272666023801181,"score_gpt":0.3362466144016522,"score_spread":0.2089800120215341,"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."}}