{"id":"W1605220802","doi":"10.1007/11496656_1","title":"Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Simple (philosophy); Computer science; Scheme (mathematics); Abstraction; Approximation algorithm; Polynomial-time approximation scheme; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003852035,0.0002675238,0.000228647,0.0000846609,0.0001608382,0.0001312143,0.0003481919,0.000362572,0.000005705578],"category_scores_gemma":[0.00008119611,0.0002165615,0.00008960853,0.00003633508,0.0003664907,0.000007271574,0.0002925216,0.0001409195,0.000001103823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002559956,"about_ca_system_score_gemma":0.00008460556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001839905,"about_ca_topic_score_gemma":0.00002384419,"domain_scores_codex":[0.9984124,0.00001021357,0.0002397327,0.0008745309,0.0001288416,0.0003342835],"domain_scores_gemma":[0.9992583,0.00008385922,0.0001122219,0.0003047268,0.0001597962,0.00008113425],"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.00009205069,0.00004900842,0.0002650289,0.00008392458,0.00002143886,0.000001496334,0.00006537398,0.0007186163,0.05691537,0.0005509662,0.0001215803,0.9411151],"study_design_scores_gemma":[0.002986211,0.006180942,0.0005794596,0.0004692499,0.00006409663,0.0001411233,0.000001598955,0.7339098,0.06070751,0.05584448,0.1362318,0.00288371],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02830758,0.0004018765,0.9695857,0.0002722332,0.0004265179,0.0005920184,0.00003577824,0.00001841858,0.0003599114],"genre_scores_gemma":[0.6948571,0.00002370214,0.2992424,0.003041873,0.002029629,0.00003211418,0.0002137256,0.00004044986,0.0005190076],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9382314,"threshold_uncertainty_score":0.8831123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02308233954582812,"score_gpt":0.2727705525386923,"score_spread":0.2496882129928642,"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."}}