{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001223937,0.0008062641,0.001440269,0.002608187,0.002688884,0.004126968,0.001624312,0.001598408,0.009755718],"category_scores_gemma":[0.005167094,0.0005792012,0.001424837,0.002560807,0.003796379,0.008119005,0.002983371,0.004728964,0.0008663508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002787,"about_ca_system_score_gemma":0.001334458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003096713,"about_ca_topic_score_gemma":0.003284717,"domain_scores_codex":[0.998997,0.0002907886,0.00004746088,0.0001654558,0.000297668,0.0002014794],"domain_scores_gemma":[0.9975388,0.001337116,0.000232969,0.0002497251,0.0002356163,0.0004058134],"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.000008805719,0.00001393426,0.0000711656,0.00002177334,0.000003118394,0.00001816368,0.00008867088,0.0007933169,0.0001414619,0.9964281,0.0007682451,0.001643227],"study_design_scores_gemma":[0.000004836836,0.000002850861,0.00006543269,0.000004555432,0.000002293958,0.00001309654,0.00002518885,0.004158615,0.00003769348,0.9950746,0.0006065193,0.000004400874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4350491,0.002403616,0.335354,0.008786525,0.0004156837,0.0001634065,0.001091261,0.0006463923,0.2160901],"genre_scores_gemma":[0.9264651,0.001261185,0.04923093,0.0009880416,0.0005847645,0.0001553472,0.0009106253,0.0002467103,0.02015721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009755718,"threshold_uncertainty_score":0.03263617,"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."}}