{"id":"W2079074189","doi":"10.1016/j.endm.2013.10.053","title":"Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs","year":2013,"lang":"nl","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Strong perfect graph theorem; Bipartite graph; Operator (biology); Characterization (materials science); Conjecture; Discrete mathematics; Chordal graph; 1-planar graph; Graph","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001488196,0.0006093738,0.0009773333,0.0003858328,0.0002164652,0.0004760705,0.001558055,0.00027328,0.0004311581],"category_scores_gemma":[0.0008436951,0.0005380407,0.0002228239,0.001556076,0.001076581,0.001060023,0.0008982749,0.001119758,0.000293138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001955009,"about_ca_system_score_gemma":0.0005014905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001853492,"about_ca_topic_score_gemma":0.0001736981,"domain_scores_codex":[0.9949525,0.0004039796,0.001082579,0.0009137372,0.0008445708,0.001802623],"domain_scores_gemma":[0.9960911,0.001553895,0.0002699675,0.001552973,0.0002525421,0.0002794849],"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.00006896924,0.0007572745,0.007240372,0.001781874,0.0003155866,0.00002694566,0.009910725,0.000580748,0.02282015,0.9452093,0.000174926,0.01111308],"study_design_scores_gemma":[0.001868827,0.00143691,0.001555142,0.0009196403,0.00006581064,0.00009200981,0.0005126173,0.3161983,0.0195902,0.6563354,0.0002706609,0.001154484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9347181,0.005622597,0.05568738,0.0007306567,0.0001337658,0.001662536,0.00001848439,0.00008268929,0.001343824],"genre_scores_gemma":[0.9723322,0.0008821475,0.02603253,0.00006694326,0.00003399195,0.0001095743,0.000003990408,0.00008127269,0.0004573244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3156176,"threshold_uncertainty_score":0.9997071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01201657952695493,"score_gpt":0.2714424837093554,"score_spread":0.2594259041824004,"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."}}