{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007907932,0.0002413827,0.0002806768,0.001390599,0.0007125101,0.0008144634,0.001421057,0.0001115414,0.00002261624],"category_scores_gemma":[0.0002127735,0.0002649245,0.000119254,0.001004844,0.00007469852,0.001770179,0.0002197122,0.0001832907,0.0000432518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007066037,"about_ca_system_score_gemma":0.0001366503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003524152,"about_ca_topic_score_gemma":0.000007009172,"domain_scores_codex":[0.9978012,0.00005804217,0.0004602458,0.0007096501,0.0005376151,0.0004332188],"domain_scores_gemma":[0.9980858,0.000469056,0.0003027409,0.0006362951,0.0003099694,0.0001961227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002618858,0.0003425615,0.002544901,0.00002387232,0.0000332323,0.00002105691,0.0001860611,0.4468292,0.00009721964,0.02088454,0.0005276747,0.5284835],"study_design_scores_gemma":[0.001208193,0.0001645471,0.1177167,0.00001569442,0.000005525746,0.00002697901,0.00001346835,0.8573143,0.0003048218,0.0218413,0.001079064,0.0003094731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1663934,0.0001503877,0.831879,0.0003423217,0.0006330202,0.0003330826,0.00004921127,0.0001049198,0.0001146731],"genre_scores_gemma":[0.5537035,0.000005446334,0.4456186,0.0002024271,0.0001442872,0.00004950492,0.0001905761,0.00001251407,0.00007314692],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.528174,"threshold_uncertainty_score":0.9999803,"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."}}