{"id":"W6950157219","doi":"10.5281/zenodo.3374972","title":"Code for Revisiting a Cutting Plane Method for Perfect Matchings","year":2019,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optical and Acousto-Optic Technologies","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Solver; Matching (statistics); Graph; Python (programming language); Linear programming; Work (physics)","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.0008131113,0.001987992,0.0009053948,0.00132191,0.0006896112,0.00150422,0.003341852,0.001292511,0.140359],"category_scores_gemma":[0.004804923,0.001246838,0.002429469,0.001437863,0.0007478487,0.002335033,0.002569955,0.002736452,0.05851233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001270001,"about_ca_system_score_gemma":0.00235327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005152002,"about_ca_topic_score_gemma":0.007181457,"domain_scores_codex":[0.9989576,0.00007134013,0.00008982779,0.0002083003,0.0005182332,0.0001546827],"domain_scores_gemma":[0.9988524,0.0003920867,0.00007525228,0.0002566627,0.0003528078,0.0000707771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003955966,0.0002387602,0.002071661,0.001565612,0.0001410709,0.0005259279,0.0004272525,0.03243895,0.01544187,0.05201717,0.5219051,0.372831],"study_design_scores_gemma":[0.0005102832,0.00007365547,0.001700593,0.0002855216,0.00006719928,0.0008774596,0.0001202131,0.2268753,0.03068997,0.07885119,0.6597872,0.000161405],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.002097537,0.0001039904,0.6687578,0.0003195743,0.0002396343,0.0002350845,0.007685035,0.3004147,0.02014666],"genre_scores_gemma":[0.02710698,0.0002258281,0.8024141,0.0006466744,0.00007588413,0.0008588452,0.01876924,0.1203165,0.02958596],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.140359,"threshold_uncertainty_score":0.4695475,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02218502050296968,"score_gpt":0.2708514891241608,"score_spread":0.2486664686211912,"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."}}