{"id":"W2395902960","doi":"","title":"Minimum many-to-many matchings for computing the distance between two sequences","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics","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.0003332261,0.0002001736,0.0002091634,0.0002915257,0.0002975756,0.00009951384,0.0004504805,0.00006066802,0.0000892998],"category_scores_gemma":[0.00003152007,0.0001782927,0.0000726136,0.000400101,0.00007802052,0.0000811612,0.00001569665,0.0001739836,0.0001147659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001112598,"about_ca_system_score_gemma":0.0001486327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002317456,"about_ca_topic_score_gemma":0.002714917,"domain_scores_codex":[0.9988133,0.00004016276,0.0002793862,0.0002547603,0.0001827235,0.0004296166],"domain_scores_gemma":[0.9989762,0.000328688,0.00005118799,0.0001857172,0.000120734,0.0003374207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001727322,0.00001149806,0.006990543,0.0001151873,0.0001536975,0.00001513038,0.00316403,0.06071807,0.00003611646,0.9071828,0.002539899,0.01905573],"study_design_scores_gemma":[0.001318371,0.000349773,0.1263194,0.0006767565,0.00008944491,0.00003299477,0.003292506,0.4931171,0.0003643765,0.345799,0.0266687,0.00197157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6244994,0.0000826194,0.3536639,0.0005416888,0.0009015723,0.0006595491,0.0004154601,0.0001739194,0.01906186],"genre_scores_gemma":[0.9971958,7.371631e-7,0.00192966,0.0004655365,0.0001805026,0.00003107067,0.00005130708,0.00002718993,0.0001181712],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5613838,"threshold_uncertainty_score":0.7270567,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03947693002219832,"score_gpt":0.2458477516972585,"score_spread":0.2063708216750602,"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."}}