{"id":"W1990785823","doi":"10.1016/s0304-3975(02)00086-5","title":"Approximation algorithms for NMR spectral peak assignment","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Bipartite graph; Matching (statistics); Disjoint sets; Combinatorics; Approximation algorithm; Mathematics; Algorithm; Set (abstract data type); Blossom algorithm; Computer science; Graph","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.004014791,0.002264625,0.003118117,0.0024822,0.001393452,0.00335672,0.005611845,0.00323487,0.01057535],"category_scores_gemma":[0.02425555,0.001354648,0.001733487,0.0047502,0.001938033,0.005221582,0.003740115,0.004871766,0.003972326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003010213,"about_ca_system_score_gemma":0.00312006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006232948,"about_ca_topic_score_gemma":0.00554351,"domain_scores_codex":[0.9974649,0.0009368236,0.000152914,0.0004725633,0.0006744229,0.0002983958],"domain_scores_gemma":[0.9882714,0.00795028,0.00061414,0.001781762,0.00101428,0.0003680855],"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.0007871964,0.0003402335,0.0009462262,0.0004633271,0.0001252918,0.00008372613,0.0002112726,0.46521,0.001637936,0.08183164,0.01821834,0.4301448],"study_design_scores_gemma":[0.00007959684,0.00003357481,0.0001127935,0.00002548986,0.00002630602,0.00004446031,0.00003748514,0.892197,0.0005338844,0.1050906,0.001805773,0.00001301194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00408347,0.0006241286,0.9923563,0.00034235,0.00008342828,0.00005689021,0.0001517852,0.0009714685,0.001330125],"genre_scores_gemma":[0.1161609,0.001130979,0.8742429,0.0003484191,0.0002795054,0.0005280835,0.001476673,0.0005845499,0.005248001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01057535,"threshold_uncertainty_score":0.0353781,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01290271587387249,"score_gpt":0.2668682977720276,"score_spread":0.2539655818981551,"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."}}