{"id":"W1967648182","doi":"10.1007/s00373-007-0714-3","title":"Efficient Many-To-Many Point Matching in One Dimension","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; Queen's University; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Matching (statistics); Dimension (graph theory); Point (geometry); Context (archaeology); 3-dimensional matching; Line (geometry); Discrete mathematics; Bipartite graph; Computer science; Graph; Statistics; Geometry","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.0009005281,0.0001740363,0.0002186336,0.0004936852,0.0002117275,0.0001188394,0.0004670429,0.00007085166,0.000002974025],"category_scores_gemma":[0.00001597305,0.0001766015,0.00006479136,0.001428575,0.00004356951,0.00009596942,0.000487272,0.0002500855,0.00001112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004676689,"about_ca_system_score_gemma":0.00001523534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001000796,"about_ca_topic_score_gemma":0.00001677051,"domain_scores_codex":[0.9983622,0.00003458336,0.0003113137,0.0004512904,0.0003725619,0.0004680635],"domain_scores_gemma":[0.9991237,0.0001184733,0.00006095965,0.0004315427,0.0000581801,0.0002071344],"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.000007791783,0.0002628212,0.001232182,0.000014918,0.000005907622,0.00004761445,0.001324395,0.0001214445,0.0002491011,0.9842613,0.00003803158,0.01243445],"study_design_scores_gemma":[0.0008905648,0.0002535107,0.07293924,0.0001123383,0.000006193881,0.00002801367,0.000243691,0.02955634,0.0007311985,0.8942729,0.0005022944,0.0004637377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7661599,0.0002887864,0.2313243,0.0003995316,0.0006557421,0.0001793431,8.584591e-7,0.000118788,0.0008727323],"genre_scores_gemma":[0.9881368,0.00003037728,0.01140742,0.0003698159,0.00001118308,0.000005507332,7.965888e-7,0.000009365631,0.00002869519],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.221977,"threshold_uncertainty_score":0.72016,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01663249054649343,"score_gpt":0.2347373155353467,"score_spread":0.2181048249888533,"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."}}