{"id":"W3199722554","doi":"10.4230/lipics.isaac.2021.44","title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Euclidean geometry; Matching (statistics); Planar graph; Planar; Approximation algorithm; Plane (geometry); Cover (algebra); Discrete mathematics; Graph; Geometry; Computer science","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.001553433,0.002493601,0.003280807,0.002357867,0.001799197,0.004385696,0.005836382,0.003134948,0.01382889],"category_scores_gemma":[0.008744876,0.001064189,0.001985136,0.007011526,0.00128477,0.01060498,0.003614636,0.002960902,0.00376236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004415038,"about_ca_system_score_gemma":0.00359371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0122988,"about_ca_topic_score_gemma":0.018587,"domain_scores_codex":[0.9970015,0.000529096,0.0002024157,0.0008540472,0.000760962,0.0006519904],"domain_scores_gemma":[0.9954046,0.002159151,0.0004956138,0.001370448,0.0002977661,0.0002724236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002132154,0.001284667,0.004203118,0.001333577,0.0004655279,0.0003551013,0.0006687785,0.4955125,0.005781702,0.07967423,0.05030038,0.3582883],"study_design_scores_gemma":[0.0002946424,0.0001160882,0.0006984298,0.00005186937,0.0001105991,0.0002675986,0.000242125,0.8810515,0.001547085,0.1096283,0.005956596,0.00003524439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1393527,0.006633318,0.8061339,0.003996799,0.0004117923,0.000571795,0.003816916,0.009991659,0.02909109],"genre_scores_gemma":[0.41382,0.002300646,0.5640319,0.0006146332,0.0002902934,0.0004259446,0.006808588,0.001044735,0.01066339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01382889,"threshold_uncertainty_score":0.04626226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02379987069991624,"score_gpt":0.2771483765634007,"score_spread":0.2533485058634845,"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."}}