{"id":"W1803930816","doi":"10.1007/s10107-016-1035-1","title":"Lovász–Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research Global; Agencia Nacional de Promoción Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bipartite graph; Mathematics; Polytope; Operator (biology); Chordal graph; Characterization (materials science); Indifference graph; Strong perfect graph theorem; Discrete mathematics; Graph; 1-planar graph; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001521977,0.0006878298,0.001069779,0.001642872,0.00178304,0.002503012,0.001498178,0.001629203,0.00681306],"category_scores_gemma":[0.006219465,0.0003906635,0.001046845,0.001687414,0.003006407,0.005686149,0.002274429,0.002941246,0.0006003203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001640356,"about_ca_system_score_gemma":0.001370261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002023423,"about_ca_topic_score_gemma":0.001908515,"domain_scores_codex":[0.9991647,0.0003407765,0.00004179182,0.0001582076,0.0001810867,0.000113439],"domain_scores_gemma":[0.9973912,0.001365383,0.0003336847,0.0002479413,0.0002726797,0.0003892165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001702585,0.00001464144,0.0001135392,0.00002812692,0.000005239061,0.00002487555,0.00006239641,0.002875054,0.0001896454,0.9933146,0.001014348,0.002340501],"study_design_scores_gemma":[0.000003898049,0.000003986765,0.00004104711,0.00000412403,0.000002290649,0.00001835201,0.0000259878,0.01125489,0.00005692646,0.9881179,0.0004663689,0.000004180178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3019738,0.002128155,0.6112642,0.00758547,0.0003489649,0.0001032747,0.0008366547,0.0003056341,0.07545388],"genre_scores_gemma":[0.9079587,0.001615919,0.06674104,0.00112136,0.0004809655,0.0001389516,0.0005228829,0.0001166709,0.02130344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00681306,"threshold_uncertainty_score":0.02279192,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0202639909015393,"score_gpt":0.251452095989001,"score_spread":0.2311881050874617,"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."}}