{"id":"W2590962680","doi":"10.1016/j.comgeo.2017.02.004","title":"An optimal algorithm for plane matchings in multipartite geometric graphs","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multipartite; Algorithm; Plane (geometry); Combinatorics; Computer science; Mathematics; Geometry; Physics; Quantum entanglement","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.0009973799,0.001546647,0.002008273,0.002248267,0.001492776,0.002697818,0.003526499,0.002676788,0.01637098],"category_scores_gemma":[0.005723513,0.001301823,0.001896477,0.003222896,0.001210101,0.004361063,0.004399169,0.00251821,0.003456967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002180676,"about_ca_system_score_gemma":0.002386037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004869603,"about_ca_topic_score_gemma":0.006141089,"domain_scores_codex":[0.998753,0.0002170861,0.00008134048,0.0003991454,0.0003398113,0.0002096369],"domain_scores_gemma":[0.9979664,0.0009820572,0.0001402254,0.0004813809,0.0002808791,0.0001490609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005818736,0.0005096312,0.0009926817,0.0005453596,0.0001250576,0.0001224605,0.0003573977,0.2216487,0.01160926,0.0723436,0.021998,0.669166],"study_design_scores_gemma":[0.0001789522,0.0001235772,0.0003195483,0.00004452027,0.000060038,0.0001061017,0.0001674315,0.8972783,0.003885824,0.09101308,0.006791354,0.000031302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02053069,0.0002470186,0.9689012,0.0003855004,0.0001159079,0.0002641347,0.0002911462,0.002392404,0.006872012],"genre_scores_gemma":[0.08721767,0.0001753701,0.9072143,0.0001543634,0.00004864626,0.0002360858,0.0008392284,0.0005308213,0.003583504],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01637098,"threshold_uncertainty_score":0.05476642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02130411157719175,"score_gpt":0.298856879699042,"score_spread":0.2775527681218503,"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."}}