{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007963835,0.0006314495,0.0005745649,0.0005930149,0.0003974414,0.0008315899,0.003378451,0.0003560094,0.00003688368],"category_scores_gemma":[0.00005772925,0.000549313,0.0002014772,0.0003822887,0.0003386892,0.001045077,0.001325916,0.0006277143,0.00002779228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004448462,"about_ca_system_score_gemma":0.0002883929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001614975,"about_ca_topic_score_gemma":0.000007963095,"domain_scores_codex":[0.9955332,0.00002688703,0.0006377954,0.001939355,0.001005383,0.0008573292],"domain_scores_gemma":[0.9971484,0.0003366111,0.0004074868,0.001643474,0.0002371251,0.0002269321],"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.000006437555,0.00006214873,0.000002512731,0.00004928486,0.00001276308,0.00001950528,0.0003363551,0.007017585,0.0003357533,0.01500582,0.0001709361,0.9769809],"study_design_scores_gemma":[0.000448856,0.0002975524,0.00002345668,0.0001868907,0.000008829905,0.00003634786,1.161042e-7,0.9129539,0.001398324,0.08014229,0.003865708,0.0006377012],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000053338,0.0003373069,0.9944032,0.0005908599,0.001942037,0.001034327,0.00003316069,0.0002114812,0.001442338],"genre_scores_gemma":[0.004439441,0.00005553902,0.9927676,0.0006169107,0.001109055,0.00005577368,0.0000421006,0.00004769874,0.0008658384],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9763432,"threshold_uncertainty_score":0.9996958,"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."}}