{"id":"W4405206838","doi":"10.1007/s10107-024-02166-0","title":"On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Vertex (graph theory); Rank (graph theory); Graph; Operator (biology); Discrete mathematics; Monotone polygon","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":[],"consensus_categories":[],"category_scores_codex":[0.0005192128,0.0001863357,0.0001823218,0.0001676068,0.0005504797,0.000984139,0.0004273033,0.00006647176,0.00002201054],"category_scores_gemma":[0.0001385216,0.0001247286,0.0001717601,0.0005693946,0.0002508451,0.0003442727,0.0001498853,0.0002451628,0.00002656685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001584967,"about_ca_system_score_gemma":0.00002474329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005413987,"about_ca_topic_score_gemma":0.000004569375,"domain_scores_codex":[0.9986076,0.00004282397,0.0002948213,0.0004394687,0.000277735,0.0003375832],"domain_scores_gemma":[0.9983216,0.001116342,0.00002325702,0.0003945743,0.00004916274,0.00009505364],"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.000005733498,0.00005730117,0.000001820426,0.0001092959,0.00003912525,0.000004288708,0.0008415657,0.00003393091,0.00003921525,0.7910495,0.0001041247,0.2077141],"study_design_scores_gemma":[0.0002047694,0.0001653046,0.00003255162,0.0001049755,0.00003166898,0.00005107156,0.00008611022,0.3741608,0.0001249094,0.6180162,0.006855363,0.0001662534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01192538,0.0006394454,0.9832568,0.002346157,0.0004241238,0.0008764498,0.000005970586,0.0003311513,0.0001945794],"genre_scores_gemma":[0.5475874,0.00003440721,0.4512878,0.0001971678,0.0001465544,0.0005293266,0.000005187732,0.00002796842,0.0001841658],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5356621,"threshold_uncertainty_score":0.9490075,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0279443316526068,"score_gpt":0.2841035484888692,"score_spread":0.2561592168362624,"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."}}