{"id":"W4381891960","doi":"10.1101/2023.06.20.545769","title":"A method for storing information in DNA with improved dropout tolerance","year":2023,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Division of Electrical, Communications and Cyber Systems; Semiconductor Research Corporation; National Science Foundation","keywords":"Fountain code; Computer science; Decoding methods; Robustness (evolution); Encoding (memory); Code (set theory); Algorithm; Data loss; Chemistry; Hamming code; Database; Programming language; Artificial intelligence","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.0007524364,0.0003751716,0.0003817845,0.0001336875,0.00009145454,0.0001201796,0.000387018,0.0005233667,0.000001434537],"category_scores_gemma":[0.0002343571,0.0003327438,0.0001178583,0.0002352887,0.0000426427,0.00001463717,0.0004147002,0.0003429161,0.000006747174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008253196,"about_ca_system_score_gemma":0.0002562359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004708341,"about_ca_topic_score_gemma":0.00001161062,"domain_scores_codex":[0.9981921,0.00008310714,0.0004401918,0.0006709269,0.0001363308,0.0004773686],"domain_scores_gemma":[0.9986759,0.00004373174,0.0003131985,0.0005704869,0.0002898881,0.0001068329],"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.0001678543,0.00003804793,0.003762904,0.0003072782,0.00006796687,0.000004025701,0.000007482668,0.0007676033,0.9947014,0.00005850949,0.00008124716,0.00003562063],"study_design_scores_gemma":[0.00178605,0.000545931,0.03374855,0.0004973922,0.0000623578,3.354679e-8,0.0000122366,0.01870512,0.9226546,0.000006080391,0.02069261,0.001289053],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8835648,0.0001865724,0.1143675,0.000116355,0.0005126884,0.0009769558,0.000121983,0.000147453,0.000005659984],"genre_scores_gemma":[0.9410321,0.0000514656,0.05785459,0.0002001177,0.0004414981,0.0003508215,0.00000455833,0.00005662605,0.00000823203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07204687,"threshold_uncertainty_score":0.9999124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01502401563629735,"score_gpt":0.2476818417436764,"score_spread":0.232657826107379,"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."}}