{"id":"W4306770764","doi":"10.1016/j.bpr.2022.100083","title":"Permissive and nonpermissive channel closings in CFTR revealed by a factor graph inference algorithm","year":2022,"lang":"en","type":"article","venue":"Biophysical Reports","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Defense Advanced Research Projects Agency; Oberlin College and Conservatory; National Sleep Foundation; National Science Foundation","keywords":"Closing (real estate); Cystic fibrosis transmembrane conductance regulator; Channel (broadcasting); Conductance; Transmembrane protein; Inference; Mutant; Patch clamp; Computer science; Algorithm; Graph; Biophysics; Electrophysiology; Cell biology; Biology; Neuroscience; Combinatorics; Mathematics; Artificial intelligence; Computer network; Cystic fibrosis; Theoretical computer science; Genetics; Gene","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.0001069975,0.000203796,0.0002548087,0.00006675703,0.0001517394,0.00002156631,0.00008735993,0.00009452082,0.000004375766],"category_scores_gemma":[0.0001178462,0.0001882942,0.0001082311,0.000235345,0.0001268209,0.000006220244,0.000240637,0.0001858313,2.818873e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003136326,"about_ca_system_score_gemma":0.00005524739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004928334,"about_ca_topic_score_gemma":0.000002179223,"domain_scores_codex":[0.9985306,0.00006880461,0.0003002876,0.0006187177,0.0002219251,0.0002596402],"domain_scores_gemma":[0.9993106,0.00001699471,0.0002048347,0.0003056147,0.00006495465,0.0000969839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002750422,0.0001535266,0.0006648733,0.000007168278,0.0000268208,0.0002040037,0.0000573481,0.000001980939,0.9877831,0.000007525834,0.0008390491,0.01022707],"study_design_scores_gemma":[0.0004851547,0.0009033463,0.005992338,0.00003893981,0.00004811276,0.0003787874,0.000243632,0.0005483674,0.9745717,0.001766308,0.01413956,0.0008837548],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9983095,0.0002280664,0.0008396138,0.0001398087,0.00005590288,0.0002062506,0.00008866955,0.00003445058,0.00009776067],"genre_scores_gemma":[0.9976403,0.0001205688,0.001198838,0.0002383524,0.00007824184,0.00004495596,0.0001780459,0.00001906356,0.0004815983],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01330051,"threshold_uncertainty_score":0.7678415,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007279270803058329,"score_gpt":0.2673321516593538,"score_spread":0.2600528808562954,"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."}}