{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000758627,0.0003534743,0.0004291382,0.0001143236,0.0005935967,0.001104312,0.0008216373,0.0001309318,0.0001311512],"category_scores_gemma":[0.0002134702,0.0002356463,0.0002106433,0.0007191689,0.0007376344,0.0007535607,0.0005758429,0.0002389313,0.0002682635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000243031,"about_ca_system_score_gemma":0.00005560634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001300054,"about_ca_topic_score_gemma":0.000005622896,"domain_scores_codex":[0.9973216,0.0001193369,0.0004933043,0.0007404158,0.0005175656,0.0008077972],"domain_scores_gemma":[0.9981192,0.0004497332,0.0001021144,0.0008602862,0.00009447843,0.0003742058],"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.00000696473,0.0001859566,0.001038249,0.00009728791,0.00004571198,0.00003588136,0.0007153118,9.811274e-7,0.0003411792,0.6319129,0.0002142966,0.3654053],"study_design_scores_gemma":[0.001787989,0.0006043836,0.001308926,0.000651957,0.00006225403,0.0002862134,0.00007666997,0.0448935,0.00173654,0.897215,0.05006249,0.001314082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3297196,0.0008654251,0.6608316,0.003021366,0.0005062146,0.001093496,0.000007297798,0.001442521,0.00251245],"genre_scores_gemma":[0.6583126,0.00002932887,0.3409282,0.000270282,0.00004115809,0.00009573268,0.00000106353,0.0000366605,0.0002850535],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3640912,"threshold_uncertainty_score":0.9999326,"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."}}