{"id":"W2507811569","doi":"10.1016/j.disopt.2018.08.003","title":"Additive stabilizers for unstable graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Vertex (graph theory); Matching (statistics); Approximation algorithm; Chordal graph; Vertex cover; Maximal independent set; Edge cover; Discrete mathematics; Graph; 1-planar 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.0003358752,0.0003434126,0.0003441891,0.0002606721,0.0003197978,0.000477354,0.001269364,0.0002588945,0.0001119887],"category_scores_gemma":[0.0001148895,0.0003528284,0.000283427,0.0004391629,0.0001827449,0.0004749316,0.001049654,0.00025646,0.000008366823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008158947,"about_ca_system_score_gemma":0.0001893076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003366305,"about_ca_topic_score_gemma":0.00001072065,"domain_scores_codex":[0.9978424,0.00009015902,0.000374653,0.0009584319,0.0003228282,0.0004115347],"domain_scores_gemma":[0.997921,0.0001480706,0.0003113904,0.001017435,0.0004869096,0.0001152071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006009967,0.0001320455,0.00004306519,0.0002469021,0.0002120131,0.000005139083,0.001606869,0.7822602,0.000008302079,0.1865118,0.01384411,0.01506954],"study_design_scores_gemma":[0.0003143632,0.0001040806,0.00001658505,0.00009988493,0.00002848077,0.000001902402,0.00004499521,0.8825914,0.0002115884,0.1129759,0.003185087,0.000425739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00010529,0.0001201722,0.992031,0.0003822329,0.001775138,0.001027248,0.000483444,0.0003383564,0.003737116],"genre_scores_gemma":[0.008198366,0.000203228,0.9889076,0.0001952592,0.0002441181,0.0004104901,0.001485723,0.00004446569,0.0003107837],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1003312,"threshold_uncertainty_score":0.9998924,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02361287613948265,"score_gpt":0.2739444552874977,"score_spread":0.250331579148015,"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."}}