{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":430,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":430,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"466a6697232e","filters":{"topic":"DNA and Biological Computing"}},"results":[{"id":"W1600165002","doi":"10.1007/bf03037362","title":"The power of communication: P systems with symport/antiport","year":2002,"lang":"en","type":"article","venue":"New Generation Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":341,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane computing; Antiporter; Membrane; Symporter; Computer science; Computation; Power (physics); Theoretical computer science; Chemistry; Algorithm; Physics; Biochemistry; Transporter; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.02731062806746406,"gpt":0.2381451841888484,"spread":0.2108345561213844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441072,0.00008810431,0.00009404652,0.00001142123,0.000265259,0.00005322814,0.000195494,0.0000621731,0.00000783481],"category_scores_gemma":[0.00003232177,0.00005441851,0.00003579324,0.00008372973,0.00005633566,0.000002359263,0.00008697515,0.00006111377,0.000003371283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004982088,"about_ca_system_score_gemma":0.00002113325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001410411,"about_ca_topic_score_gemma":0.000009165897,"domain_scores_codex":[0.9992629,0.00007369887,0.0002515362,0.0001668633,0.000111707,0.0001332987],"domain_scores_gemma":[0.9993131,0.00002765713,0.0001752785,0.0003340374,0.0001104297,0.00003949683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009806572,0.0002715117,0.05269399,0.00003123923,0.0003961075,0.000007600393,0.0007636678,0.1008157,0.632755,0.01183045,0.09063451,0.1097021],"study_design_scores_gemma":[0.002568582,0.00279616,0.009577354,0.0001878781,0.00007200699,0.000208283,0.0007536699,0.5138672,0.1270363,0.00005794435,0.3416947,0.001179823],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9716328,0.003407291,0.0203798,0.0002770571,0.000193278,0.0001476781,8.537326e-7,0.00001921271,0.003942023],"genre_scores_gemma":[0.9968786,0.00008739776,0.001802816,0.00009861697,0.0003562881,0.000001252669,0.00002777431,0.000007520313,0.0007397908],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5057187,"threshold_uncertainty_score":0.2219122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1569419053","doi":"","title":"Fuzzy Automata and Languages: Theory and Applications","year":2002,"lang":"en","type":"book","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":296,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Tree-adjoining grammar; L-attributed grammar; Context-sensitive grammar; Embedded pushdown automaton; Probabilistic automaton; Context-free grammar; Indexed grammar; Mathematics; Nested word; Deterministic context-free grammar; Pushdown automaton; Quantum finite automata; Discrete mathematics; Automata theory; Computer science; Theoretical computer science; Finite-state machine; Programming language; Artificial intelligence; Rule-based machine translation; Automaton","retraction":null,"screen_n_in":null,"score":{"opus":0.007681325748701296,"gpt":0.2392440040577874,"spread":0.2315626783090861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001251973,0.0001437127,0.0001254499,0.00001778884,0.00005736773,0.00002378969,0.00009543158,0.0002914909,0.00003053123],"category_scores_gemma":[0.00001995941,0.0001051412,0.00003274167,0.00001170424,0.0001088661,5.829441e-7,0.0002137288,0.00008841281,0.00001363572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003696756,"about_ca_system_score_gemma":0.000014914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.798239e-7,"about_ca_topic_score_gemma":0.000001987376,"domain_scores_codex":[0.9993906,0.00003031909,0.0001014365,0.0003261673,0.00003890438,0.0001125911],"domain_scores_gemma":[0.9996629,0.00003374059,0.00004459777,0.0001868715,0.00001731197,0.00005459045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006000832,0.0001055272,0.000235543,0.0003198885,0.0003025212,0.00001596496,0.00004034394,8.540545e-7,0.04472754,0.2792638,0.1464765,0.5284516],"study_design_scores_gemma":[0.0001940766,0.0001504817,0.0001443069,0.00002067995,0.00003430794,0.0000386701,0.00003884372,0.000006032,0.0006145183,0.01020837,0.9882487,0.0003010178],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001239023,0.007347625,0.0007596163,0.00003496763,0.0000123072,0.0002029418,0.00002559628,0.00003868262,0.9903392],"genre_scores_gemma":[0.02215586,0.001726486,0.00060753,0.0006840994,0.0005908261,0.00002197963,0.0003808032,0.00002195236,0.9738105],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8417722,"threshold_uncertainty_score":0.4287535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984638028","doi":"10.1145/1400181.1400200","title":"The many facets of natural computing","year":2008,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":240,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Natural computing; Natural (archaeology); Computer science; Natural science; Bridge (graph theory); Human–computer interaction; Artificial intelligence; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.03992601041239598,"gpt":0.2933581590792394,"spread":0.2534321486668434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0001706433,0.00004701326,0.00006602568,0.000005754005,0.0003617983,0.000003249183,0.008626783,0.00003659467,4.9679e-7],"category_scores_gemma":[0.002231549,0.0000245711,0.00008363362,0.00007079241,0.0004264204,8.613417e-7,0.01054003,0.00009340594,9.677329e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002804058,"about_ca_system_score_gemma":0.00001835437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008649557,"about_ca_topic_score_gemma":0.000006425649,"domain_scores_codex":[0.9995289,0.0001098859,0.0001608671,0.00006736161,0.00005242254,0.00008060508],"domain_scores_gemma":[0.9925484,0.0001238221,0.0001306731,0.007108333,0.000078726,0.00001005187],"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.00002596413,0.0001022421,0.02495509,0.000009447167,0.00007799302,7.90843e-8,0.0001641398,0.00008108928,0.9559914,0.002270277,0.009727111,0.006595117],"study_design_scores_gemma":[0.0006661031,0.0002171846,0.3123756,0.00007752158,0.00003425198,0.00005006458,0.0004014896,0.002143012,0.5883613,0.007476895,0.08789672,0.0002998759],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9909633,0.003490188,0.00003410648,0.003966997,0.00006738194,0.0000773627,0.00000235377,0.000004486094,0.001393852],"genre_scores_gemma":[0.9927995,0.0003851877,0.006564028,0.00008077236,0.00001946174,0.000001073126,0.000007666677,0.000002887861,0.0001394851],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3676302,"threshold_uncertainty_score":0.9974625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068176031","doi":"10.1007/s11434-006-2012-5","title":"New field of cryptography: DNA cryptography","year":2006,"lang":"en","type":"article","venue":"Science Bulletin","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":184,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"Cryptography; DNA computing; Quantum cryptography; Financial cryptography; Computer science; Neural cryptography; Encryption; Theoretical computer science; Computer security; Public-key cryptography; Algorithm; Quantum information; Physics; Quantum","retraction":null,"screen_n_in":null,"score":{"opus":0.00445660488723027,"gpt":0.2319371019555044,"spread":0.2274804970682742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002583286,0.00009162371,0.00009298079,0.00007550287,0.00009841871,0.00002450475,0.0003688995,0.0000722745,0.0001126861],"category_scores_gemma":[0.00007521792,0.00007149283,0.0001057936,0.000380108,0.0002691368,0.000001481292,0.0001344995,0.00005136606,0.00000989577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002088032,"about_ca_system_score_gemma":0.00005056872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001088767,"about_ca_topic_score_gemma":0.000005734992,"domain_scores_codex":[0.9990814,0.000017235,0.0001634766,0.0003115776,0.0001660908,0.0002602745],"domain_scores_gemma":[0.9995883,0.00001569608,0.00004880763,0.0002090333,0.00006875992,0.00006939965],"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.00001770999,0.00002739465,0.01012413,0.00000326067,0.000002930198,6.963581e-7,0.000003185142,0.00001064876,0.9675636,0.00230114,0.012921,0.007024263],"study_design_scores_gemma":[0.0001516786,0.0004016914,0.01725743,0.00001056452,0.000004028176,0.000003286252,0.00001831018,0.000004953013,0.8478165,0.00182599,0.1323531,0.0001523971],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9669473,0.0003020792,0.0120626,0.0006115169,0.000142078,0.00007760221,0.000001784166,0.00001693278,0.01983815],"genre_scores_gemma":[0.9833394,0.00001120612,0.01600959,0.0003265943,0.0001915647,0.0000013423,0.000005135608,0.00000358703,0.0001115249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1197471,"threshold_uncertainty_score":0.2915393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966857768","doi":"10.1093/nar/gkg612","title":"RNAsoft: a suite of RNA secondary structure prediction and design software tools","year":2003,"lang":"en","type":"article","venue":"Nucleic Acids Research","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"RNA; Biology; Nucleic acid secondary structure; Protein secondary structure; Computational biology; Suite; DNA; Nucleic acid structure; Software; Software suite; Genetics; Computer science; Biochemistry; Gene; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.04990884701928244,"gpt":0.309198004975074,"spread":0.2592891579557915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007516564,0.0001025428,0.0001281938,0.00005525125,0.000141359,0.0000398433,0.0001647765,0.0002256819,0.0001071669],"category_scores_gemma":[0.0009741901,0.00008050686,0.00004014051,0.000154889,0.0002136543,0.000006347625,0.0001502298,0.0002796495,0.000002721325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001179097,"about_ca_system_score_gemma":0.00009263802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003817262,"about_ca_topic_score_gemma":0.000001562402,"domain_scores_codex":[0.9986566,0.0003244248,0.0001679231,0.0003204809,0.0002199753,0.0003106489],"domain_scores_gemma":[0.9993742,0.0000974334,0.0000378912,0.0002224015,0.0001767832,0.00009127553],"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.0000879851,0.00002661983,0.009588137,0.00003930977,0.0000281776,0.000003485823,0.00004229891,0.00001689767,0.9476723,0.0001586024,0.001288269,0.04104789],"study_design_scores_gemma":[0.0009993754,0.002113285,0.05317194,0.00004402173,0.00001115683,0.00005748899,0.0002002105,0.0001373053,0.9086519,0.002632353,0.03171971,0.0002612412],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9935812,0.0008046423,0.003957118,0.00002859707,0.00005188283,0.0002290066,0.00004997744,0.00001391916,0.001283604],"genre_scores_gemma":[0.9930351,0.0001041206,0.006396017,0.00004934614,0.0000874701,0.000005047597,0.00003592673,0.00001259547,0.0002743785],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0435838,"threshold_uncertainty_score":0.3282975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115404543","doi":"10.1016/j.tcs.2004.06.029","title":"Computationally universal P systems without priorities: two catalysts are sufficient","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":122,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catalysis; Symbol (formal); Reduction (mathematics); P system; Power (physics); Mathematics; Computer science; Membrane computing; Chemistry; Theoretical computer science; Algorithm; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.008116660906839171,"gpt":0.2500124413008852,"spread":0.241895780394046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516515,0.0001626664,0.0001672505,0.0000592576,0.0003067462,0.0001480238,0.0006537794,0.00006307913,0.000003316683],"category_scores_gemma":[0.00006039759,0.000125747,0.00006163567,0.0002858796,0.001880379,0.000009465584,0.0004936927,0.0001083311,0.00002254696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005558984,"about_ca_system_score_gemma":0.0001769064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001147418,"about_ca_topic_score_gemma":0.000001693233,"domain_scores_codex":[0.9983865,0.00006248296,0.0002064846,0.0005720118,0.0003625768,0.0004099439],"domain_scores_gemma":[0.9991895,0.00003174166,0.00007974706,0.0002886456,0.0002230526,0.0001873306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006376082,0.0001636107,0.001924293,0.00002093797,0.00001986625,0.00002970342,0.00020392,0.04930694,0.04432052,0.9027077,0.00003899377,0.001199742],"study_design_scores_gemma":[0.01398526,0.009818445,0.06383055,0.00114229,0.000161548,0.001550139,0.001597085,0.5941949,0.214873,0.08764955,0.005295689,0.005901458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6999958,0.00005327819,0.298553,0.0001140062,0.0003000649,0.0001189272,0.000004520223,0.00003749055,0.0008230142],"genre_scores_gemma":[0.9915766,0.000002576576,0.007759986,0.000290079,0.0003305064,0.000002128767,0.00001430538,0.000007565709,0.00001631526],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8150582,"threshold_uncertainty_score":0.6928335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124920465","doi":"10.1093/bib/bbp064","title":"Simulation of P systems with active membranes on CUDA","year":2009,"lang":"en","type":"article","venue":"Briefings in Bioinformatics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"CUDA; Computer science; Key (lock); Class (philosophy); Central processing unit; Membrane computing; Parallel computing; Computational science; Simulation; Computer architecture; Computer hardware; Operating system; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01213112504075233,"gpt":0.2458033272438325,"spread":0.2336722022030802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009746985,0.00009455544,0.0001293649,0.00003876332,0.00002586198,0.00001390088,0.00008942764,0.00009452985,0.000001014388],"category_scores_gemma":[0.0000873506,0.00006616077,0.00002698517,0.0000945897,0.00003305052,0.000005651057,0.00001899604,0.0000577402,0.000001748501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008147507,"about_ca_system_score_gemma":0.0000162232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001092701,"about_ca_topic_score_gemma":0.000001526757,"domain_scores_codex":[0.9994273,0.00001449804,0.0002381476,0.00009078042,0.00009905906,0.0001301688],"domain_scores_gemma":[0.9996215,0.00003441861,0.0001433592,0.000124068,0.00005306463,0.00002358695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009826735,0.000295311,0.001493153,0.0002907654,0.00005571101,0.000005188568,0.0007149181,0.8829049,0.03080109,0.001300738,0.0002268938,0.0809286],"study_design_scores_gemma":[0.00389133,0.008466813,0.02795498,0.0008346764,0.00003945495,0.00003645049,0.001090225,0.7240358,0.2115726,0.0003598126,0.02055036,0.001167496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9896766,0.00005962591,0.004916633,0.00008213025,0.00003283614,0.0001821672,0.000005840257,0.00001250647,0.005031683],"genre_scores_gemma":[0.9982182,0.00001421386,0.001178281,0.0004921447,0.00003322072,0.000001300966,0.00003144543,0.000003326238,0.00002786072],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1807715,"threshold_uncertainty_score":0.2697958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2257571149","doi":"10.1007/s11432-007-0025-6","title":"Symmetric-key cryptosystem with DNA technology","year":2007,"lang":"en","type":"article","venue":"Science in China Series F Information Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"DNA computing; Cryptosystem; Encryption; Computer science; Symmetric-key algorithm; Cryptography; Key encapsulation; Key (lock); Theoretical computer science; Public-key cryptography; Computer security; Algorithm; Computation","retraction":null,"screen_n_in":null,"score":{"opus":0.007562128177110418,"gpt":0.2532331923620461,"spread":0.2456710641849357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342311,0.0001036617,0.00009583017,0.00059906,0.0004179936,0.0001595496,0.0006800788,0.00008038605,0.000004680828],"category_scores_gemma":[0.0004004185,0.00006593825,0.00001705133,0.003764457,0.001541702,0.0001733326,0.0001978258,0.00008074871,0.00001060303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002690933,"about_ca_system_score_gemma":0.0001824812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001630556,"about_ca_topic_score_gemma":0.0000538285,"domain_scores_codex":[0.998658,0.0000120348,0.0002949216,0.0002389123,0.0003717642,0.0004243745],"domain_scores_gemma":[0.9994896,0.00001336754,0.0001397552,0.0001671263,0.00012846,0.00006169295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002664263,0.00009771224,0.4353499,0.00006488592,0.000008479699,0.00001018495,0.001628045,0.001600155,0.3216353,0.09128448,0.000129459,0.147925],"study_design_scores_gemma":[0.0007178301,0.003481187,0.3041856,0.00009676949,0.000003487056,0.0003049021,0.01208875,0.00127115,0.6399745,0.002463088,0.03458648,0.0008262224],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.968067,0.00002847312,0.004184044,0.0003410974,0.0001727747,0.000122491,0.000001254399,0.00002902303,0.02705384],"genre_scores_gemma":[0.9952534,0.000009398542,0.004523667,0.0001493769,0.00002890024,0.000003616181,0.000003141998,0.000001365217,0.00002712184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3183392,"threshold_uncertainty_score":0.5680465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404127378","doi":"","title":"Radio Number for Square Paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01060503079864784,"gpt":0.2571862683527507,"spread":0.2465812375541028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001213648,0.0001113016,0.0001130592,0.00000824845,0.0000839835,0.00001995975,0.0001549943,0.0001335406,0.00001249154],"category_scores_gemma":[0.00008132235,0.00009271209,0.0001031602,0.00005203139,0.0000219889,0.000001737555,0.00003622397,0.00005279386,0.00001690957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007945375,"about_ca_system_score_gemma":0.00001700149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000128396,"about_ca_topic_score_gemma":3.580246e-7,"domain_scores_codex":[0.9993097,0.00002535581,0.0001267584,0.0002519326,0.00005797188,0.0002283158],"domain_scores_gemma":[0.9996317,0.00001575462,0.00004162029,0.000188515,0.00006071952,0.00006169561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003470332,0.0006633173,0.02787535,0.00003754593,0.00009350957,0.00001507278,0.00007415121,0.00001684039,0.5399929,0.3029055,0.06568816,0.06229069],"study_design_scores_gemma":[0.004335893,0.003756652,0.03982483,0.0000411419,0.00004440972,0.00004190009,0.00006788209,0.000218312,0.2164943,0.4151842,0.3189203,0.001070203],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.995092,0.0001850188,0.0002132664,0.0002374819,0.0005413109,0.0001745395,0.000005623832,0.00002908254,0.003521623],"genre_scores_gemma":[0.9982395,0.00001600603,0.0006297178,0.0005703552,0.0000643774,0.000008410694,0.00007922555,0.000007940343,0.0003844983],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3234986,"threshold_uncertainty_score":0.3780689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076127862","doi":"10.1016/s0304-3975(02)00069-5","title":"Coding properties of DNA languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Saint Mary's University","funders":"","keywords":"DNA computing; Computation; Computer science; Decidability; Coding (social sciences); Theoretical computer science; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0133844404434226,"gpt":0.2452220632468246,"spread":0.231837622803402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005480988,0.00007388245,0.00009067196,0.00002401409,0.0000949007,0.00002497224,0.000307544,0.00003877519,0.00001412339],"category_scores_gemma":[0.0001889831,0.00004810714,0.00003693083,0.0001448349,0.001450232,0.000003086356,0.0001812813,0.00004403791,0.000004102043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000382589,"about_ca_system_score_gemma":0.00003424899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.184957e-7,"about_ca_topic_score_gemma":1.129833e-7,"domain_scores_codex":[0.9992253,0.00006165299,0.000119203,0.0002472771,0.0001333504,0.0002132709],"domain_scores_gemma":[0.9996327,0.00001315616,0.00003065576,0.0001886628,0.00007294019,0.00006190827],"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.000006731809,0.00001901584,0.0002233731,0.000005389246,0.000002089598,6.688813e-7,0.00002188912,0.00001054419,0.7209356,0.2767903,0.000007141777,0.00197718],"study_design_scores_gemma":[0.00008963302,0.0002246479,0.0003129285,0.00001764439,0.000002197266,0.0000118618,0.0000203833,0.0009231956,0.9962854,0.001781253,0.000237627,0.00009327085],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9452799,0.000114343,0.04874806,0.00003524224,0.00008700279,0.00005161571,4.98153e-7,0.00001198958,0.005671376],"genre_scores_gemma":[0.993782,0.000004870116,0.0059824,0.0001527442,0.00006037988,9.234904e-7,6.131764e-7,0.000003078505,0.00001293874],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2753497,"threshold_uncertainty_score":0.534344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029929198","doi":"10.1016/j.jfranklin.2009.07.002","title":"Cyclic DNA codes over the ring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy=\"false\">[</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy=\"false\">]</mml:mo><mml:mo>/</mml:mo><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math> based on the deletion distance","year":2009,"lang":"lv","type":"article","venue":"Journal of the Franklin Institute","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Ring (chemistry); Set (abstract data type); Mathematics; DNA; Similarity (geometry); Minimum distance; Combinatorics; Genetics; Discrete mathematics; Computer science; Biology; Artificial intelligence; Chemistry; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0160574690519091,"gpt":0.2378533661460158,"spread":0.2217958970941067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.008771225,0.004072046,0.001631836,0.002133876,0.007515784,0.006499058,0.01118918,0.009794826,0.3242693],"category_scores_gemma":[0.008164596,0.006963028,0.009077261,0.004813797,0.007657687,0.003297031,0.007373367,0.008695007,0.003210102],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001321766,"about_ca_system_score_gemma":0.005885225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004582636,"about_ca_topic_score_gemma":0.005283067,"domain_scores_codex":[0.9640849,0.003017642,0.007901701,0.006674925,0.009297553,0.00902326],"domain_scores_gemma":[0.9717763,0.00543432,0.01011012,0.007046131,0.001180914,0.00445222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00946534,0.001947162,0.0001059686,0.002867545,0.008613097,0.004822872,0.003231435,0.01452357,0.018311,0.3760425,0.5495569,0.01051258],"study_design_scores_gemma":[0.007384841,0.007128296,0.0002630239,0.004879054,0.006369747,0.00575434,0.004488538,0.02199301,0.9134761,0.003004906,0.01863276,0.006625396],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6921914,0.007029356,0.002749779,0.003553884,0.009654577,0.0002829922,0.00243635,0.0008105609,0.2812911],"genre_scores_gemma":[0.962236,0.006698239,0.003870583,0.006823264,0.009882272,0.002925453,0.004233356,0.002842306,0.0004885505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8951651,"threshold_uncertainty_score":0.9997505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297474248","doi":"10.3390/s22197332","title":"Best Fit DNA-Based Cryptographic Keys: The Genetic Algorithm Approach","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Cryptography; Crossover; Computer science; Key space; Redundancy (engineering); Population; Theoretical computer science; Key (lock); ENCODE; DNA computing; Algorithm; Biology; Computer security; Genetics; Artificial intelligence; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.01914973559302962,"gpt":0.2314581414857692,"spread":0.2123084058927396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002002069,0.0001416463,0.0001051083,0.0000313924,0.0003953484,0.00002393798,0.0003289438,0.0000706863,0.00005126926],"category_scores_gemma":[0.00003371363,0.00009674076,0.0001457702,0.0002006381,0.0001169215,4.906069e-7,0.0002177248,0.0001755011,0.000009125092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000827744,"about_ca_system_score_gemma":0.00002622996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001589096,"about_ca_topic_score_gemma":0.000001079185,"domain_scores_codex":[0.9988415,0.0002089221,0.0001513018,0.0003564881,0.0001626148,0.0002791788],"domain_scores_gemma":[0.9994929,0.00002346497,0.00006051681,0.0003301015,0.00003970987,0.00005328696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004381615,0.002505098,0.02133261,0.0001090011,0.0006191217,0.000148646,0.0004231656,0.2372169,0.4372965,0.0004397834,0.01424681,0.2852242],"study_design_scores_gemma":[0.002456671,0.00370125,0.01638802,0.0000147023,0.0001527542,0.0002410074,0.002690896,0.1427276,0.05201985,0.0004580614,0.7774496,0.001699597],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.994624,0.0006135272,0.002062492,0.0002717286,0.0001559784,0.0001998242,0.00002372355,0.00002557588,0.002023191],"genre_scores_gemma":[0.9922282,0.00001853336,0.005647791,0.001286867,0.000252511,0.00003643803,0.00008049581,0.00001658988,0.0004325754],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7632028,"threshold_uncertainty_score":0.3944974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122157334","doi":"10.1007/978-1-4471-0313-4_15","title":"On P Systems with Active Membranes","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane; Computer science; Chemistry; Biochemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.01441057272753299,"gpt":0.2162483272682789,"spread":0.201837754540746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004237543,0.0002609633,0.0002188007,0.00002605852,0.0000477924,0.00002147193,0.0001412289,0.0003968997,0.0001317883],"category_scores_gemma":[0.000008334849,0.0001544333,0.00008211487,0.000009040724,0.0000601654,5.067187e-7,0.00006323271,0.0001446245,0.00006192819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001011745,"about_ca_system_score_gemma":0.00002477856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007574848,"about_ca_topic_score_gemma":0.000008141411,"domain_scores_codex":[0.999171,0.0000114025,0.0001259844,0.0004157587,0.0001108882,0.0001649599],"domain_scores_gemma":[0.9995272,0.00001812235,0.00009236691,0.0002445657,0.00005990066,0.00005789813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.005822337,0.0003994315,0.0001238937,0.0006956134,0.003528251,0.0007668191,0.00004684064,0.00197265,0.08221767,0.749036,0.04759871,0.1077918],"study_design_scores_gemma":[0.0003462259,0.001838011,0.00001241068,0.0001518801,0.0000388926,0.00007479161,0.00001420397,0.0000200731,0.005771399,0.0007664899,0.9903971,0.0005685434],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.004039946,0.0004048852,0.0002325963,0.00002704655,0.0001159596,0.0001897404,0.00001434425,0.00002681921,0.9949487],"genre_scores_gemma":[0.2102757,0.0002299841,0.00003874476,0.000324593,0.0005021903,0.000005230584,0.0002140109,0.00003385173,0.7883757],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9427984,"threshold_uncertainty_score":0.6297607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007496476","doi":"10.1016/j.biosystems.2007.06.002","title":"DNA approach to solve clustering problem based on a mutual order","year":2007,"lang":"en","type":"article","venue":"Biosystems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Universiti Malaysia Pahang","keywords":"Cluster analysis; Computer science; Data mining; Correlation clustering; Clustering high-dimensional data; CURE data clustering algorithm; Fuzzy clustering; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01746398095476364,"gpt":0.2456237060203725,"spread":0.2281597250656088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052106,0.000162738,0.0001452703,0.00004873856,0.0000785129,0.00003203496,0.000191184,0.0001769118,0.000003140241],"category_scores_gemma":[0.00005072457,0.0001215945,0.00006916644,0.0001586337,0.00001981966,0.000001108012,0.0001063162,0.00006919818,0.00003420962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000190194,"about_ca_system_score_gemma":0.00002466199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001306042,"about_ca_topic_score_gemma":0.0000165165,"domain_scores_codex":[0.9988307,0.00002837404,0.0002310206,0.00041802,0.0001323085,0.0003596175],"domain_scores_gemma":[0.9994851,0.00001548295,0.00005670972,0.0002520653,0.000061573,0.0001290378],"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.0002959587,0.0002348107,0.00148466,0.00009872505,0.00003076769,0.000006770733,0.00006115662,0.001041185,0.9892525,0.0001814247,0.001861102,0.005450908],"study_design_scores_gemma":[0.003115492,0.005369719,0.005825501,0.0003392397,0.00003561967,0.00008130785,0.0007999436,0.02484988,0.5274603,0.00002038237,0.4300669,0.002035608],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7732749,0.00006861405,0.1721507,0.00008426154,0.0003306297,0.0006250252,0.00001001451,0.00006661096,0.05338921],"genre_scores_gemma":[0.9873678,5.531042e-7,0.01102673,0.0007017359,0.0005533703,0.00001381164,0.00005407225,0.00001632758,0.0002655623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4617922,"threshold_uncertainty_score":0.4958479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975121090","doi":"10.1142/s012905410200145x","title":"COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Membrane; Membrane computing; Computer science; Theoretical computer science; Mathematics; Chemistry; Biochemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.01656679589912971,"gpt":0.2873662264388591,"spread":0.2707994305397294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581137,0.0000512804,0.0001056979,0.0001306976,0.00003854887,0.00003090209,0.0008763404,0.00003125277,0.000009299725],"category_scores_gemma":[0.00009750245,0.00004392966,0.00005397829,0.0001952859,0.0002700798,0.00002485871,0.0001933949,0.00007304492,3.692078e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001530637,"about_ca_system_score_gemma":0.00003199354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000796216,"about_ca_topic_score_gemma":0.000002416974,"domain_scores_codex":[0.9991003,0.0000439861,0.0004347512,0.0000936727,0.0002447288,0.00008252623],"domain_scores_gemma":[0.9987603,0.00005865084,0.0004212433,0.0001218925,0.0006104989,0.00002735286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000854017,0.0008821895,0.03896292,0.00001939153,0.0001266898,0.000004750249,0.000559059,0.1253483,0.5671337,0.002076629,0.001231111,0.2635699],"study_design_scores_gemma":[0.002264878,0.001161598,0.05757055,0.0004591375,0.00001882349,0.0002188441,0.00009150309,0.7949262,0.1352269,0.001209429,0.006461428,0.0003907458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8264701,0.0004541314,0.1722279,0.0002677574,0.0002854776,0.00002891791,0.00000142521,0.00000140565,0.0002628473],"genre_scores_gemma":[0.985552,0.0001616701,0.01410934,0.00006800493,0.00009459553,1.452845e-7,0.000005428969,0.000001847387,0.0000069931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6695778,"threshold_uncertainty_score":0.17914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2796415147","doi":"10.1021/acssynbio.7b00363","title":"MIDAS: A Modular DNA Assembly System for Synthetic Biology","year":2018,"lang":"en","type":"article","venue":"ACS Synthetic Biology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministry of Business, Innovation and Employment; Fulbright New Zealand; Alberta Agricultural Research Institute; University of Canterbury","keywords":"Synthetic biology; Modular design; Computational biology; Biology; DNA; Computer science; Genetics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01781519051785452,"gpt":0.2726757459853574,"spread":0.2548605554675029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007167763,0.0003982461,0.0005090867,0.00009104604,0.0002945877,0.00002915637,0.0006737655,0.0008144089,0.00002753818],"category_scores_gemma":[0.0005555154,0.0003034151,0.0002505353,0.0001376701,0.0007119444,0.000003523307,0.0003556129,0.0001361142,0.00009454263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003504666,"about_ca_system_score_gemma":0.00007848771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002143565,"about_ca_topic_score_gemma":0.00001263706,"domain_scores_codex":[0.9970824,0.0003370439,0.0005084833,0.001088167,0.00006458109,0.0009193927],"domain_scores_gemma":[0.9984572,0.0001782484,0.0002154918,0.0007506871,0.0002457511,0.0001526426],"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.0001458138,0.00007415297,0.0006351104,0.00004903467,0.0001139702,0.000001799996,0.00001818216,0.000002063942,0.9785691,0.008250652,0.0002608955,0.01187923],"study_design_scores_gemma":[0.0009891673,0.004054856,0.0003273185,0.00008795944,0.00009876907,0.0001679993,0.0001419096,0.0006609891,0.8451893,0.002438373,0.1450664,0.0007769191],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9612679,0.0008474402,0.03221012,0.0005559818,0.001215982,0.0006005457,0.0001013589,0.0001293613,0.003071301],"genre_scores_gemma":[0.9953697,0.0000393387,0.002247148,0.0005793737,0.001194129,0.0001217139,0.0001889831,0.00004482135,0.0002147749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1448055,"threshold_uncertainty_score":0.9999418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2471342003","doi":"","title":"On the design of codes for DNA computing","year":2006,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; DNA computing; Nucleic acid secondary structure; Code word; Hadamard transform; DNA; Computation; Algorithm; Theoretical computer science; Mathematics; Genetics; Biology; Decoding methods; RNA","retraction":null,"screen_n_in":null,"score":{"opus":0.0248825918359308,"gpt":0.2518797054783427,"spread":0.2269971136424118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002165265,0.00005404521,0.00006069065,0.000005593021,0.00005580464,0.000006332,0.00009907737,0.00004525817,0.000006040671],"category_scores_gemma":[0.00007204076,0.00002798635,0.00004783291,0.00002347806,0.00003760297,2.148163e-7,0.00003426118,0.00001896821,0.000001131014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001444577,"about_ca_system_score_gemma":0.000006928352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004708556,"about_ca_topic_score_gemma":0.000001319855,"domain_scores_codex":[0.999621,0.00003514024,0.00009980806,0.000111137,0.00003210378,0.0001008647],"domain_scores_gemma":[0.9996772,0.000152179,0.00003972379,0.00008981187,0.00003289515,0.000008198676],"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.00005114212,0.00004315866,0.0003226082,0.000004718048,0.00001103319,1.172872e-7,0.000002241547,0.00183041,0.9706056,0.01936537,0.006156282,0.001607367],"study_design_scores_gemma":[0.0002103514,0.0005709702,0.001075627,0.000007533698,0.000004824684,0.000001096405,0.00001926595,0.00502375,0.9863544,0.003848947,0.002795773,0.00008743129],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7075588,0.00003839806,0.2890908,0.0001192575,0.00002670284,0.000145283,0.000002401882,0.00000681056,0.003011602],"genre_scores_gemma":[0.9943681,0.000001182006,0.004937637,0.0003102941,0.0001063619,0.000002327371,0.00001402993,0.000003420697,0.0002566543],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2868094,"threshold_uncertainty_score":0.114125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007924435","doi":"10.1016/j.biosystems.2006.12.009","title":"Stochastic P systems and the simulation of biochemical processes with dynamic compartments","year":2007,"lang":"en","type":"review","venue":"Biosystems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Computer science; Biological system; Computational biology; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.04052884215604588,"gpt":0.3331897729596532,"spread":0.2926609308036073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003644652,0.0002819231,0.0008658959,0.00004227737,0.00005772851,0.00003148191,0.0002072363,0.0002951405,3.828144e-7],"category_scores_gemma":[0.0001207752,0.0001326066,0.000104231,0.0001671792,0.0002121233,0.000001313366,0.0001019741,0.00009640524,0.000001782663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001486624,"about_ca_system_score_gemma":0.000101219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008602227,"about_ca_topic_score_gemma":0.000003887741,"domain_scores_codex":[0.9986531,0.0001377794,0.0005051701,0.0003615743,0.0001513218,0.0001910871],"domain_scores_gemma":[0.9988838,0.0002214704,0.0004737926,0.0002538672,0.000117659,0.00004944911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002649743,0.0009320372,0.0002439849,0.5085522,0.00605933,0.00003251799,0.0002441909,0.008115074,0.002902754,0.0005952376,0.0005817548,0.4690911],"study_design_scores_gemma":[0.00282809,0.001121839,0.000009998179,0.03530569,0.00140695,0.0003263622,0.0001554989,0.005959193,0.0001418737,0.000006783177,0.9514536,0.001284138],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.00340145,0.9924988,0.00277066,0.000001670053,0.0001241728,0.001090818,0.00003971758,0.0000117402,0.00006102335],"genre_scores_gemma":[0.572748,0.4267789,0.00001915622,0.000004543878,0.000144123,0.0000324855,0.0002089539,0.00001878164,0.00004498652],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9508718,"threshold_uncertainty_score":0.5407542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1876472356","doi":"10.1007/978-3-540-77962-9_29","title":"Watson-Crick Conjugate and Commutative Words","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Mathematics; Watson; Commutative property; Palindrome; Conjugacy class; Combinatorics on words; Complementarity (molecular biology); Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; DNA; Computer science; Genome; Word (group theory); Base pair","retraction":null,"screen_n_in":null,"score":{"opus":0.01654321535526889,"gpt":0.2488950887281109,"spread":0.232351873372842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000249341,0.0003097064,0.000292366,0.0001006872,0.0001877465,0.0000673844,0.0005105164,0.0003038897,0.000007927758],"category_scores_gemma":[0.00006863508,0.0002398291,0.00006848371,0.00009930879,0.001096837,0.000004973096,0.0007832084,0.0003655875,0.000006875389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002745501,"about_ca_system_score_gemma":0.0001033165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000871416,"about_ca_topic_score_gemma":0.00002076272,"domain_scores_codex":[0.9984019,0.00002880678,0.0002304891,0.0007911096,0.0002010533,0.000346684],"domain_scores_gemma":[0.9992565,0.00009387356,0.0001140757,0.0003427634,0.00009436952,0.00009842425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008215359,0.00005159713,0.001071972,0.00005153807,0.00005677488,0.0001605983,0.0007788771,0.003017661,0.02511436,0.0005643967,0.0002788569,0.9687712],"study_design_scores_gemma":[0.006983797,0.01331876,0.01008617,0.002673028,0.0001756716,0.003382291,0.00001175803,0.1350547,0.2881127,0.1522627,0.3748598,0.01307875],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05795136,0.004761296,0.9247476,0.0004656994,0.000791026,0.0004349116,0.00001909718,0.00004876824,0.01078019],"genre_scores_gemma":[0.969494,0.0005822536,0.02697473,0.001802458,0.0005019294,0.000002650675,0.00003622541,0.00002198639,0.0005837358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9556925,"threshold_uncertainty_score":0.9779946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132853600","doi":"10.1007/s11047-009-9131-2","title":"Watson–Crick palindromes in DNA computing","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Palindrome; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Catenation; Context (archaeology); Set (abstract data type); Mathematics; Combinatorics; Watson; Theory of computation; DNA computing; Sequence (biology); Discrete mathematics; Algebra over a field; Pure mathematics; DNA; Computer science; Base pair; Genome; Algorithm; Genetics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.009755713941148563,"gpt":0.2680295968948341,"spread":0.2582738829536856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004116195,0.0002371892,0.0002585881,0.00007321465,0.0001585633,0.00005612649,0.0003399627,0.0001997217,0.000004464383],"category_scores_gemma":[0.0001818214,0.0001951079,0.0001283602,0.0002687165,0.00004118183,0.000004738548,0.0002217588,0.000372828,0.00001073174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002744536,"about_ca_system_score_gemma":0.00002326925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008610288,"about_ca_topic_score_gemma":0.000005542599,"domain_scores_codex":[0.9982749,0.0001095784,0.0003791334,0.0005248373,0.0001555329,0.0005560833],"domain_scores_gemma":[0.9994802,0.00005385555,0.0001170491,0.000209092,0.00006439837,0.00007535938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00009925798,0.0001733926,0.03437433,0.00002586581,0.00003470771,0.00007333833,0.0002322474,0.001663635,0.6028205,0.0004869472,0.0008777467,0.359138],"study_design_scores_gemma":[0.003868526,0.001934174,0.7600059,0.0004131301,0.00003097729,0.0003281208,0.0004743697,0.07741291,0.1393738,0.001557942,0.01215923,0.002440958],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9956164,0.001176585,0.0008656583,0.0003350701,0.0003516886,0.0001398245,9.075222e-7,0.00006592453,0.001447942],"genre_scores_gemma":[0.9947191,0.00001005545,0.003267147,0.001275103,0.0005893886,2.641203e-7,0.00005482808,0.00001105346,0.00007308762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7256316,"threshold_uncertainty_score":0.7956269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025553490","doi":"10.1007/s00236-003-0118-7","title":"Sticky-free and overhang-free DNA languages","year":2003,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"DNA computing; Theory of computation; Computer science; Computation; DNA; Theoretical computer science; Set (abstract data type); Algorithm; Programming language; Genetics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.006728166659572096,"gpt":0.2258984392369812,"spread":0.2191702725774091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001513986,0.0001079653,0.0000999534,0.00001834396,0.00006750847,0.00003824859,0.0002386092,0.0001027191,0.00004337633],"category_scores_gemma":[0.0009195181,0.00007965577,0.00003552805,0.00004292066,0.00006051354,0.000007320071,0.0002629881,0.00006387734,0.00001127716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003735244,"about_ca_system_score_gemma":0.00001675885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002615863,"about_ca_topic_score_gemma":0.000003515768,"domain_scores_codex":[0.9994167,0.00002415635,0.0001632872,0.0001117478,0.00007792685,0.0002061762],"domain_scores_gemma":[0.9994231,0.00002845526,0.00005159167,0.0003996972,0.00002515558,0.00007196227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002092716,0.0003009429,0.01654859,0.0004788756,0.0003888628,0.00003149986,0.001332939,0.00001452859,0.7261154,0.03596305,0.1688535,0.04976255],"study_design_scores_gemma":[0.003252263,0.001344404,0.01568864,0.00006740274,0.00006468262,0.000199709,0.001660466,0.0002864289,0.2134247,0.004610469,0.7583234,0.001077509],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9171472,0.0002361092,0.0003170804,0.0001880214,0.00005550247,0.00009697217,0.00001308376,0.00002235703,0.08192363],"genre_scores_gemma":[0.9958327,0.000051764,0.002753534,0.0009317757,0.00005948732,0.000003832521,0.00002691802,0.000005615203,0.0003343622],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5894699,"threshold_uncertainty_score":0.3248268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964440534","doi":"10.1023/b:joco.0000017385.39168.0d","title":"Exordium for DNA Codes","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Los Alamos National Laboratory; Francis Crick Institute; Alexander von Humboldt-Stiftung; University of California Berkeley; Laboratory Directed Research and Development; U.S. Department of Energy; University of Calgary; National Science Foundation","keywords":"Generalization; Computer science; Sequence (biology); DNA; Code (set theory); Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Genetics; Biology; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01075103160510034,"gpt":0.2501131395328206,"spread":0.2393621079277203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003822153,0.00006899444,0.0001240512,0.00002591773,0.00005493814,0.00002262951,0.00008886426,0.0001003347,0.000009182059],"category_scores_gemma":[0.0005408352,0.00005389616,0.00009978793,0.00005336638,0.00001852128,0.000004576261,0.00001300041,0.00004595046,3.974931e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009653948,"about_ca_system_score_gemma":0.00005526712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.176587e-7,"about_ca_topic_score_gemma":3.197184e-8,"domain_scores_codex":[0.9994265,0.00006439771,0.0002454811,0.00008099495,0.00008017452,0.0001024921],"domain_scores_gemma":[0.9993358,0.00002697658,0.0002248306,0.00006336443,0.0003032368,0.00004584814],"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.002094639,0.001044104,0.004616851,0.00007497233,0.00038428,0.0000100774,0.00008167446,0.2952661,0.6199534,0.05717559,0.01627936,0.003018933],"study_design_scores_gemma":[0.01102222,0.008321178,0.0004243408,0.00006831453,0.0001550513,0.0001502666,0.000130644,0.006596649,0.7087536,0.01785814,0.2457954,0.0007242156],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3380109,0.0004237225,0.6544119,0.0001447946,0.004945365,0.0002274273,0.000003578368,0.000007962456,0.001824367],"genre_scores_gemma":[0.9641097,0.00004821453,0.03507593,0.00007387558,0.0006160513,0.000001592699,0.00001325833,0.000008111192,0.00005325101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6260989,"threshold_uncertainty_score":0.2197822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989600529","doi":"10.1186/s13036-019-0211-2","title":"High capacity DNA data storage with variable-length Oligonucleotides using repeat accumulate code and hybrid mapping","year":2019,"lang":"en","type":"article","venue":"Journal of Biological Engineering","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National University Health System; Nanyang Technological University; National University of Singapore; University of Alberta","keywords":"Computer science; Coding (social sciences); Computer data storage; Algorithm; Oligonucleotide; DNA; Computer hardware; Biology; Mathematics; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.04411487236689308,"gpt":0.2336495960399167,"spread":0.1895347236730237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899816,0.0001958802,0.0003377081,0.00004938314,0.00005090287,0.00004767137,0.0003603944,0.0001309504,0.00001147234],"category_scores_gemma":[0.0002540002,0.0001217827,0.00005028182,0.00008701958,0.00005359537,0.00002139906,0.0003682428,0.0002556085,9.047611e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001830526,"about_ca_system_score_gemma":0.00002376003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006398351,"about_ca_topic_score_gemma":2.936743e-7,"domain_scores_codex":[0.9988813,0.0000524489,0.0003508005,0.0003303182,0.0001070567,0.0002780991],"domain_scores_gemma":[0.9992206,0.0000639893,0.0002168445,0.0002960694,0.00008627369,0.0001162099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001008975,0.00002841884,0.0053659,0.00003257372,0.000112264,0.0000316494,0.000007012663,0.02784275,0.9657225,0.00007480939,0.00001599295,0.0006652062],"study_design_scores_gemma":[0.009655558,0.01101911,0.1247696,0.002011262,0.0003762346,0.008867965,0.0003905669,0.4286828,0.3549455,0.0005590288,0.05443985,0.004282573],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9707991,0.0003500191,0.02848403,0.00002546348,0.0001849098,0.00008559526,0.00002457555,0.00001562066,0.00003069619],"genre_scores_gemma":[0.9607092,0.0001020559,0.03876472,0.00008046364,0.0002988723,2.864044e-7,0.00002401992,0.00001295708,0.000007406124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.610777,"threshold_uncertainty_score":0.4966155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163677685","doi":"10.1016/s0304-3975(99)00100-0","title":"Using DNA to solve the Bounded Post Correspondence Problem","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Bounded function; Mathematics; Combinatorics; DNA; Discrete mathematics; Algorithm; Computer science; Algebra over a field; Genetics; Biology; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01483284745428979,"gpt":0.2743296738512333,"spread":0.2594968263969435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774105,0.0001442727,0.0001099482,0.00003022297,0.0005141933,0.0001941062,0.001070297,0.00006292429,0.0001550209],"category_scores_gemma":[0.00008023465,0.00008518716,0.00006057572,0.0004068564,0.00180589,0.000007479407,0.0005269754,0.0001120329,0.00008573355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001674039,"about_ca_system_score_gemma":0.00009513211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004687497,"about_ca_topic_score_gemma":0.000001253384,"domain_scores_codex":[0.9984581,0.00006972598,0.0001753936,0.0005371083,0.0002725337,0.0004871255],"domain_scores_gemma":[0.9991978,0.00005092921,0.0000276571,0.0004161453,0.0001261341,0.0001813828],"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.0002153752,0.00007756962,0.0001180666,0.00000446068,0.000008420063,0.000008406935,0.000197747,0.001098043,0.7639918,0.1668622,0.0001500296,0.06726786],"study_design_scores_gemma":[0.001378258,0.007392548,0.01099049,0.000216948,0.00006037419,0.0007443607,0.0001237425,0.241604,0.6034977,0.09922866,0.0322343,0.002528566],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8707327,0.00002184186,0.1249526,0.0006028375,0.0001359019,0.000187689,0.000002241464,0.00002397974,0.003340252],"genre_scores_gemma":[0.9600326,0.000002229022,0.03647022,0.003180575,0.0002529123,0.000002953921,0.000002193131,0.000006396311,0.00004991404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.240506,"threshold_uncertainty_score":0.6653879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1760096751","doi":"10.1007/s00200-013-0188-x","title":"Construction of cyclic codes over $$\\mathbb F _2+u\\mathbb F _2$$ F 2 + u F 2 for DNA computing","year":2013,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Complement (music); BCH code; Ring (chemistry); Constraint (computer-aided design); Combinatorics; Construct (python library); Physics; Mathematics; DNA; Discrete mathematics; Computer science; Chemistry; Decoding methods; Algorithm; Biology; Genetics; Computer network; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.005864888415478002,"gpt":0.222129005381761,"spread":0.216264116966283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689612,0.0001888551,0.0002762585,0.00007023977,0.0001318166,0.0000511094,0.0003168434,0.0001559249,0.000004817416],"category_scores_gemma":[0.0000862829,0.0001882797,0.00006996591,0.0001708673,0.00008991265,0.00001177468,0.0003708727,0.0001574433,0.000001746514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001609183,"about_ca_system_score_gemma":0.00001348457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000062037,"about_ca_topic_score_gemma":0.000003473293,"domain_scores_codex":[0.9988177,0.00004767682,0.0004588353,0.0003058409,0.00007744122,0.0002925475],"domain_scores_gemma":[0.9990753,0.0002025706,0.000181403,0.0003960157,0.00008293645,0.00006180296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003153251,0.0001582141,0.01908369,0.0003711211,0.00009602129,3.3233e-7,0.000247963,0.01300049,0.8718743,0.01693973,0.0001895074,0.07800703],"study_design_scores_gemma":[0.002359797,0.0003577376,0.05248215,0.0004499329,0.00003847273,0.00004716511,0.0005868829,0.7893831,0.1443535,0.002909782,0.005987165,0.001044261],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9230404,0.0007011488,0.07542243,0.00007669683,0.00004813806,0.0004142293,0.000003077229,0.00005245552,0.0002413967],"genre_scores_gemma":[0.9582009,0.0001045946,0.04138577,0.00009871869,0.00007572564,0.00002744738,0.00007704314,0.00002078823,0.000008968605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7763826,"threshold_uncertainty_score":0.7677824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1875480853","doi":"10.1007/3-540-45711-9_21","title":"Codes, Involutions, and DNA Encodings","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"DNA computing; Computer science; Computation; DNA; Theoretical computer science; Encoding (memory); Algorithm; Computational problem; Artificial intelligence; Biology; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.01680504986024873,"gpt":0.2307862610184788,"spread":0.2139812111582301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002670503,0.0002486451,0.0002154007,0.0001096465,0.0001515439,0.00008147669,0.0004343622,0.0003254694,0.00001561136],"category_scores_gemma":[0.00007881568,0.0002031296,0.00005681673,0.00008439679,0.0006176945,0.000004523711,0.0005952103,0.0002651298,0.000007267051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003120179,"about_ca_system_score_gemma":0.00005734069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005518017,"about_ca_topic_score_gemma":0.00001759498,"domain_scores_codex":[0.9985265,0.00001506565,0.0002049938,0.0007686951,0.0001784747,0.0003062306],"domain_scores_gemma":[0.9993961,0.00004880047,0.00009179783,0.0003066512,0.00006843737,0.00008817276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003115786,0.00006933322,0.001876881,0.00008783174,0.00004421112,0.00006435415,0.0001820593,0.001826682,0.1236412,0.0055022,0.0005296604,0.8661444],"study_design_scores_gemma":[0.003095262,0.005822981,0.005738621,0.002167,0.0001402414,0.00119727,0.00000216609,0.1697756,0.1729793,0.2337521,0.3969505,0.00837896],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03388349,0.005079207,0.9480466,0.0004789258,0.0007864065,0.0003557397,0.00001833877,0.00005573966,0.01129551],"genre_scores_gemma":[0.9658328,0.0004888393,0.03035083,0.001565392,0.0007370909,0.000002672794,0.00003083031,0.0000198181,0.0009717701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9319493,"threshold_uncertainty_score":0.8283384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1892760407","doi":"10.1109/spire.1999.796577","title":"Circular contextual insertions/deletions with applications to biomolecular computation","year":2003,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computation; Rewriting; DNA computing; Computer science; DNA; Circular DNA; Theoretical computer science; Algorithm; Genetics; Biology; Genome; Programming language; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.01628470030553776,"gpt":0.2649685206745533,"spread":0.2486838203690156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001003186,0.0001101177,0.00008434238,0.00003871315,0.0001472577,0.0000270632,0.00009029153,0.00007337157,0.00002053352],"category_scores_gemma":[0.00003943289,0.00008452669,0.00004564768,0.0002258886,0.0000468998,0.000001814748,0.00003061556,0.00004431726,0.00005232477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009229469,"about_ca_system_score_gemma":0.00003884183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006559467,"about_ca_topic_score_gemma":0.000009762657,"domain_scores_codex":[0.9992341,0.00005834173,0.0001381338,0.0003098622,0.00008186779,0.0001777271],"domain_scores_gemma":[0.9995523,0.00000951008,0.00003088251,0.0001801215,0.0001229773,0.0001041831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002247914,0.0001503308,0.001987543,0.000006423214,0.00004979171,0.000002418825,0.00001500321,0.001084164,0.9805716,0.01126808,0.0007880324,0.004054163],"study_design_scores_gemma":[0.001406704,0.001725745,0.00525681,0.00001983604,0.00005273331,0.0001292604,0.0003769035,0.0003930727,0.3584885,0.001068636,0.630164,0.000917821],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2836947,0.00007389341,0.710059,0.0001628909,0.00001671253,0.0002901334,0.000003508123,0.0000291661,0.005669978],"genre_scores_gemma":[0.9805738,0.000004087713,0.01765195,0.001315263,0.00004059126,0.00008031847,0.0001068263,0.00001022612,0.0002168806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6968791,"threshold_uncertainty_score":0.3446898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120837895","doi":"10.1016/s0304-3975(03)00139-7","title":"Closure and decidability properties of some language classes with respect to ciliate bio-operations","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Closure (psychology); Decidability; Mathematics; Ciliate; Computer science; Discrete mathematics; Biology; Ecology; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01103872080513999,"gpt":0.2451559344226615,"spread":0.2341172136175216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005296178,0.00008918692,0.0001082401,0.00003026859,0.0001295369,0.00004814018,0.0002067376,0.00003823694,0.000005221923],"category_scores_gemma":[0.0002242146,0.00005167831,0.00002028926,0.0001964696,0.001432757,0.000006919361,0.0001765619,0.00004996961,0.000001643629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005820806,"about_ca_system_score_gemma":0.00006329134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002604616,"about_ca_topic_score_gemma":0.000004897279,"domain_scores_codex":[0.9991111,0.00008830157,0.0001226345,0.000348091,0.0001328259,0.0001970619],"domain_scores_gemma":[0.9995302,0.00001935489,0.00001619854,0.0002334645,0.00009899241,0.0001018191],"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.00006703871,0.00005742081,0.003911086,0.00001206508,0.000005935171,0.0000016284,0.0001416189,0.0001609795,0.8271269,0.166572,0.000005831754,0.001937468],"study_design_scores_gemma":[0.0002047891,0.001347814,0.00746754,0.0000304385,0.000006064202,0.00001802017,0.00004883618,0.0009450229,0.9875368,0.002089981,0.000126326,0.0001783405],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9768372,0.0001255779,0.02236292,0.0001937577,0.00003501944,0.0001341074,0.000001921095,0.00001072248,0.0002988001],"genre_scores_gemma":[0.9832713,0.00000373833,0.01639904,0.0002709861,0.00003996515,0.000003139534,7.336735e-7,0.000003146806,0.000007937521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.164482,"threshold_uncertainty_score":0.5279055,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W95475432","doi":"","title":"Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems","year":2008,"lang":"en","type":"book","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Algorithm; Computer science; Graph theory; Identification (biology); Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01732839738042495,"gpt":0.2297522499403364,"spread":0.2124238525599114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001857936,0.0002326516,0.0002807027,0.00005286407,0.00007897188,0.00003639545,0.0001072921,0.0004327988,0.0000170637],"category_scores_gemma":[0.00005818405,0.0001832906,0.00008459435,0.00003081567,0.0002482826,0.000001543384,0.0003005882,0.0001897027,0.00000556909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001106566,"about_ca_system_score_gemma":0.0001825892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001150582,"about_ca_topic_score_gemma":0.000001480776,"domain_scores_codex":[0.9988026,0.000008774878,0.0002773664,0.0005272717,0.0001481754,0.0002357823],"domain_scores_gemma":[0.9994288,0.00003006838,0.0001379568,0.0002363198,0.00008200963,0.00008484827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006332713,0.0001331931,0.00003275268,0.0004762948,0.0002682134,0.00002576612,0.00008002976,0.0001166203,0.909503,0.003705774,0.07637017,0.009224837],"study_design_scores_gemma":[0.0003926737,0.0003603693,0.00001824471,0.0001822834,0.00004252958,0.00009907976,0.000006932006,0.001143792,0.07713629,0.0002915673,0.9197758,0.0005504494],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01429213,0.01446627,0.04228864,0.00009526391,0.001033867,0.001904022,0.0000785927,0.0001838562,0.9256573],"genre_scores_gemma":[0.02327278,0.002399703,0.0856568,0.0003075512,0.001565532,0.0000463296,0.001191198,0.0001389614,0.8854212],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8434056,"threshold_uncertainty_score":0.7474374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414008559","doi":"10.1109/mcom.001.2400764","title":"Pushing Large Language Models to the 6G Edge: Vision, Challenges, and Opportunities","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Hong Kong; Research Grants Council, University Grants Committee; Cancer Research Society","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Human–computer interaction; Telecommunications; Computer vision; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.07353448083784425,"gpt":0.3204168409315371,"spread":0.2468823600936928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003862409,0.00009400526,0.00009278923,0.00003655988,0.0002533687,0.00003794868,0.0006459272,0.00007020657,0.000002662907],"category_scores_gemma":[0.00005532793,0.00006579584,0.00003353187,0.00006592144,0.00007908665,0.000005201343,0.0008239666,0.0001148218,0.000008540768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005884919,"about_ca_system_score_gemma":0.00002369826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005601199,"about_ca_topic_score_gemma":0.0001933065,"domain_scores_codex":[0.9993427,0.0001380661,0.0001462406,0.000174634,0.00004628724,0.0001521044],"domain_scores_gemma":[0.9987304,0.00005843576,0.00003417559,0.001059768,0.00007309765,0.00004416488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008484564,0.0005031265,0.0001364275,0.0000843083,0.0001892883,0.000004890606,0.002902929,0.0002854404,0.2066657,0.1010762,0.08423532,0.6038316],"study_design_scores_gemma":[0.0002548248,0.0001063467,0.001272304,0.0000534251,0.00001807917,0.000005375223,0.001026678,0.00212919,0.001273553,0.001107499,0.9925917,0.0001609621],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.420607,0.2372072,0.02253828,0.1356828,0.0006227163,0.001031958,0.0001021207,0.0001674091,0.1820405],"genre_scores_gemma":[0.9821323,0.01172551,0.001115869,0.002548933,0.00007771931,0.00002807098,0.00007243254,0.000006733228,0.002292437],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9083564,"threshold_uncertainty_score":0.2683077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983239548","doi":"10.1016/j.tcs.2004.12.032","title":"On properties of bond-free DNA languages","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"DNA; DNA computing; Construct (python library); Property (philosophy); Characterization (materials science); Formal language; Computer science; Discrete mathematics; Mathematics; Algorithm; Theoretical computer science; Programming language; Genetics; Biology; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.009223273731269854,"gpt":0.2389336360263328,"spread":0.229710362295063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003790246,0.00008992007,0.00009811601,0.00003037554,0.00008454957,0.00002531788,0.0006753921,0.00004749451,0.00001431288],"category_scores_gemma":[0.0001712469,0.00005637013,0.00004466331,0.0001193017,0.001450256,0.000003772085,0.0004923515,0.00005958292,0.0000122351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006090847,"about_ca_system_score_gemma":0.0000259474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.814737e-7,"about_ca_topic_score_gemma":4.202578e-7,"domain_scores_codex":[0.999132,0.00003115708,0.0001311232,0.0002913242,0.0001863156,0.0002280249],"domain_scores_gemma":[0.999449,0.000019213,0.00003276283,0.0003646008,0.00006386499,0.0000705601],"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.00004391862,0.00006719914,0.0000482508,0.000005439106,0.000003355838,8.60576e-7,0.00003404921,0.00007280977,0.6793841,0.3026946,0.0001717741,0.01747367],"study_design_scores_gemma":[0.0001851765,0.0006482001,0.0004064386,0.00002552808,0.000002497212,0.000007119969,0.000008260929,0.003163793,0.9907972,0.004245665,0.0003869171,0.0001231582],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9829989,0.00009667698,0.01079143,0.0003922447,0.00006034915,0.00006168926,0.000001591366,0.00001790739,0.005579229],"genre_scores_gemma":[0.991765,0.000003269789,0.007339017,0.0006491052,0.0002168302,0.000001224172,0.000001157865,0.000003800968,0.0000205766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3114131,"threshold_uncertainty_score":0.5343529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079582928","doi":"10.1016/j.tcs.2009.05.001","title":"On the descriptional complexity of Watson–Crick automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Watson; Automaton; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Unary operation; Automata theory; Mathematics; Finite-state machine; Regular language; DFA minimization; Deterministic finite automaton; Discrete mathematics; Quantum finite automata; Combinatorics; Computer science; Theoretical computer science; Algorithm; DNA; Base pair","retraction":null,"screen_n_in":null,"score":{"opus":0.03009187934474768,"gpt":0.2660095653318389,"spread":0.2359176859870912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007242225,0.00009789112,0.00009975793,0.00002343562,0.0002031421,0.00003857105,0.0007442554,0.00004391405,0.00003871595],"category_scores_gemma":[0.0001462248,0.0000533985,0.00006071259,0.0001942218,0.002916356,0.000003344399,0.0002471125,0.00008961764,0.00001152674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007578642,"about_ca_system_score_gemma":0.00003210968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.714228e-7,"about_ca_topic_score_gemma":9.66438e-8,"domain_scores_codex":[0.998951,0.00007920287,0.0001513962,0.0003081533,0.000261055,0.000249196],"domain_scores_gemma":[0.9993914,0.00006228092,0.00004247142,0.0003403412,0.0000904629,0.00007303054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003770331,0.00007257115,0.00003064046,9.880837e-7,0.00000208161,6.301248e-7,0.00001106823,0.00004136519,0.07557944,0.9179843,0.0001792217,0.006059963],"study_design_scores_gemma":[0.000370516,0.003986237,0.02937521,0.00003590858,0.000007289793,0.00003075115,0.00001006855,0.06441842,0.1679645,0.7330109,0.0004759807,0.0003141979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8958036,0.00001374983,0.09746826,0.001737234,0.0001164755,0.0000863324,0.000003140769,0.00001946182,0.004751779],"genre_scores_gemma":[0.9909761,0.000001954948,0.007034542,0.001861669,0.000113027,7.154006e-7,0.000004076319,0.000002052896,0.000005868783],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1849734,"threshold_uncertainty_score":0.9997971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985614194","doi":"10.1016/j.tcs.2005.09.016","title":"Simple permutations mix well","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Random permutation; Mathematics; Combinatorics; Permutation (music); Simple (philosophy); Independence (probability theory); Closeness; Mixing (physics); Random graph; Discrete mathematics; Derangement; Graph; Symmetric group; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.008061903686414422,"gpt":0.2620267867829475,"spread":0.2539648830965331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949827,0.00009747281,0.00007914471,0.0000302837,0.0002467779,0.00006976952,0.000485101,0.0000518086,0.0001038464],"category_scores_gemma":[0.00006296612,0.00007217366,0.00005106859,0.0001915866,0.001272909,0.000006024567,0.000373509,0.00007284952,0.0001149994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001031809,"about_ca_system_score_gemma":0.00003830932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.772004e-7,"about_ca_topic_score_gemma":7.977366e-7,"domain_scores_codex":[0.9989524,0.0000407194,0.0001339944,0.000386604,0.0001610876,0.0003251933],"domain_scores_gemma":[0.9994786,0.00002795926,0.00002488836,0.0002515067,0.00008053869,0.0001365368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003629504,0.000171938,0.001243502,0.0000053209,0.00001022541,0.000004446244,0.00008617554,0.001647124,0.299162,0.5874531,0.0009216612,0.1092582],"study_design_scores_gemma":[0.001033497,0.00192304,0.01953916,0.00002234893,0.00002362807,0.0001243928,0.00004338404,0.3145156,0.5179607,0.05919481,0.08444992,0.001169556],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7273301,0.00003542455,0.2598453,0.0004474153,0.0000979032,0.0000662549,0.000001757605,0.00003134067,0.01214438],"genre_scores_gemma":[0.9823033,0.000003615608,0.01589839,0.001247321,0.000498341,0.000001907008,0.000009214436,0.000004599292,0.00003335862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5282583,"threshold_uncertainty_score":0.4690086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074437394","doi":"10.1109/tit.2012.2191682","title":"Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Synchronization (alternating current); Channel capacity; Independent and identically distributed random variables; Channel (broadcasting); Upper and lower bounds; Noise (video); Mathematics; Topology (electrical circuits); Computer science; Algorithm; Random variable; Combinatorics; Telecommunications; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01290173147699545,"gpt":0.2245494277444444,"spread":0.2116476962674489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003870085,0.00009587828,0.0000738812,0.00003730792,0.0001988173,0.00001958189,0.00007170711,0.0001027019,0.00002516553],"category_scores_gemma":[0.00002513728,0.00006380968,0.00004195469,0.00008249113,0.0001450383,0.00003539642,0.000002043911,0.00009166116,0.000009164662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001466288,"about_ca_system_score_gemma":0.00001010525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004493642,"about_ca_topic_score_gemma":8.937137e-7,"domain_scores_codex":[0.9994202,0.0001021063,0.0001853588,0.00007030951,0.00009210422,0.0001299277],"domain_scores_gemma":[0.9996272,0.00004674473,0.0001044381,0.0001280409,0.00005235983,0.00004116581],"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.002707419,0.0010863,0.0009570242,0.0003690364,0.0005810925,2.706725e-7,0.007386508,0.0413138,0.7147144,0.07963584,0.002004721,0.1492436],"study_design_scores_gemma":[0.0005392483,0.0004911305,0.0005614194,0.00004364874,0.00004201991,0.000009302616,0.000717684,0.003179074,0.9902281,0.000426729,0.003494654,0.0002669979],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5904682,0.00002338613,0.4087016,0.0000475988,0.0002232584,0.0001118827,0.00003339382,0.0000107199,0.0003799371],"genre_scores_gemma":[0.9994561,0.00003221945,0.00003622028,0.0003144458,0.00003509915,0.00001366574,0.00005953432,0.000003711285,0.00004899092],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4089878,"threshold_uncertainty_score":0.2602083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042079117","doi":"10.1016/s0304-3975(02)00853-8","title":"A recognition and parsing algorithm for arbitrary conjunctive grammars","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"L-attributed grammar; Parsing expression grammar; Indexed grammar; Context-free grammar; Parsing; Computer science; Phrase structure grammar; Context-sensitive grammar; Time complexity; Algorithm; Tree-adjoining grammar; Rule-based machine translation; Definite clause grammar; Mathematics; Theoretical computer science; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01796921826556223,"gpt":0.2474809605047613,"spread":0.2295117422391991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503992,0.00009659639,0.00009330217,0.00002595479,0.0002116059,0.00006395506,0.0001334462,0.00005993181,0.000005220244],"category_scores_gemma":[0.0001295952,0.00007398391,0.00003773953,0.0001133721,0.001274524,0.000006002926,0.00009992702,0.00005903668,0.000002550846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006342292,"about_ca_system_score_gemma":0.00003495393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.283908e-7,"about_ca_topic_score_gemma":8.662348e-8,"domain_scores_codex":[0.9990587,0.00006234784,0.0001084791,0.0004070196,0.00008814671,0.0002753028],"domain_scores_gemma":[0.999593,0.00006425936,0.00002820538,0.0001126559,0.00009342791,0.0001084596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004741211,0.00007280635,0.0001166019,0.000008984434,0.00001265049,0.000002794791,0.00004681309,0.000003645,0.06612735,0.194444,0.00003667156,0.7390803],"study_design_scores_gemma":[0.001213454,0.002737013,0.0005909078,0.0000466392,0.00002633904,0.0001479556,0.00005107788,0.06253785,0.2747513,0.6549114,0.002340272,0.0006458083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3311336,0.00005374258,0.6678456,0.00003646651,0.0001297242,0.0001260525,0.000004784797,0.00001202994,0.0006580221],"genre_scores_gemma":[0.7856578,0.000006708828,0.2137166,0.0004981319,0.00009806598,0.000005252454,0.00001023596,0.000004029459,0.000003234933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7384345,"threshold_uncertainty_score":0.4696036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1484840002","doi":"","title":"Membrane systems with coupled transport: universality and normal forms","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Universality (dynamical systems); Membrane; Membrane computing; Turing; Symporter; Molecule; Antiporter; Turing machine; Membrane transport; Computation; Chemistry; Computer science; Theoretical computer science; Physics; Algorithm; Quantum mechanics; Biochemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.0116261369136358,"gpt":0.1937117161132927,"spread":0.182085579199657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120299,0.0001344654,0.0001448731,0.00002113385,0.0001065272,0.0000384617,0.0001113317,0.00008518752,0.00007145782],"category_scores_gemma":[0.000006462093,0.00008874739,0.00003322084,0.00006073543,0.0001040187,0.00001722974,0.00004767944,0.00007065538,0.00001574676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001032198,"about_ca_system_score_gemma":0.000008025393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001884703,"about_ca_topic_score_gemma":0.000008189538,"domain_scores_codex":[0.9992824,0.00001339678,0.0002220238,0.0001348019,0.0001139407,0.0002334034],"domain_scores_gemma":[0.9996223,0.000009520144,0.00007798362,0.0001614563,0.00002890879,0.00009987064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.005487174,0.002792829,0.4930348,0.007165361,0.004117574,0.0002935428,0.01249301,0.007662293,0.328791,0.02466301,0.01004285,0.1034565],"study_design_scores_gemma":[0.02134603,0.01350077,0.07665423,0.0005748845,0.0004897682,0.001187216,0.01300112,0.1844564,0.04192637,0.00007152424,0.6421242,0.00466746],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9857865,0.0001383493,0.001419593,0.00006173769,0.00004452348,0.0002113441,0.00001644638,0.00002491883,0.01229658],"genre_scores_gemma":[0.9987836,0.000091371,0.0002949686,0.0002597851,0.00004181663,0.000006207826,0.00008833317,0.000006027863,0.0004278463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6320814,"threshold_uncertainty_score":0.3619013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085202968","doi":"10.1016/j.tcs.2004.06.028","title":"Template-guided DNA recombination","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Saskatchewan","funders":"","keywords":"Recombination; DNA; Gene; Genome; Genetics; Process (computing); Computer science; Computational biology; Biology; Theoretical computer science; Computation; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01405394857149718,"gpt":0.2674203274528775,"spread":0.2533663788813803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190522,0.0001058457,0.00008967653,0.00003908348,0.0002224371,0.00007352194,0.0004978779,0.00007080036,0.00001905115],"category_scores_gemma":[0.0001052411,0.00007905922,0.00004799541,0.0002467299,0.001111948,0.000006614063,0.0003689166,0.00007489706,0.00003834687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002151363,"about_ca_system_score_gemma":0.00005859699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001638184,"about_ca_topic_score_gemma":3.228155e-7,"domain_scores_codex":[0.9988751,0.00003624315,0.0001553228,0.0004326903,0.0001882895,0.0003123648],"domain_scores_gemma":[0.9994714,0.00001536791,0.00003527065,0.000253944,0.0001029308,0.0001211291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001907788,0.00008372538,0.0001949965,0.00000375838,0.000004553584,0.00000503927,0.00003041511,0.000387343,0.3627658,0.6222838,0.00008220787,0.01413924],"study_design_scores_gemma":[0.00093896,0.001333092,0.004792293,0.00003090596,0.000006720103,0.0001023904,0.000007913525,0.004208452,0.777191,0.2096389,0.001297946,0.0004514028],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7842603,0.00001292305,0.2113584,0.0003939023,0.0002537015,0.00007431264,6.449459e-7,0.00003273419,0.003613052],"genre_scores_gemma":[0.9834198,0.000003833004,0.0157512,0.0006146886,0.0001846751,0.000001987738,0.000007101592,0.000004943067,0.00001171852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4144252,"threshold_uncertainty_score":0.4097018,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1553144061","doi":"10.1007/11753681_12","title":"Hairpin Structures in DNA Words","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"DNA computing; Computer science; DNA; Algebraic structure; Algorithm; Algebraic properties; Discrete mathematics; Mathematics; Biology; Genetics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01126963481184999,"gpt":0.2392232831598932,"spread":0.2279536483480432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003084821,0.000347042,0.000305228,0.0002174713,0.00008101261,0.00008862965,0.0008185422,0.0004780047,0.00001503538],"category_scores_gemma":[0.00006272647,0.000277851,0.00009808743,0.0001656883,0.0004657825,0.000004622557,0.0006004102,0.0004202896,0.000004863377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005844458,"about_ca_system_score_gemma":0.0001465726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003138985,"about_ca_topic_score_gemma":0.0002572414,"domain_scores_codex":[0.9979585,0.00002515627,0.00032738,0.0009732287,0.0002623404,0.0004533955],"domain_scores_gemma":[0.9992571,0.00004899027,0.000121775,0.0004542889,0.00005393899,0.00006386113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008774095,0.00007062351,0.004156025,0.00006775247,0.00002273762,0.0001729879,0.0000960109,0.06909011,0.08273124,0.00179221,0.0003435621,0.841369],"study_design_scores_gemma":[0.003869996,0.003709565,0.04247472,0.001782211,0.00005476578,0.0003926224,0.000001632681,0.07303495,0.2725786,0.4896756,0.1041923,0.008233082],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09416657,0.001810793,0.8882546,0.0002822035,0.001422057,0.0004381159,0.00001498502,0.00004894483,0.01356169],"genre_scores_gemma":[0.977967,0.00002620116,0.01967752,0.0008409629,0.0008759515,0.000002484563,0.00005255171,0.00002140477,0.0005359661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8838004,"threshold_uncertainty_score":0.9999673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099378738","doi":"10.1142/s0129054105003467","title":"BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Decidability; Discrete mathematics; Characterization (materials science); Property (philosophy); Mathematics; Context (archaeology); Hamming code; Hamming distance; Computer science; Combinatorics; Algorithm; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.01543495050001134,"gpt":0.3606698463397361,"spread":0.3452348958397248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007074788,0.00005135152,0.00007670961,0.0001188774,0.00006905544,0.00006744118,0.0005168265,0.00002787869,0.000007173152],"category_scores_gemma":[0.000246245,0.00004165361,0.00004424703,0.0001098527,0.0003180388,0.0000484281,0.0002368448,0.00004746129,4.281848e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001738915,"about_ca_system_score_gemma":0.00009897824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002865702,"about_ca_topic_score_gemma":0.000002181959,"domain_scores_codex":[0.9992835,0.000032692,0.000291992,0.000107547,0.0002100604,0.00007421299],"domain_scores_gemma":[0.9988658,0.00003034763,0.0002581767,0.0001147315,0.000687899,0.00004308307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005529324,0.0001214965,0.0100543,0.000006578904,0.00008161883,0.000002006483,0.0001435779,0.001066425,0.196567,0.02158012,0.0004268624,0.7698947],"study_design_scores_gemma":[0.004016325,0.001887944,0.144917,0.0002064076,0.00008298495,0.003152285,0.000470899,0.04525355,0.6665817,0.01899582,0.1136689,0.0007662103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4101314,0.000114705,0.5884967,0.000578036,0.0002891195,0.00002265193,0.000003007816,0.000002448587,0.0003619159],"genre_scores_gemma":[0.5620844,0.0000328075,0.4375193,0.0001102208,0.0002425063,2.154012e-7,0.0000032929,0.00000116761,0.000006064419],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7691285,"threshold_uncertainty_score":0.1698585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162572810","doi":"10.1016/s0304-3975(99)00277-7","title":"Shuffle and scattered deletion closure of languages","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Closure (psychology); Computer science; Programming language; Mathematics; Linguistics; Combinatorics; Philosophy; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.004512639951644926,"gpt":0.2419252014596633,"spread":0.2374125615080183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003113189,0.00006535802,0.00007942169,0.00001778513,0.00007518515,0.00002293978,0.0002174105,0.00004462901,0.00006529527],"category_scores_gemma":[0.00002239854,0.00004663745,0.00002539753,0.0001051154,0.001282533,0.000003235514,0.0001381298,0.00004069325,0.000005063049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002135045,"about_ca_system_score_gemma":0.00001238077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001633415,"about_ca_topic_score_gemma":2.60139e-7,"domain_scores_codex":[0.9993459,0.00003769977,0.0001014919,0.0002514319,0.0001020914,0.0001614092],"domain_scores_gemma":[0.9997109,0.00001618636,0.00001933721,0.000153175,0.00003848755,0.00006195329],"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.0000963994,0.00008901994,0.006244719,0.00001924953,0.000009880493,0.000003736401,0.00009396673,0.00007430746,0.5877197,0.08947922,0.0001063557,0.3160635],"study_design_scores_gemma":[0.001144336,0.003143184,0.1019358,0.00008589661,0.00002530318,0.0001420088,0.00004566489,0.01937634,0.8505664,0.01972065,0.003078351,0.0007360808],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987003,0.00009322282,0.01007259,0.0001322061,0.00002695741,0.00004469407,0.000001880627,0.000009974386,0.002615418],"genre_scores_gemma":[0.9941975,0.00001511454,0.005407706,0.0002574207,0.00009532839,6.276313e-7,0.000004334751,0.000002477683,0.00001942516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3153274,"threshold_uncertainty_score":0.4725547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029114055","doi":"10.1109/tit.2004.830782","title":"Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Maximum a posteriori estimation; Algorithm; Markov chain; Mathematics; Decoding methods; Computational complexity theory; Sequence (biology); Directed acyclic graph; Forward algorithm; Monotonic function; Markov model; Variable-order Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.01048673774791291,"gpt":0.2543342481356515,"spread":0.2438475103877386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000277528,0.0001114586,0.0001026286,0.0000773306,0.0001173783,0.00002233265,0.0001070168,0.0001276231,0.00001874354],"category_scores_gemma":[0.00001416523,0.0000937158,0.0001163027,0.00007506458,0.00007145153,0.00002850527,0.000001361216,0.00006450738,0.000009414778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000235013,"about_ca_system_score_gemma":0.00005863929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007197219,"about_ca_topic_score_gemma":0.000001342965,"domain_scores_codex":[0.9993554,0.00003162779,0.0002750758,0.0001080034,0.00009441888,0.0001354279],"domain_scores_gemma":[0.999574,0.000040504,0.0001306503,0.000132262,0.00008672071,0.00003586069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004607479,0.0001110519,0.000002662507,0.00009944572,0.0000474124,1.269207e-7,0.0001714025,0.8667639,0.0260608,0.001215493,0.00002927165,0.1050377],"study_design_scores_gemma":[0.001377925,0.0007991072,0.00003998356,0.00005028835,0.00002485673,0.00000248197,0.0001456562,0.04711642,0.9460066,0.003287842,0.0009366172,0.0002122196],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1268243,0.0000107814,0.8722795,0.00007232583,0.0002704184,0.0002734481,0.00008424115,0.00002245861,0.0001624965],"genre_scores_gemma":[0.9893545,0.000005937528,0.01000527,0.0003875166,0.00003435387,0.00005558418,0.0001114575,0.000005349692,0.00004002012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9199458,"threshold_uncertainty_score":0.382162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3141810508","doi":"","title":"DNA computing: the arrival of biological mathematics","year":2008,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematical and theoretical biology; Simple (philosophy); Mathematics; Mathematical problem; Computer science; Field (mathematics); Theoretical computer science; Biology; Pure mathematics; Bioinformatics; Mathematics education","retraction":null,"screen_n_in":null,"score":{"opus":0.04818565574785137,"gpt":0.2615253658217996,"spread":0.2133397100739483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001621967,0.00008773489,0.000119944,0.000007878409,0.00009656406,0.000003601242,0.0002376139,0.00009515625,0.00002522097],"category_scores_gemma":[0.0001093298,0.00004199404,0.00009381213,0.00005695639,0.0002985226,4.50843e-7,0.0001865328,0.00005522882,0.000008232616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001691841,"about_ca_system_score_gemma":0.00001420585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002448841,"about_ca_topic_score_gemma":5.690181e-7,"domain_scores_codex":[0.9993939,0.00004112127,0.000191195,0.0001551641,0.00006852925,0.0001500745],"domain_scores_gemma":[0.999623,0.00003976571,0.00006865404,0.0001958789,0.00004193008,0.00003079382],"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.00002311231,0.0001625873,0.01285115,0.000008598775,0.00003955596,0.000004112919,0.00008612886,0.0000335777,0.9799817,0.003227134,0.001943154,0.001639185],"study_design_scores_gemma":[0.0006363108,0.001286095,0.04616706,0.0000160223,0.00001406472,0.0002697702,0.0003828279,0.001288227,0.9250072,0.001379453,0.02313893,0.0004139922],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9871509,0.00009913902,0.005428907,0.0001232299,0.00005230205,0.00007620377,0.000001528127,0.00001500753,0.007052766],"genre_scores_gemma":[0.9956002,0.00003682323,0.003727075,0.0002534589,0.0001385459,7.702953e-7,0.00001085084,0.000003931924,0.0002283144],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05497446,"threshold_uncertainty_score":0.1712467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562193608","doi":"10.3233/fun-2006-71405","title":"A Formal Language Analysis of DNA Hairpin Structures","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Formal language; Computer science; Programming language; Computational biology; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.006143947400711379,"gpt":0.2426447297500487,"spread":0.2365007823493373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116196,0.0001028492,0.00017842,0.000086731,0.00005282871,0.00002402595,0.0001618576,0.00007810565,0.0001023534],"category_scores_gemma":[0.00002150943,0.00007614493,0.0001542045,0.0002131825,0.00006163119,0.000008389458,0.0001375849,0.00004344357,0.000005912719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007684574,"about_ca_system_score_gemma":0.00001293401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005879279,"about_ca_topic_score_gemma":0.00004013759,"domain_scores_codex":[0.9992377,0.0000163865,0.0003261961,0.00009879408,0.0001106584,0.0002103308],"domain_scores_gemma":[0.9995989,0.00001084587,0.0001314787,0.0001990071,0.00002644397,0.00003338849],"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.0002617014,0.0002035634,0.07838067,0.0001489007,0.001649458,0.000004668207,0.0006433186,0.002687386,0.8823339,0.007129843,0.004533539,0.02202302],"study_design_scores_gemma":[0.001685904,0.001082468,0.4136734,0.00002672869,0.0007891424,0.00001529651,0.00201847,0.008534556,0.5349525,0.0005095715,0.03588553,0.000826507],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9882411,0.00008671354,0.002296727,0.00001674296,0.00003860639,0.00008095083,0.00004372548,0.00001294407,0.009182481],"genre_scores_gemma":[0.9974275,0.000003214967,0.001526996,0.0002281592,0.00006591959,0.000003268281,0.0005570884,0.000003567034,0.000184313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3473815,"threshold_uncertainty_score":0.31051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110917769","doi":"10.1155/2013/634832","title":"HyDEn: A Hybrid Steganocryptographic Approach for Data Encryption Using Randomized Error-Correcting DNA Codes","year":2013,"lang":"en","type":"article","venue":"BioMed Research International","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada; Université de Moncton","funders":"National Research Council Canada","keywords":"ASCII; Encryption; Computer science; Hamming code; Error detection and correction; Hamming distance; Cryptography; Set (abstract data type); Code (set theory); Theoretical computer science; Algorithm; Steganography; Decoding methods; Artificial intelligence; Image (mathematics); Programming language; Block code; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1878390544108485,"gpt":0.4148317964148738,"spread":0.2269927420040252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002902937,0.0001449035,0.000217392,0.0002364236,0.0002391856,0.0001830292,0.0009184562,0.0001179823,0.00005792771],"category_scores_gemma":[0.001795702,0.0001093338,0.0001384252,0.0001907252,0.0003365516,0.00002115588,0.0007315982,0.0001744517,0.00001038172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003219688,"about_ca_system_score_gemma":0.00007564962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001207422,"about_ca_topic_score_gemma":0.000002882776,"domain_scores_codex":[0.9978136,0.000384739,0.0003337036,0.0006159489,0.000417374,0.0004345889],"domain_scores_gemma":[0.9985984,0.0002518927,0.0001119005,0.0003803034,0.000551819,0.0001056778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002882016,0.0001704908,0.0005596518,0.00003143312,0.0002526992,0.000001389736,0.00002021317,0.00004325761,0.9772462,0.0002146007,0.004420338,0.01415775],"study_design_scores_gemma":[0.0318376,0.0003827442,0.0003857457,0.00007049927,0.00003452803,0.00009618998,0.0004746796,0.8055879,0.1432421,0.002515075,0.01477889,0.0005939675],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8307468,0.0002052844,0.166119,0.0002669094,0.0005742515,0.001088772,0.00007705179,0.00002499362,0.0008970053],"genre_scores_gemma":[0.9648479,0.0000375429,0.03099388,0.00006706638,0.001092263,0.0001582227,0.002550033,0.00001722879,0.0002358456],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.834004,"threshold_uncertainty_score":0.4458503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4220848411","doi":"10.1016/j.ins.2022.03.003","title":"Supervisory control of discrete event systems under asynchronous spiking neuron P systems","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Supervisor; Supervisory control; Asynchronous communication; Computer science; Construct (python library); Event (particle physics); Control system; Process (computing); SNP; Control (management); Control theory (sociology); Theoretical computer science; Control engineering; Distributed computing; Artificial intelligence; Single-nucleotide polymorphism; Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02367749502025764,"gpt":0.2537733227940611,"spread":0.2300958277738034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930433,0.00006694959,0.0000994695,0.00004858375,0.0002670005,0.00006442222,0.0002589319,0.00002907997,0.000007522708],"category_scores_gemma":[0.00003533441,0.00004988519,0.00004469948,0.0001325915,0.00008949896,0.0000217966,0.0001366088,0.00005072583,0.000002973678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001417744,"about_ca_system_score_gemma":0.00005654476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005754599,"about_ca_topic_score_gemma":7.087598e-7,"domain_scores_codex":[0.9990731,0.0001039952,0.0003083577,0.000108429,0.0002580521,0.0001480814],"domain_scores_gemma":[0.9996096,0.00002193041,0.0001900607,0.0001002877,0.00004986968,0.00002822839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005934176,0.00004207392,0.01046581,0.0001045054,0.00003410213,8.220678e-7,0.0002944935,0.8769906,0.1002171,0.006920462,0.0003188289,0.004551953],"study_design_scores_gemma":[0.002677828,0.006241499,0.03358609,0.0001063558,0.0000502545,0.000215159,0.02545358,0.7513639,0.01012248,0.0002667528,0.1687415,0.001174591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9428895,0.0007068694,0.05267018,0.00008287169,0.0006570746,0.0002276687,0.00002812586,0.0000140072,0.002723735],"genre_scores_gemma":[0.999657,0.000006294994,0.00002056161,0.0002002427,0.00005243111,0.00001790576,0.0000263705,0.000001569305,0.0000175688],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1684227,"threshold_uncertainty_score":0.2053579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071364560","doi":"10.1080/08948550213852","title":"DNA Computing: Models and Implementations","year":2002,"lang":"en","type":"article","venue":"Comments® on Theoretical Biology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Implementation; Computer science; Computational biology; Theoretical computer science; Computer architecture; Programming language; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.03897692259768443,"gpt":0.3085882406305894,"spread":0.2696113180329049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001784384,0.0001595144,0.0001576337,0.0000292747,0.0001515734,0.00001974193,0.000185825,0.0001553852,0.0002432827],"category_scores_gemma":[0.00008095583,0.0001194694,0.00005858986,0.00005157965,0.0004833246,0.000001716865,0.0002715073,0.0001128982,0.00002865968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007407481,"about_ca_system_score_gemma":0.000003104526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001209304,"about_ca_topic_score_gemma":4.232934e-7,"domain_scores_codex":[0.9988611,0.0001757984,0.0002121193,0.000379861,0.00004734206,0.0003238219],"domain_scores_gemma":[0.9994876,0.0001072496,0.00004736353,0.0002180429,0.00002916019,0.0001105282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004951328,0.0001799435,0.001934773,0.000004440501,0.00004977519,0.000001809152,0.0000386076,0.00001316333,0.04450792,0.927671,0.002591428,0.0229576],"study_design_scores_gemma":[0.006696594,0.01230777,0.003002914,0.00006734002,0.0001190356,0.0001166544,0.0004089224,0.03653831,0.1019347,0.7008686,0.1357793,0.002159889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9691249,0.000318678,0.009906415,0.002770377,0.0001512803,0.0002029811,0.00002823473,0.00003740446,0.01745976],"genre_scores_gemma":[0.9939153,0.0001068948,0.0005691198,0.005100526,0.0001330728,0.000005912856,0.000107294,0.000009849731,0.00005200631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2268024,"threshold_uncertainty_score":0.4871822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057447340","doi":"10.1142/s0129054107005145","title":"INVOLUTIVELY BORDERED WORDS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Prefix; Suffix; Alphabet; Mathematics; Combinatorics on words; Combinatorics; Watson; Word (group theory); Involution (esoterism); Discrete mathematics; Computer science; Biology; Linguistics; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.01718857657105889,"gpt":0.3233007750085465,"spread":0.3061121984374877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452687,0.00005428878,0.00007618862,0.0001811735,0.0000569677,0.00004536053,0.0007801834,0.00002557242,0.000007171491],"category_scores_gemma":[0.0001853737,0.00004357452,0.00006997812,0.0001983094,0.0002913583,0.00002685621,0.0001858883,0.00006027134,0.000001463035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002448746,"about_ca_system_score_gemma":0.0001807249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003838898,"about_ca_topic_score_gemma":0.000004013386,"domain_scores_codex":[0.9990557,0.00001444558,0.0003380949,0.0001128776,0.0003641083,0.0001148137],"domain_scores_gemma":[0.9983782,0.00003514874,0.0002851007,0.00008899085,0.001155338,0.00005719323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001725704,0.0002552157,0.01740126,0.000003213903,0.000108697,0.00001477727,0.0001665385,0.00107776,0.676206,0.005122644,0.0004102628,0.299061],"study_design_scores_gemma":[0.001797661,0.002173893,0.4970822,0.0001382863,0.00002221019,0.0005242334,0.0001484535,0.003723909,0.4346405,0.003958044,0.05535631,0.0004342543],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6174587,0.0000369743,0.3810752,0.0001615045,0.0008007608,0.00001688892,0.000001144224,0.000001640058,0.0004471415],"genre_scores_gemma":[0.9526243,0.00001713869,0.0467266,0.000144128,0.0004656954,1.552385e-7,0.000002823299,0.000001917656,0.0000173065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.479681,"threshold_uncertainty_score":0.1776917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156204758","doi":"10.1016/j.tcs.2004.09.038","title":"Aspects of shuffle and deletion on trajectories","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Decidability; Word (group theory); Context (archaeology); Generalization; Variable (mathematics); Sequence (biology); Constraint (computer-aided design); Focus (optics); Catenation; Binary number; Computer science; Palindrome; Context-free language; Quotient; Integer (computer science); Morphism; Mathematics; Algorithm; Discrete mathematics; Arithmetic; Combinatorics; Artificial intelligence; Programming language; Rule-based machine translation","retraction":null,"screen_n_in":null,"score":{"opus":0.007725269626223187,"gpt":0.2393898409633678,"spread":0.2316645713371446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002628908,0.00006857327,0.00007690821,0.00002415817,0.00008255448,0.00002080162,0.0001813014,0.00004022765,0.000004373274],"category_scores_gemma":[0.00006207123,0.000048155,0.00002314407,0.0001192397,0.001396912,0.000002812555,0.0001485303,0.00004577495,0.000003669733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006276861,"about_ca_system_score_gemma":0.00003027989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.627153e-7,"about_ca_topic_score_gemma":4.112703e-7,"domain_scores_codex":[0.9993545,0.00001997543,0.00009089767,0.0002560471,0.0001233517,0.0001551996],"domain_scores_gemma":[0.9997129,0.00001840403,0.00002435198,0.0001332211,0.00004795465,0.0000631901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002585395,0.0000359353,0.0001030913,0.000003528179,0.000001879095,0.00000107188,0.00002072599,0.0001256333,0.1874786,0.8071505,0.000004016846,0.005049156],"study_design_scores_gemma":[0.000423972,0.002723105,0.008123254,0.00003370652,0.000004481426,0.00002348036,0.000008263304,0.001045817,0.8670684,0.1201301,0.000229577,0.0001859041],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9171789,0.00002473261,0.07806081,0.0001402918,0.00008234842,0.00004553967,8.055042e-7,0.000009695745,0.00445684],"genre_scores_gemma":[0.994843,0.000005810861,0.004848907,0.0002032924,0.0000915744,6.18758e-7,0.000001827156,0.000002354036,0.000002615507],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6870204,"threshold_uncertainty_score":0.514698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132713666","doi":"10.1109/memb.2006.1578663","title":"The quest for error correction in biology","year":2006,"lang":"en","type":"article","venue":"IEEE Engineering in Medicine and Biology Magazine","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Howard Hughes Medical Institute","keywords":"Systems biology; Coding (social sciences); Computational biology; Computer science; Error detection and correction; Biology; Data science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01863428916936006,"gpt":0.2957271069855238,"spread":0.2770928178161638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004544143,0.0001280646,0.000176737,0.00006712365,0.00004200831,0.000004069723,0.00009614528,0.0001831254,0.000001295925],"category_scores_gemma":[0.0002591842,0.00007727156,0.00002505156,0.0001058154,0.0001312764,0.000001538329,0.000029131,0.0001204767,8.966173e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001098179,"about_ca_system_score_gemma":0.000009177202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006722386,"about_ca_topic_score_gemma":0.000327125,"domain_scores_codex":[0.9991653,0.00003833881,0.0002474374,0.0002608626,0.00001647441,0.000271577],"domain_scores_gemma":[0.9996517,0.0001589419,0.00003989476,0.0001002443,0.00002567508,0.00002352717],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001179036,0.00003599028,0.05653344,0.00001947474,0.0000127134,0.000002346618,0.00001255655,0.0009670745,0.927426,0.001262303,0.004645466,0.008964732],"study_design_scores_gemma":[0.006974466,0.005778004,0.2389213,0.0002088634,0.00003232173,0.0001038084,0.00008328331,0.03873021,0.02365793,0.002903286,0.6816826,0.000923968],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895512,0.002195178,0.005772223,0.0008006172,0.001049397,0.0002099286,0.000002824771,0.00001933248,0.0003993105],"genre_scores_gemma":[0.9982352,0.0002439075,0.0002589115,0.0001414758,0.0007722046,0.00003398407,0.00008250214,0.000007944922,0.0002238602],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9037681,"threshold_uncertainty_score":0.3151042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1567910696","doi":"10.1007/3-540-44968-x_33","title":"Generating Necklaces and Strings with Forbidden Substrings","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Substring; Computer science; Algorithm; Artificial intelligence; Programming language; Data structure","retraction":null,"screen_n_in":null,"score":{"opus":0.01017285368743673,"gpt":0.2192672726429337,"spread":0.2090944189554969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002196123,0.0002899156,0.0002312686,0.00009526352,0.0001573442,0.0001469524,0.0004040065,0.0002478979,0.00001044657],"category_scores_gemma":[0.00002237892,0.0002099747,0.00004084357,0.00008558355,0.000436165,0.000007227759,0.0003404856,0.0002683383,0.000001997934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001917549,"about_ca_system_score_gemma":0.00009148759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001316053,"about_ca_topic_score_gemma":0.00005121604,"domain_scores_codex":[0.9984182,0.00001095084,0.0001959516,0.0008341685,0.0002023948,0.0003383409],"domain_scores_gemma":[0.9994441,0.00004126868,0.0001024482,0.0002718184,0.00005648299,0.00008386981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005827815,0.00001468309,0.001534885,0.00004083955,0.00002429285,0.00004326196,0.0001001633,0.01384502,0.02957603,0.0002313372,0.00001326197,0.954518],"study_design_scores_gemma":[0.00716778,0.01959347,0.006200631,0.004595959,0.0002460364,0.002346331,0.00000758472,0.3736755,0.3968912,0.07286673,0.103269,0.01313976],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5208786,0.002696255,0.4677183,0.0001845886,0.0002112203,0.0003914724,0.00000791612,0.00005110338,0.007860621],"genre_scores_gemma":[0.952652,0.0001908356,0.04544735,0.0007111021,0.0006113863,0.000002525174,0.00001972925,0.00002317103,0.0003419384],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9413782,"threshold_uncertainty_score":0.856252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}