{"id":"W2158086649","doi":"10.1007/s00373-014-1467-4","title":"Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences","year":2014,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Queen's University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Real line; Line (geometry); Discrete mathematics; Algorithm; Statistics","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":[],"consensus_categories":[],"category_scores_codex":[0.0005630524,0.0001651719,0.000206707,0.00006076982,0.0006307542,0.0003423042,0.001005895,0.00004160252,5.11322e-7],"category_scores_gemma":[0.00003032872,0.0001129683,0.00006105375,0.0003758113,0.00006032541,0.0002486008,0.0004586549,0.0001302355,0.000003549865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000128849,"about_ca_system_score_gemma":0.00001522351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004973652,"about_ca_topic_score_gemma":0.000001841049,"domain_scores_codex":[0.9987369,0.0000530825,0.0002223925,0.0004127298,0.0002501847,0.0003247019],"domain_scores_gemma":[0.9987926,0.0003938101,0.0001112287,0.0004925058,0.00007754725,0.0001323011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002327498,0.00001678834,0.003552926,0.00001877732,0.000008746626,8.057809e-7,0.0003945098,0.00001275537,0.00001851598,0.9418429,0.001277721,0.05285323],"study_design_scores_gemma":[0.0006296529,0.000216162,0.009990478,0.00006768542,0.00001567735,0.000004622631,0.00006784237,0.1391703,0.0001172615,0.7967893,0.0525928,0.0003382377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09101355,0.0002034431,0.9064038,0.00113671,0.0005690776,0.0002373793,0.00001170539,0.0001037956,0.0003205025],"genre_scores_gemma":[0.9852419,0.0000172508,0.01413598,0.0004378362,0.0000705073,0.00001513294,0.000006080005,0.000009696165,0.00006561177],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8942283,"threshold_uncertainty_score":0.4851315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.013452449097659,"score_gpt":0.2554887625289435,"score_spread":0.2420363134312845,"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."}}