{"id":"W2734443656","doi":"","title":"A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for some NP-Hard Graph Optimization Problems","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Semidefinite programming; Mathematics; Hierarchy; Relaxation (psychology); Combinatorics; Projection (relational algebra); Graph; Mathematical optimization; Discrete mathematics; Algorithm","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.003181255,0.001792063,0.001287603,0.0009842915,0.0007361724,0.001716398,0.001639998,0.001153722,0.005634375],"category_scores_gemma":[0.006358101,0.0008318623,0.001462007,0.001238816,0.001249744,0.002721472,0.002093226,0.005242685,0.001356158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001385166,"about_ca_system_score_gemma":0.00152154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001280794,"about_ca_topic_score_gemma":0.002667657,"domain_scores_codex":[0.9983986,0.0006960004,0.00007197609,0.0002330622,0.000427204,0.0001731283],"domain_scores_gemma":[0.997041,0.001777208,0.0002333652,0.0003446237,0.0003710092,0.0002328799],"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.0002901025,0.0005216661,0.0008568151,0.0007708833,0.00008720889,0.0002254205,0.0003434529,0.6121879,0.008468871,0.2139532,0.01589093,0.1464036],"study_design_scores_gemma":[0.00004396128,0.0001240314,0.0001941325,0.00004983575,0.0000145102,0.00008587859,0.00005236438,0.9119413,0.001324645,0.08302333,0.003124033,0.00002195628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02698941,0.001102829,0.9513927,0.001072933,0.00007779982,0.0001971609,0.0003406167,0.000606517,0.0182201],"genre_scores_gemma":[0.2916826,0.001900006,0.6951042,0.0008744284,0.0002110581,0.0005449677,0.001559549,0.000380961,0.007742159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005634375,"threshold_uncertainty_score":0.01884884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01711668131733231,"score_gpt":0.2475291359091198,"score_spread":0.2304124545917874,"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."}}