{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005214578,0.0006710255,0.0005922305,0.0007069137,0.0008933682,0.001383946,0.001436253,0.0008125125,0.00617206],"category_scores_gemma":[0.004113796,0.0002806717,0.00046681,0.001370104,0.0007601597,0.002431468,0.001352607,0.0009751358,0.0009159449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009794025,"about_ca_system_score_gemma":0.0006765857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009437712,"about_ca_topic_score_gemma":0.001399671,"domain_scores_codex":[0.9993325,0.0001182003,0.00003099456,0.0002062129,0.0001923411,0.0001197254],"domain_scores_gemma":[0.9983389,0.0006762456,0.0002587208,0.0003596013,0.0002394228,0.0001269992],"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.0004316216,0.0001736734,0.001495972,0.0003496237,0.00008247446,0.0004087614,0.0002901347,0.1991946,0.03554134,0.5949779,0.01039356,0.1566603],"study_design_scores_gemma":[0.00004494714,0.00009821328,0.0004505308,0.00002840832,0.00004503794,0.0002428214,0.0001316191,0.3594841,0.01134099,0.6147978,0.01331718,0.00001836283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1771098,0.000232294,0.7958143,0.0005004511,0.00009291559,0.0002477995,0.000656681,0.0008720605,0.02447379],"genre_scores_gemma":[0.7567915,0.0003748555,0.2250062,0.0002048132,0.00008258237,0.0002310672,0.001454078,0.0002552875,0.01559966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00617206,"threshold_uncertainty_score":0.02064759,"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."}}