{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002392081,0.0001995373,0.00019774,0.0001520106,0.0005569434,0.0005671633,0.001578542,0.00004730816,0.00003714182],"category_scores_gemma":[0.0001824869,0.0001621243,0.00009279847,0.000760883,0.0008660177,0.0005137777,0.000262754,0.000199839,0.00005107047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008049386,"about_ca_system_score_gemma":0.0001319806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001527321,"about_ca_topic_score_gemma":8.614619e-8,"domain_scores_codex":[0.9974033,0.0001453753,0.000268611,0.0007976157,0.0006895634,0.0006955087],"domain_scores_gemma":[0.9986033,0.0002406447,0.00008007175,0.0006652853,0.0001411862,0.0002695023],"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.000001962134,0.000059591,0.00001675719,0.000006281049,0.00000280191,0.000002396176,0.0002246015,0.0008066177,0.0002200541,0.9408522,0.00005651409,0.05775027],"study_design_scores_gemma":[0.0002811595,0.0002507548,0.0001831824,0.0000103007,0.000003112933,0.00003337462,0.000005077286,0.7698826,0.003945954,0.2243852,0.000814565,0.0002047514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002141932,0.00001902746,0.9899042,0.0009541168,0.0007952139,0.0002990062,0.000001224197,0.0002486462,0.00563662],"genre_scores_gemma":[0.4912986,8.801052e-7,0.508278,0.0002340622,0.0001288652,0.00001656941,8.160177e-7,0.000006317136,0.00003586205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.769076,"threshold_uncertainty_score":0.6611236,"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."}}