{"id":"W1532366404","doi":"10.1007/3-540-45784-4_7","title":"Improved Approximation Algorithms for NMR Spectral Peak Assignment","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bipartite graph; Disjoint sets; Matching (statistics); Combinatorics; Mathematics; Algorithm; Approximation algorithm; Blossom algorithm; Graph; Discrete 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002999857,0.002318957,0.002602316,0.002273927,0.001109232,0.002781308,0.005173534,0.00229079,0.01224163],"category_scores_gemma":[0.01535759,0.001129477,0.001594006,0.00511744,0.00142441,0.004616009,0.003530766,0.004568717,0.005494892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002172786,"about_ca_system_score_gemma":0.002244991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004711576,"about_ca_topic_score_gemma":0.005702383,"domain_scores_codex":[0.9974912,0.0007363017,0.000166665,0.0003713998,0.0009731625,0.0002612291],"domain_scores_gemma":[0.9930347,0.003841268,0.000317831,0.001669066,0.0009528909,0.0001843437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007518771,0.0003084965,0.0004396972,0.0003136345,0.00009113662,0.0000843652,0.0001876252,0.2426758,0.005505722,0.07169739,0.01838347,0.6595607],"study_design_scores_gemma":[0.00007521924,0.00004123868,0.0001290424,0.00002077542,0.0000276524,0.00007963441,0.00003677711,0.932414,0.002163041,0.06135662,0.003635924,0.00002006346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002476184,0.0003350487,0.9947795,0.0001227843,0.00008682537,0.00003687686,0.00009179363,0.0009025823,0.001168475],"genre_scores_gemma":[0.03156818,0.0004180376,0.9629164,0.0001231246,0.0001475623,0.0002263167,0.0005771776,0.0003784831,0.003644736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01224163,"threshold_uncertainty_score":0.04095232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02399118566302421,"score_gpt":0.2500937005534127,"score_spread":0.2261025148903885,"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."}}