{"id":"W2971016812","doi":"10.5802/ojmo.2","title":"Revisiting a Cutting-Plane Method for Perfect Matchings","year":2020,"lang":"en","type":"preprint","venue":"Open Journal of Mathematical Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Counterexample; Linear programming; Uniqueness; Mathematics; Cutting-plane method; Matching (statistics); Algorithm; Mathematical optimization; Point (geometry); Polynomial; Sequence (biology); Time complexity; Applied mathematics; Discrete mathematics; Integer programming; Mathematical analysis; Geometry","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003229328,0.0002722534,0.0009072928,0.0001499815,0.0001774255,0.001462299,0.003015286,0.0001613391,0.00009766757],"category_scores_gemma":[0.001340562,0.000232869,0.0003549017,0.0002421019,0.00002652364,0.0006070576,0.00216859,0.0007041338,0.000006595577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005848323,"about_ca_system_score_gemma":0.0002191826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002439712,"about_ca_topic_score_gemma":7.305916e-8,"domain_scores_codex":[0.9974601,0.0002768848,0.001152502,0.0004032098,0.000470752,0.0002365162],"domain_scores_gemma":[0.9963263,0.001051488,0.001529633,0.0004362337,0.0004690489,0.0001872607],"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.0001306287,0.0002871074,0.000006269733,0.002814024,0.0004378123,0.0000852058,0.003550644,0.5277005,0.0001162277,0.3711466,0.00301413,0.09071092],"study_design_scores_gemma":[0.0003579243,0.0001108611,0.000001206781,0.001050158,0.00007127968,0.0001874575,0.00003142969,0.7308016,0.0001235497,0.2668249,0.0002510975,0.0001885235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000258177,0.0001048245,0.9906217,0.006635526,0.0003270529,0.0007026628,0.00001121833,0.000036863,0.00153427],"genre_scores_gemma":[0.0005939315,0.00004558173,0.9985135,0.0003634984,0.0003745057,0.00002058356,0.00001261371,0.00002805163,0.00004776549],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2031011,"threshold_uncertainty_score":0.9995743,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06268050422370516,"score_gpt":0.3521685173705242,"score_spread":0.289488013146819,"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."}}