{"id":"W2752885799","doi":"10.1287/moor.2019.1034","title":"Stabilizing Weighted Graphs","year":2020,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Matching (statistics); Cardinality (data modeling); Time complexity; Bipartite graph; Graph; Factor-critical graph; Discrete mathematics; Line graph; Computer science; Graph power","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":[],"consensus_categories":[],"category_scores_codex":[0.001667491,0.0002167822,0.0004525762,0.0006548954,0.0003938843,0.0006383831,0.003081337,0.0001764069,0.00008273732],"category_scores_gemma":[0.0005066454,0.0002052842,0.0001943952,0.001297753,0.0003026164,0.0002259157,0.004663995,0.001324166,0.00006314307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005646398,"about_ca_system_score_gemma":0.0005264548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009768786,"about_ca_topic_score_gemma":0.00004458467,"domain_scores_codex":[0.9967221,0.0002828452,0.0006684405,0.0006061248,0.001333144,0.0003873677],"domain_scores_gemma":[0.9965129,0.0004812104,0.00007128772,0.001727776,0.001051009,0.0001558114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000122518,0.0002878296,0.000007821569,0.0006333934,0.0000582497,0.000008185769,0.004716807,0.0009017104,0.001148836,0.9895428,0.0006685664,0.002024593],"study_design_scores_gemma":[0.00008129299,0.00005171914,0.00001862134,0.0001718426,0.000004827851,0.000002834046,0.0001539919,0.5282742,0.002448061,0.468463,0.0001816892,0.0001479299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0325714,0.0004098056,0.9548976,0.003894144,0.0003556787,0.00125835,0.00007255726,0.0002272332,0.006313205],"genre_scores_gemma":[0.2681807,0.0001229241,0.7312564,0.00002462766,0.00006141477,0.0001454169,0.00002705183,0.00002383993,0.0001576617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5273725,"threshold_uncertainty_score":0.8371248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2289313489513301,"score_gpt":0.4098623481194887,"score_spread":0.1809309991681586,"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."}}