{"meta":{"query_hash":"466a6697232e","filters":{"topic":"DNA and Biological Computing"},"cohort_total":430,"direct_labels_cover":0,"predictions_cover":430,"exported":430,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/466a6697232e","api":"https://metacan.xera.ac/api/v1/cohort?topic=DNA+and+Biological+Computing"},"results":[{"id":"W124413104","doi":"","title":"DNA computers: tomorrow's reality","year":2001,"lang":"en","type":"book","venue":"World Scientific Publishing Co., Inc. eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematical and theoretical biology; Simple (philosophy); Mathematical problem; Computer science; Mathematics; Mathematical structure; Field (mathematics); Theoretical computer science; Biology; Pure mathematics; Bioinformatics; Mathematics education; Epistemology","score_opus":0.035318820394712916,"score_gpt":0.2691993860798016,"score_spread":0.2338805656850887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124413104","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004733716,0.00033302847,0.00067842,0.00033897682,0.0043736035,0.00051417045,0.0002881369,0.0002183511,0.9885216],"genre_scores_gemma":[0.03504923,0.0000045496336,0.00056044315,0.0012725529,0.0027951794,0.000017665901,0.0070329728,0.00007429624,0.9531931],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950926,0.00028332378,0.00082231965,0.0019792588,0.0008218807,0.0010006685],"domain_scores_gemma":[0.99680895,0.00010840532,0.0005833893,0.0016020421,0.00048182523,0.00041541737],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028968283,0.0006706933,0.0006422019,0.00044489256,0.00080727495,0.0045291693,0.0022149535,0.0008258638,0.00012168782],"category_scores_gemma":[0.00030900678,0.00060335855,0.00040238534,0.00022289224,0.0008726698,0.000036256,0.0014295225,0.0009865379,0.00008926336],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039349663,0.000051095274,0.0000911199,0.000059233862,0.00008503644,0.000047930218,0.00004883969,0.000007636484,0.008642314,0.0012824151,0.9709301,0.01871492],"study_design_scores_gemma":[0.00035151152,0.000098052704,0.00007098334,0.00017312121,0.00003642571,0.00002969994,0.000012257283,0.00008398667,0.0024361655,0.0026264337,0.9933176,0.0007637296],"about_ca_topic_score_codex":0.00004242772,"about_ca_topic_score_gemma":0.00068708573,"teacher_disagreement_score":0.03532849,"about_ca_system_score_codex":0.00018877802,"about_ca_system_score_gemma":0.00077127945,"threshold_uncertainty_score":0.9996418},"labels":[],"label_agreement":null},{"id":"W128333381","doi":"","title":"Parallelism, Program Size, Time, and Temperature in Self-Assembly","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tile; Square (algebra); Upper and lower bounds; Combinatorics; Parallelism (grammar); Binary logarithm; Computer science; Order (exchange); Parallel computing; Discrete mathematics; Mathematics; Geometry; Materials science","score_opus":0.012058607749450808,"score_gpt":0.17289344770468965,"score_spread":0.16083483995523884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128333381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997733,0.00003088729,0.000009131442,0.000033837856,0.000047249,0.0001331322,0.000001954219,0.00004327354,0.0019675472],"genre_scores_gemma":[0.9983748,0.00004707205,0.0005435714,0.00010916294,0.00007242411,4.665932e-7,0.000013008414,0.0000061072365,0.0008333442],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993327,0.00003585521,0.00006832786,0.00035524572,0.000017921266,0.00018991285],"domain_scores_gemma":[0.9996795,0.000020606767,0.000030233705,0.00016417737,0.000031523046,0.00007394675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009580999,0.00010837642,0.000095836294,0.000021849779,0.000056482037,0.00002143702,0.00014789507,0.00020850773,0.0000098301],"category_scores_gemma":[0.000039846687,0.000096744385,0.000040358096,0.00013583186,0.000051692405,0.000004913155,0.00012673829,0.00017526069,0.000010585655],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084957675,0.00022381698,0.046459958,0.000010553929,0.000028568527,0.00008039065,0.000018690595,0.00018104225,0.9495272,0.0018224093,0.0002619501,0.0013004349],"study_design_scores_gemma":[0.0084042465,0.003788806,0.7013987,0.00007562198,0.00015179078,0.00014343488,0.0002598461,0.035615828,0.13513796,0.0030421384,0.10897816,0.003003531],"about_ca_topic_score_codex":0.000010038989,"about_ca_topic_score_gemma":0.000065648404,"teacher_disagreement_score":0.8143893,"about_ca_system_score_codex":0.0000051078655,"about_ca_system_score_gemma":0.000023573648,"threshold_uncertainty_score":0.39451218},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011626136913635801,"score_gpt":0.19371171611329274,"score_spread":0.18208557919965696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484840002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857865,0.00013834929,0.001419593,0.00006173769,0.00004452348,0.00021134414,0.000016446384,0.00002491883,0.012296583],"genre_scores_gemma":[0.99878365,0.000091371,0.00029496863,0.00025978507,0.000041816635,0.000006207826,0.000088333174,0.0000060278635,0.00042784627],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992824,0.000013396783,0.00022202381,0.0001348019,0.00011394073,0.00023340336],"domain_scores_gemma":[0.9996223,0.000009520144,0.00007798362,0.00016145632,0.00002890879,0.00009987064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012029902,0.00013446536,0.00014487309,0.000021133848,0.00010652717,0.0000384617,0.00011133168,0.000085187516,0.00007145782],"category_scores_gemma":[0.000006462093,0.00008874739,0.00003322084,0.00006073543,0.000104018676,0.00001722974,0.000047679438,0.000070655384,0.000015746758],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005487174,0.0027928292,0.4930348,0.0071653607,0.004117574,0.00029354283,0.012493013,0.0076622926,0.32879102,0.02466301,0.010042854,0.103456505],"study_design_scores_gemma":[0.021346029,0.013500766,0.07665423,0.00057488447,0.00048976816,0.0011872165,0.01300112,0.18445638,0.04192637,0.00007152424,0.64212424,0.00466746],"about_ca_topic_score_codex":0.000018847026,"about_ca_topic_score_gemma":0.000008189538,"teacher_disagreement_score":0.6320814,"about_ca_system_score_codex":0.000010321975,"about_ca_system_score_gemma":0.000008025393,"threshold_uncertainty_score":0.36190134},"labels":[],"label_agreement":null},{"id":"W1490096632","doi":"10.1007/978-3-642-03564-7_13","title":"On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Singleton; Hierarchy; Characterization (materials science); Code (set theory); Element (criminal law); Mathematics; Discrete mathematics; Sigma; Property (philosophy); Combinatorics; Computer science; Relation (database); Set (abstract data type); Programming language; Physics","score_opus":0.020867858230932457,"score_gpt":0.24892793219308845,"score_spread":0.228060073962156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490096632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53179723,0.00055787474,0.46262497,0.0019494717,0.00020521088,0.0005291734,0.0000085786205,0.000014074735,0.0023134071],"genre_scores_gemma":[0.9922187,0.000027440985,0.005709611,0.0018506276,0.00008235627,8.727982e-7,0.0000076962815,0.0000038067114,0.000098905955],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990694,0.000032325912,0.0001801483,0.00043521042,0.00014881288,0.00013411402],"domain_scores_gemma":[0.9993647,0.0001264681,0.00009118836,0.0002802654,0.000097411095,0.00004000842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004601436,0.00014049733,0.00014878166,0.00005279225,0.00009433604,0.00002186828,0.00033202968,0.0001721982,0.0000037641578],"category_scores_gemma":[0.00023137085,0.00008941552,0.00003846649,0.00007753225,0.00017514837,0.0000027762478,0.00023249732,0.00017125491,0.0000018562046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044861314,0.00015164736,0.0019447175,0.000095693445,0.00004645023,0.000012905102,0.0004923071,0.06136674,0.17907138,0.03389947,0.0003098093,0.7221603],"study_design_scores_gemma":[0.0015748955,0.010758368,0.0959165,0.0019532559,0.000061068495,0.00007879565,0.0000022268175,0.082792915,0.19275342,0.5992537,0.012092392,0.0027624278],"about_ca_topic_score_codex":0.000002557046,"about_ca_topic_score_gemma":0.000013625326,"teacher_disagreement_score":0.71939784,"about_ca_system_score_codex":0.000017668148,"about_ca_system_score_gemma":0.000040041577,"threshold_uncertainty_score":0.36462587},"labels":[],"label_agreement":null},{"id":"W1493314725","doi":"10.3968/j.pam.1925252820110201.010","title":"Generation of All Possible Multiselections from a Multiset","year":2011,"lang":"en","type":"article","venue":"Progress in applied mathematics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiset; Selection (genetic algorithm); Key (lock); Computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.09346011894198672,"score_gpt":0.30241623161411235,"score_spread":0.20895611267212563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493314725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98831177,0.000283653,0.008491213,0.0000063313237,0.000057154313,0.00024701498,0.000012648822,0.000016987533,0.0025732066],"genre_scores_gemma":[0.79738855,0.000019249352,0.20236753,0.000022514705,0.00006706102,0.000041382693,0.000072639246,0.000008253544,0.000012808762],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993537,0.000011662642,0.00024353428,0.00018757267,0.00006438404,0.0001391457],"domain_scores_gemma":[0.999651,0.000010687667,0.00010818218,0.00017443285,0.000026625057,0.000029034569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010249737,0.00009622473,0.00013124979,0.000028165276,0.000023551725,0.000007300576,0.00012857684,0.00011405694,0.00001911862],"category_scores_gemma":[0.00002074311,0.00007966178,0.00003456357,0.00007002463,0.00006353388,0.0000012394271,0.00008134139,0.00005691564,0.0000046982454],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006139688,0.0012559755,0.017213268,0.00007839922,0.00008766051,0.0000029263967,0.0012973258,0.00002620826,0.93874365,0.003218494,0.00023684141,0.03777783],"study_design_scores_gemma":[0.00075611746,0.00019077625,0.0042777914,0.0000306314,0.00002651514,0.0000032036367,0.00015793479,0.009932829,0.9805002,0.003389543,0.0004688034,0.00026564012],"about_ca_topic_score_codex":0.000008940013,"about_ca_topic_score_gemma":0.000022993856,"teacher_disagreement_score":0.19387631,"about_ca_system_score_codex":0.0000055237383,"about_ca_system_score_gemma":0.00001122439,"threshold_uncertainty_score":0.3248513},"labels":[],"label_agreement":null},{"id":"W1495745209","doi":"10.1007/3-540-30296-4_8","title":"Involution Solid Codes","year":2006,"lang":"en","type":"book-chapter","venue":"Natural computing series","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Involution (esoterism); Biology; Neuroscience","score_opus":0.01031791125276476,"score_gpt":0.23907608188667503,"score_spread":0.22875817063391027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495745209","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19895819,0.023939177,0.0015656442,0.00045180993,0.003949917,0.0008228068,0.00012464172,0.0005557315,0.7696321],"genre_scores_gemma":[0.7773832,0.00008322541,0.0011461677,0.00028144178,0.0018770188,8.3548275e-7,0.0011665837,0.000043438245,0.21801808],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855596,0.000029661027,0.00034879305,0.0005567047,0.00017393574,0.0003349413],"domain_scores_gemma":[0.99925524,0.000022891227,0.00024592452,0.00026510822,0.00016072666,0.000050113187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014508689,0.00039980863,0.0003532481,0.00004958143,0.00023330342,0.000062607534,0.000278301,0.0006095439,0.000013384805],"category_scores_gemma":[0.000046547666,0.00033582863,0.00022293955,0.000024919795,0.00019770702,0.0000037687148,0.00038981444,0.0004425611,0.000025296218],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001050882,0.0001628069,0.001982882,0.0006479119,0.00096114306,0.00018770066,0.00011350051,0.0024133387,0.5011631,0.10547504,0.26703814,0.11880351],"study_design_scores_gemma":[0.000510405,0.00095719076,0.0017628098,0.0003733935,0.00008925283,0.00017892424,0.000016080581,0.000690124,0.02584106,0.007436658,0.9603247,0.0018193999],"about_ca_topic_score_codex":0.000010328406,"about_ca_topic_score_gemma":0.000025959573,"teacher_disagreement_score":0.69328654,"about_ca_system_score_codex":0.000031313917,"about_ca_system_score_gemma":0.00004621946,"threshold_uncertainty_score":0.9999094},"labels":[],"label_agreement":null},{"id":"W1501007009","doi":"10.1007/11753681","title":"DNA computing : 11th International workshop on DNA computing, DNA11, London, ON, Canada, June 6-9, 2005 : Revised selected papers","year":2006,"lang":"en","type":"book","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"DNA computing; Computer science; In vitro recombination; DNA; Theoretical computer science; Algorithm; Biology; Genetics; Molecular cloning; Computation; Gene","score_opus":0.007705307379715683,"score_gpt":0.22267641561221665,"score_spread":0.21497110823250098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501007009","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03238814,0.00078622747,0.0012995458,0.0016871595,0.002790633,0.0009088925,0.00015950926,0.00023639257,0.9597435],"genre_scores_gemma":[0.14311649,0.00009414007,0.0005558057,0.005618165,0.00396314,0.0000042854895,0.0064963507,0.00012229306,0.8400293],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99605525,0.0001567446,0.0008713555,0.0013930335,0.00061706576,0.00090657076],"domain_scores_gemma":[0.99805146,0.00020425768,0.0005715353,0.0005853345,0.00033758767,0.00024984023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033908212,0.00085801247,0.0007142532,0.0001280646,0.00027910163,0.000112568436,0.00091647415,0.0008475626,0.00023339658],"category_scores_gemma":[0.00024792188,0.00072113867,0.00029977987,0.00015959583,0.00012585898,0.000002438671,0.0004386214,0.00078788644,0.000031941687],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015666198,0.00011602284,0.0001720325,0.000043890974,0.00031595476,0.000064389744,0.000006075131,0.0011377864,0.007933774,0.00036349584,0.97155696,0.018132973],"study_design_scores_gemma":[0.0008404304,0.00023925216,0.0009747511,0.00046674733,0.000046490215,0.000021168298,0.000008916279,0.0007359029,0.003682368,0.000024469578,0.99195004,0.0010094425],"about_ca_topic_score_codex":0.0021905254,"about_ca_topic_score_gemma":0.04907856,"teacher_disagreement_score":0.11971418,"about_ca_system_score_codex":0.00042314295,"about_ca_system_score_gemma":0.0011193664,"threshold_uncertainty_score":0.999524},"labels":[],"label_agreement":null},{"id":"W1503227914","doi":"10.1142/4802","title":"Words, Semigroups, and Transductions","year":2001,"lang":"en","type":"book","venue":"WORLD SCIENTIFIC eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Psychology","score_opus":0.015428942075273124,"score_gpt":0.23038553210486662,"score_spread":0.2149565900295935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503227914","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011008233,0.0015584194,0.00024011129,0.000069525675,0.0011691524,0.00026176329,0.000046008903,0.000050062965,0.9855967],"genre_scores_gemma":[0.016122457,0.0000114685845,0.00028115502,0.00015179896,0.00074737833,0.000009592512,0.0003848898,0.000026455768,0.9822648],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983916,0.00004095129,0.00024830122,0.0008208282,0.00016868986,0.00032957224],"domain_scores_gemma":[0.9992578,0.000015694191,0.00009742565,0.00043299765,0.000060349434,0.00013570485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000323913,0.00026748137,0.00022997185,0.00013974008,0.00036464087,0.00016251976,0.00025683825,0.0002577648,0.000069183414],"category_scores_gemma":[0.000009487609,0.00023026465,0.00014680903,0.000065263295,0.00054870377,0.000001270081,0.00016342146,0.00026373833,0.000024881292],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054443528,0.000060066905,0.00017395898,0.000099092475,0.00015902115,0.000034823373,0.00015870457,0.0000059472063,0.15269308,0.0035740589,0.793404,0.04958281],"study_design_scores_gemma":[0.00013210505,0.000053839853,0.000022504319,0.000058320737,0.000031861844,0.000026187992,0.000009232133,0.0000054637576,0.0022696727,0.0014522509,0.99563724,0.0003013423],"about_ca_topic_score_codex":0.0000013264754,"about_ca_topic_score_gemma":0.0006045027,"teacher_disagreement_score":0.20223323,"about_ca_system_score_codex":0.000020087733,"about_ca_system_score_gemma":0.00012839958,"threshold_uncertainty_score":0.93899196},"labels":[],"label_agreement":null},{"id":"W1536047544","doi":"10.1007/11925903_6","title":"Gene Assembly Algorithms for Ciliates","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":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Coding (social sciences); Gene; Algorithm; Coding region; Heuristic; Theoretical computer science; Biology; Mathematics; Genetics; Artificial intelligence","score_opus":0.020294322320876496,"score_gpt":0.26163653968018563,"score_spread":0.24134221735930914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536047544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035866408,0.0008966968,0.9922754,0.00012400604,0.00090712326,0.00031562208,0.000026067035,0.000026558964,0.0018418734],"genre_scores_gemma":[0.56837845,0.0000755596,0.42076707,0.002363233,0.0046537225,0.000024423105,0.00043162674,0.00007454283,0.0032313948],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980744,0.000011975172,0.00028331828,0.0009723041,0.00021438666,0.00044360105],"domain_scores_gemma":[0.99914765,0.00008848747,0.00013420443,0.00039784028,0.00016221224,0.00006960014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003824642,0.00032564107,0.00028325096,0.00011130809,0.00014389309,0.00009532746,0.0007002183,0.00041848177,0.000004022099],"category_scores_gemma":[0.00007601802,0.00026122987,0.00015271,0.00008625574,0.00031658067,0.000003898818,0.00042324624,0.00020228075,0.0000048381767],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038478272,0.000053614967,0.00019831026,0.000050896262,0.000031450294,0.000022261218,0.000017905368,0.01798441,0.1555882,0.00031506454,0.00056747784,0.82513195],"study_design_scores_gemma":[0.0015366989,0.0030294284,0.00079795124,0.0003420584,0.00005706834,0.00012401641,2.3213315e-7,0.14986521,0.6664268,0.085549906,0.08926378,0.0030068746],"about_ca_topic_score_codex":0.00000845576,"about_ca_topic_score_gemma":0.000020256786,"teacher_disagreement_score":0.8221251,"about_ca_system_score_codex":0.00003969581,"about_ca_system_score_gemma":0.00014026623,"threshold_uncertainty_score":0.99998397},"labels":[],"label_agreement":null},{"id":"W1536273031","doi":"10.1109/isit.1994.394684","title":"Sequential sequence estimation for CPM","year":2002,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Trellis (graph); Alphabet; Sequence (biology); Computer science; Modulation (music); Algorithm; Graph; Reduction (mathematics); Theoretical computer science; Mathematics; Decoding methods","score_opus":0.06565258982604555,"score_gpt":0.2998097405995631,"score_spread":0.23415715077351756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536273031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78753304,0.00013297124,0.2034025,0.00033494172,0.00014556397,0.00019194493,0.000008358474,0.00003620597,0.008214462],"genre_scores_gemma":[0.98241955,0.000009527145,0.015130188,0.00038903553,0.00016004223,0.000008561746,0.000056691235,0.0000038112305,0.0018225872],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996087,0.000010709381,0.00007814607,0.00015441091,0.00003095994,0.00011706089],"domain_scores_gemma":[0.99983233,0.000007227529,0.00002139575,0.000083911684,0.00002844485,0.000026674858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059336217,0.00005421859,0.00004373697,0.000007022222,0.000050699462,0.00001385752,0.00007090532,0.000064799315,0.000077612836],"category_scores_gemma":[0.00005944599,0.000040992294,0.000044678596,0.000023344277,0.000023495008,0.000001167493,0.000031689135,0.000018748946,0.000018991524],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011529684,0.000027166428,0.00018234519,0.00000771373,0.000010425801,7.6540454e-7,0.000007706752,0.00020156452,0.94609255,0.0009003011,0.0050934157,0.0474645],"study_design_scores_gemma":[0.0008255014,0.0009783931,0.00036921073,0.000009786958,0.000017546043,0.000036905094,0.000015680516,0.15876253,0.71981514,0.0015360138,0.11720785,0.00042548045],"about_ca_topic_score_codex":0.0000027272429,"about_ca_topic_score_gemma":0.0000016837724,"teacher_disagreement_score":0.22627746,"about_ca_system_score_codex":0.0000035448984,"about_ca_system_score_gemma":0.000003379953,"threshold_uncertainty_score":0.16716173},"labels":[],"label_agreement":null},{"id":"W1537079998","doi":"10.3233/fun-2004-59403","title":"Trajectory-Based Embedding Relations","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Embedding; Trajectory; Computer science; Mathematics; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.013528172953539632,"score_gpt":0.2637694309856211,"score_spread":0.25024125803208147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537079998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9504839,0.000041638406,0.034252662,0.00023173304,0.00011781429,0.00014804563,0.000009960465,0.00004269778,0.014671512],"genre_scores_gemma":[0.98448956,0.0000024661556,0.013873241,0.0012430347,0.000086741726,0.000010000813,0.00014815255,0.0000064032874,0.00014037137],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993435,0.000013425833,0.0002276481,0.00011544958,0.00009340686,0.00020655581],"domain_scores_gemma":[0.9996548,0.000011530573,0.00006519348,0.00017329534,0.00002529498,0.00006987163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011813251,0.00010456451,0.00008365609,0.000032431235,0.00013659232,0.00004115778,0.00013423053,0.00008798722,0.000089383495],"category_scores_gemma":[0.000058922287,0.00008530946,0.00007589712,0.00007750713,0.000052962863,0.0000070402148,0.000058382713,0.00007825644,0.00015304895],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004633095,0.001142961,0.04384431,0.00032301384,0.00045039316,0.000021962747,0.0018510962,0.17505583,0.70930725,0.016659046,0.015628891,0.035251964],"study_design_scores_gemma":[0.01054079,0.0041066185,0.031831156,0.00032484074,0.00012252804,0.000081610684,0.0021515626,0.014531811,0.40663514,0.0033880903,0.5238247,0.0024611682],"about_ca_topic_score_codex":0.000004247229,"about_ca_topic_score_gemma":0.0000031518375,"teacher_disagreement_score":0.5081958,"about_ca_system_score_codex":0.000030430781,"about_ca_system_score_gemma":0.000060224353,"threshold_uncertainty_score":0.34788188},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011269634811849989,"score_gpt":0.2392232831598932,"score_spread":0.22795364834804321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553144061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09416657,0.0018107928,0.88825464,0.00028220355,0.0014220567,0.00043811588,0.000014985022,0.00004894483,0.013561686],"genre_scores_gemma":[0.97796696,0.00002620116,0.019677516,0.0008409629,0.0008759515,0.0000024845633,0.000052551713,0.000021404774,0.0005359661],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979585,0.000025156269,0.00032738002,0.00097322866,0.00026234036,0.00045339554],"domain_scores_gemma":[0.99925715,0.00004899027,0.000121775,0.00045428888,0.000053938995,0.00006386113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030848206,0.00034704202,0.00030522802,0.00021747134,0.00008101261,0.00008862965,0.0008185422,0.00047800472,0.000015035375],"category_scores_gemma":[0.00006272647,0.00027785098,0.00009808743,0.00016568825,0.00046578248,0.0000046225573,0.00060041016,0.0004202896,0.0000048633774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087740955,0.00007062351,0.004156025,0.000067752466,0.000022737622,0.00017298793,0.000096010896,0.06909011,0.08273124,0.0017922096,0.00034356213,0.841369],"study_design_scores_gemma":[0.0038699962,0.0037095654,0.04247472,0.0017822107,0.000054765776,0.0003926224,0.0000016326813,0.07303495,0.27257857,0.4896756,0.104192264,0.008233082],"about_ca_topic_score_codex":0.000031389853,"about_ca_topic_score_gemma":0.0002572414,"teacher_disagreement_score":0.8838004,"about_ca_system_score_codex":0.000058444577,"about_ca_system_score_gemma":0.00014657264,"threshold_uncertainty_score":0.99996734},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Formal language; Computer science; Programming language; Computational biology; Biology","score_opus":0.006143947400711379,"score_gpt":0.24264472975004872,"score_spread":0.23650078234933733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562193608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98824114,0.00008671354,0.0022967274,0.000016742955,0.000038606388,0.000080950835,0.00004372548,0.000012944072,0.009182481],"genre_scores_gemma":[0.99742746,0.0000032149674,0.0015269956,0.00022815916,0.000065919594,0.000003268281,0.0005570884,0.000003567034,0.00018431299],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923766,0.0000163865,0.00032619608,0.00009879408,0.00011065842,0.00021033078],"domain_scores_gemma":[0.99959886,0.000010845872,0.00013147868,0.00019900707,0.000026443973,0.00003338849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011619597,0.00010284921,0.00017841998,0.000086731,0.000052828713,0.000024025954,0.0001618576,0.00007810565,0.000102353384],"category_scores_gemma":[0.00002150943,0.00007614493,0.00015420449,0.00021318255,0.00006163119,0.000008389458,0.0001375849,0.00004344357,0.000005912719],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026170135,0.00020356342,0.078380674,0.0001489007,0.001649458,0.000004668207,0.00064331864,0.0026873865,0.88233393,0.0071298433,0.0045335386,0.022023024],"study_design_scores_gemma":[0.0016859036,0.001082468,0.4136734,0.000026728694,0.00078914245,0.000015296506,0.0020184699,0.008534556,0.53495246,0.00050957146,0.03588553,0.000826507],"about_ca_topic_score_codex":0.00005879279,"about_ca_topic_score_gemma":0.00004013759,"teacher_disagreement_score":0.34738147,"about_ca_system_score_codex":0.000007684574,"about_ca_system_score_gemma":0.00001293401,"threshold_uncertainty_score":0.31051},"labels":[],"label_agreement":null},{"id":"W156605946","doi":"","title":"Computational modeling of genetic processes in stichotrichous ciliates","year":2003,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Closure (psychology); Decidability; Computer science; Computational complexity theory; Theoretical computer science; Formal language; Ciliate; Process (computing); Computational problem; Computational model; Mathematics; Algorithm; Biology; Genetics; Programming language","score_opus":0.017522356736801845,"score_gpt":0.2500532076570155,"score_spread":0.23253085092021364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156605946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9489628,0.0006492644,0.047698658,0.000007972821,0.000018471666,0.00005684879,0.0000012400191,0.0000053648246,0.0025993756],"genre_scores_gemma":[0.9868804,0.000032533546,0.012943926,0.000066665234,0.000016295371,0.0000024325557,0.000010351585,0.0000037789482,0.000043579854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947715,0.000028479624,0.00017314847,0.00015527089,0.00005533309,0.00011061145],"domain_scores_gemma":[0.999785,0.00001980039,0.000028832437,0.00005736766,0.00008735668,0.00002163511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084006475,0.00006226305,0.000079004894,0.000025350802,0.000015779045,0.000005018874,0.000064887936,0.000054329306,0.000012083033],"category_scores_gemma":[0.00023822828,0.000048659447,0.000020746233,0.00011867606,0.00001955525,8.3083285e-7,0.000022203083,0.000029204666,0.0000014658449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030337209,0.00016735222,0.10794761,0.000070041635,0.00001753511,0.0000026811394,0.00003015024,0.85022414,0.039644122,0.00044885732,0.00003572067,0.0013814439],"study_design_scores_gemma":[0.0038614466,0.0018639225,0.036239132,0.00013022704,0.00004197437,0.00007095645,0.00052561524,0.71865207,0.20975776,0.024578424,0.00285184,0.0014266614],"about_ca_topic_score_codex":0.000008165433,"about_ca_topic_score_gemma":0.000009912263,"teacher_disagreement_score":0.17011364,"about_ca_system_score_codex":0.000002870897,"about_ca_system_score_gemma":0.000055299348,"threshold_uncertainty_score":0.19842747},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Substring; Computer science; Algorithm; Artificial intelligence; Programming language; Data structure","score_opus":0.01017285368743673,"score_gpt":0.21926727264293366,"score_spread":0.20909441895549694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567910696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52087855,0.0026962555,0.46771827,0.00018458856,0.00021122034,0.00039147236,0.00000791612,0.000051103376,0.007860621],"genre_scores_gemma":[0.952652,0.00019083556,0.04544735,0.0007111021,0.00061138626,0.0000025251736,0.000019729254,0.000023171033,0.00034193837],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984182,0.000010950844,0.0001959516,0.0008341685,0.00020239485,0.0003383409],"domain_scores_gemma":[0.9994441,0.000041268682,0.00010244816,0.00027181843,0.000056482993,0.00008386981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021961225,0.00028991562,0.00023126864,0.00009526352,0.00015734417,0.0001469524,0.00040400648,0.0002478979,0.000010446572],"category_scores_gemma":[0.000022378917,0.0002099747,0.000040843566,0.00008558355,0.00043616502,0.0000072277594,0.0003404856,0.0002683383,0.000001997934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058278147,0.000014683088,0.0015348846,0.00004083955,0.000024292847,0.000043261956,0.000100163285,0.013845018,0.029576028,0.00023133715,0.000013261969,0.95451796],"study_design_scores_gemma":[0.00716778,0.019593474,0.0062006307,0.004595959,0.00024603645,0.002346331,0.0000075847197,0.3736755,0.39689124,0.07286673,0.10326896,0.013139764],"about_ca_topic_score_codex":0.000013160535,"about_ca_topic_score_gemma":0.00005121604,"teacher_disagreement_score":0.9413782,"about_ca_system_score_codex":0.000019175492,"about_ca_system_score_gemma":0.00009148759,"threshold_uncertainty_score":0.856252},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007681325748701296,"score_gpt":0.2392440040577874,"score_spread":0.2315626783090861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569419053","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012390226,0.0073476247,0.00075961626,0.00003496763,0.000012307201,0.00020294177,0.00002559628,0.00003868262,0.9903392],"genre_scores_gemma":[0.022155859,0.0017264861,0.00060753,0.0006840994,0.0005908261,0.00002197963,0.00038080325,0.000021952363,0.9738105],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993906,0.000030319086,0.00010143645,0.0003261673,0.00003890438,0.00011259106],"domain_scores_gemma":[0.9996629,0.000033740595,0.000044597768,0.0001868715,0.00001731197,0.000054590448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012519726,0.00014371269,0.00012544988,0.000017788836,0.000057367728,0.000023789687,0.000095431584,0.00029149087,0.00003053123],"category_scores_gemma":[0.000019959405,0.00010514122,0.00003274167,0.000011704236,0.00010886606,5.829441e-7,0.00021372875,0.00008841281,0.000013635716],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006000832,0.0001055272,0.00023554305,0.00031988852,0.00030252116,0.000015964959,0.000040343944,8.5405446e-7,0.044727538,0.27926376,0.14647649,0.52845156],"study_design_scores_gemma":[0.00019407658,0.0001504817,0.00014430689,0.00002067995,0.000034307945,0.000038670096,0.000038843722,0.000006032,0.0006145183,0.010208369,0.9882487,0.0003010178],"about_ca_topic_score_codex":8.7982386e-7,"about_ca_topic_score_gemma":0.0000019873755,"teacher_disagreement_score":0.8417722,"about_ca_system_score_codex":0.0000036967563,"about_ca_system_score_gemma":0.000014914,"threshold_uncertainty_score":0.42875347},"labels":[],"label_agreement":null},{"id":"W1570640940","doi":"10.1007/978-3-642-15461-4_1","title":"A Graph-Based Developmental Swarm Representation and Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Rule-based machine translation; Theoretical computer science; Representation (politics); Graph; Generative grammar; Swarm behaviour; Multi-agent system; Property (philosophy); Artificial intelligence","score_opus":0.014235389900059207,"score_gpt":0.25003949765511296,"score_spread":0.23580410775505375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570640940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024153255,0.00022227918,0.9740719,0.000106098516,0.00043961703,0.00017572774,0.0000057434922,0.000018506935,0.0008068546],"genre_scores_gemma":[0.43668467,0.000036554153,0.56116915,0.0013188287,0.0005343613,0.0000047631133,0.00008307115,0.000019883168,0.00014871679],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985913,0.000013506909,0.00018910391,0.00077228586,0.00019368547,0.00024011143],"domain_scores_gemma":[0.9994904,0.000048345937,0.00009108705,0.0002205934,0.000073513766,0.00007607169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024169352,0.00022305988,0.00017190352,0.00012992945,0.00013592963,0.00008019223,0.00034131363,0.00032829551,0.0000072517564],"category_scores_gemma":[0.00005617647,0.00018248797,0.000055746295,0.000096606105,0.0005383619,0.0000041016788,0.0003555744,0.00030802473,0.0000029275186],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013306442,0.000016972504,0.00043240405,0.0000112476055,0.000009235551,0.00002279673,0.00003432268,0.00050688174,0.09038037,0.00005112787,0.000006455253,0.90851486],"study_design_scores_gemma":[0.0015080248,0.0012469097,0.0032261105,0.00032408876,0.000030756462,0.00034180234,0.000001107521,0.0557396,0.87416553,0.04632314,0.014902744,0.0021902048],"about_ca_topic_score_codex":0.0000076278366,"about_ca_topic_score_gemma":0.00003093535,"teacher_disagreement_score":0.9063247,"about_ca_system_score_codex":0.000018830331,"about_ca_system_score_gemma":0.00014732096,"threshold_uncertainty_score":0.7441644},"labels":[],"label_agreement":null},{"id":"W1570814494","doi":"10.1007/978-3-642-14455-4_39","title":"Pseudo-power Avoidance","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Repetition (rhetorical device); Property (philosophy); Complementarity (molecular biology); Power (physics); Theoretical computer science; Algorithm; Physics; Biology","score_opus":0.010077664795226577,"score_gpt":0.23729925388807835,"score_spread":0.22722158909285178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570814494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028049577,0.00063663576,0.95661855,0.0002985746,0.0018935095,0.0002476093,0.000008625409,0.00004235288,0.012204562],"genre_scores_gemma":[0.9168164,0.0000495772,0.07865061,0.0021731954,0.0011840512,0.0000032375287,0.000023233113,0.000031034564,0.001068648],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980153,0.000015436908,0.00025614974,0.0010151977,0.0002679391,0.00042998005],"domain_scores_gemma":[0.9989434,0.000055118395,0.00013300529,0.0006427297,0.00012072605,0.00010500424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039515685,0.00033502432,0.0002616385,0.00010853531,0.00015529133,0.00009363508,0.000988829,0.0005986237,0.000046495534],"category_scores_gemma":[0.00011954952,0.00026486706,0.00011693487,0.00009789881,0.00071989116,0.000004519229,0.00072856183,0.0007009725,0.00003144228],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038544647,0.00004834906,0.0004995868,0.000027819686,0.000021490001,0.000059029273,0.000076110504,0.001687974,0.6214739,0.0014280685,0.00007541863,0.37456372],"study_design_scores_gemma":[0.0012845928,0.0027375652,0.0022805098,0.0006555813,0.000035603294,0.00040546004,4.491871e-7,0.012314815,0.60166246,0.118803605,0.2554601,0.0043592392],"about_ca_topic_score_codex":0.000002990881,"about_ca_topic_score_gemma":0.000031907628,"teacher_disagreement_score":0.8887668,"about_ca_system_score_codex":0.00002457527,"about_ca_system_score_gemma":0.0001585893,"threshold_uncertainty_score":0.99998033},"labels":[],"label_agreement":null},{"id":"W158624546","doi":"","title":"Note on transformation of posets with the same semi bound graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Star product; Combinatorics; Chemistry","score_opus":0.007142248163686592,"score_gpt":0.2307854759495268,"score_spread":0.22364322778584023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158624546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960307,0.00010072044,0.00005195375,0.00084739726,0.00009859666,0.000107950604,0.0000036940503,0.000009052345,0.0027499353],"genre_scores_gemma":[0.9993069,0.000021003938,0.000061457285,0.0005054478,0.000015349786,0.0000034161312,0.00002873415,0.000005710312,0.000051952964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994938,0.000038391387,0.00011302868,0.00012893236,0.00009627572,0.0001296116],"domain_scores_gemma":[0.99968934,0.000020287234,0.000057741287,0.00016227459,0.0000432868,0.000027062099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013350957,0.00008852749,0.000083087005,0.000014302404,0.00007316764,0.00001154495,0.00013999248,0.000077026314,0.0000042406805],"category_scores_gemma":[0.000012798901,0.000050266965,0.000049461465,0.00007412997,0.00006964435,0.0000029717853,0.000020610169,0.00007545651,0.0000045447287],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064123736,0.00044629964,0.0031200286,0.000046642082,0.00012610253,0.0000026218684,0.00065626577,0.0004109583,0.8090115,0.14955682,0.0031663696,0.03281513],"study_design_scores_gemma":[0.0022105745,0.003263502,0.014560952,0.00005550361,0.000034531324,0.00001650818,0.0001282227,0.00028663423,0.91275054,0.019156715,0.047125436,0.00041084722],"about_ca_topic_score_codex":0.000005733833,"about_ca_topic_score_gemma":0.000011379625,"teacher_disagreement_score":0.13040009,"about_ca_system_score_codex":0.000006215429,"about_ca_system_score_gemma":0.000015833413,"threshold_uncertainty_score":0.20498273},"labels":[],"label_agreement":null},{"id":"W1594387091","doi":"10.1007/978-0-387-35608-2","title":"Foundations of information technology in the era of network and mobile computing : IFIP 17th World Computer Congress - TC1 Stream /2nd IFIP International Conference on Theoretical Computer Science (TCS 2002) August 25-30, 2002, Montréal, Québec, Canada","year":2002,"lang":"en","type":"book","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.008524662849964384,"score_gpt":0.22536746381800185,"score_spread":0.21684280096803746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594387091","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20498174,0.0039296066,0.08448005,0.0063817203,0.004647488,0.0053300164,0.0007064664,0.00016401363,0.6893789],"genre_scores_gemma":[0.9906169,0.00017727668,0.0043185954,0.0008662575,0.0003990947,0.00001338584,0.00025503963,0.000013898161,0.0033395202],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802446,0.00007996697,0.00073192304,0.00042301655,0.0003833418,0.0003573053],"domain_scores_gemma":[0.9984965,0.00019107277,0.00046911617,0.00037509168,0.0004022448,0.000066027555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044395443,0.00030429763,0.00041129053,0.00017648762,0.00017815894,0.00008659615,0.0007688076,0.00027014135,0.00036953643],"category_scores_gemma":[0.000051211988,0.00021581544,0.000065911256,0.0002582956,0.0013669208,0.000015803502,0.000540306,0.0004807137,0.0000040028376],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021569738,0.00061751314,0.0048517673,0.0002613441,0.00042344714,0.000030018671,0.00037294874,0.024308933,0.0008289463,0.33122233,0.38674,0.25012705],"study_design_scores_gemma":[0.0037736543,0.0038702036,0.006484014,0.0021490278,0.00016161756,0.00014386908,0.0004994022,0.43112123,0.0022922927,0.0052230563,0.54182184,0.002459779],"about_ca_topic_score_codex":0.011496997,"about_ca_topic_score_gemma":0.048092566,"teacher_disagreement_score":0.7856352,"about_ca_system_score_codex":0.00009877329,"about_ca_system_score_gemma":0.0006494093,"threshold_uncertainty_score":0.99508554},"labels":[],"label_agreement":null},{"id":"W1598203455","doi":"10.1007/978-3-540-27812-2_14","title":"Substitution on Trajectories","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Substitution (logic); Computer science; Closure (psychology); Cryptanalysis; Word (group theory); Theoretical computer science; Class (philosophy); Binary number; Algorithm; Artificial intelligence; Programming language; Arithmetic; Cryptography; Mathematics","score_opus":0.01619292755635701,"score_gpt":0.24390310888693942,"score_spread":0.2277101813305824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598203455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020298196,0.00043121554,0.9627187,0.00018800383,0.0014394553,0.0002556391,0.000007986389,0.000044085933,0.01461672],"genre_scores_gemma":[0.98855716,0.000040425166,0.009162733,0.00088361016,0.0008803363,0.0000019035182,0.0000449751,0.0000137167735,0.0004151126],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985485,0.000010923203,0.00018370265,0.0007359022,0.00023496918,0.00028600948],"domain_scores_gemma":[0.9994089,0.000032886026,0.000082439874,0.00034675427,0.00006768588,0.00006133842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021056368,0.00025981796,0.00018908623,0.00010820278,0.00011912479,0.0000630238,0.00047798178,0.0003284105,0.000018121973],"category_scores_gemma":[0.00007120796,0.00020182334,0.00008582459,0.00009099844,0.0004948283,0.000003406111,0.00020881165,0.00028500496,0.000028918093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019007485,0.00014808786,0.00057573005,0.00008820614,0.000049445713,0.00013929924,0.00013747852,0.13069405,0.09994202,0.0542094,0.00010185918,0.7137243],"study_design_scores_gemma":[0.0023818363,0.007917383,0.0034643933,0.0019327232,0.00005424414,0.0002103041,4.7869446e-7,0.007859973,0.5221102,0.356509,0.09286354,0.0046959003],"about_ca_topic_score_codex":0.0000029092282,"about_ca_topic_score_gemma":0.000017640064,"teacher_disagreement_score":0.968259,"about_ca_system_score_codex":0.000077445206,"about_ca_system_score_gemma":0.00020125332,"threshold_uncertainty_score":0.8230117},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027310628067464062,"score_gpt":0.23814518418884842,"score_spread":0.21083455612138435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600165002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9716328,0.003407291,0.020379804,0.0002770571,0.00019327801,0.0001476781,8.537326e-7,0.000019212714,0.0039420235],"genre_scores_gemma":[0.99687856,0.00008739776,0.0018028164,0.00009861697,0.00035628813,0.0000012526689,0.000027774306,0.000007520313,0.0007397908],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926287,0.000073698866,0.0002515362,0.00016686332,0.00011170698,0.00013329873],"domain_scores_gemma":[0.9993131,0.000027657128,0.00017527855,0.00033403738,0.00011042975,0.000039496827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024410718,0.00008810431,0.00009404652,0.000011421229,0.00026525903,0.000053228145,0.00019549398,0.0000621731,0.00000783481],"category_scores_gemma":[0.00003232177,0.000054418513,0.00003579324,0.000083729734,0.000056335663,0.0000023592627,0.00008697515,0.000061113766,0.0000033712831],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009806572,0.0002715117,0.05269399,0.000031239226,0.00039610753,0.0000076003926,0.0007636678,0.100815676,0.63275504,0.011830455,0.09063451,0.10970212],"study_design_scores_gemma":[0.0025685818,0.0027961603,0.009577354,0.00018787809,0.00007200699,0.000208283,0.0007536699,0.5138672,0.12703635,0.00005794435,0.34169474,0.0011798233],"about_ca_topic_score_codex":0.000014104111,"about_ca_topic_score_gemma":0.000009165897,"teacher_disagreement_score":0.5057187,"about_ca_system_score_codex":0.000004982088,"about_ca_system_score_gemma":0.000021133248,"threshold_uncertainty_score":0.22191225},"labels":[],"label_agreement":null},{"id":"W1605220802","doi":"10.1007/11496656_1","title":"Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Simple (philosophy); Computer science; Scheme (mathematics); Abstraction; Approximation algorithm; Polynomial-time approximation scheme; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.02308233954582812,"score_gpt":0.2727705525386923,"score_spread":0.2496882129928642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605220802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028307583,0.00040187655,0.96958566,0.0002722332,0.0004265179,0.00059201836,0.00003577824,0.000018418583,0.0003599114],"genre_scores_gemma":[0.69485706,0.000023702141,0.29924244,0.003041873,0.0020296292,0.000032114178,0.00021372557,0.000040449864,0.00051900756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984124,0.000010213575,0.00023973266,0.0008745309,0.00012884158,0.0003342835],"domain_scores_gemma":[0.9992583,0.000083859224,0.00011222185,0.00030472683,0.00015979615,0.00008113425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038520352,0.00026752378,0.000228647,0.000084660904,0.00016083816,0.0001312143,0.00034819188,0.00036257197,0.0000057055777],"category_scores_gemma":[0.00008119611,0.00021656153,0.00008960853,0.00003633508,0.00036649068,0.000007271574,0.00029252164,0.00014091945,0.0000011038227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092050694,0.000049008417,0.00026502888,0.00008392458,0.000021438856,0.0000014963342,0.000065373984,0.0007186163,0.056915373,0.00055096624,0.00012158035,0.94111514],"study_design_scores_gemma":[0.002986211,0.0061809416,0.0005794596,0.00046924994,0.00006409663,0.00014112334,0.0000015989546,0.73390985,0.06070751,0.055844482,0.13623175,0.0028837104],"about_ca_topic_score_codex":0.0000018399049,"about_ca_topic_score_gemma":0.000023844192,"teacher_disagreement_score":0.9382314,"about_ca_system_score_codex":0.00002559956,"about_ca_system_score_gemma":0.000084605555,"threshold_uncertainty_score":0.88311225},"labels":[],"label_agreement":null},{"id":"W162061640","doi":"","title":"Self-Dual Confined Configurations With Ten Points.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number)","score_opus":0.008409585598752102,"score_gpt":0.22398269000087415,"score_spread":0.21557310440212205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162061640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.954832,0.00010822173,0.000076240976,0.00015268639,0.00027950373,0.00015125315,0.0000036673532,0.00004858112,0.044347823],"genre_scores_gemma":[0.99805176,0.000010959323,0.0011925299,0.00032408943,0.0000144905125,0.0000099797335,0.00005491323,0.000011256274,0.0003300188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921554,0.00008241523,0.00013497638,0.00026393897,0.00008588549,0.00021722981],"domain_scores_gemma":[0.9995388,0.000020224286,0.000054681597,0.00021365943,0.00009500844,0.00007762174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014318974,0.00013065588,0.000117225936,0.000016429496,0.00011393821,0.000028081817,0.00009843824,0.00011004769,0.000034169538],"category_scores_gemma":[0.0000856042,0.00009655853,0.00004258581,0.0000913401,0.000055790704,0.0000024306403,0.000030951374,0.00008243696,0.000024552552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077399534,0.00035677277,0.012674519,0.000015918577,0.00017506882,0.000023929262,0.000059778125,0.000007651939,0.1878868,0.79497963,0.0033416965,0.00040081536],"study_design_scores_gemma":[0.0061323517,0.0040045306,0.014255306,0.000032954344,0.000108275635,0.00020911763,0.00030672358,0.000089195884,0.50663763,0.058766026,0.4081575,0.0013004126],"about_ca_topic_score_codex":0.0000030489837,"about_ca_topic_score_gemma":0.000002690629,"teacher_disagreement_score":0.7362136,"about_ca_system_score_codex":0.000007673732,"about_ca_system_score_gemma":0.000064732645,"threshold_uncertainty_score":0.39375424},"labels":[],"label_agreement":null},{"id":"W1635909773","doi":"10.1007/978-3-540-88869-7_8","title":"Template-Guided Recombination: From Theory to Laboratory","year":2009,"lang":"en","type":"book-chapter","venue":"Natural computing series","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Western University","funders":"","keywords":"Recombination; Computational biology; Computer science; Biology; Genetics","score_opus":0.013415699200183154,"score_gpt":0.25141423886541114,"score_spread":0.237998539665228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1635909773","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45218918,0.02445128,0.0024986914,0.0034751073,0.0092521375,0.0021463078,0.0005355712,0.0010801647,0.5043716],"genre_scores_gemma":[0.67833525,0.00014492402,0.013158561,0.0053906073,0.0036371367,0.000003111626,0.0020111608,0.00011542319,0.2972038],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829435,0.0000782212,0.00039911724,0.0007240069,0.00019441085,0.0003098941],"domain_scores_gemma":[0.9989394,0.00006878583,0.00021913706,0.00038923253,0.00027512765,0.000108317974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030040584,0.00043780982,0.0003943291,0.00006616674,0.00021534238,0.000084751395,0.00042361737,0.000609174,0.00006279143],"category_scores_gemma":[0.00017051653,0.00037696504,0.00017070246,0.000051865612,0.00008611123,0.0000054963502,0.00035945253,0.00047171328,0.000066317414],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011870752,0.00010172468,0.0002765572,0.00011025617,0.00084427954,0.00016558777,0.0003133757,0.00022721142,0.23529768,0.082379535,0.09717264,0.5819241],"study_design_scores_gemma":[0.00036943294,0.0007502059,0.0008739221,0.00025350356,0.000047714682,0.000023830586,0.000023317525,0.000019720765,0.019053508,0.026770843,0.9507327,0.0010813236],"about_ca_topic_score_codex":0.0000040767227,"about_ca_topic_score_gemma":0.000007824111,"teacher_disagreement_score":0.85356003,"about_ca_system_score_codex":0.000037210313,"about_ca_system_score_gemma":0.000065701104,"threshold_uncertainty_score":0.9998682},"labels":[],"label_agreement":null},{"id":"W1659750926","doi":"","title":"Block Substitutions and Their Properties","year":2006,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Substitution (logic); Decidability; Closure (psychology); Hierarchy; Block (permutation group theory); Computer science; Mathematics; Type (biology); Theoretical computer science; Algebra over a field; Algorithm; Discrete mathematics; Programming language; Pure mathematics; Combinatorics","score_opus":0.012272361941071192,"score_gpt":0.1910393230670962,"score_spread":0.178766961126025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1659750926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879857,0.00096752646,0.00054653833,0.00012139634,0.000022372233,0.000038971386,0.000001021671,0.000015294529,0.01030118],"genre_scores_gemma":[0.9983748,0.0000152551665,0.00017272416,0.00012166863,0.00012996065,0.0000021046487,0.000008311798,0.0000020471455,0.001173108],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971855,0.00000968565,0.000056693912,0.000115128074,0.000014267083,0.00008565761],"domain_scores_gemma":[0.99989516,0.0000015810351,0.000009561916,0.00006147185,0.000016393467,0.000015820391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000033874385,0.00005209755,0.000040272225,0.000005872865,0.000065023756,0.0000134231395,0.00003745454,0.00004319227,0.0000031889288],"category_scores_gemma":[0.000008893029,0.000028450691,0.000019286595,0.000019082363,0.00006316527,5.687443e-7,0.000051076666,0.000019564617,0.0000028402776],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000471511,0.000017873617,0.0031616597,0.0000023085984,0.000004014632,2.6084814e-7,0.0000024667847,0.00001689336,0.99441767,0.0010043177,0.00045428934,0.0009135043],"study_design_scores_gemma":[0.00017319308,0.00013149154,0.010130236,0.000006067585,0.0000030163073,0.00002467547,0.000046496887,0.00017375183,0.9204269,0.00040514374,0.068325,0.0001540218],"about_ca_topic_score_codex":0.000027371989,"about_ca_topic_score_gemma":0.000026281714,"teacher_disagreement_score":0.073990785,"about_ca_system_score_codex":0.0000010925824,"about_ca_system_score_gemma":0.000006742629,"threshold_uncertainty_score":0.11601855},"labels":[],"label_agreement":null},{"id":"W1661765563","doi":"10.1063/1.59932","title":"How DNA packages itself into finite bundles of a well-defined size","year":2000,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"DNA; Computer science; Biology; Genetics","score_opus":0.014257341335453864,"score_gpt":0.22976006577392566,"score_spread":0.2155027244384718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661765563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98674417,0.00018493623,0.000322387,0.0010108094,0.00003235684,0.00012408422,0.000005034743,0.000033519398,0.011542683],"genre_scores_gemma":[0.994671,0.00026259938,0.0013698204,0.00029701638,0.00013939825,0.000011433923,0.000018647865,0.000011948878,0.0032181335],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989963,0.000012124745,0.00020062148,0.0003928789,0.0001223018,0.00027576025],"domain_scores_gemma":[0.99942774,0.00003873385,0.00010829978,0.00011552018,0.00022762326,0.00008206195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013704161,0.00019414783,0.00021843892,0.000022225768,0.00008026139,0.000089790046,0.00030504665,0.00019037188,0.00016602901],"category_scores_gemma":[0.00034439104,0.00015253435,0.00009114881,0.00012141225,0.00015496506,0.000009902581,0.00010777402,0.00010384836,0.00001855338],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008422253,0.00006444706,0.012168871,0.000054837074,0.000030637944,9.279386e-7,0.00020893365,4.4693934e-7,0.9727037,0.00054163503,0.00059160555,0.013549742],"study_design_scores_gemma":[0.0012614791,0.0024341135,0.017139856,0.00017916651,0.000060953713,0.000021526681,0.001143359,0.00079508993,0.850844,0.0049105855,0.120272726,0.0009371448],"about_ca_topic_score_codex":0.000014559863,"about_ca_topic_score_gemma":0.0000041772646,"teacher_disagreement_score":0.1218597,"about_ca_system_score_codex":0.0000058417554,"about_ca_system_score_gemma":0.000040101746,"threshold_uncertainty_score":0.622017},"labels":[],"label_agreement":null},{"id":"W1673169420","doi":"10.1007/978-3-540-92910-9_33","title":"DNA Computing — Foundations and Implications","year":2012,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"DNA computing; Computer science; Natural computing; Coding theory; DNA; Complementarity (molecular biology); Theoretical computer science; Programming language; Algorithm; Computation; Biology; Genetics","score_opus":0.02654650303483736,"score_gpt":0.2976675911499013,"score_spread":0.27112108811506397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673169420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9640982,0.00020804026,0.017456414,0.00027679646,0.000049927352,0.00004762242,0.0000013678156,0.000017256025,0.017844373],"genre_scores_gemma":[0.9955625,0.000009120853,0.0035022262,0.00042481034,0.00023272686,0.0000014716439,0.000036640155,0.0000030478052,0.00022745723],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996634,0.00001449637,0.00006813334,0.00009804839,0.000017427108,0.00013846664],"domain_scores_gemma":[0.9998065,0.000012662333,0.000018414561,0.00008670991,0.00001888738,0.000056808873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008920942,0.000045897505,0.000036716563,0.000008170289,0.00010911561,0.0000138234645,0.00004383159,0.00004104146,0.000014255676],"category_scores_gemma":[0.00003442878,0.000035163004,0.000018599969,0.000032695716,0.00003170481,0.0000016905907,0.00006960367,0.000023328894,0.000009459653],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030753226,0.000059461803,0.18918964,0.0000038693215,0.00001843342,3.9378502e-8,0.000034469304,0.0000030327135,0.76043093,0.013676833,0.0015443467,0.03503585],"study_design_scores_gemma":[0.00027668348,0.00013324815,0.7864372,0.0000043377995,0.000015240181,0.000042742828,0.00014452412,0.00018271848,0.04849776,0.00046151897,0.16350031,0.00030369306],"about_ca_topic_score_codex":0.0000025076474,"about_ca_topic_score_gemma":0.0000016364206,"teacher_disagreement_score":0.7119332,"about_ca_system_score_codex":0.0000019734548,"about_ca_system_score_gemma":0.000004807585,"threshold_uncertainty_score":0.14339058},"labels":[],"label_agreement":null},{"id":"W1711504524","doi":"10.1007/978-3-540-77962-9_30","title":"DNA Coding Using the Subword Closure Operation","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":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Closure (psychology); Coding (social sciences); Computer science; Encoding (memory); Theoretical computer science; Algorithm; Programming language; Artificial intelligence; Mathematics","score_opus":0.028887339326133774,"score_gpt":0.26077115980651655,"score_spread":0.23188382048038278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1711504524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060121592,0.0008967168,0.9364137,0.00024187776,0.00076948234,0.00024856703,0.0000039215356,0.000019850451,0.0012842842],"genre_scores_gemma":[0.980872,0.00014917123,0.016325274,0.0012316395,0.0012298779,0.0000013600267,0.000022759736,0.00001741747,0.00015050822],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998506,0.0000328946,0.0002361269,0.00066709914,0.0002474621,0.00031041962],"domain_scores_gemma":[0.9992717,0.000056231573,0.0001163069,0.0004091842,0.00009765368,0.000048907805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003665448,0.00025564432,0.00019483769,0.00007251584,0.0003677194,0.000108827895,0.00068462256,0.0003043915,0.000008179697],"category_scores_gemma":[0.000062696796,0.00016525913,0.00009590929,0.00010419021,0.0005197224,0.0000058975434,0.0005004516,0.0003345083,0.000003862267],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007219846,0.000054367738,0.0019464698,0.000049870567,0.00006174347,0.00009969373,0.00046974106,0.12589182,0.44905004,0.0012065341,0.00023471672,0.42086282],"study_design_scores_gemma":[0.0015534448,0.002060446,0.0020599824,0.0009918305,0.00008706596,0.0013043118,0.0000026789294,0.49557534,0.40497106,0.011332403,0.075908124,0.0041533126],"about_ca_topic_score_codex":0.000007309823,"about_ca_topic_score_gemma":0.00002594188,"teacher_disagreement_score":0.9207504,"about_ca_system_score_codex":0.000044117052,"about_ca_system_score_gemma":0.00018460817,"threshold_uncertainty_score":0.67390716},"labels":[],"label_agreement":null},{"id":"W173210980","doi":"10.1007/978-3-642-10631-6_96","title":"Step-Assembly with a Constant Number of Tile Types","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Tile; Monotone polygon; Constant (computer programming); Computer science; Bin; Extension (predicate logic); Class (philosophy); Tree (set theory); Scaling; Node (physics); Algorithm; Mathematics; Geometry; Combinatorics; Artificial intelligence; Physics","score_opus":0.010199613632745692,"score_gpt":0.24444731609198195,"score_spread":0.23424770245923626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173210980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049344562,0.0007572888,0.91032064,0.00013678244,0.00030763893,0.00032906377,0.0000146182665,0.000028727347,0.038760666],"genre_scores_gemma":[0.94329387,0.000034450448,0.055494092,0.000527588,0.00022524301,6.679153e-7,0.000014614876,0.000012416052,0.00039706894],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869937,0.000014154466,0.00021754343,0.0005803557,0.00022797508,0.00026062195],"domain_scores_gemma":[0.9992543,0.000044446308,0.00015640046,0.00034785797,0.0001396848,0.00005734721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020006842,0.00023459466,0.00027729574,0.000061449035,0.000052095096,0.000033218854,0.00046704378,0.0002398591,0.000015852504],"category_scores_gemma":[0.000029784838,0.00015955036,0.00006371365,0.00010237409,0.00047413586,0.000003245073,0.00022967045,0.00019657362,0.0000056475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637962,0.000080739585,0.001395811,0.000057864974,0.000049342707,0.00006532658,0.00006281632,0.0029020624,0.05698331,0.0028855344,0.00006402192,0.9353068],"study_design_scores_gemma":[0.0058270157,0.018260797,0.0049100406,0.00561826,0.00027268514,0.0019528677,0.0000047989743,0.0534608,0.69226336,0.09881923,0.10990618,0.008703972],"about_ca_topic_score_codex":0.000005650337,"about_ca_topic_score_gemma":0.000025240422,"teacher_disagreement_score":0.92660284,"about_ca_system_score_codex":0.000018835728,"about_ca_system_score_gemma":0.000192516,"threshold_uncertainty_score":0.6506275},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005864888415478002,"score_gpt":0.222129005381761,"score_spread":0.216264116966283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760096751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92304045,0.0007011488,0.07542243,0.00007669683,0.00004813806,0.0004142293,0.0000030772287,0.000052455518,0.00024139673],"genre_scores_gemma":[0.95820093,0.00010459464,0.041385766,0.000098718694,0.00007572564,0.000027447384,0.000077043136,0.000020788233,0.000008968605],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988177,0.000047676822,0.00045883527,0.00030584095,0.00007744122,0.00029254745],"domain_scores_gemma":[0.9990753,0.00020257065,0.00018140298,0.00039601568,0.00008293645,0.00006180296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036896125,0.00018885508,0.00027625848,0.000070239774,0.00013181663,0.0000511094,0.00031684345,0.00015592486,0.000004817416],"category_scores_gemma":[0.0000862829,0.00018827974,0.000069965914,0.00017086726,0.000089912646,0.000011774681,0.00037087267,0.00015744325,0.0000017465143],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031532512,0.00015821414,0.01908369,0.00037112107,0.000096021286,3.3233005e-7,0.00024796303,0.013000488,0.87187433,0.01693973,0.00018950735,0.078007035],"study_design_scores_gemma":[0.0023597975,0.00035773762,0.05248215,0.00044993294,0.00003847273,0.000047165107,0.00058688293,0.7893831,0.14435351,0.0029097823,0.005987165,0.0010442612],"about_ca_topic_score_codex":0.000062037005,"about_ca_topic_score_gemma":0.0000034732927,"teacher_disagreement_score":0.7763826,"about_ca_system_score_codex":0.000016091833,"about_ca_system_score_gemma":0.000013484566,"threshold_uncertainty_score":0.76778245},"labels":[],"label_agreement":null},{"id":"W1852771732","doi":"10.1007/978-3-642-18305-8_9","title":"Triangular Tile Self-assembly Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Tile; Equilateral triangle; Square (algebra); Escher; Computer science; Triangular array; Hexagonal crystal system; Combinatorics; Mathematics; Geometry; Crystallography; Materials science","score_opus":0.01675393470677481,"score_gpt":0.23208903383377202,"score_spread":0.21533509912699722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1852771732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010794077,0.0029247496,0.96769214,0.00005044615,0.0021128699,0.0004843934,0.0000096930335,0.00008647841,0.015845176],"genre_scores_gemma":[0.97747636,0.00011362798,0.019140497,0.0005783096,0.0016088029,0.0000072278826,0.000036220667,0.000037940743,0.0010010133],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979554,0.000034143275,0.00032581005,0.0009758458,0.0002681774,0.0004406512],"domain_scores_gemma":[0.9989301,0.00004721707,0.00017597587,0.0006027781,0.00013065293,0.00011327867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051421806,0.0003531464,0.00034650596,0.0001407661,0.00012305244,0.00010874759,0.000936154,0.0005157238,0.000011947386],"category_scores_gemma":[0.00005239008,0.00027544991,0.00012965855,0.00011042169,0.000232045,0.0000051157945,0.0006078343,0.00031307232,0.000031027375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017922028,0.000296656,0.00089001004,0.00033782973,0.00024253098,0.00035363453,0.00050165656,0.01098649,0.15646668,0.009522044,0.0006133804,0.8196099],"study_design_scores_gemma":[0.004609504,0.009798421,0.001594734,0.002505111,0.00027196828,0.001122558,0.0000027091596,0.12302496,0.28443885,0.07283832,0.48953846,0.010254405],"about_ca_topic_score_codex":0.000014592805,"about_ca_topic_score_gemma":0.00000962469,"teacher_disagreement_score":0.96668226,"about_ca_system_score_codex":0.00004932436,"about_ca_system_score_gemma":0.00018691804,"threshold_uncertainty_score":0.9999698},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016805049860248732,"score_gpt":0.2307862610184788,"score_spread":0.21398121115823007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875480853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03388349,0.005079207,0.9480466,0.00047892577,0.00078640645,0.0003557397,0.000018338767,0.000055739663,0.0112955095],"genre_scores_gemma":[0.96583277,0.00048883935,0.03035083,0.0015653924,0.0007370909,0.0000026727944,0.000030830313,0.000019818102,0.00097177015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985265,0.000015065647,0.0002049938,0.0007686951,0.00017847473,0.00030623065],"domain_scores_gemma":[0.99939615,0.00004880047,0.000091797825,0.00030665123,0.00006843737,0.00008817276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026705026,0.00024864514,0.00021540072,0.00010964648,0.00015154392,0.00008147669,0.00043436215,0.00032546942,0.000015611357],"category_scores_gemma":[0.00007881568,0.00020312959,0.000056816727,0.00008439679,0.0006176945,0.0000045237107,0.0005952103,0.00026512984,0.000007267051],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031157855,0.00006933322,0.0018768808,0.00008783174,0.00004421112,0.00006435415,0.00018205927,0.0018266819,0.12364122,0.0055021998,0.0005296604,0.8661444],"study_design_scores_gemma":[0.003095262,0.0058229812,0.0057386206,0.002167,0.00014024145,0.0011972705,0.0000021660903,0.1697756,0.17297928,0.23375213,0.39695048,0.00837896],"about_ca_topic_score_codex":0.0000055180167,"about_ca_topic_score_gemma":0.000017594975,"teacher_disagreement_score":0.93194926,"about_ca_system_score_codex":0.000031201787,"about_ca_system_score_gemma":0.00005734069,"threshold_uncertainty_score":0.82833844},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016543215355268887,"score_gpt":0.24889508872811086,"score_spread":0.23235187337284197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876472356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057951357,0.0047612963,0.92474765,0.00046569938,0.000791026,0.0004349116,0.000019097177,0.000048768245,0.010780189],"genre_scores_gemma":[0.96949404,0.00058225356,0.026974734,0.0018024581,0.0005019294,0.0000026506755,0.000036225414,0.000021986394,0.00058373576],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984019,0.000028806779,0.00023048912,0.0007911096,0.00020105334,0.00034668398],"domain_scores_gemma":[0.9992565,0.00009387356,0.000114075745,0.00034276338,0.00009436952,0.00009842425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024934098,0.00030970637,0.00029236596,0.0001006872,0.00018774651,0.000067384404,0.0005105164,0.00030388968,0.000007927758],"category_scores_gemma":[0.00006863508,0.00023982908,0.000068483714,0.00009930879,0.0010968369,0.0000049730957,0.00078320835,0.00036558748,0.0000068753893],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082153594,0.00005159713,0.0010719722,0.000051538074,0.000056774876,0.00016059831,0.0007788771,0.003017661,0.025114356,0.0005643967,0.0002788569,0.9687712],"study_design_scores_gemma":[0.006983797,0.013318763,0.010086172,0.002673028,0.00017567156,0.0033822907,0.000011758033,0.13505471,0.28811267,0.15226267,0.37485975,0.013078746],"about_ca_topic_score_codex":0.00000871416,"about_ca_topic_score_gemma":0.00002076272,"teacher_disagreement_score":0.95569247,"about_ca_system_score_codex":0.000027455011,"about_ca_system_score_gemma":0.000103316466,"threshold_uncertainty_score":0.9779946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01628470030553776,"score_gpt":0.26496852067455334,"score_spread":0.2486838203690156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892760407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28369474,0.00007389341,0.710059,0.00016289091,0.00001671253,0.00029013344,0.000003508123,0.0000291661,0.0056699784],"genre_scores_gemma":[0.98057383,0.0000040877126,0.017651947,0.0013152632,0.00004059126,0.00008031847,0.00010682626,0.000010226125,0.00021688058],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992341,0.00005834173,0.00013813382,0.00030986223,0.00008186779,0.00017772705],"domain_scores_gemma":[0.9995523,0.00000951008,0.00003088251,0.00018012148,0.00012297733,0.00010418314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010031855,0.0001101177,0.000084342384,0.000038713148,0.00014725774,0.000027063199,0.00009029153,0.00007337157,0.00002053352],"category_scores_gemma":[0.00003943289,0.00008452669,0.00004564768,0.00022588857,0.000046899797,0.000001814748,0.000030615563,0.00004431726,0.00005232477],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022479138,0.00015033083,0.0019875432,0.000006423214,0.000049791706,0.0000024188255,0.000015003215,0.0010841639,0.98057157,0.011268083,0.00078803237,0.0040541627],"study_design_scores_gemma":[0.0014067037,0.0017257446,0.0052568098,0.000019836041,0.000052733314,0.00012926043,0.0003769035,0.00039307267,0.3584885,0.001068636,0.63016397,0.000917821],"about_ca_topic_score_codex":0.0000065594672,"about_ca_topic_score_gemma":0.000009762657,"teacher_disagreement_score":0.6968791,"about_ca_system_score_codex":0.0000092294695,"about_ca_system_score_gemma":0.000038841827,"threshold_uncertainty_score":0.34468985},"labels":[],"label_agreement":null},{"id":"W1894411705","doi":"10.1109/ijsis.1998.685431","title":"Towards a DNA solution to the shortest common superstring problem","year":2002,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Superstring theory; Coding (social sciences); Computer science; Algorithm; Theoretical computer science; DNA; Mathematics; Biology; Genetics","score_opus":0.028596108148102272,"score_gpt":0.2423833055074734,"score_spread":0.21378719735937113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894411705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95462257,0.00020980557,0.0042032315,0.0033026084,0.00007755861,0.00021123649,0.000002811759,0.00003427389,0.037335914],"genre_scores_gemma":[0.9965769,0.000019794204,0.001030046,0.0011754095,0.00022014357,0.000009453265,0.000014130503,0.000005368627,0.0009487533],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993601,0.000033097345,0.00011352047,0.00020394416,0.00006787262,0.00022149483],"domain_scores_gemma":[0.99971986,0.0000065714285,0.000015669071,0.00017697737,0.000025211097,0.00005571633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014572837,0.00008715797,0.00006930547,0.000010880978,0.00012140551,0.000028988248,0.00018883693,0.00007247083,0.000064117194],"category_scores_gemma":[0.000028497441,0.000050105446,0.000054117827,0.00007935108,0.000025492545,0.0000012401898,0.0001775653,0.0000592269,0.00004937353],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020169822,0.000100964695,0.0050671194,0.0000059806284,0.000030350924,0.000002842029,0.00009934583,0.00016215416,0.8485843,0.00048718025,0.023801886,0.12163774],"study_design_scores_gemma":[0.00058760616,0.0018532804,0.013336891,0.000032728796,0.000030357756,0.00006334121,0.000273858,0.006811157,0.38780034,0.0002332815,0.58822787,0.0007493326],"about_ca_topic_score_codex":0.000033764336,"about_ca_topic_score_gemma":0.00007598165,"teacher_disagreement_score":0.56442595,"about_ca_system_score_codex":0.00000792631,"about_ca_system_score_gemma":0.000004535009,"threshold_uncertainty_score":0.20432408},"labels":[],"label_agreement":null},{"id":"W1896187825","doi":"10.1016/j.tcs.2015.11.004","title":"Growth rate of binary words avoiding xxx","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Binary number; Mathematics; Combinatorics; Computer science; Arithmetic","score_opus":0.01801672403630301,"score_gpt":0.25971368786202886,"score_spread":0.24169696382572586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896187825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89199704,0.000058165082,0.10507717,0.00015436459,0.0002436345,0.000055769557,0.0000011217352,0.000017910217,0.0023948504],"genre_scores_gemma":[0.9916398,0.0000040667987,0.007822003,0.00030553484,0.00020678183,0.0000010412696,0.0000032626817,0.00000478917,0.000012745338],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988475,0.00014619934,0.00017585017,0.0003658824,0.0001661734,0.00029842512],"domain_scores_gemma":[0.9992716,0.0000517235,0.000051629366,0.00024264996,0.0001936071,0.00018882725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017909757,0.00010699262,0.000131843,0.00004438956,0.00011507639,0.000034847417,0.00059174973,0.0000621493,0.00000765272],"category_scores_gemma":[0.00037061374,0.00007608663,0.000050457445,0.00031767657,0.0017242345,0.000006355159,0.00070135854,0.0000987785,0.000010015866],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010183632,0.00008484294,0.0016059529,0.000010463585,0.00000805157,0.000007165397,0.00013150292,0.0001551619,0.65023255,0.3432247,0.0002315143,0.0042062365],"study_design_scores_gemma":[0.00083254994,0.0031247821,0.004365426,0.000058220332,0.000014057752,0.000043114094,0.00007723293,0.039257992,0.86950374,0.08146855,0.00070359063,0.00055075134],"about_ca_topic_score_codex":0.0000019876798,"about_ca_topic_score_gemma":1.1965439e-7,"teacher_disagreement_score":0.26175615,"about_ca_system_score_codex":0.00000977811,"about_ca_system_score_gemma":0.00007881781,"threshold_uncertainty_score":0.6353014},"labels":[],"label_agreement":null},{"id":"W1924404066","doi":"10.1016/j.jcss.2016.10.001","title":"Deciding whether a regular language is generated by a splicing system","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Syntactic monoid; Regular language; RNA splicing; Computer science; Class (philosophy); Function (biology); Word (group theory); Mathematics; Discrete mathematics; Genetics; Theoretical computer science; Monoid; Artificial intelligence; Biology; Gene; Free monoid","score_opus":0.010700925357367405,"score_gpt":0.24105450340923162,"score_spread":0.2303535780518642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924404066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93960106,0.0019238038,0.057827577,0.000117366326,0.00024355802,0.000039727423,0.0000022740087,0.000007676105,0.00023696962],"genre_scores_gemma":[0.996647,0.00002125196,0.0026529455,0.00010898562,0.000481476,3.822156e-7,2.8438163e-7,0.0000036790234,0.000084006984],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990948,0.00010849717,0.00028978742,0.000183561,0.00016273894,0.00016061861],"domain_scores_gemma":[0.9995222,0.000028423307,0.00021611738,0.000078570025,0.00008031807,0.00007438117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008452588,0.00009307307,0.00018333073,0.00004255422,0.00012665371,0.000076906275,0.00021263135,0.00006263676,0.0000011328395],"category_scores_gemma":[0.000009669312,0.000045151257,0.00006700964,0.00008254649,0.00007363577,0.000007585036,0.00007872084,0.000033453023,0.0000011559617],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014436658,0.000007714021,0.0020706386,0.000031431748,0.000027550339,0.000011691242,0.00009410402,0.000010943639,0.9832319,0.00014102325,0.0013342535,0.0130243385],"study_design_scores_gemma":[0.0029129246,0.0041334713,0.0024578015,0.0034259425,0.00008161549,0.004768275,0.0044550085,0.014001632,0.94799536,0.000039981125,0.014790397,0.0009375868],"about_ca_topic_score_codex":0.0000049385567,"about_ca_topic_score_gemma":5.1734196e-7,"teacher_disagreement_score":0.05704594,"about_ca_system_score_codex":0.000014169097,"about_ca_system_score_gemma":0.00002626195,"threshold_uncertainty_score":0.18412149},"labels":[],"label_agreement":null},{"id":"W1933655552","doi":"","title":"Contextual Grammars with Uniform Sets of Trajectories","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Unary operation; Rule-based machine translation; Tree-adjoining grammar; Alphabet; Context-sensitive grammar; Context-free grammar; Set (abstract data type); Indexed grammar; Context (archaeology); Generative grammar; Computer science; Stochastic context-free grammar; L-attributed grammar; Mathematics; Grammar; Phrase structure grammar; Embedded pushdown automaton; Artificial intelligence; Combinatorics; Linguistics; Programming language","score_opus":0.012009057617999959,"score_gpt":0.23743093247552435,"score_spread":0.2254218748575244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933655552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914307,0.000036876976,0.0033007322,0.000056391247,0.00005027542,0.00014523078,0.000018982892,0.000014914024,0.004945896],"genre_scores_gemma":[0.99496937,0.000011230025,0.0045080734,0.00030207017,0.00003099272,0.000005469359,0.00011312219,0.0000054489337,0.000054246],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933326,0.000008712148,0.00025061463,0.000096314136,0.00011568673,0.00019540198],"domain_scores_gemma":[0.99961543,0.00000926089,0.00010501377,0.0001610693,0.00005037591,0.000058866255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009556713,0.00011644412,0.00013737546,0.000022446557,0.00005622172,0.0000198199,0.00014538954,0.000071512004,0.000019459965],"category_scores_gemma":[0.000026809475,0.00007716108,0.000049184215,0.00007506719,0.00015133593,0.000008762835,0.00007540488,0.000058564325,0.000010341689],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004746546,0.0019967,0.12890182,0.0014403495,0.0020045072,0.000047256235,0.009234845,0.0053798775,0.59049135,0.09881566,0.0038560694,0.15308498],"study_design_scores_gemma":[0.011560584,0.015927209,0.029444635,0.0003629779,0.0001265823,0.00024494145,0.011186433,0.00018980456,0.83323663,0.0034125939,0.09260143,0.0017061448],"about_ca_topic_score_codex":0.000021342392,"about_ca_topic_score_gemma":0.00002141765,"teacher_disagreement_score":0.24274528,"about_ca_system_score_codex":0.000014802335,"about_ca_system_score_gemma":0.0000553985,"threshold_uncertainty_score":0.31465375},"labels":[],"label_agreement":null},{"id":"W1964254484","doi":"10.5220/0005255701950200","title":"Application of Ant Colony Optimization for Mapping the Combinatorial Phylogenetic Search Space","year":2015,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Phylogenetic tree; ANT; Space (punctuation); Ant colony; Artificial intelligence; Combinatorial optimization; Theoretical computer science; Algorithm; Biology; Computer network; Genetics","score_opus":0.040894991935636185,"score_gpt":0.2765143256729495,"score_spread":0.2356193337373133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964254484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48442385,0.00013713693,0.5136487,0.0002602283,0.00011993141,0.00039772925,0.000003411714,0.0000072214075,0.0010017821],"genre_scores_gemma":[0.9918272,0.0000068086833,0.007750108,0.000067672576,0.00019865115,0.000019955249,0.000055593537,0.000004454874,0.00006956413],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954385,0.00004073005,0.000107902146,0.00013894145,0.00006449563,0.000104102095],"domain_scores_gemma":[0.99961054,0.00002298459,0.000046104044,0.00013080898,0.00015857338,0.000030976793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030881373,0.000052572963,0.00006519158,0.000009954118,0.000044460692,0.000008249366,0.0001241705,0.00007057223,0.0000015107895],"category_scores_gemma":[0.00008158913,0.000033029697,0.000033396973,0.00006697796,0.000047639434,6.8263074e-7,0.00007243004,0.000024361549,8.216352e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019132724,0.00011123885,0.005816439,0.000026730237,0.000036116715,1.06572465e-7,0.000073674004,0.037755758,0.9405627,0.007157202,0.0012428372,0.007025836],"study_design_scores_gemma":[0.0024208203,0.0019524234,0.0023467655,0.000010054803,0.000025150834,0.000005219187,0.00063678756,0.295638,0.6603219,0.002075494,0.03425026,0.00031716053],"about_ca_topic_score_codex":0.000014822937,"about_ca_topic_score_gemma":0.0000014856099,"teacher_disagreement_score":0.5074033,"about_ca_system_score_codex":0.0000061127766,"about_ca_system_score_gemma":0.000032737404,"threshold_uncertainty_score":0.1346912},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010751031605100343,"score_gpt":0.2501131395328206,"score_spread":0.23936210792772025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964440534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33801088,0.00042372252,0.6544119,0.0001447946,0.004945365,0.0002274273,0.0000035783683,0.000007962456,0.0018243671],"genre_scores_gemma":[0.9641097,0.000048214526,0.035075933,0.00007387558,0.0006160513,0.0000015926993,0.000013258334,0.000008111192,0.000053251006],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994265,0.00006439771,0.00024548112,0.00008099495,0.00008017452,0.000102492115],"domain_scores_gemma":[0.99933577,0.000026976577,0.00022483063,0.00006336443,0.00030323677,0.000045848145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038221525,0.00006899444,0.00012405116,0.000025917732,0.00005493814,0.000022629514,0.00008886426,0.00010033468,0.000009182059],"category_scores_gemma":[0.0005408352,0.000053896165,0.000099787925,0.000053366384,0.000018521278,0.0000045762613,0.000013000412,0.00004595046,3.9749307e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020946392,0.0010441045,0.004616851,0.000074972326,0.00038428,0.000010077403,0.00008167446,0.2952661,0.6199534,0.05717559,0.016279362,0.0030189333],"study_design_scores_gemma":[0.011022223,0.008321178,0.0004243408,0.000068314526,0.00015505127,0.00015026663,0.00013064401,0.006596649,0.70875365,0.017858144,0.24579535,0.0007242156],"about_ca_topic_score_codex":1.1765866e-7,"about_ca_topic_score_gemma":3.1971837e-8,"teacher_disagreement_score":0.6260989,"about_ca_system_score_codex":0.000009653948,"about_ca_system_score_gemma":0.00005526712,"threshold_uncertainty_score":0.21978219},"labels":[],"label_agreement":null},{"id":"W1966644481","doi":"10.1007/s00236-007-0041-4","title":"The syntactic monoid of hairpin-free languages","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"DNA computing; String (physics); Formal language; Computer science; Rewriting; DNA; Free monoid; Alphabet; Context (archaeology); Characterization (materials science); Mathematics; Discrete mathematics; Monoid; Physics; Algorithm; Biology; Genetics; Programming language; Linguistics; Theoretical physics","score_opus":0.005987572387986165,"score_gpt":0.24978094973339865,"score_spread":0.24379337734541248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966644481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9512791,0.00020442331,0.0008404809,0.0002501838,0.000068062414,0.00008897275,0.0000028024194,0.000012353597,0.047253612],"genre_scores_gemma":[0.9986999,0.000041791827,0.0007821446,0.00024173752,0.00007027303,0.0000014296824,0.000011330063,0.0000033768088,0.00014800463],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941653,0.000012574319,0.00023654649,0.000059904523,0.00008340685,0.00019103875],"domain_scores_gemma":[0.9994063,0.00008686449,0.0001016082,0.0003274016,0.00003959714,0.000038233622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039021528,0.000070281305,0.00007410707,0.000013322977,0.000087312,0.000022014761,0.00033124315,0.0000711143,0.0000064998444],"category_scores_gemma":[0.0004885424,0.000040141036,0.000053566728,0.00004912591,0.00007444649,0.00000540809,0.00019300237,0.00006229796,0.000008036785],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004209355,0.00013593203,0.006778725,0.00016560267,0.00025000895,0.0000073294987,0.00061692996,0.000015561309,0.82105225,0.007914195,0.014683615,0.1479589],"study_design_scores_gemma":[0.0008202824,0.0009348248,0.029540591,0.000043319607,0.000032625758,0.000046698893,0.0032255156,0.00028632267,0.6382055,0.0005826581,0.32587242,0.00040924628],"about_ca_topic_score_codex":0.0000046499913,"about_ca_topic_score_gemma":0.0000095507085,"teacher_disagreement_score":0.3111888,"about_ca_system_score_codex":0.0000038884573,"about_ca_system_score_gemma":0.000014455478,"threshold_uncertainty_score":0.1636904},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.049908847019282436,"score_gpt":0.309198004975074,"score_spread":0.25928915795579155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966857768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99358124,0.00080464233,0.0039571184,0.000028597065,0.000051882835,0.00022900665,0.000049977443,0.000013919162,0.001283604],"genre_scores_gemma":[0.9930351,0.000104120605,0.0063960166,0.00004934614,0.0000874701,0.000005047597,0.000035926732,0.000012595472,0.0002743785],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986566,0.00032442482,0.00016792314,0.00032048087,0.00021997532,0.00031064893],"domain_scores_gemma":[0.9993742,0.0000974334,0.0000378912,0.00022240155,0.00017678316,0.00009127553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007516564,0.000102542814,0.00012819376,0.000055251254,0.00014135896,0.000039843304,0.00016477647,0.0002256819,0.000107166896],"category_scores_gemma":[0.00097419013,0.00008050686,0.000040140512,0.000154889,0.00021365435,0.0000063476245,0.00015022977,0.00027964954,0.0000027213248],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000879851,0.000026619828,0.009588137,0.000039309773,0.000028177601,0.000003485823,0.000042298907,0.00001689767,0.9476723,0.00015860242,0.0012882692,0.041047893],"study_design_scores_gemma":[0.0009993754,0.002113285,0.053171936,0.000044021726,0.000011156834,0.000057488993,0.00020021047,0.0001373053,0.9086519,0.0026323535,0.031719714,0.00026124116],"about_ca_topic_score_codex":0.0000038172616,"about_ca_topic_score_gemma":0.0000015624016,"teacher_disagreement_score":0.0435838,"about_ca_system_score_codex":0.000011790968,"about_ca_system_score_gemma":0.00009263802,"threshold_uncertainty_score":0.32829747},"labels":[],"label_agreement":null},{"id":"W1966899942","doi":"10.1109/cit.2012.137","title":"Searching for Optimal Deletion Correcting Codes: New Properties and Extensions of Tenengolts Codes","year":2012,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Hamming code; Luby transform code; Block code; Linear code; Tornado code; Reed–Muller code; Expander code; Concatenated error correction code; Raptor code; Computer science; Turbo code; Hamming distance; Fountain code; Code (set theory); Hamming bound; Construct (python library); Algorithm; Mathematics; Decoding methods","score_opus":0.0625867515575177,"score_gpt":0.28608387622517256,"score_spread":0.22349712466765487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966899942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659675,0.00074154243,0.032748424,0.000067350644,0.00005929908,0.00014179198,0.0000021124965,0.000011856112,0.0002601716],"genre_scores_gemma":[0.9836863,0.000032858436,0.015644291,0.00011653714,0.00020063823,0.0000040131104,0.000017794477,0.0000061867054,0.00029134407],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947244,0.00003177215,0.00012317896,0.00013538312,0.000040939736,0.00019631385],"domain_scores_gemma":[0.9997055,0.00003555358,0.000041693744,0.00007018172,0.000075424534,0.00007163351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026076633,0.000073908,0.00010134698,0.000014831549,0.000090170746,0.000010767093,0.00004889004,0.0000678027,0.0000028855802],"category_scores_gemma":[0.00030697705,0.000048782007,0.000039352777,0.000025227604,0.000045930923,0.000003607854,0.00009458378,0.00003960859,4.2090585e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006460075,0.000026946522,0.0037118718,0.000021202157,0.0000150824,5.061328e-8,0.000090847745,0.00008658809,0.96801496,0.00012507329,0.00020992578,0.027632829],"study_design_scores_gemma":[0.00038972055,0.0005378575,0.0043334574,0.00004936275,0.000019470162,0.000027877522,0.0008174474,0.0033419596,0.9869878,0.000037839276,0.0032724536,0.00018475276],"about_ca_topic_score_codex":0.00004979379,"about_ca_topic_score_gemma":0.00000826443,"teacher_disagreement_score":0.027448077,"about_ca_system_score_codex":0.0000025862983,"about_ca_system_score_gemma":0.000018160783,"threshold_uncertainty_score":0.19892725},"labels":[],"label_agreement":null},{"id":"W1973178331","doi":"10.1016/j.ic.2009.02.009","title":"Minimality in template-guided recombination","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Template; Equivalence (formal languages); Decidability; Computer science; Formal language; Set (abstract data type); Closure (psychology); Programming language; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.019213371579834878,"score_gpt":0.28941344583506157,"score_spread":0.2702000742552267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973178331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98370486,0.000020935908,0.0123764975,0.0002963717,0.000040735165,0.00008434304,8.8196526e-7,0.000013477257,0.003461877],"genre_scores_gemma":[0.99810547,0.000013103748,0.0009334941,0.00073805556,0.00001814484,0.0000014574496,0.00017790831,7.891142e-7,0.000011596494],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996019,0.0000248468,0.00019124204,0.00006803192,0.00004558609,0.000068408604],"domain_scores_gemma":[0.99983656,0.0000056703857,0.00006099344,0.00003308904,0.00004342589,0.000020246287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016352216,0.00004883139,0.000047484606,0.000042680338,0.000034978715,0.000032516178,0.000028950222,0.00005922614,0.0000019104325],"category_scores_gemma":[0.000037420796,0.000044159337,0.000013447071,0.00006705123,0.000009311256,0.00002016453,0.000013123033,0.000031651038,0.000005130892],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010666572,0.000081901286,0.013327174,0.000021933822,0.0000065498893,7.5487844e-7,0.00036908052,0.0023508514,0.021605391,0.0022288277,0.0016722108,0.95822865],"study_design_scores_gemma":[0.0017889137,0.0007391438,0.923298,0.000024527077,0.000003879256,0.000025156187,0.00020085042,0.047229875,0.00797818,0.006744173,0.0116586555,0.00030865395],"about_ca_topic_score_codex":0.000005341134,"about_ca_topic_score_gemma":0.000002013237,"teacher_disagreement_score":0.95792,"about_ca_system_score_codex":0.000006945578,"about_ca_system_score_gemma":0.000008945065,"threshold_uncertainty_score":0.18007655},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Membrane; Membrane computing; Computer science; Theoretical computer science; Mathematics; Chemistry; Biochemistry","score_opus":0.016566795899129714,"score_gpt":0.2873662264388591,"score_spread":0.2707994305397294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975121090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8264701,0.0004541314,0.17222795,0.00026775736,0.00028547758,0.000028917913,0.0000014252103,0.00000140565,0.00026284726],"genre_scores_gemma":[0.98555195,0.00016167009,0.014109344,0.000068004934,0.00009459553,1.4528453e-7,0.0000054289685,0.000001847387,0.0000069930998],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991003,0.000043986103,0.00043475121,0.0000936727,0.00024472884,0.000082526225],"domain_scores_gemma":[0.99876034,0.00005865084,0.0004212433,0.00012189248,0.00061049894,0.000027352862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055811374,0.0000512804,0.00010569785,0.00013069765,0.00003854887,0.000030902087,0.0008763404,0.000031252766,0.000009299725],"category_scores_gemma":[0.00009750245,0.000043929664,0.00005397829,0.00019528593,0.00027007982,0.000024858708,0.00019339485,0.000073044925,3.6920784e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000854017,0.00088218955,0.038962923,0.000019391528,0.00012668982,0.0000047502485,0.000559059,0.12534831,0.56713367,0.0020766293,0.0012311107,0.2635699],"study_design_scores_gemma":[0.0022648785,0.0011615985,0.057570554,0.0004591375,0.000018823486,0.00021884407,0.00009150309,0.79492617,0.1352269,0.0012094288,0.0064614275,0.00039074582],"about_ca_topic_score_codex":0.0000079621595,"about_ca_topic_score_gemma":0.0000024169744,"teacher_disagreement_score":0.66957784,"about_ca_system_score_codex":0.000015306374,"about_ca_system_score_gemma":0.000031993543,"threshold_uncertainty_score":0.17913997},"labels":[],"label_agreement":null},{"id":"W1981907634","doi":"10.1109/tcomm.2013.020413.120070","title":"On the Capacity of Duplication Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Gene duplication; Channel capacity; Channel (broadcasting); Probability density function; Upper and lower bounds; Mathematics; Series (stratigraphy); Representation (politics); Computer science; Algorithm; Topology (electrical circuits); Combinatorics; Statistics; Telecommunications","score_opus":0.04739777772552795,"score_gpt":0.2642986101064345,"score_spread":0.21690083238090657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981907634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8836029,0.00004853001,0.10708034,0.004575927,0.00011105425,0.00039210278,0.000020076914,0.00002456059,0.004144485],"genre_scores_gemma":[0.99844825,0.00010368851,0.00060600607,0.0004350993,0.000017749842,0.00012049788,0.000011741323,0.0000060649445,0.00025087903],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945617,0.00011571178,0.00014961211,0.00012285006,0.00006138563,0.000094284616],"domain_scores_gemma":[0.9986204,0.00014575035,0.000062091145,0.001048842,0.00009417835,0.000028763856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117552176,0.00007587608,0.00006608129,0.000024723624,0.00024752473,0.000014048642,0.0004950841,0.0000730522,0.00006429577],"category_scores_gemma":[0.000020260339,0.000050914285,0.00007815692,0.00010609455,0.00015820113,0.00000286751,0.0000064863125,0.00014368656,0.00006217017],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002361265,0.0007312381,0.000036174388,0.0000072941607,0.00008434309,2.5287733e-8,0.00012197993,0.0026399852,0.9693171,0.0077724126,0.001804043,0.017461829],"study_design_scores_gemma":[0.00033500444,0.00073042326,0.0017113454,0.000041810217,0.000030858966,0.000004453918,0.00016640518,0.0065489667,0.9760614,0.0050420836,0.009039382,0.00028785088],"about_ca_topic_score_codex":0.000052196912,"about_ca_topic_score_gemma":0.000014910349,"teacher_disagreement_score":0.11484535,"about_ca_system_score_codex":0.0000074145037,"about_ca_system_score_gemma":0.000011587058,"threshold_uncertainty_score":0.20762244},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009223273731269854,"score_gpt":0.23893363602633283,"score_spread":0.22971036229506298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983239548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9829989,0.00009667698,0.01079143,0.00039224472,0.000060349154,0.00006168926,0.0000015913657,0.000017907394,0.0055792285],"genre_scores_gemma":[0.991765,0.0000032697892,0.0073390165,0.00064910523,0.00021683019,0.0000012241721,0.0000011578647,0.0000038009675,0.0000205766],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913204,0.00003115708,0.00013112318,0.0002913242,0.00018631562,0.00022802487],"domain_scores_gemma":[0.999449,0.000019213005,0.00003276283,0.00036460077,0.000063864994,0.0000705601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037902457,0.000089920075,0.00009811601,0.000030375539,0.000084549574,0.00002531788,0.0006753921,0.000047494508,0.000014312881],"category_scores_gemma":[0.00017124687,0.00005637013,0.00004466331,0.00011930173,0.0014502561,0.0000037720852,0.00049235154,0.000059582922,0.0000122350975],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004391862,0.00006719914,0.000048250797,0.000005439106,0.000003355838,8.60576e-7,0.00003404921,0.000072809766,0.6793841,0.3026946,0.00017177408,0.017473668],"study_design_scores_gemma":[0.00018517647,0.0006482001,0.00040643863,0.000025528081,0.0000024972119,0.000007119969,0.000008260929,0.0031637927,0.9907972,0.0042456654,0.00038691706,0.00012315816],"about_ca_topic_score_codex":6.814737e-7,"about_ca_topic_score_gemma":4.2025778e-7,"teacher_disagreement_score":0.31141314,"about_ca_system_score_codex":0.000006090847,"about_ca_system_score_gemma":0.000025947396,"threshold_uncertainty_score":0.5343529},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03992601041239598,"score_gpt":0.2933581590792394,"score_spread":0.25343214866684344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984638028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909633,0.0034901884,0.000034106477,0.0039669974,0.000067381945,0.000077362696,0.00000235377,0.0000044860935,0.001393852],"genre_scores_gemma":[0.99279946,0.00038518765,0.006564028,0.000080772355,0.000019461744,0.0000010731256,0.0000076666765,0.0000028878615,0.00013948508],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995289,0.000109885885,0.00016086707,0.00006736161,0.000052422536,0.00008060508],"domain_scores_gemma":[0.9925484,0.00012382213,0.00013067306,0.007108333,0.000078726,0.000010051874],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00017064334,0.00004701326,0.000066025685,0.0000057540046,0.00036179833,0.0000032491835,0.008626783,0.00003659467,4.9679e-7],"category_scores_gemma":[0.0022315485,0.000024571103,0.00008363362,0.00007079241,0.00042642045,8.6134173e-7,0.010540034,0.000093405935,9.67733e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025964126,0.00010224208,0.024955094,0.000009447167,0.00007799302,7.90843e-8,0.00016413983,0.00008108928,0.95599145,0.0022702771,0.009727111,0.006595117],"study_design_scores_gemma":[0.0006661031,0.00021718458,0.31237563,0.00007752158,0.000034251978,0.000050064584,0.00040148958,0.0021430117,0.58836126,0.0074768947,0.08789672,0.00029987592],"about_ca_topic_score_codex":0.000008649557,"about_ca_topic_score_gemma":0.0000064256487,"teacher_disagreement_score":0.3676302,"about_ca_system_score_codex":0.000002804058,"about_ca_system_score_gemma":0.00001835437,"threshold_uncertainty_score":0.9974625},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008061903686414422,"score_gpt":0.2620267867829475,"score_spread":0.2539648830965331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985614194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72733015,0.000035424546,0.25984535,0.00044741525,0.0000979032,0.0000662549,0.0000017576049,0.000031340667,0.012144382],"genre_scores_gemma":[0.98230326,0.0000036156082,0.015898388,0.0012473214,0.00049834105,0.0000019070077,0.000009214436,0.000004599292,0.00003335862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989524,0.0000407194,0.00013399444,0.00038660396,0.00016108762,0.00032519325],"domain_scores_gemma":[0.9994786,0.000027959259,0.000024888355,0.0002515067,0.00008053869,0.0001365368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039498266,0.00009747281,0.00007914471,0.0000302837,0.00024677793,0.00006976952,0.00048510105,0.0000518086,0.00010384641],"category_scores_gemma":[0.000062966115,0.00007217366,0.000051068586,0.00019158659,0.0012729089,0.0000060245666,0.000373509,0.00007284952,0.0001149994],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036295045,0.00017193802,0.0012435018,0.0000053208996,0.000010225408,0.000004446244,0.00008617554,0.0016471236,0.299162,0.58745307,0.0009216612,0.10925824],"study_design_scores_gemma":[0.0010334969,0.0019230397,0.01953916,0.00002234893,0.000023628074,0.00012439278,0.00004338404,0.31451556,0.5179607,0.059194814,0.08444992,0.0011695557],"about_ca_topic_score_codex":6.772004e-7,"about_ca_topic_score_gemma":7.977366e-7,"teacher_disagreement_score":0.52825826,"about_ca_system_score_codex":0.000010318092,"about_ca_system_score_gemma":0.000038309317,"threshold_uncertainty_score":0.46900856},"labels":[],"label_agreement":null},{"id":"W1988719430","doi":"10.1016/s0012-365x(01)00133-9","title":"On the recognition of de Bruijn graphs and their induced subgraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"De Bruijn sequence; Combinatorics; De Bruijn graph; Mathematics; Cograph; Discrete mathematics; Induced subgraph; Graph; Pathwidth; Line graph","score_opus":0.0384573941709699,"score_gpt":0.23659130619966753,"score_spread":0.19813391202869762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988719430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957103,0.00011833283,0.00047030582,0.00012397634,0.00001581877,0.00009749231,0.000009753086,0.000008134388,0.0034458947],"genre_scores_gemma":[0.9991312,0.00007928622,0.0005229123,0.0001955258,0.00001613648,0.0000049776545,0.0000104763285,0.000006795758,0.000032657717],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999553,0.00004204483,0.00012910375,0.000114872906,0.0000445459,0.00011639205],"domain_scores_gemma":[0.9996397,0.0000793934,0.00007330565,0.00015585941,0.00002421638,0.000027541255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017851221,0.00009008844,0.0000942823,0.000016874523,0.000054122174,0.000012098222,0.00009608013,0.00007710045,0.000022853566],"category_scores_gemma":[0.00015038635,0.00004758096,0.000061889456,0.000059239414,0.00006609128,0.0000010479499,0.00004723807,0.000061888575,0.0000028641823],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021895563,0.00016174265,0.0005539178,0.00007837641,0.00008132457,0.0000010099445,0.00090102624,0.0000021301605,0.9702586,0.013784547,0.0006833665,0.01347207],"study_design_scores_gemma":[0.00049553404,0.0011742729,0.0012357241,0.00015642948,0.000036217636,0.000030994728,0.0013557379,0.003578015,0.7885759,0.20261559,0.00035381276,0.00039176326],"about_ca_topic_score_codex":0.0000016462236,"about_ca_topic_score_gemma":0.0000013256572,"teacher_disagreement_score":0.18883105,"about_ca_system_score_codex":0.0000016180576,"about_ca_system_score_gemma":0.0000024844912,"threshold_uncertainty_score":0.19402952},"labels":[],"label_agreement":null},{"id":"W1989026574","doi":"10.1109/ccece.2006.277769","title":"An Artificial Life Technique for the Cryptanalysis of Simple Substitution Ciphers","year":2006,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cryptanalysis; Substitution (logic); Simple (philosophy); Computer science; S-box; Algorithm; Ant colony optimization algorithms; Encoding (memory); Differential cryptanalysis; Linear cryptanalysis; Theoretical computer science; Block cipher; Arithmetic; Cryptography; Mathematics; Artificial intelligence; Programming language","score_opus":0.01797384814054745,"score_gpt":0.2767945421235143,"score_spread":0.2588206939829668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989026574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5951713,0.00006646738,0.40394175,0.000062852305,0.000019049865,0.00015863519,0.0000060412467,0.000008655435,0.0005652671],"genre_scores_gemma":[0.9970508,0.0000037059444,0.0024652241,0.00010556004,0.00022294931,0.0000205869,0.00009439733,0.000003420907,0.00003331397],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995298,0.000024044568,0.0001538212,0.0001437353,0.000042905103,0.0001057201],"domain_scores_gemma":[0.999687,0.000020261987,0.000052745072,0.00015767288,0.00006173337,0.00002059344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020202251,0.000059067865,0.00007457407,0.0000115508155,0.00008093204,0.000010196582,0.00011898264,0.00008309016,0.00001815651],"category_scores_gemma":[0.000053507396,0.00003439698,0.00009369879,0.00006836263,0.00006427229,0.0000011939702,0.000020872838,0.000022556544,4.943815e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034008077,0.00003853718,0.000920153,0.0000026816524,0.000015655523,6.493954e-8,0.0000010297335,0.0008806792,0.99297,0.003827505,0.00031722258,0.0009924527],"study_design_scores_gemma":[0.00007188355,0.00020805457,0.0014994462,9.067306e-7,0.00002757103,5.131221e-7,0.000048862043,0.001638433,0.9886497,0.0015166841,0.006260361,0.0000775702],"about_ca_topic_score_codex":0.00008282641,"about_ca_topic_score_gemma":0.000085454514,"teacher_disagreement_score":0.40187955,"about_ca_system_score_codex":0.0000028726217,"about_ca_system_score_gemma":0.000019370536,"threshold_uncertainty_score":0.1402668},"labels":[],"label_agreement":null},{"id":"W1995860689","doi":"10.1021/sb5000466","title":"Solving a Four-Destination Traveling Salesman Problem Using <i>Escherichia coli</i> Cells As Biocomputers","year":2014,"lang":"en","type":"article","venue":"ACS Synthetic Biology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Genome Alberta; University of Alberta; Alberta Innovates - Technology Futures","keywords":"Travelling salesman problem; Computer science; Population; Selection (genetic algorithm); Shortest path problem; Path (computing); Mathematical optimization; Mathematics; Algorithm; Theoretical computer science; Artificial intelligence; Graph; Computer network","score_opus":0.018570609758917694,"score_gpt":0.24629532386786185,"score_spread":0.22772471410894415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995860689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93171203,0.000111997586,0.06527733,0.00018739993,0.0003090445,0.00023772234,0.0000039321844,0.000055705365,0.0021048496],"genre_scores_gemma":[0.9725046,0.00003055592,0.026058549,0.00087853585,0.00038302346,0.000010529928,0.000043684042,0.000028302353,0.00006222407],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809676,0.00031238675,0.00035699471,0.0006428568,0.00007762763,0.0005133583],"domain_scores_gemma":[0.9992056,0.000104309765,0.00018988068,0.0003010528,0.000090852205,0.000108315275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750002,0.00027160012,0.00027617224,0.000047213067,0.00021182674,0.000040264007,0.00034243055,0.00038127683,0.000010208354],"category_scores_gemma":[0.00014741407,0.00022952359,0.000113893795,0.00012867624,0.00020212324,0.0000043291484,0.00023283415,0.00017049594,0.00002761064],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024376202,0.000041866846,0.000585722,0.000018416113,0.000028474975,0.000001601247,0.000026124771,0.00029523243,0.98222685,0.0007333207,0.000037098052,0.015980944],"study_design_scores_gemma":[0.0008328979,0.0014095089,0.0005281577,0.0001081889,0.000067894835,0.00010898727,0.000058298825,0.011607281,0.95805615,0.0036221037,0.022747185,0.00085331907],"about_ca_topic_score_codex":0.000042014843,"about_ca_topic_score_gemma":0.000006104184,"teacher_disagreement_score":0.040792573,"about_ca_system_score_codex":0.000021018914,"about_ca_system_score_gemma":0.00005304994,"threshold_uncertainty_score":0.93597},"labels":[],"label_agreement":null},{"id":"W2002094114","doi":"10.1007/s00453-015-9983-z","title":"Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Theory of computation; Algorithm; Mathematics; Approximation algorithm; Binary number; Binary tree; Tree (set theory); Combinatorics; Branching (polymer chemistry); Weight-balanced tree; Binary logarithm; Binary search tree; Computer science","score_opus":0.04039927411750235,"score_gpt":0.29000887086651705,"score_spread":0.2496095967490147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002094114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8470994,0.00035441978,0.15168074,0.000111059264,0.000114253584,0.00036141174,0.000024945759,0.000012281566,0.00024147001],"genre_scores_gemma":[0.8908262,0.000006365068,0.10867029,0.00006595791,0.00017818289,0.000029339171,0.00012198644,0.000008679213,0.00009300268],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992218,0.000035785702,0.00021337287,0.00026240828,0.00008674389,0.00017985808],"domain_scores_gemma":[0.9995078,0.00004965931,0.00010626134,0.00014597508,0.00011634735,0.0000739844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031479975,0.00011278854,0.00014187946,0.000024118524,0.00004146813,0.000014669083,0.00010254276,0.00010259873,0.0000014760918],"category_scores_gemma":[0.0002630095,0.000089436195,0.00005668313,0.00004253795,0.00006447069,0.000003799312,0.000109073015,0.000036955105,0.0000011117463],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014024613,0.00016982782,0.005787305,0.00006586812,0.000101655016,0.0000011870375,0.00019140552,0.000115839255,0.18088917,0.00013951755,0.0011139854,0.811284],"study_design_scores_gemma":[0.0048872074,0.0040873326,0.015139792,0.00008141251,0.00009811038,0.000037132395,0.0006934006,0.21177796,0.7355491,0.008796257,0.017953467,0.000898824],"about_ca_topic_score_codex":0.000013625581,"about_ca_topic_score_gemma":0.000009174722,"teacher_disagreement_score":0.81038517,"about_ca_system_score_codex":0.0000075548915,"about_ca_system_score_gemma":0.000019520461,"threshold_uncertainty_score":0.3647102},"labels":[],"label_agreement":null},{"id":"W2002626286","doi":"10.1016/j.ic.2012.04.003","title":"Deciding regularity of hairpin completions of regular languages in polynomial time","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decidability; Regular language; DNA computing; Topological entropy; Formal language; Time complexity; Mathematics; Context (archaeology); Discrete mathematics; Exponential function; Computer science; Exponential growth; Growth function; Combinatorics; Algorithm; Theoretical computer science; Automaton","score_opus":0.009762622650934222,"score_gpt":0.26203966914840254,"score_spread":0.2522770464974683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002626286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98726815,0.00011887976,0.01169582,0.000035559468,0.000023458322,0.00006233527,0.0000055961323,0.0000046089963,0.0007855997],"genre_scores_gemma":[0.9975954,0.000006727738,0.0021659916,0.00004359961,0.000027067454,0.0000010196695,0.00015123528,0.0000012168425,0.00000770548],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9995999,0.0000316867,0.00021321702,0.000036626032,0.000048843336,0.00006973417],"domain_scores_gemma":[0.99977154,0.000013375681,0.00011125195,0.000041266598,0.000042281015,0.00002031134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001938763,0.00004140776,0.0000757649,0.000048306167,0.000021186612,0.0000055325913,0.000031585467,0.000052580963,0.0000033753875],"category_scores_gemma":[0.000043656386,0.000037396418,0.000020946376,0.000059629223,0.000032468302,0.000018699355,0.00003610971,0.000024459263,0.0000016987968],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022081021,0.0002149987,0.10680958,0.0001863593,0.000046851765,2.2646663e-7,0.0017445722,0.0036608127,0.6913105,0.0030025006,0.0014484333,0.1913543],"study_design_scores_gemma":[0.0015805003,0.000376397,0.8052108,0.00008413917,0.000016221811,0.000019373447,0.0009264748,0.023988198,0.16115314,0.00026716865,0.006087317,0.00029022226],"about_ca_topic_score_codex":0.000016488268,"about_ca_topic_score_gemma":0.0000016214026,"teacher_disagreement_score":0.6984013,"about_ca_system_score_codex":0.000004074879,"about_ca_system_score_gemma":0.0000074332347,"threshold_uncertainty_score":0.15249817},"labels":[],"label_agreement":null},{"id":"W2005930353","doi":"10.1016/j.tcs.2011.12.025","title":"Language theoretical properties of hairpin formations","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Variety (cybernetics); Class (philosophy); Regular language; Concatenation (mathematics); Closure (psychology); Aperiodic graph; Iterated function; Mathematics; Property (philosophy); Pumping lemma for regular languages; Discrete mathematics; Computer science; Combinatorics; Programming language; Second-generation programming language; Artificial intelligence; Fifth-generation programming language","score_opus":0.017979340750517714,"score_gpt":0.2343071813241843,"score_spread":0.21632784057366658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005930353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87358946,0.000056593617,0.11732742,0.000048574653,0.000093885326,0.00008625086,0.0000017560292,0.000021445401,0.008774648],"genre_scores_gemma":[0.98628646,0.0000033132123,0.0134187,0.00019553449,0.00008059067,0.000002728033,0.000002146105,0.0000043687687,0.0000061871406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990503,0.000059799906,0.00019144334,0.00026004238,0.00016828494,0.0002701017],"domain_scores_gemma":[0.99945045,0.000012672378,0.000043011423,0.000293721,0.00010368643,0.0000964377],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005434521,0.00009811951,0.00011288992,0.00003904589,0.00012083334,0.000021798993,0.0005653258,0.00005878997,0.00006828374],"category_scores_gemma":[0.00012140852,0.00006266913,0.000058622434,0.000172361,0.004187345,0.000007982567,0.00046584537,0.00007065735,0.000012358617],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003442304,0.000059051283,0.00013888696,0.0000075130242,0.0000041441817,0.0000010002664,0.00039727226,0.0000033516926,0.25874954,0.73565567,0.000009680311,0.0049394793],"study_design_scores_gemma":[0.00016389857,0.0006367349,0.0013245958,0.00002866408,0.00000670164,0.000019930667,0.00007937831,0.008663603,0.9713982,0.017463954,0.000041494914,0.00017289772],"about_ca_topic_score_codex":0.0000019096994,"about_ca_topic_score_gemma":2.596659e-7,"teacher_disagreement_score":0.7181917,"about_ca_system_score_codex":0.000004598576,"about_ca_system_score_gemma":0.000038895872,"threshold_uncertainty_score":0.9985227},"labels":[],"label_agreement":null},{"id":"W2005962757","doi":"10.1007/s11047-007-9045-9","title":"On the universality of peptide computing","year":2007,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Turing machine; Theory of computation; Turing; Universality (dynamical systems); Super-recursive algorithm; Construct (python library); Computation; Theoretical computer science; Non-deterministic Turing machine; Universal Turing machine; Artificial intelligence; Algorithm; Programming language","score_opus":0.012729422730591775,"score_gpt":0.26377731716144015,"score_spread":0.25104789443084835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005962757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882561,0.00016935456,0.0061218757,0.00012048997,0.00025109306,0.00009913009,0.0000011629285,0.000024059484,0.004956756],"genre_scores_gemma":[0.99785364,0.0000015258581,0.0011560175,0.0006042085,0.00028829792,5.041514e-8,0.00001358364,0.0000074445666,0.00007522534],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895173,0.00008996957,0.00025260547,0.00025892546,0.00015013742,0.0002966341],"domain_scores_gemma":[0.9991624,0.00032791967,0.00016011272,0.00020852358,0.0001006488,0.00004042723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010486771,0.00013211078,0.00013450724,0.000027550062,0.00018920802,0.000013602878,0.0003027125,0.00009993671,0.0000048484508],"category_scores_gemma":[0.00034284953,0.00008321281,0.00011727968,0.00015463796,0.00010440356,0.000001447954,0.0002636572,0.00025889758,0.0000036588776],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003372187,0.00013455377,0.017532445,0.00004223932,0.000127739,0.000018017272,0.00023714545,0.0015151132,0.87682146,0.020457236,0.0020872327,0.08068958],"study_design_scores_gemma":[0.0017806191,0.0015747874,0.23038115,0.00031072597,0.000045992812,0.00006954946,0.0014939676,0.023680594,0.7264997,0.0016198155,0.011321869,0.0012212709],"about_ca_topic_score_codex":0.000014314253,"about_ca_topic_score_gemma":0.0000057725683,"teacher_disagreement_score":0.2128487,"about_ca_system_score_codex":0.000015145789,"about_ca_system_score_gemma":0.000015806232,"threshold_uncertainty_score":0.339332},"labels":[],"label_agreement":null},{"id":"W2006134859","doi":"","title":"Skoliad: nº. 130","year":2011,"lang":"en","type":"article","venue":"Crux mathematicorum","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"CONTEST; Norwegian; Permission; Library science; Political science; Media studies; Sociology; Philosophy; Law; Computer science; Linguistics","score_opus":0.054304124169658165,"score_gpt":0.23969377503737144,"score_spread":0.18538965086771328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006134859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.901334,0.00020565031,0.005543619,0.000058030026,0.00015777248,0.00013453222,0.0000032334567,0.000048047797,0.092515126],"genre_scores_gemma":[0.9911363,0.000013422434,0.0067653405,0.00037613246,0.00013634216,0.000009862011,0.000009780366,0.000014063357,0.0015387441],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992107,0.000026910611,0.00017744894,0.0002343513,0.000090817295,0.00025973198],"domain_scores_gemma":[0.9995098,0.00000960526,0.00006552511,0.0002950568,0.000049788272,0.00007018435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019319209,0.00012632093,0.00013112716,0.000018229784,0.00006657809,0.0000136149565,0.00022888907,0.00011103393,0.00019882491],"category_scores_gemma":[0.00012949045,0.00009255759,0.00008950012,0.000049215207,0.00006196336,0.0000018005451,0.00017115254,0.000058735764,0.00019782843],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120769364,0.00077791524,0.009257545,0.00017674641,0.00015649915,0.000044050066,0.00055689295,0.0000022069341,0.9225546,0.022278542,0.02164975,0.022424448],"study_design_scores_gemma":[0.0010848683,0.0014661932,0.01718679,0.00011514505,0.000069500325,0.00016106521,0.0006035243,0.00033004538,0.8576991,0.049248848,0.07085811,0.001176807],"about_ca_topic_score_codex":0.0000035267485,"about_ca_topic_score_gemma":0.0000022120353,"teacher_disagreement_score":0.09097638,"about_ca_system_score_codex":0.000005135462,"about_ca_system_score_gemma":0.000016957405,"threshold_uncertainty_score":0.3774389},"labels":[],"label_agreement":null},{"id":"W2006568248","doi":"10.14778/1920841.1921043","title":"Transforming XML documents as schemas evolve","year":2010,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); York University","funders":"","keywords":"XML Schema Editor; Computer science; Streaming XML; XML validation; Document Structure Description; Efficient XML Interchange; XML database; XML Schema (W3C); XSLT; Information retrieval; cXML; XML Encryption; RELAX NG; Programming language; Database; XML; World Wide Web","score_opus":0.006265382445630607,"score_gpt":0.23777636910250835,"score_spread":0.23151098665687775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006568248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.972853,0.00007057014,0.000017216922,0.00031926797,0.0002204337,0.00025449364,0.000002155591,0.000012819287,0.026250014],"genre_scores_gemma":[0.9977567,0.000026420905,0.0010894632,0.00021388568,0.00017144324,0.000017217993,0.0000031578554,0.000009297639,0.0007124104],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991788,0.0000030004724,0.00019008454,0.00024020956,0.00016259102,0.00022530237],"domain_scores_gemma":[0.99962974,0.0000056923222,0.00010950533,0.00010224275,0.000095402094,0.000057410685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002095124,0.000129423,0.000114595176,0.000017735676,0.000097391676,0.000020266682,0.00035024263,0.00010900528,0.000025495665],"category_scores_gemma":[0.00010457504,0.000079202306,0.00013296731,0.000077357174,0.00008317958,0.0000055794612,0.00021332563,0.00015374948,0.000008509527],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029417968,0.000048575235,0.00396922,0.000019050953,0.00002717036,1.0965937e-7,0.000035427955,5.700991e-7,0.9911987,0.002059731,0.00031607813,0.0022959085],"study_design_scores_gemma":[0.00030945346,0.00016649539,0.00059205084,0.0000199748,0.0000149878815,0.00001255202,0.0000678437,0.0000062323124,0.9552104,0.0007575551,0.0427355,0.00010695188],"about_ca_topic_score_codex":0.00001281019,"about_ca_topic_score_gemma":0.0000021638382,"teacher_disagreement_score":0.04241942,"about_ca_system_score_codex":0.0000073391184,"about_ca_system_score_gemma":0.00001880025,"threshold_uncertainty_score":0.32297763},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01746398095476364,"score_gpt":0.24562370602037245,"score_spread":0.2281597250656088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007496476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7732749,0.00006861405,0.17215072,0.00008426154,0.0003306297,0.0006250252,0.000010014514,0.00006661096,0.05338921],"genre_scores_gemma":[0.9873678,5.531042e-7,0.011026732,0.0007017359,0.00055337034,0.000013811637,0.00005407225,0.000016327578,0.00026556232],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988307,0.00002837404,0.00023102062,0.00041801998,0.00013230855,0.0003596175],"domain_scores_gemma":[0.99948514,0.000015482949,0.000056709723,0.00025206528,0.000061573,0.00012903778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052106,0.00016273804,0.00014527026,0.000048738555,0.0000785129,0.000032034957,0.000191184,0.00017691181,0.000003140241],"category_scores_gemma":[0.00005072457,0.00012159447,0.00006916644,0.00015863372,0.000019819656,0.000001108012,0.00010631619,0.00006919818,0.000034209617],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029595871,0.00023481066,0.0014846597,0.000098725046,0.00003076769,0.0000067707333,0.00006115662,0.0010411851,0.9892525,0.00018142466,0.0018611016,0.005450908],"study_design_scores_gemma":[0.0031154922,0.005369719,0.005825501,0.0003392397,0.000035619665,0.00008130785,0.0007999436,0.024849879,0.52746034,0.000020382366,0.43006694,0.002035608],"about_ca_topic_score_codex":0.000013060419,"about_ca_topic_score_gemma":0.000016516502,"teacher_disagreement_score":0.46179217,"about_ca_system_score_codex":0.000019019402,"about_ca_system_score_gemma":0.000024661995,"threshold_uncertainty_score":0.49584788},"labels":[],"label_agreement":null},{"id":"W2007676477","doi":"10.1007/s002360100072","title":"Tree-systems of morphisms","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Morphism; Theory of computation; Tree (set theory); Alphabet; Mathematics; Regular language; Hierarchy; Substring; Root (linguistics); Discrete mathematics; Computer science; Combinatorics; Automaton; Theoretical computer science; Algorithm; Data structure; Programming language","score_opus":0.013829491109477622,"score_gpt":0.2309483918935203,"score_spread":0.21711890078404267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007676477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9461776,0.00008094969,0.001000183,0.000057913767,0.00008657499,0.00008273367,0.0000031023512,0.000010961559,0.052499983],"genre_scores_gemma":[0.9988705,0.000047764694,0.0004579856,0.00016206158,0.00008019706,0.0000034977215,0.000035118235,0.0000034719048,0.00033938608],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944866,0.000014027978,0.00024616023,0.00006941693,0.000074748765,0.0001469785],"domain_scores_gemma":[0.99963224,0.000011627817,0.000092215705,0.00018003274,0.00004110851,0.00004278879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011326665,0.00007416395,0.00010764683,0.000019774747,0.000029122182,0.000012291317,0.000157499,0.00008472752,0.000026171212],"category_scores_gemma":[0.00006619077,0.000053031108,0.000051680912,0.00006161702,0.000042836324,0.000004181584,0.00008361236,0.00003939855,0.000018402528],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001773821,0.00015656007,0.018344833,0.00012307597,0.00013186478,0.0000062095314,0.00023029959,0.00015262245,0.9139272,0.0015762006,0.015938098,0.04923568],"study_design_scores_gemma":[0.0014689437,0.0018971919,0.017565822,0.00008516372,0.000038627913,0.0001908397,0.0008456737,0.007704801,0.12884682,0.00017381212,0.84047514,0.0007071404],"about_ca_topic_score_codex":0.0000073545298,"about_ca_topic_score_gemma":0.0000012486889,"teacher_disagreement_score":0.82453704,"about_ca_system_score_codex":0.0000023061612,"about_ca_system_score_gemma":0.000013171153,"threshold_uncertainty_score":0.21625458},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04052884215604588,"score_gpt":0.33318977295965324,"score_spread":0.29266093080360733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007924435","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034014496,0.99249876,0.0027706595,0.0000016700533,0.00012417277,0.0010908175,0.00003971758,0.000011740199,0.000061023347],"genre_scores_gemma":[0.572748,0.42677894,0.000019156218,0.000004543878,0.00014412303,0.000032485503,0.00020895386,0.000018781642,0.000044986522],"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865305,0.00013777938,0.0005051701,0.00036157432,0.00015132179,0.00019108712],"domain_scores_gemma":[0.9988838,0.00022147043,0.0004737926,0.00025386715,0.000117659,0.000049449114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036446523,0.0002819231,0.00086589594,0.00004227737,0.00005772851,0.00003148191,0.0002072363,0.00029514055,3.8281442e-7],"category_scores_gemma":[0.00012077522,0.00013260664,0.00010423102,0.00016717924,0.00021212325,0.0000013133662,0.00010197415,0.00009640524,0.0000017826633],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026497429,0.0009320372,0.00024398489,0.5085522,0.0060593304,0.00003251799,0.00024419086,0.008115074,0.002902754,0.0005952376,0.0005817548,0.46909115],"study_design_scores_gemma":[0.0028280902,0.0011218389,0.000009998179,0.035305686,0.0014069502,0.00032636223,0.00015549886,0.005959193,0.00014187368,0.000006783177,0.95145357,0.0012841378],"about_ca_topic_score_codex":0.000008602227,"about_ca_topic_score_gemma":0.000003887741,"teacher_disagreement_score":0.9508718,"about_ca_system_score_codex":0.000014866239,"about_ca_system_score_gemma":0.00010121903,"threshold_uncertainty_score":0.5407542},"labels":[],"label_agreement":null},{"id":"W2011599949","doi":"10.1145/1866480.1866507","title":"Certain answers and rewritings for local regular path queries on graph-structured data","year":2010,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Rewriting; Computer science; Graph; Node (physics); Automaton; Connection (principal bundle); Path (computing); Theoretical computer science; Matching (statistics); Mathematics","score_opus":0.014642342608333456,"score_gpt":0.25813494054177055,"score_spread":0.24349259793343708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011599949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876989,0.00010871424,0.010655552,0.00042984608,0.00011377699,0.00016749483,0.00006368067,0.00002351587,0.0007385102],"genre_scores_gemma":[0.9886316,0.000023518847,0.009742882,0.00075618934,0.00019886138,0.000004375158,0.00045624812,0.000009052997,0.00017725372],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991958,0.000018976623,0.00011769312,0.00042549946,0.000051087172,0.00019093763],"domain_scores_gemma":[0.99945724,0.000025627842,0.000036724574,0.00037982396,0.00003631808,0.00006427986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001939626,0.00011753314,0.00010261457,0.0000143268735,0.00010123639,0.00002935436,0.0002284732,0.00017284015,0.000009129773],"category_scores_gemma":[0.0001352166,0.000082100945,0.00003541254,0.000031387004,0.00017401508,0.0000026097155,0.00019050919,0.000093585084,4.720032e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017088563,0.000022571885,0.0015601031,0.000020514397,0.000025276706,0.0000019879362,0.0000106838825,0.0000032303703,0.93009293,0.004228537,0.004790593,0.05907271],"study_design_scores_gemma":[0.0016195382,0.0019959589,0.006893337,0.000026366733,0.000036853715,0.000053731335,0.0005805579,0.001952951,0.5078816,0.0064003537,0.471742,0.00081675174],"about_ca_topic_score_codex":0.000017054062,"about_ca_topic_score_gemma":0.00007880128,"teacher_disagreement_score":0.4669514,"about_ca_system_score_codex":0.0000012395113,"about_ca_system_score_gemma":0.000013980463,"threshold_uncertainty_score":0.33479795},"labels":[],"label_agreement":null},{"id":"W2013089631","doi":"10.1007/s11047-004-3591-1","title":"DNA and quantum based algorithms for VLSI circuits testing","year":2005,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Very-large-scale integration; Computer science; Algorithm; DNA computing; Theory of computation; Electronic circuit; Test vector; Parallel computing; Computer engineering; Computation; Embedded system; Engineering; Artificial intelligence","score_opus":0.03375845069028024,"score_gpt":0.28606512766318987,"score_spread":0.25230667697290965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013089631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816096,0.001133822,0.016243925,0.00022990942,0.00024075978,0.00019546323,0.0000048092547,0.00005785996,0.0002838951],"genre_scores_gemma":[0.97348577,0.0000017790057,0.024351094,0.00086639385,0.0011861272,0.0000023702364,0.00005062811,0.000014296735,0.000041534095],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989156,0.000038396352,0.00020974546,0.00040322632,0.000082777566,0.00035023247],"domain_scores_gemma":[0.99943864,0.00016161909,0.00009160149,0.00011783005,0.00012114432,0.00006914343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031401403,0.00016368467,0.00015037665,0.000028484164,0.00023916355,0.00004962871,0.00014719399,0.00013269206,0.0000012522833],"category_scores_gemma":[0.0004689346,0.00013463844,0.000070619986,0.00009425746,0.00004755229,0.0000036554127,0.00012978574,0.00014337603,0.0000016864083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015477704,0.000024901392,0.0020142233,0.000027374585,0.000015528221,0.0000013351367,0.0000148632,0.00036308888,0.54378045,0.00007525978,0.00023655043,0.45343095],"study_design_scores_gemma":[0.0014941165,0.0006243224,0.010019751,0.00008215888,0.000022903716,0.00004812007,0.000040437542,0.83322376,0.13552031,0.00014977563,0.018150548,0.00062382594],"about_ca_topic_score_codex":0.0000033377914,"about_ca_topic_score_gemma":0.0000022098154,"teacher_disagreement_score":0.83286065,"about_ca_system_score_codex":0.000012343487,"about_ca_system_score_gemma":0.000025926816,"threshold_uncertainty_score":0.54903966},"labels":[],"label_agreement":null},{"id":"W2016488439","doi":"10.1109/cwit.2007.375721","title":"Channel Code Design with Causal Side Information at the Encoder","year":2007,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Channel (broadcasting); Additive white Gaussian noise; Encoder; Computer science; Interference (communication); Binary symmetric channel; Hamming code; Hamming distance; Code (set theory); Algorithm; Hamming(7,4); Binary erasure channel; Linear code; Binary code; Concatenated error correction code; Decoding methods; Binary number; Theoretical computer science; Mathematics; Block code; Telecommunications; Channel capacity; Arithmetic","score_opus":0.01811616586216009,"score_gpt":0.23892519729285258,"score_spread":0.2208090314306925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016488439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48908332,0.000057287656,0.49693546,0.00022533473,0.000048105154,0.00015127382,0.000002174462,0.000018677252,0.013478379],"genre_scores_gemma":[0.9958393,0.000007937152,0.0013767645,0.0015321302,0.000091246795,0.0000029571306,0.000043918644,0.0000032536498,0.0011024987],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952847,0.000022566726,0.000107120264,0.00009629135,0.00006909764,0.00017645817],"domain_scores_gemma":[0.9997341,0.000026175225,0.000039982922,0.00011945218,0.000044593387,0.00003566933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003208532,0.00007506116,0.000046464596,0.000009587711,0.00010704431,0.000016366108,0.00009150864,0.00007270169,0.000017376073],"category_scores_gemma":[0.00003115443,0.000035451238,0.000021655267,0.000044234574,0.000051210496,0.0000030985416,0.00008131293,0.00004256978,0.000026364087],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015962991,0.00010078294,0.0053642895,0.000021803733,0.00015474306,0.000015334377,0.00037405657,0.0077784928,0.9251988,0.00068595575,0.024256574,0.03445287],"study_design_scores_gemma":[0.00047609903,0.0007429562,0.0062149805,0.0000055680816,0.0000110393285,0.000057499397,0.0002444613,0.0008622543,0.9200618,0.00008592223,0.07100085,0.00023655272],"about_ca_topic_score_codex":0.00001245678,"about_ca_topic_score_gemma":0.0001167566,"teacher_disagreement_score":0.50675595,"about_ca_system_score_codex":0.000007744031,"about_ca_system_score_gemma":0.000012420487,"threshold_uncertainty_score":0.14456595},"labels":[],"label_agreement":null},{"id":"W2017338196","doi":"10.1142/s0129054111007964","title":"ORTHOGONAL SHUFFLE ON TRAJECTORIES","year":2011,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Corollary; Catenation; Set (abstract data type); Orthogonal array; Computer science; Literal (mathematical logic); Trajectory; Combinatorics; Mathematics; Arithmetic; Algorithm; Geometry; Programming language","score_opus":0.03615053148239461,"score_gpt":0.30310088824732984,"score_spread":0.2669503567649352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017338196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89307845,0.000016298914,0.102215275,0.00010128604,0.0012293024,0.000022692686,0.0000026260582,0.000002533884,0.0033315576],"genre_scores_gemma":[0.97192186,0.000008994779,0.0275541,0.00013781227,0.00034031962,2.7074532e-7,0.0000032301946,0.0000019217407,0.00003151566],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921983,0.000017820843,0.00025203254,0.000111116904,0.00031723434,0.00008193471],"domain_scores_gemma":[0.99888223,0.00001953095,0.00022130003,0.000091782094,0.0007413131,0.000043810483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034348635,0.000054924167,0.00007180505,0.00012216736,0.000049051454,0.000031660926,0.00070333673,0.000023774874,0.000026314256],"category_scores_gemma":[0.00009609675,0.00004141603,0.000073786505,0.00010915727,0.00025917005,0.00001984398,0.00011043551,0.000055429835,0.0000047393955],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008242139,0.0014710359,0.053878017,0.000009936191,0.000381125,0.00004429921,0.00080691685,0.0021613387,0.62036026,0.07831284,0.00235933,0.23939072],"study_design_scores_gemma":[0.0017008847,0.0063703456,0.3938976,0.00017234356,0.000029874487,0.0005530011,0.000081844366,0.00220985,0.5519253,0.007611172,0.03493026,0.00051754457],"about_ca_topic_score_codex":0.0000014868307,"about_ca_topic_score_gemma":0.00000125016,"teacher_disagreement_score":0.34001955,"about_ca_system_score_codex":0.000012908866,"about_ca_system_score_gemma":0.0001532077,"threshold_uncertainty_score":0.16888967},"labels":[],"label_agreement":null},{"id":"W2017404547","doi":"10.1142/s0129054108006200","title":"WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID","year":2008,"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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Watson; Alphabet; Monoid; Prefix; Suffix; Combinatorics; Mathematics; Word (group theory); DNA; Discrete mathematics; Computer science; Base pair; Linguistics; Biology; Genetics; Philosophy; Natural language processing","score_opus":0.018994772658084556,"score_gpt":0.2844391777177993,"score_spread":0.2654444050597147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017404547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8415783,0.0001414248,0.15723959,0.0003677005,0.00048189156,0.000023498136,0.0000017113706,0.0000021172962,0.00016374976],"genre_scores_gemma":[0.982706,0.00012140793,0.016764347,0.00012381567,0.0002621005,2.9982579e-7,0.0000025776426,0.0000021995804,0.000017228283],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992887,0.00002173282,0.00025676377,0.00012807731,0.00021214249,0.00009257779],"domain_scores_gemma":[0.99900866,0.000037573664,0.00022078265,0.000093049115,0.00058560685,0.000054329765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028332637,0.000065631946,0.00009430971,0.00011808938,0.000099409655,0.00004496349,0.0005339905,0.000025916499,0.0000052281375],"category_scores_gemma":[0.000117469994,0.000046659206,0.000056559158,0.00012147442,0.0003443369,0.000030567662,0.00019347573,0.0000616391,8.1253927e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015964833,0.0003708837,0.028411347,0.000008275426,0.00020941286,0.000025568535,0.0008108917,0.0015705063,0.78251964,0.0013627794,0.00056839763,0.18398267],"study_design_scores_gemma":[0.0035627566,0.0041477415,0.32603619,0.00027340162,0.000041796342,0.006901257,0.0004037613,0.042542562,0.5651186,0.0058126394,0.04417739,0.0009818925],"about_ca_topic_score_codex":0.000004228327,"about_ca_topic_score_gemma":9.7998e-7,"teacher_disagreement_score":0.29762483,"about_ca_system_score_codex":0.000014600488,"about_ca_system_score_gemma":0.00015268757,"threshold_uncertainty_score":0.19027072},"labels":[],"label_agreement":null},{"id":"W2021913171","doi":"10.1016/j.tcs.2009.03.031","title":"On the synchronized derivation depth of context-free grammars","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Rule-based machine translation; Context (archaeology); Tree-adjoining grammar; Context-free grammar; Context-sensitive grammar; Mathematics; Indexed grammar; Computer science; Calculus (dental); Algorithm; Artificial intelligence; Geography","score_opus":0.009761927934682894,"score_gpt":0.2406589230558795,"score_spread":0.2308969951211966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021913171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79515964,0.000031770556,0.2015636,0.0011214744,0.00008312675,0.00010651203,9.56953e-7,0.000013255293,0.0019196735],"genre_scores_gemma":[0.9932294,0.000003186951,0.004648995,0.0020228452,0.00008583415,0.0000010793525,0.0000024549972,0.0000023954078,0.0000038090825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990568,0.00007685773,0.00015357032,0.00028036154,0.0002055943,0.00022681168],"domain_scores_gemma":[0.9992535,0.000101987614,0.000053590775,0.0004414741,0.00009063942,0.000058800106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065365917,0.00009405373,0.00010056082,0.000023233819,0.00015051846,0.00003610668,0.0008529843,0.000050108425,0.000013827311],"category_scores_gemma":[0.00042539835,0.000052281262,0.0000547339,0.00019613992,0.0013264813,0.0000031739467,0.00024153818,0.00007735583,0.000004064858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004876421,0.00004231821,0.000058229813,0.0000011611164,0.0000026926787,6.529185e-7,0.000014175588,0.000047535665,0.09553715,0.8544557,0.00012557536,0.04966606],"study_design_scores_gemma":[0.0008906908,0.0045130034,0.012557739,0.000057018573,0.000011382932,0.000019060091,0.000021727148,0.0387248,0.44482058,0.4976644,0.00034760102,0.00037198418],"about_ca_topic_score_codex":7.5384054e-7,"about_ca_topic_score_gemma":3.7831705e-7,"teacher_disagreement_score":0.3567913,"about_ca_system_score_codex":0.000007891729,"about_ca_system_score_gemma":0.00003215676,"threshold_uncertainty_score":0.48874757},"labels":[],"label_agreement":null},{"id":"W2022963826","doi":"10.1109/tcomm.2006.877945","title":"Length-constrained MAP decoding of variable-length encoded Markov sequences","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Maximum a posteriori estimation; Markov chain; Directed acyclic graph; Mathematics; Parameterized complexity; Algorithm; Directed graph; Markov process; Path (computing); Sequential decoding; Sequence (biology); Binary number; Markov model; Mathematical optimization; Computer science; Maximum likelihood; Block code","score_opus":0.020305138290164695,"score_gpt":0.2612639241017747,"score_spread":0.24095878581160998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022963826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28827366,0.00083769235,0.680864,0.0011751509,0.00040703386,0.0004497088,0.00021885675,0.000116638264,0.027657272],"genre_scores_gemma":[0.9657426,0.00021494688,0.033322077,0.0000879775,0.000044936696,0.000029312607,0.0000732034,0.000011006212,0.00047395032],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989847,0.00015975836,0.00034132277,0.00022760454,0.000092258204,0.00019438249],"domain_scores_gemma":[0.99874485,0.00014706395,0.00011421777,0.0008461495,0.00010396474,0.00004374795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023755532,0.00014182199,0.00015507183,0.000063550244,0.00031228957,0.000019296262,0.00058529293,0.00014768523,0.000051692765],"category_scores_gemma":[0.000014035914,0.00012990879,0.000119512864,0.00017692927,0.00027257772,0.000006642477,0.000012210308,0.00018714252,0.000008186882],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057591227,0.00058957696,0.00024509657,0.0000248715,0.000107974265,6.63616e-7,0.000035988,0.0041901963,0.9740997,0.0028214685,0.00032229885,0.01750458],"study_design_scores_gemma":[0.0015876029,0.0008817565,0.00068106677,0.00016549308,0.00017887745,0.00004129067,0.0004464611,0.014250434,0.94962436,0.0033184527,0.027913928,0.0009102827],"about_ca_topic_score_codex":0.00013379479,"about_ca_topic_score_gemma":0.00014101039,"teacher_disagreement_score":0.6774689,"about_ca_system_score_codex":0.000017217897,"about_ca_system_score_gemma":0.00006981704,"threshold_uncertainty_score":0.5297526},"labels":[],"label_agreement":null},{"id":"W2023410739","doi":"10.1109/iscc.2010.5546594","title":"Component-based networking for simulations in medical education","year":2010,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"U.S. National Library of Medicine","keywords":"Component (thermodynamics); Computer science; Graphics; Context (archaeology); Hierarchy; Set (abstract data type); Visualization; Computer graphics; Server; Wireless; Human–computer interaction; Multimedia; Distributed computing; Computer network; Operating system; Artificial intelligence; Programming language","score_opus":0.013072457398967575,"score_gpt":0.3081099652055343,"score_spread":0.29503750780656673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023410739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892116,0.000027957482,0.008531495,0.00058398186,0.0004759166,0.00012355493,0.0000012103317,0.000009176272,0.0010350735],"genre_scores_gemma":[0.9947135,0.0000010109667,0.0029878826,0.0013493266,0.00067984493,0.000009012944,0.00018727983,0.0000037682453,0.000068373374],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995907,0.000014643488,0.000104964136,0.00013465642,0.00004553191,0.000109503104],"domain_scores_gemma":[0.99978316,0.000035919253,0.000020405645,0.00008325839,0.000030167002,0.000047083424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013561964,0.000047242615,0.000047870857,0.000016884012,0.000037881047,0.000008514527,0.00008316798,0.00012339003,0.00004133549],"category_scores_gemma":[0.0001531707,0.000037311976,0.000030827017,0.00004032957,0.000023227743,6.057114e-7,0.00002508329,0.00006687733,0.0000010936334],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006427286,0.00040112605,0.08221973,0.000012238505,0.000007999087,4.6995123e-7,0.000005671398,0.0010187667,0.83145577,0.0015706441,0.002253024,0.08099027],"study_design_scores_gemma":[0.0024715026,0.0004242594,0.040633842,0.000051925555,0.000012251815,0.00000760364,0.00003707662,0.32420394,0.081617355,0.0016878898,0.5482489,0.0006034466],"about_ca_topic_score_codex":0.000009987432,"about_ca_topic_score_gemma":0.0002610979,"teacher_disagreement_score":0.7498384,"about_ca_system_score_codex":0.0000022907566,"about_ca_system_score_gemma":0.00010829272,"threshold_uncertainty_score":0.15215382},"labels":[],"label_agreement":null},{"id":"W2025168251","doi":"10.1016/s0304-3975(01)00280-8","title":"Error-detecting properties of languages","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Redundancy (engineering); Property (philosophy); Error detection and correction; Word (group theory); Extension (predicate logic); Algorithm; Error analysis; Theoretical computer science; Natural language processing; Mathematics; Programming language","score_opus":0.022543639455241488,"score_gpt":0.2496567692035984,"score_spread":0.2271131297483569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025168251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808077,0.00023173058,0.0150538115,0.00008067392,0.000078774094,0.000053094504,6.1560206e-7,0.000019995912,0.003673589],"genre_scores_gemma":[0.99573404,0.000005177208,0.0039425613,0.00015222725,0.00013982665,0.0000010162186,4.714725e-7,0.0000036966942,0.000021010126],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917936,0.000044731314,0.00013149396,0.00026709444,0.00014806069,0.00022925141],"domain_scores_gemma":[0.99961394,0.00001451079,0.000037263235,0.0002077311,0.00006494339,0.000061628125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037280066,0.00007912711,0.00009327488,0.000028034765,0.000114340175,0.000026148511,0.00039822038,0.000047891484,0.00003443612],"category_scores_gemma":[0.00013640804,0.000052039642,0.000037204605,0.00015743973,0.0014292451,0.0000037404384,0.0003410087,0.00006703843,0.000009984331],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010051519,0.000039086026,0.00025612148,0.000009517876,0.0000038028254,0.0000015038502,0.000086766246,0.000043315893,0.9523278,0.020095104,0.000019630937,0.02710731],"study_design_scores_gemma":[0.00013650976,0.0005237599,0.00047489585,0.000028953507,0.000003696821,0.000021610407,0.00003918159,0.03181166,0.96597433,0.00060759165,0.0002150681,0.00016276831],"about_ca_topic_score_codex":0.0000012691,"about_ca_topic_score_gemma":1.9231933e-7,"teacher_disagreement_score":0.03176834,"about_ca_system_score_codex":0.0000037111765,"about_ca_system_score_gemma":0.0000078115,"threshold_uncertainty_score":0.52661127},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0067281666595720956,"score_gpt":0.2258984392369812,"score_spread":0.2191702725774091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025553490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9171472,0.0002361092,0.00031708038,0.00018802144,0.000055502474,0.000096972166,0.000013083762,0.000022357026,0.081923634],"genre_scores_gemma":[0.9958327,0.000051763996,0.0027535341,0.0009317757,0.00005948732,0.0000038325206,0.000026918024,0.0000056152035,0.00033436215],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994167,0.000024156352,0.00016328717,0.000111747795,0.00007792685,0.00020617622],"domain_scores_gemma":[0.99942315,0.00002845526,0.000051591673,0.00039969716,0.000025155576,0.00007196227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015139864,0.00010796533,0.0000999534,0.000018343955,0.00006750847,0.000038248585,0.00023860918,0.00010271909,0.00004337633],"category_scores_gemma":[0.00091951806,0.00007965577,0.00003552805,0.00004292066,0.000060513536,0.0000073200713,0.00026298812,0.00006387734,0.000011277162],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020927157,0.00030094286,0.016548587,0.00047887556,0.00038886277,0.00003149986,0.0013329389,0.000014528591,0.7261154,0.035963047,0.1688535,0.049762554],"study_design_scores_gemma":[0.0032522627,0.0013444043,0.015688637,0.00006740274,0.000064682616,0.000199709,0.0016604661,0.00028642887,0.21342468,0.0046104686,0.7583234,0.0010775093],"about_ca_topic_score_codex":0.0000026158627,"about_ca_topic_score_gemma":0.000003515768,"teacher_disagreement_score":0.58946985,"about_ca_system_score_codex":0.0000037352443,"about_ca_system_score_gemma":0.000016758848,"threshold_uncertainty_score":0.3248268},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010486737747912913,"score_gpt":0.2543342481356515,"score_spread":0.24384751038773855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029114055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12682432,0.000010781398,0.8722795,0.000072325834,0.0002704184,0.0002734481,0.000084241154,0.000022458613,0.00016249648],"genre_scores_gemma":[0.9893545,0.000005937528,0.010005271,0.00038751657,0.00003435387,0.000055584183,0.00011145752,0.0000053496924,0.00004002012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935544,0.000031627787,0.00027507584,0.000108003376,0.00009441888,0.00013542791],"domain_scores_gemma":[0.999574,0.000040504005,0.0001306503,0.00013226201,0.000086720705,0.000035860692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027752804,0.000111458605,0.000102628575,0.0000773306,0.00011737826,0.000022332651,0.00010701681,0.00012762313,0.000018743542],"category_scores_gemma":[0.000014165232,0.000093715804,0.00011630273,0.00007506458,0.000071451526,0.000028505267,0.0000013612156,0.00006450738,0.000009414778],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004607479,0.00011105188,0.000002662507,0.000099445715,0.000047412395,1.2692065e-7,0.0001714025,0.8667639,0.026060803,0.0012154931,0.000029271647,0.10503768],"study_design_scores_gemma":[0.0013779247,0.0007991072,0.000039983555,0.000050288352,0.000024856732,0.0000024819697,0.00014565619,0.047116417,0.9460066,0.0032878418,0.0009366172,0.00021221963],"about_ca_topic_score_codex":0.000007197219,"about_ca_topic_score_gemma":0.0000013429645,"teacher_disagreement_score":0.9199458,"about_ca_system_score_codex":0.000023501298,"about_ca_system_score_gemma":0.000058639285,"threshold_uncertainty_score":0.38216197},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.0160574690519091,"score_gpt":0.2378533661460158,"score_spread":0.2217958970941067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029929198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6921914,0.0070293555,0.0027497786,0.0035538839,0.009654577,0.00028299217,0.0024363503,0.00081056094,0.28129107],"genre_scores_gemma":[0.962236,0.0066982387,0.0038705834,0.0068232636,0.009882272,0.0029254525,0.004233356,0.002842306,0.0004885505],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9640849,0.0030176418,0.007901701,0.0066749253,0.0092975525,0.00902326],"domain_scores_gemma":[0.9717763,0.0054343203,0.0101101175,0.0070461314,0.0011809135,0.0044522197],"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.0040720464,0.0016318362,0.0021338763,0.0075157844,0.0064990576,0.011189177,0.009794826,0.3242693],"category_scores_gemma":[0.008164596,0.0069630276,0.009077261,0.004813797,0.0076576867,0.0032970307,0.0073733674,0.008695007,0.0032101024],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00946534,0.0019471619,0.000105968604,0.0028675455,0.008613097,0.0048228716,0.003231435,0.014523571,0.018311003,0.3760425,0.5495569,0.0105125755],"study_design_scores_gemma":[0.007384841,0.007128296,0.00026302395,0.0048790537,0.006369747,0.00575434,0.0044885376,0.021993011,0.9134761,0.0030049062,0.018632758,0.006625396],"about_ca_topic_score_codex":0.0045826356,"about_ca_topic_score_gemma":0.005283067,"teacher_disagreement_score":0.8951651,"about_ca_system_score_codex":0.00013217656,"about_ca_system_score_gemma":0.0058852253,"threshold_uncertainty_score":0.9997505},"labels":[],"label_agreement":null},{"id":"W2031426449","doi":"10.1007/s11047-012-9329-6","title":"Extended Watson–Crick L systems with regular trigger languages and restricted derivation modes","year":2012,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Watson; Recursively enumerable language; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Morphism; Theory of computation; Regular language; Mathematics; Recursively enumerable set; Context (archaeology); Computer science; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Theoretical computer science; Automaton","score_opus":0.009170351526350288,"score_gpt":0.2609547408258283,"score_spread":0.25178438929947805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031426449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98987156,0.0071425103,0.0022271054,0.000053039377,0.00011516162,0.00014538053,0.0000012596898,0.00004965674,0.00039430129],"genre_scores_gemma":[0.9968473,0.000020516016,0.0022544987,0.00009554218,0.0005379139,0.0000017997806,0.00006552638,0.000012048229,0.00016486882],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990717,0.00008891743,0.00015840984,0.000247732,0.0001140606,0.0003191739],"domain_scores_gemma":[0.99958664,0.000037044418,0.0000928295,0.00013757707,0.00007533669,0.00007054477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017848608,0.00014938373,0.00014522321,0.0000330514,0.00014597115,0.00004924463,0.00009549685,0.00012733458,8.4826894e-7],"category_scores_gemma":[0.000094670744,0.00009821532,0.00003118783,0.00012258902,0.00004523396,0.000008728386,0.0001183401,0.00014200987,0.0000011778217],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016875859,0.00006997282,0.026110724,0.00007639475,0.00009218108,0.000008599021,0.00012891628,0.00034224289,0.94252974,0.0007832107,0.0005293397,0.029159937],"study_design_scores_gemma":[0.004113514,0.0017172244,0.60802865,0.00045066315,0.00016868148,0.0008896013,0.0026189692,0.07166837,0.29159248,0.0000955621,0.016272524,0.0023837737],"about_ca_topic_score_codex":0.000017433234,"about_ca_topic_score_gemma":8.824793e-7,"teacher_disagreement_score":0.65093726,"about_ca_system_score_codex":0.000011763785,"about_ca_system_score_gemma":0.000010094378,"threshold_uncertainty_score":0.40051046},"labels":[],"label_agreement":null},{"id":"W2032865003","doi":"10.2298/fuee1103451y","title":"The EXOR gate under uncertainty: A case study","year":2011,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Computer science; Probabilistic CTL; Probabilistic logic network; Theoretical computer science; Probabilistic argumentation; Subjective logic; Notation; Probabilistic analysis of algorithms; Artificial intelligence; Mathematics; Description logic; Arithmetic; Multimodal logic","score_opus":0.017175743630380706,"score_gpt":0.21873105369750367,"score_spread":0.20155531006712296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032865003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99753636,0.0009494605,0.0003481241,0.00010893732,0.00007548718,0.000109531786,0.0000061361184,0.000015064714,0.0008509124],"genre_scores_gemma":[0.9973255,0.0011802496,0.00030990122,0.00008636125,0.00003441745,0.0000022659456,0.000016848748,0.000010813863,0.0010336518],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991386,0.00008312597,0.0001193445,0.0002595895,0.00006680618,0.00033251185],"domain_scores_gemma":[0.9995675,0.000025572324,0.00005636262,0.0002052456,0.00006861269,0.000076696815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012604383,0.00014999491,0.00010515466,0.000018137693,0.00048526042,0.000038396236,0.00016074518,0.00008247214,0.000009433499],"category_scores_gemma":[0.00001902612,0.000105525236,0.00004211669,0.00007764654,0.00013747424,0.0000063830557,0.00019073444,0.00010555284,0.0000010329112],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0071115466,0.0037848945,0.051325437,0.00016685424,0.0069773793,0.009216632,0.031848483,0.007057476,0.35231057,0.27996692,0.014337353,0.23589644],"study_design_scores_gemma":[0.006113979,0.036655437,0.008547787,0.000034233286,0.00078526046,0.004895909,0.24409613,0.003097097,0.03544697,0.016392874,0.6403729,0.003561433],"about_ca_topic_score_codex":0.00014976895,"about_ca_topic_score_gemma":0.0013493721,"teacher_disagreement_score":0.6260356,"about_ca_system_score_codex":0.000018293478,"about_ca_system_score_gemma":0.000053623444,"threshold_uncertainty_score":0.43031943},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017969218265562234,"score_gpt":0.24748096050476134,"score_spread":0.22951174223919912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042079117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33113357,0.000053742584,0.6678456,0.00003646651,0.00012972424,0.00012605246,0.000004784797,0.000012029942,0.00065802207],"genre_scores_gemma":[0.78565776,0.000006708828,0.21371657,0.0004981319,0.00009806598,0.000005252454,0.000010235957,0.0000040294585,0.000003234933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990587,0.00006234784,0.00010847907,0.00040701963,0.000088146706,0.00027530282],"domain_scores_gemma":[0.999593,0.00006425936,0.000028205375,0.00011265588,0.00009342791,0.00010845964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503992,0.00009659639,0.00009330217,0.00002595479,0.00021160586,0.000063955056,0.00013344616,0.00005993181,0.0000052202436],"category_scores_gemma":[0.00012959515,0.00007398391,0.00003773953,0.00011337212,0.0012745238,0.000006002926,0.00009992702,0.00005903668,0.000002550846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004741211,0.00007280635,0.000116601914,0.000008984434,0.000012650494,0.0000027947913,0.000046813086,0.0000036449997,0.06612735,0.19444399,0.00003667156,0.7390803],"study_design_scores_gemma":[0.0012134537,0.002737013,0.0005909078,0.000046639198,0.00002633904,0.00014795564,0.000051077877,0.06253785,0.27475128,0.6549114,0.002340272,0.0006458083],"about_ca_topic_score_codex":4.283908e-7,"about_ca_topic_score_gemma":8.662348e-8,"teacher_disagreement_score":0.7384345,"about_ca_system_score_codex":0.0000063422917,"about_ca_system_score_gemma":0.00003495393,"threshold_uncertainty_score":0.4696036},"labels":[],"label_agreement":null},{"id":"W2042571483","doi":"10.1016/j.jneb.2010.09.003","title":"See the Difference: Nutrient Bar Graph Cards","year":2011,"lang":"en","type":"article","venue":"Journal of Nutrition Education and Behavior","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bar (unit); Graph; Bar chart; Food labeling; Nutrition information; Gerontology; Obesity; Nutrient; Computer science; Environmental health; Psychology; Medicine; Mathematics; Food science; Geography; Internal medicine; Biology; Statistics; Theoretical computer science","score_opus":0.02446660253668186,"score_gpt":0.28264667838137386,"score_spread":0.258180075844692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042571483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977022,0.001066711,0.0002942285,0.00020913698,0.00044277593,0.00009580724,0.000002590399,0.000002073658,0.00018452248],"genre_scores_gemma":[0.99792963,0.00041494696,0.00083711307,0.00020452973,0.00041314485,0.000017504251,0.0000088761335,0.0000029694274,0.00017126603],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99955636,0.00004354965,0.00017630722,0.00007809987,0.000072807554,0.00007290004],"domain_scores_gemma":[0.9995676,0.000005918248,0.00012631918,0.00007365922,0.00016653813,0.000059928996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012976339,0.000060917806,0.00007232878,0.00003370183,0.00007196212,0.00001720313,0.00009230702,0.0000623524,0.000045134107],"category_scores_gemma":[0.000021743925,0.000035875277,0.00007151474,0.00004785119,0.000052722193,0.0000033598283,0.000020315732,0.000084599145,0.0000010610904],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015713004,0.014386549,0.11595014,0.00005222689,0.000057553672,0.000007030216,0.0007103151,1.2733713e-7,0.7232095,0.00056204293,0.01736265,0.12754472],"study_design_scores_gemma":[0.0007053546,0.0011287001,0.88109165,0.000058698704,0.00012784316,0.00035501647,0.0022739202,7.185609e-7,0.087108135,0.0011539585,0.02583803,0.00015796213],"about_ca_topic_score_codex":0.0000050957,"about_ca_topic_score_gemma":0.0000011175455,"teacher_disagreement_score":0.76514155,"about_ca_system_score_codex":0.000005561546,"about_ca_system_score_gemma":0.000047357833,"threshold_uncertainty_score":0.14629513},"labels":[],"label_agreement":null},{"id":"W2042572227","doi":"10.1007/s10878-012-9541-4","title":"A lower bound of the surviving rate of a planar graph with girth at least seven","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Planar graph; Graph; Wheel graph; Mathematics; Upper and lower bounds; Girth (graph theory); Discrete mathematics; Graph power; Line graph","score_opus":0.007577310179705699,"score_gpt":0.21246243814157073,"score_spread":0.20488512796186503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042572227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99135804,0.0001976892,0.007039229,0.00004620946,0.0010638144,0.00006870903,0.0000028137244,0.0000012821275,0.00022224044],"genre_scores_gemma":[0.9979638,0.000031192638,0.0016628356,0.00002439076,0.0002771304,3.3047428e-7,0.0000047163467,0.0000066416014,0.00002895677],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992773,0.0001371958,0.00028192092,0.000060472128,0.00012856163,0.000114560564],"domain_scores_gemma":[0.99902236,0.000027547567,0.00056385534,0.0001027049,0.00024069764,0.000042851403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046625943,0.00007786763,0.0001644772,0.000026736117,0.000051568968,0.0000072364296,0.00014092197,0.00008174641,0.0000073650403],"category_scores_gemma":[0.0001124024,0.000044491695,0.00009534202,0.00012105369,0.000064935106,0.000009501539,0.000053599237,0.00007056873,1.1348669e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004774605,0.0012564661,0.20647475,0.000108700166,0.0005856492,0.000004805952,0.00042470198,0.099334806,0.68254864,0.0027995661,0.001075855,0.0006114683],"study_design_scores_gemma":[0.01766799,0.013872233,0.16543318,0.0009616086,0.00071953685,0.00054813793,0.0005075484,0.0027539562,0.78278315,0.0030271348,0.010344656,0.0013808634],"about_ca_topic_score_codex":0.000003906413,"about_ca_topic_score_gemma":9.929221e-7,"teacher_disagreement_score":0.100234516,"about_ca_system_score_codex":0.00001195155,"about_ca_system_score_gemma":0.00004555853,"threshold_uncertainty_score":0.18143186},"labels":[],"label_agreement":null},{"id":"W2044323336","doi":"10.1006/inco.2001.3035","title":"An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types","year":2001,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Decidability; Channel (broadcasting); Computer science; Syntax; Substitution (logic); Expression (computer science); Class (philosophy); Code (set theory); Bounded function; Type (biology); Error detection and correction; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Programming language; Artificial intelligence","score_opus":0.024715105701297452,"score_gpt":0.27252821719270887,"score_spread":0.24781311149141141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044323336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91805124,0.00005201935,0.081128545,0.00005759553,0.000051119372,0.00008546791,0.0000060189013,0.000008318611,0.0005596722],"genre_scores_gemma":[0.9989186,0.000024583596,0.00060920184,0.00010187532,0.000018318064,0.0000022219983,0.00031769482,0.0000018563514,0.0000056702534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996148,0.000019555951,0.00017984101,0.000058846643,0.00006792807,0.000059069447],"domain_scores_gemma":[0.9996582,0.00000991284,0.00014167128,0.000059566693,0.000105174855,0.000025456036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009941671,0.00005427754,0.00007344374,0.00004318202,0.000039626197,0.000015450898,0.000053387146,0.000054760694,0.0000038510684],"category_scores_gemma":[0.000016772277,0.000044861037,0.000024273017,0.000069612346,0.000042647705,0.000030629297,0.000027130376,0.000024050367,0.0000014091476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055306766,0.0007013708,0.13504775,0.00033863683,0.00019988319,0.0000011531462,0.003460127,0.03258987,0.11630985,0.029412199,0.00054575724,0.6808403],"study_design_scores_gemma":[0.0051057427,0.004155647,0.37555623,0.00014013851,0.00007749389,0.000039101415,0.0024542804,0.46231946,0.121964045,0.019879436,0.0074934466,0.0008149635],"about_ca_topic_score_codex":0.000011140701,"about_ca_topic_score_gemma":0.0000071945606,"teacher_disagreement_score":0.68002534,"about_ca_system_score_codex":0.0000023047473,"about_ca_system_score_gemma":0.000011614344,"threshold_uncertainty_score":0.18293801},"labels":[],"label_agreement":null},{"id":"W2051924156","doi":"10.1016/j.tcs.2006.08.010","title":"Algebraic properties of substitution on trajectories","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Substitution (logic); Concatenation (mathematics); Transitive closure; Generalization; Concurrency; Closure (psychology); Algebraic number; Transitive relation; Morphism; Algebraic theory; Mathematics; Regular language; Coding (social sciences); Quotient; Algebra over a field; Computer science; Set (abstract data type); Discrete mathematics; Theoretical computer science; Pure mathematics; Combinatorics; Automaton; Programming language","score_opus":0.010173418425434982,"score_gpt":0.2178024978931209,"score_spread":0.2076290794676859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051924156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9590014,0.000048022695,0.0381378,0.000055395743,0.00014100912,0.00006203303,8.807579e-7,0.000016391517,0.002537031],"genre_scores_gemma":[0.99801,0.0000016759062,0.0016570931,0.000101246085,0.00020269594,0.000001427231,0.0000037718237,0.0000027914646,0.000019333369],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918437,0.000036220117,0.00013726478,0.0002717803,0.00017281987,0.00019755404],"domain_scores_gemma":[0.9996606,0.000011663138,0.00003378332,0.00017781639,0.00007838329,0.000037714482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030565055,0.000084614534,0.00008917205,0.00003088023,0.00011061433,0.000026696745,0.00029598922,0.000045688674,0.0000069613634],"category_scores_gemma":[0.000049407237,0.000054584132,0.00004111946,0.00016672479,0.002151167,0.0000037660802,0.00013138389,0.00004689713,0.000009276634],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029666344,0.000041024778,0.00021445352,0.000003961446,0.0000012276461,4.6211738e-7,0.0000042917145,0.00012143538,0.52045697,0.47808444,0.000019752862,0.0010222954],"study_design_scores_gemma":[0.00011789691,0.0005740204,0.0031654674,0.000021610653,0.000002542014,0.000005517965,0.0000016276371,0.0021280712,0.9856628,0.007845297,0.000362146,0.00011297489],"about_ca_topic_score_codex":0.0000016260267,"about_ca_topic_score_gemma":4.0931178e-7,"teacher_disagreement_score":0.47023913,"about_ca_system_score_codex":0.0000066944317,"about_ca_system_score_gemma":0.000032950673,"threshold_uncertainty_score":0.7926064},"labels":[],"label_agreement":null},{"id":"W2053896820","doi":"10.3389/fgene.2013.00072","title":"Death of the genome paper","year":2013,"lang":"en","type":"article","venue":"Frontiers in Genetics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Genome; Computational biology; Evolutionary biology; Biology; Computer science; Genetics; Gene","score_opus":0.007218041612033406,"score_gpt":0.20002591435963074,"score_spread":0.19280787274759734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053896820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933728,0.0016146224,0.0022297783,0.000091316986,0.00029756973,0.00015383944,0.0000026832336,0.0000027478136,0.002234628],"genre_scores_gemma":[0.990204,0.00016960733,0.008844464,0.0003342026,0.00008333131,0.0000060865555,0.000006548945,0.000006414784,0.00034535493],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994497,0.000041337164,0.00014657842,0.00014704603,0.000060447157,0.00015490154],"domain_scores_gemma":[0.9996573,0.0000031281252,0.00004560001,0.00023557174,0.0000325569,0.000025872823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006360233,0.00007382798,0.000088198634,0.000013719365,0.000024761028,0.0000068034815,0.000256421,0.00009739373,0.000017426095],"category_scores_gemma":[0.000027716555,0.00004714787,0.000056651115,0.00005984543,0.000064418535,9.1471446e-7,0.00015754766,0.00005701217,0.0000028045608],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066234857,0.000034356963,0.5231644,0.00000774438,0.000018196013,2.8810064e-7,0.000021114964,0.00031027416,0.46825278,0.00004119009,0.0024866194,0.005656417],"study_design_scores_gemma":[0.00029620115,0.00016009195,0.8705532,0.0000088136385,0.000008334885,0.000002328999,0.00007308635,0.0003765068,0.079336315,0.001847047,0.047162436,0.00017564092],"about_ca_topic_score_codex":0.000009303603,"about_ca_topic_score_gemma":0.0000016733572,"teacher_disagreement_score":0.38891646,"about_ca_system_score_codex":0.0000061095525,"about_ca_system_score_gemma":0.000016770731,"threshold_uncertainty_score":0.19226344},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017188576571058888,"score_gpt":0.32330077500854654,"score_spread":0.30611219843748766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057447340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6174587,0.0000369743,0.38107523,0.00016150446,0.0008007608,0.00001688892,0.0000011442244,0.0000016400577,0.00044714147],"genre_scores_gemma":[0.95262426,0.000017138687,0.0467266,0.00014412796,0.0004656954,1.5523847e-7,0.0000028232994,0.000001917656,0.000017306504],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990557,0.000014445584,0.00033809486,0.00011287756,0.00036410827,0.00011481368],"domain_scores_gemma":[0.9983782,0.000035148736,0.0002851007,0.00008899085,0.0011553376,0.000057193225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452687,0.000054288776,0.00007618862,0.00018117347,0.0000569677,0.00004536053,0.0007801834,0.000025572419,0.0000071714912],"category_scores_gemma":[0.00018537368,0.000043574517,0.000069978116,0.0001983094,0.00029135827,0.00002685621,0.00018588833,0.00006027134,0.0000014630351],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001725704,0.00025521565,0.01740126,0.0000032139033,0.00010869701,0.000014777271,0.00016653854,0.0010777602,0.676206,0.0051226444,0.00041026282,0.29906103],"study_design_scores_gemma":[0.0017976612,0.002173893,0.49708223,0.00013828627,0.000022210188,0.00052423344,0.00014845355,0.0037239087,0.4346405,0.003958044,0.05535631,0.0004342543],"about_ca_topic_score_codex":0.0000038388976,"about_ca_topic_score_gemma":0.000004013386,"teacher_disagreement_score":0.479681,"about_ca_system_score_codex":0.000024487457,"about_ca_system_score_gemma":0.00018072488,"threshold_uncertainty_score":0.17769171},"labels":[],"label_agreement":null},{"id":"W2060572307","doi":"10.1109/cjece.2006.259174","title":"An efficient graph-based steiner tree heuristic for the global routing of macro cells","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Macro; Heuristic; Computer science; Tree (set theory); Graph; Routing (electronic design automation); Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence; Computer network","score_opus":0.003440906801038219,"score_gpt":0.1780704800521457,"score_spread":0.17462957325110748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060572307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5803035,0.00077341567,0.4187346,0.000029728199,0.000100563695,0.000043557277,0.0000052324194,0.0000019140157,0.000007510194],"genre_scores_gemma":[0.9964545,0.0000020972877,0.0030921937,0.00006448914,0.00037548968,6.6829904e-7,0.000003614854,0.0000048900665,0.0000020836935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942005,0.0000148445415,0.00020192591,0.000099239034,0.000048930102,0.000214984],"domain_scores_gemma":[0.9995985,0.00005504876,0.000068443966,0.00006559083,0.00007525191,0.00013715727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012999057,0.000087054934,0.0001206802,0.000037652353,0.000056268524,0.000027210399,0.00014536375,0.0000529591,5.667986e-7],"category_scores_gemma":[0.000021459231,0.00005782321,0.000085471635,0.000108327775,0.000026187074,0.0000014346098,0.000008246433,0.00006749638,3.903012e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005708044,0.00005480119,0.005795104,0.000029324592,0.00006370789,0.00002308428,0.000009487556,0.9138175,0.057921667,0.0014721823,0.0003206068,0.020435443],"study_design_scores_gemma":[0.00058156956,0.0011932191,0.017705685,0.000027435168,0.00003614741,0.00005264826,0.0000028612515,0.9617284,0.016674167,0.00007788302,0.0017476677,0.00017231925],"about_ca_topic_score_codex":0.00012863365,"about_ca_topic_score_gemma":0.00010975685,"teacher_disagreement_score":0.416151,"about_ca_system_score_codex":0.000015629843,"about_ca_system_score_gemma":0.00008170851,"threshold_uncertainty_score":0.23579621},"labels":[],"label_agreement":null},{"id":"W206369421","doi":"","title":"A Syndrome-Distribution Decoding of Mols Lp Codes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Distribution (mathematics); Algorithm; Mathematical analysis","score_opus":0.00919060259359472,"score_gpt":0.2369193175644431,"score_spread":0.22772871497084837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206369421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972172,0.00024407043,0.000054554333,0.000030185442,0.00017643881,0.00008658516,0.000018087057,0.000016868224,0.0021560069],"genre_scores_gemma":[0.99935323,0.00005926975,0.00012041533,0.000054398683,0.000009464992,0.000004206417,0.00017421378,0.0000066975467,0.00021810152],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927896,0.000045646048,0.00018907172,0.00021492822,0.00008176189,0.0001896494],"domain_scores_gemma":[0.9996385,0.000016707598,0.00005616849,0.00018775734,0.00004824743,0.000052643496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001626441,0.00010429553,0.00014932851,0.000010452694,0.00005963262,0.0000106112275,0.00016075505,0.0001273112,0.0000900406],"category_scores_gemma":[0.00005546282,0.000088985755,0.00008065066,0.0000966134,0.000055033095,0.000002279635,0.00005699864,0.00006275925,0.000019791887],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003419191,0.0007467853,0.041267365,0.000090394184,0.000243961,0.000060544047,0.00006024775,0.0001897976,0.82539725,0.055177543,0.0076987785,0.06872538],"study_design_scores_gemma":[0.004158837,0.0036724221,0.07558393,0.00018112923,0.00009499972,0.0002696726,0.000080017344,0.0010411006,0.7771577,0.06972762,0.06672753,0.0013050284],"about_ca_topic_score_codex":0.000010829059,"about_ca_topic_score_gemma":8.333259e-7,"teacher_disagreement_score":0.067420356,"about_ca_system_score_codex":0.000011050842,"about_ca_system_score_gemma":0.000020203686,"threshold_uncertainty_score":0.36287338},"labels":[],"label_agreement":null},{"id":"W2066031880","doi":"10.1097/00007890-201007272-01984","title":"AN ISLET SPARING TRANSPLANT TECHNIQUE UTILIZING A SUBCUTANEOUS CELL POUCHTM AS AN ALTERNATIVE TO THE INTRAPORTAL ROUTE OF ADMINISTRATION","year":2010,"lang":"en","type":"article","venue":"Transplantation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; London Health Sciences Centre; Middlesex London Health Unit","funders":"","keywords":"Islet; Medicine; Administration (probate law); Route of administration; Surgery; Pharmacology; Internal medicine; Insulin","score_opus":0.010671733047196512,"score_gpt":0.272783380655458,"score_spread":0.2621116476082615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066031880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97344726,0.0000073330034,0.025149148,0.00005093362,0.00010044082,0.00032302973,0.00007031586,0.000021261569,0.00083027984],"genre_scores_gemma":[0.99667454,0.000033982808,0.0023747676,0.00011096193,0.00016692655,0.000020314183,0.0005969267,0.000010826617,0.0000107613705],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991631,0.00006789818,0.00022052703,0.00027930192,0.000109983615,0.00015921381],"domain_scores_gemma":[0.999591,0.000015632093,0.00008022673,0.0001904117,0.00004945568,0.000073298535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022149297,0.0001267836,0.00009923101,0.000030280062,0.00008320516,0.000024894534,0.00021993059,0.00012924998,0.000011637844],"category_scores_gemma":[0.0000060570624,0.000094092604,0.00004624746,0.0000633761,0.000039229784,0.00001061153,0.000006127121,0.0001438026,0.0000023068383],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045763783,0.000078078294,0.0011750195,0.00002149456,0.0000088950155,0.000026490401,0.0005301847,0.00013876878,0.9954447,0.0003030696,0.0000014322144,0.0018142115],"study_design_scores_gemma":[0.00020410874,0.0015918405,0.0026949067,0.000015679805,0.00002997541,0.00023938424,0.000108483306,0.00038323048,0.9943466,0.000098662116,0.00014319758,0.00014390772],"about_ca_topic_score_codex":0.00011625446,"about_ca_topic_score_gemma":0.0006426012,"teacher_disagreement_score":0.023227274,"about_ca_system_score_codex":0.000003276956,"about_ca_system_score_gemma":0.000038433296,"threshold_uncertainty_score":0.3836985},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0044566048872302704,"score_gpt":0.23193710195550443,"score_spread":0.22748049706827417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068176031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96694726,0.00030207922,0.012062597,0.0006115169,0.000142078,0.00007760221,0.0000017841662,0.000016932776,0.019838152],"genre_scores_gemma":[0.9833394,0.000011206119,0.01600959,0.00032659425,0.00019156474,0.0000013423003,0.0000051356083,0.00000358703,0.00011152491],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990814,0.000017234996,0.00016347661,0.00031157763,0.00016609082,0.0002602745],"domain_scores_gemma":[0.9995883,0.00001569608,0.000048807633,0.00020903327,0.00006875992,0.00006939965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025832863,0.00009162371,0.00009298079,0.00007550287,0.00009841871,0.000024504754,0.00036889946,0.0000722745,0.000112686124],"category_scores_gemma":[0.00007521792,0.00007149283,0.00010579362,0.00038010805,0.0002691368,0.0000014812919,0.00013449948,0.00005136606,0.00000989577],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017709986,0.000027394648,0.010124128,0.0000032606697,0.0000029301978,6.963581e-7,0.000003185142,0.0000106487605,0.9675636,0.0023011402,0.012920999,0.0070242626],"study_design_scores_gemma":[0.00015167859,0.00040169145,0.017257432,0.000010564517,0.0000040281757,0.0000032862517,0.00001831018,0.000004953013,0.8478165,0.00182599,0.13235314,0.00015239713],"about_ca_topic_score_codex":0.000108876695,"about_ca_topic_score_gemma":0.000005734992,"teacher_disagreement_score":0.119747125,"about_ca_system_score_codex":0.0000020880323,"about_ca_system_score_gemma":0.000050568717,"threshold_uncertainty_score":0.29153928},"labels":[],"label_agreement":null},{"id":"W2068856084","doi":"10.1186/1471-2105-11-s1-s40","title":"New decoding algorithms for Hidden Markov Models using distance measures on labellings","year":2010,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decoding methods; Markov chain; Markov model; Hidden Markov model; Algorithm; Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.060008494598102875,"score_gpt":0.29085506612591827,"score_spread":0.2308465715278154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068856084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099288665,0.00007498852,0.8988376,0.00002975831,0.0003223301,0.00023856052,0.00002402794,0.000028249096,0.0011557875],"genre_scores_gemma":[0.16230279,0.00002485315,0.83658016,0.0002870962,0.00045874063,0.000005003578,0.00006581133,0.000016555437,0.00025901035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905163,0.000011583108,0.0003091897,0.00018772998,0.00013048941,0.00030936915],"domain_scores_gemma":[0.9993609,0.000044815322,0.00014090333,0.00025447714,0.000083564286,0.00011534619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775153,0.00017740575,0.00015378998,0.000031195526,0.00015490338,0.000069574315,0.00025090654,0.0002128983,0.0000048477996],"category_scores_gemma":[0.00012588043,0.00013904316,0.00011427271,0.00006576696,0.00003904657,0.000011241611,0.0000863051,0.00013319527,0.000004005883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065052474,0.00016847905,0.0031581589,0.00042038338,0.00015361191,0.0000019162037,0.00044437833,0.008976023,0.27510324,0.007735134,0.008275,0.69491315],"study_design_scores_gemma":[0.0006627914,0.00024678904,0.000040636656,0.00003882055,0.000022343072,0.000010478552,0.00007599011,0.9430539,0.03848505,0.0014884458,0.015497353,0.00037743014],"about_ca_topic_score_codex":0.0000066974826,"about_ca_topic_score_gemma":0.00002360374,"teacher_disagreement_score":0.93407786,"about_ca_system_score_codex":0.000010526626,"about_ca_system_score_gemma":0.00008202744,"threshold_uncertainty_score":0.5670015},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Implementation; Computer science; Computational biology; Theoretical computer science; Computer architecture; Programming language; Biology","score_opus":0.03897692259768443,"score_gpt":0.30858824063058937,"score_spread":0.26961131803290495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071364560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96912485,0.00031867795,0.009906415,0.0027703769,0.0001512803,0.00020298114,0.00002823473,0.000037404458,0.017459756],"genre_scores_gemma":[0.9939153,0.0001068948,0.00056911976,0.0051005264,0.00013307283,0.0000059128556,0.000107293985,0.000009849731,0.00005200631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988611,0.0001757984,0.00021211928,0.00037986098,0.000047342062,0.00032382188],"domain_scores_gemma":[0.99948764,0.0001072496,0.00004736353,0.00021804286,0.000029160192,0.00011052823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017843842,0.00015951437,0.00015763374,0.000029274699,0.00015157337,0.000019741934,0.00018582497,0.00015538523,0.00024328275],"category_scores_gemma":[0.00008095583,0.00011946942,0.000058589863,0.00005157965,0.00048332458,0.0000017168652,0.00027150728,0.00011289821,0.000028659675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004951328,0.00017994354,0.0019347728,0.0000044405006,0.00004977519,0.0000018091517,0.000038607595,0.000013163333,0.044507924,0.927671,0.0025914276,0.022957595],"study_design_scores_gemma":[0.006696594,0.012307773,0.0030029144,0.00006734002,0.00011903558,0.000116654424,0.0004089224,0.036538307,0.10193467,0.7008686,0.13577928,0.002159889],"about_ca_topic_score_codex":0.0000012093044,"about_ca_topic_score_gemma":4.2329344e-7,"teacher_disagreement_score":0.22680241,"about_ca_system_score_codex":0.000007407481,"about_ca_system_score_gemma":0.0000031045256,"threshold_uncertainty_score":0.48718217},"labels":[],"label_agreement":null},{"id":"W2071889691","doi":"10.1142/s012962640700296x","title":"ASPECTS OF BIOMOLECULAR COMPUTING","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Membrane computing; DNA computing; Natural computing; Computer science; Unconventional computing; Field (mathematics); Computation; Process (computing); Theoretical computer science; Supercomputer; Distributed computing; Computational science; Parallel computing; Algorithm; Mathematics","score_opus":0.013027655964919744,"score_gpt":0.26577668498190216,"score_spread":0.25274902901698243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071889691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7244086,0.0004501948,0.2723488,0.00017398658,0.00005242695,0.000054137,4.3718325e-7,0.000019234196,0.002492166],"genre_scores_gemma":[0.9869743,0.0000033845895,0.011344831,0.0014372008,0.00019494664,4.990871e-7,0.000018445384,0.000012175915,0.000014238553],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999029,0.000025820505,0.00024715415,0.0002767265,0.000117183365,0.00030413954],"domain_scores_gemma":[0.999603,0.000014056819,0.00013856914,0.00013833451,0.00004939968,0.000056639255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036643897,0.00012654526,0.00013449098,0.000042735177,0.00008340137,0.000018226698,0.00018764698,0.000083243285,0.0000027836747],"category_scores_gemma":[0.000055668155,0.000107881686,0.00007556728,0.00013186625,0.00011328298,0.0000024217043,0.000096052485,0.000075565295,0.000003494237],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036454137,0.000030542982,0.002159542,0.000034915996,0.000015144549,0.000016452228,0.000031824016,0.00018344884,0.9793603,0.00007068748,0.00011715228,0.017943544],"study_design_scores_gemma":[0.0008946601,0.000313392,0.015444967,0.00010617608,0.000024601231,0.00007229962,0.00009860847,0.0010849942,0.973166,0.00020978299,0.0080329105,0.0005516488],"about_ca_topic_score_codex":0.00000520478,"about_ca_topic_score_gemma":0.0000014948652,"teacher_disagreement_score":0.26256564,"about_ca_system_score_codex":0.0000069819366,"about_ca_system_score_gemma":0.000020484258,"threshold_uncertainty_score":0.43992877},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012901731476995451,"score_gpt":0.2245494277444444,"score_spread":0.21164769626744895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074437394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5904682,0.000023386126,0.40870157,0.0000475988,0.00022325838,0.000111882655,0.000033393815,0.000010719901,0.0003799371],"genre_scores_gemma":[0.9994561,0.000032219446,0.00003622028,0.00031444585,0.000035099154,0.000013665736,0.00005953432,0.0000037112848,0.000048990918],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942017,0.00010210631,0.00018535879,0.00007030951,0.00009210422,0.00012992768],"domain_scores_gemma":[0.99962723,0.000046744728,0.0001044381,0.00012804095,0.00005235983,0.00004116581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038700848,0.000095878284,0.0000738812,0.00003730792,0.00019881733,0.000019581888,0.00007170711,0.000102701895,0.000025165535],"category_scores_gemma":[0.000025137282,0.00006380968,0.000041954692,0.000082491126,0.00014503834,0.000035396417,0.0000020439106,0.00009166116,0.000009164662],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027074195,0.0010863004,0.0009570242,0.0003690364,0.0005810925,2.706725e-7,0.0073865084,0.041313805,0.7147144,0.079635836,0.0020047214,0.14924356],"study_design_scores_gemma":[0.0005392483,0.00049113046,0.0005614194,0.000043648735,0.000042019907,0.000009302616,0.00071768404,0.0031790743,0.9902281,0.00042672898,0.0034946539,0.00026699787],"about_ca_topic_score_codex":0.0000044936423,"about_ca_topic_score_gemma":8.937137e-7,"teacher_disagreement_score":0.40898785,"about_ca_system_score_codex":0.000014662884,"about_ca_system_score_gemma":0.0000101052465,"threshold_uncertainty_score":0.26020834},"labels":[],"label_agreement":null},{"id":"W2075397399","doi":"10.1109/tcomm.2012.100812.110547","title":"Reliable Communication over Non-Binary Insertion/Deletion Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decodes; Algorithm; Binary number; Additive white Gaussian noise; Sequence (biology); Redundancy (engineering); Computer science; Decoding methods; Binary code; Set (abstract data type); Theoretical computer science; Mathematics; White noise; Arithmetic; Telecommunications","score_opus":0.02976522417575794,"score_gpt":0.2859943577366687,"score_spread":0.25622913356091076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075397399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8219754,0.0016043208,0.16508888,0.0018496579,0.0006953006,0.0005659152,0.00003741237,0.00014129277,0.008041781],"genre_scores_gemma":[0.99346447,0.0012710559,0.0033380925,0.00052039145,0.00009558177,0.000115406016,0.00017725505,0.00002134704,0.0009964239],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989888,0.00016855904,0.00026339103,0.00019078782,0.00010779649,0.00028068112],"domain_scores_gemma":[0.9980189,0.000062350184,0.00009325625,0.001624091,0.00009407424,0.000107308224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000328396,0.00015862031,0.00012233447,0.0000725372,0.00067236996,0.000031957738,0.0006303025,0.00019135553,0.000059997106],"category_scores_gemma":[0.000011522127,0.00015104449,0.00012316306,0.00021338867,0.00014214839,0.00002391987,0.000026336786,0.00029253395,0.000096397394],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029934483,0.0046813455,0.0026979316,0.00004458148,0.00029690284,5.572369e-7,0.00072278944,0.011823769,0.93640244,0.0013068542,0.012372699,0.02935077],"study_design_scores_gemma":[0.0032818145,0.0019005428,0.028353775,0.00031254307,0.00028879542,0.0000783904,0.0008304114,0.03115089,0.45178398,0.0008623432,0.4788736,0.0022828786],"about_ca_topic_score_codex":0.000054592696,"about_ca_topic_score_gemma":0.000022434071,"teacher_disagreement_score":0.48461846,"about_ca_system_score_codex":0.000038101145,"about_ca_system_score_gemma":0.000028176868,"threshold_uncertainty_score":0.6159415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013384440443422596,"score_gpt":0.2452220632468246,"score_spread":0.231837622803402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076127862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9452799,0.00011434297,0.048748065,0.000035242236,0.000087002794,0.000051615705,4.9815304e-7,0.000011989583,0.005671376],"genre_scores_gemma":[0.99378204,0.000004870116,0.0059824,0.00015274424,0.00006037988,9.234904e-7,6.131764e-7,0.0000030785045,0.0000129387445],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922526,0.00006165299,0.00011920299,0.00024727714,0.00013335038,0.00021327089],"domain_scores_gemma":[0.99963266,0.000013156157,0.00003065576,0.00018866282,0.000072940195,0.00006190827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005480988,0.00007388245,0.00009067196,0.000024014087,0.0000949007,0.000024972242,0.00030754402,0.000038775186,0.000014123386],"category_scores_gemma":[0.00018898313,0.000048107144,0.000036930833,0.00014483488,0.001450232,0.0000030863562,0.00018128131,0.00004403791,0.000004102043],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067318088,0.000019015844,0.00022337309,0.000005389246,0.0000020895982,6.6888134e-7,0.000021889116,0.000010544195,0.72093564,0.2767903,0.0000071417767,0.00197718],"study_design_scores_gemma":[0.000089633024,0.0002246479,0.00031292852,0.000017644394,0.0000021972662,0.0000118618,0.000020383302,0.0009231956,0.9962854,0.0017812526,0.00023762704,0.00009327085],"about_ca_topic_score_codex":5.184957e-7,"about_ca_topic_score_gemma":1.12983294e-7,"teacher_disagreement_score":0.27534968,"about_ca_system_score_codex":0.0000038258895,"about_ca_system_score_gemma":0.000034248995,"threshold_uncertainty_score":0.534344},"labels":[],"label_agreement":null},{"id":"W2076263584","doi":"10.1016/j.tcs.2005.07.013","title":"Decidability of trajectory-based equations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Catenation; Decidability; Constructive; Mathematics; Quotient; Trajectory; Regular language; Integer (computer science); Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Theoretical computer science; Programming language; Automaton","score_opus":0.012589549041056431,"score_gpt":0.2672837213251435,"score_spread":0.2546941722840871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076263584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5451551,0.000012882836,0.45353815,0.00012449829,0.000043382293,0.000050234165,0.0000014836007,0.000009770731,0.0010644854],"genre_scores_gemma":[0.9390111,4.6284057e-7,0.060471587,0.000361589,0.00014538076,0.0000017708413,0.0000031915658,0.000002565679,0.0000023777347],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990736,0.000058452897,0.00017144874,0.00030745534,0.00017455795,0.00021444797],"domain_scores_gemma":[0.9993836,0.00008334408,0.000038526006,0.00028441567,0.0001190998,0.000091000125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007036386,0.00007715099,0.00009307123,0.00003108037,0.00010614645,0.000019763813,0.00042809648,0.00004959697,0.000040269177],"category_scores_gemma":[0.00021966347,0.00005657563,0.000060873655,0.00020884354,0.0018105455,0.0000035359517,0.00016737389,0.000053748867,0.0000072982634],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005996353,0.0002701402,0.0019663824,0.000009309334,0.000005652734,5.1785753e-7,0.000033805558,0.004764858,0.5861594,0.34901014,0.00002691739,0.05769291],"study_design_scores_gemma":[0.0003534791,0.0008049652,0.007065326,0.000012355864,0.0000067454894,0.0000026772059,0.0000039145507,0.2861361,0.69853914,0.006326243,0.0005311303,0.0002179535],"about_ca_topic_score_codex":6.279088e-7,"about_ca_topic_score_gemma":7.9406186e-7,"teacher_disagreement_score":0.39385596,"about_ca_system_score_codex":0.00001066357,"about_ca_system_score_gemma":0.00008238758,"threshold_uncertainty_score":0.667103},"labels":[],"label_agreement":null},{"id":"W2077823020","doi":"10.1007/s11047-013-9364-y","title":"Computing maximal Kleene closures that are embeddable in a given subword-closed language","year":2013,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Closure (psychology); Regular language; Computer science; Set (abstract data type); Property (philosophy); Characterization (materials science); Discrete mathematics; Coding (social sciences); DNA computing; Mathematics; Algorithm; Theoretical computer science; Automaton; Programming language","score_opus":0.011136271938677993,"score_gpt":0.2531903348998224,"score_spread":0.2420540629611444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077823020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954968,0.0019977388,0.00048859353,0.0003122522,0.00033247808,0.00031100135,0.0000030395397,0.00008252472,0.00097553874],"genre_scores_gemma":[0.9944284,0.000007699237,0.004048761,0.0006398392,0.00058083737,0.000002735056,0.00008355664,0.000026093448,0.00018207979],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99796873,0.00017430684,0.00036049777,0.0006051566,0.00020035838,0.0006909554],"domain_scores_gemma":[0.99922925,0.00009167317,0.00021635988,0.00026841345,0.000095712305,0.00009859849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003745962,0.0002991724,0.00033646153,0.00008162487,0.00018354703,0.000116763746,0.00041542097,0.00024788635,0.000028579889],"category_scores_gemma":[0.00018230172,0.00024378896,0.00015032271,0.00023326265,0.000071249255,0.000011536405,0.0005411,0.00046634075,0.000035374964],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107621534,0.00017512335,0.30542892,0.00010356674,0.000088069,0.0000962305,0.00045012662,0.0014854019,0.593735,0.000087027416,0.0022144094,0.09602851],"study_design_scores_gemma":[0.0025263396,0.00046247125,0.8155857,0.00037559503,0.00002235866,0.000111609246,0.0019713382,0.065341264,0.10972911,0.00029596823,0.002126277,0.0014520055],"about_ca_topic_score_codex":0.0002482296,"about_ca_topic_score_gemma":0.0000745109,"teacher_disagreement_score":0.51015675,"about_ca_system_score_codex":0.000035673223,"about_ca_system_score_gemma":0.000033060634,"threshold_uncertainty_score":0.9941426},"labels":[],"label_agreement":null},{"id":"W2079434710","doi":"10.1109/ispdc.2013.30","title":"Not Seeing the Parse Trees from the Parse Forest of a Context-Free Parallel Communicating Grammar System","year":2013,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parsing; Computer science; Parse tree; Context (archaeology); Programming language; Grammar; Tree (set theory); Artificial intelligence; Natural language processing; Theoretical computer science; Linguistics; Mathematics","score_opus":0.02418025774135813,"score_gpt":0.2274830923306096,"score_spread":0.20330283458925147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079434710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929125,0.001224946,0.0013966985,0.0013302157,0.000052783726,0.00036967304,0.000015745578,0.000028225484,0.0026692469],"genre_scores_gemma":[0.9969479,0.000049361788,0.0017064813,0.00090174493,0.00013758618,0.000041230283,0.00005075518,0.000010918162,0.00015401811],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9987922,0.0002675549,0.00034967394,0.0002309612,0.00011109767,0.00024855582],"domain_scores_gemma":[0.9982073,0.00034067308,0.00018813959,0.0011312763,0.00008646154,0.00004615751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036802082,0.00016029566,0.00019846178,0.000006294346,0.0002342918,0.000053132328,0.0012212857,0.00012352668,0.000017651037],"category_scores_gemma":[0.00020596564,0.00007232761,0.00014646917,0.000054975473,0.00021466106,0.0000035142546,0.00082026166,0.00014481528,0.000014263649],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024708826,0.00026863985,0.21378478,0.000066455905,0.00063633354,0.000005468435,0.0007691499,0.0007750603,0.6667366,0.014426493,0.015533443,0.08675046],"study_design_scores_gemma":[0.007882396,0.002331403,0.6046747,0.00081298,0.00041503238,0.00008161706,0.04876916,0.0960043,0.13430251,0.0041979975,0.09799299,0.002534933],"about_ca_topic_score_codex":0.0025002402,"about_ca_topic_score_gemma":0.0012103448,"teacher_disagreement_score":0.5324341,"about_ca_system_score_codex":0.000006523272,"about_ca_system_score_gemma":0.000016961305,"threshold_uncertainty_score":0.37796322},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030091879344747684,"score_gpt":0.2660095653318389,"score_spread":0.2359176859870912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079582928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8958036,0.000013749835,0.097468264,0.0017372343,0.00011647553,0.0000863324,0.0000031407685,0.000019461819,0.004751779],"genre_scores_gemma":[0.9909761,0.0000019549482,0.0070345416,0.0018616691,0.000113027025,7.154006e-7,0.0000040763193,0.0000020528955,0.000005868783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998951,0.00007920287,0.00015139625,0.00030815328,0.00026105501,0.000249196],"domain_scores_gemma":[0.99939144,0.000062280924,0.00004247142,0.0003403412,0.0000904629,0.00007303054],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007242225,0.00009789112,0.00009975793,0.000023435623,0.00020314207,0.000038571052,0.00074425543,0.000043914053,0.000038715945],"category_scores_gemma":[0.00014622479,0.000053398504,0.000060712588,0.00019422181,0.0029163563,0.0000033443994,0.00024711253,0.00008961764,0.0000115267385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037703314,0.00007257115,0.000030640458,9.880837e-7,0.0000020816103,6.3012476e-7,0.000011068235,0.00004136519,0.07557944,0.9179843,0.00017922174,0.0060599633],"study_design_scores_gemma":[0.000370516,0.003986237,0.02937521,0.000035908583,0.000007289793,0.000030751147,0.000010068553,0.06441842,0.16796449,0.73301095,0.00047598075,0.0003141979],"about_ca_topic_score_codex":5.714228e-7,"about_ca_topic_score_gemma":9.66438e-8,"teacher_disagreement_score":0.18497339,"about_ca_system_score_codex":0.000007578642,"about_ca_system_score_gemma":0.000032109685,"threshold_uncertainty_score":0.9997971},"labels":[],"label_agreement":null},{"id":"W2082796216","doi":"10.1142/s0129054108006169","title":"STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING","year":2008,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Prince Edward Island","funders":"","keywords":"Closure (psychology); Constraint (computer-aided design); Upper and lower bounds; State (computer science); Coding (social sciences); Regular language; Computer science; Set (abstract data type); Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; Automaton; Programming language","score_opus":0.03906646804155322,"score_gpt":0.3068749110862771,"score_spread":0.2678084430447239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082796216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63303643,0.0000069700177,0.36618555,0.00047988177,0.00014676955,0.00006280395,0.0000040766113,0.0000011493204,0.000076388365],"genre_scores_gemma":[0.9646301,0.000009311423,0.035074003,0.00013248446,0.00013530506,0.0000013250097,0.0000035557837,0.0000019641607,0.000011893408],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912596,0.000027091439,0.00029330852,0.00011294074,0.0003659438,0.00007475135],"domain_scores_gemma":[0.99832875,0.000019812564,0.00029417695,0.0001393926,0.0011773551,0.00004053323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028727058,0.000053990545,0.00008502962,0.00008272071,0.00013726918,0.000034468547,0.00079724647,0.000015573969,0.000003449634],"category_scores_gemma":[0.000044497614,0.000034065106,0.000054119195,0.00022992367,0.00052531064,0.000027427075,0.00018016876,0.000052804124,7.0247074e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001648294,0.0003063009,0.046216458,0.000008639641,0.00011657077,0.0000027927824,0.00038982707,0.029197255,0.8942733,0.0093139075,0.00024281973,0.01976731],"study_design_scores_gemma":[0.0009531896,0.0012170157,0.4022348,0.00012431474,0.000017941737,0.0004611239,0.00004750199,0.0044894014,0.58242244,0.0014796811,0.0063151973,0.00023742956],"about_ca_topic_score_codex":0.0000059172335,"about_ca_topic_score_gemma":0.00000934287,"teacher_disagreement_score":0.35601833,"about_ca_system_score_codex":0.000019478526,"about_ca_system_score_gemma":0.0002517972,"threshold_uncertainty_score":0.1935529},"labels":[],"label_agreement":null},{"id":"W2082853563","doi":"10.1016/j.tcs.2008.01.037","title":"On the weight of universal insertion grammars","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Recursively enumerable language; Rule-based machine translation; Morphism; Mathematics; Regular language; Indexed grammar; Discrete mathematics; Computer science; Context-sensitive grammar; Programming language; Context-free grammar; Theoretical computer science; Natural language processing; Automaton","score_opus":0.010292168348289705,"score_gpt":0.21424115294548252,"score_spread":0.20394898459719282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082853563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9355669,0.000010191924,0.061847296,0.0002769226,0.000116256684,0.00005391134,7.1917503e-7,0.00000904792,0.002118755],"genre_scores_gemma":[0.9975253,0.000008369851,0.0019114236,0.0004508241,0.00008850219,5.9109516e-7,0.0000016390329,0.0000023992313,0.000011000688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925643,0.00006501713,0.000098833305,0.00022915057,0.00017377654,0.00017680954],"domain_scores_gemma":[0.9995486,0.00006516392,0.000033302324,0.00023129335,0.000068479385,0.00005313943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035940434,0.00007044114,0.00006795552,0.000023144117,0.00020753466,0.000009387721,0.00046485604,0.000040483315,0.000019454394],"category_scores_gemma":[0.000089264184,0.000038590788,0.000045194316,0.00019311071,0.0025391087,0.0000025968716,0.00024104316,0.000068421046,0.000007822094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047707596,0.00004341395,0.00031456284,0.0000011344792,0.0000033025126,0.0000027382807,0.000025266807,0.00005900309,0.12658577,0.87033546,0.00012988319,0.0024517842],"study_design_scores_gemma":[0.00066680997,0.0038300587,0.017394971,0.000041938813,0.00001092948,0.00009347825,0.000022941551,0.03404949,0.8306467,0.11103429,0.0017302756,0.00047812916],"about_ca_topic_score_codex":0.0000011310478,"about_ca_topic_score_gemma":1.17731396e-7,"teacher_disagreement_score":0.7593011,"about_ca_system_score_codex":0.000006309453,"about_ca_system_score_gemma":0.000035619072,"threshold_uncertainty_score":0.9355452},"labels":[],"label_agreement":null},{"id":"W2083142817","doi":"10.1007/s10623-010-9376-x","title":"Existence of directed BIBDs with block size 7 and related perfect 5-deletion-correcting codes of length 7","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders; Mount Saint Vincent University","keywords":"Alphabet; Mathematics; Combinatorics; Block size; Code (set theory); Block (permutation group theory); Arithmetic; Discrete mathematics; Algorithm; Computer science; Philosophy; Linguistics; Programming language","score_opus":0.008440811014382437,"score_gpt":0.22151810603271468,"score_spread":0.21307729501833225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083142817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99776757,0.00058830966,0.00055049435,0.000013689415,0.000044938046,0.000117832875,0.000009879408,0.000022795357,0.00088447414],"genre_scores_gemma":[0.9916327,0.00023027448,0.008054168,0.000020051142,0.00002535817,0.000004479889,0.000011613154,0.000009626669,0.000011711669],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917626,0.000068754474,0.00021604668,0.0002903902,0.0000819174,0.00016660317],"domain_scores_gemma":[0.9993858,0.00013128658,0.00014721924,0.000151044,0.00012278414,0.00006187669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024476642,0.00014873038,0.0002285907,0.000060019698,0.00009546873,0.000015944997,0.00008728407,0.00015423543,0.0000063063444],"category_scores_gemma":[0.000113014416,0.000105272724,0.0000699047,0.0002573253,0.00035084673,0.000003689981,0.000053190484,0.00013491983,8.399774e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011614738,0.000050685627,0.07703047,0.000037270693,0.00007395784,0.0000011701463,0.000064991706,0.0000039283955,0.9187872,0.0002753897,0.000013022127,0.0035457932],"study_design_scores_gemma":[0.0013336266,0.0033791803,0.15054786,0.00015851516,0.00013870414,0.00018788302,0.00046706758,0.0005254271,0.84128696,0.00072413986,0.0006742435,0.0005764094],"about_ca_topic_score_codex":0.000035117984,"about_ca_topic_score_gemma":0.000022341957,"teacher_disagreement_score":0.07750023,"about_ca_system_score_codex":6.982444e-7,"about_ca_system_score_gemma":0.000015166766,"threshold_uncertainty_score":0.4292897},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01405394857149718,"score_gpt":0.26742032745287747,"score_spread":0.2533663788813803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085202968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7842603,0.000012923048,0.21135843,0.00039390227,0.00025370147,0.00007431264,6.449459e-7,0.000032734195,0.003613052],"genre_scores_gemma":[0.98341984,0.0000038330036,0.015751204,0.0006146886,0.00018467508,0.0000019877384,0.000007101592,0.000004943067,0.000011718524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988751,0.000036243153,0.00015532278,0.0004326903,0.00018828947,0.0003123648],"domain_scores_gemma":[0.99947137,0.000015367914,0.000035270652,0.00025394396,0.00010293083,0.000121129095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061905215,0.00010584566,0.000089676534,0.000039083476,0.00022243713,0.000073521944,0.0004978779,0.000070800364,0.000019051147],"category_scores_gemma":[0.00010524105,0.000079059224,0.000047995414,0.00024672993,0.0011119477,0.000006614063,0.00036891663,0.000074897056,0.000038346872],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019077883,0.00008372538,0.00019499654,0.0000037583802,0.0000045535844,0.0000050392696,0.000030415105,0.000387343,0.36276585,0.6222838,0.00008220787,0.014139237],"study_design_scores_gemma":[0.00093896,0.0013330925,0.004792293,0.00003090596,0.000006720103,0.00010239035,0.000007913525,0.0042084516,0.77719104,0.20963886,0.0012979461,0.0004514028],"about_ca_topic_score_codex":0.0000016381839,"about_ca_topic_score_gemma":3.228155e-7,"teacher_disagreement_score":0.41442522,"about_ca_system_score_codex":0.00002151363,"about_ca_system_score_gemma":0.000058596994,"threshold_uncertainty_score":0.40970176},"labels":[],"label_agreement":null},{"id":"W2085490472","doi":"10.1016/j.tcs.2007.07.031","title":"An infinite hierarchy induced by depth synchronization","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Saskatchewan; Western University","funders":"","keywords":"Synchronization (alternating current); Measure (data warehouse); Hierarchy; Logarithm; Mathematics; Context (archaeology); Bounded function; Grammar; Constant (computer programming); Word (group theory); Discrete mathematics; Computer science; Combinatorics; Topology (electrical circuits); Mathematical analysis; Linguistics; Geometry; Programming language; Data mining","score_opus":0.009671298505598903,"score_gpt":0.27280782412570487,"score_spread":0.263136525620106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085490472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5458548,0.00001490643,0.45259598,0.000035028956,0.000097340526,0.000048766102,7.88337e-7,0.00002305493,0.001329335],"genre_scores_gemma":[0.98871773,0.0000028872394,0.010134723,0.0008223886,0.00028457466,8.270044e-7,0.00002603241,0.0000067727874,0.0000040702303],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986427,0.00006237018,0.00017719361,0.000472411,0.0002199657,0.00042537344],"domain_scores_gemma":[0.9992834,0.000035373785,0.000040198065,0.00030712536,0.0001113017,0.00022261187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011948533,0.00012044169,0.00009136597,0.000049362567,0.0002262912,0.00009073306,0.0005902867,0.000100876765,0.00001460234],"category_scores_gemma":[0.00008690555,0.00009220314,0.000030599607,0.00035007,0.0010236568,0.000011111632,0.00026821965,0.00010696209,0.000010859573],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035447778,0.00007936905,0.0011054918,0.0000024154751,0.000003184966,0.0000024486212,0.000034406108,0.000034246183,0.81725305,0.06494407,0.000036151356,0.1164697],"study_design_scores_gemma":[0.0006392837,0.0038047,0.017754504,0.00002238639,0.000009601001,0.00003881756,0.000023915367,0.06162048,0.90159863,0.011872056,0.0018643345,0.0007512899],"about_ca_topic_score_codex":0.0000017803243,"about_ca_topic_score_gemma":0.0000012681918,"teacher_disagreement_score":0.4428629,"about_ca_system_score_codex":0.000015448659,"about_ca_system_score_gemma":0.000043650387,"threshold_uncertainty_score":0.3771706},"labels":[],"label_agreement":null},{"id":"W2085596190","doi":"10.1109/tnb.2012.2190618","title":"Pattern Clustering With Statistical Methods Using a DNA-Based Algorithm","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on NanoBioscience","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; CURE data clustering algorithm; Correlation clustering; Canopy clustering algorithm; Data mining; Fuzzy clustering; Construct (python library); Algorithm; Single-linkage clustering; Realization (probability); Encoding (memory); Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.033384320890948505,"score_gpt":0.3279154507780883,"score_spread":0.2945311298871398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085596190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1282172,0.00002785561,0.87125397,0.00001957005,0.00030118626,0.00009069548,0.00002436796,0.000020749809,0.000044404886],"genre_scores_gemma":[0.74786854,0.0000025671907,0.25172937,0.00030398613,0.000053188814,0.0000059692065,0.0000027700403,0.00000819514,0.000025431507],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989288,0.00011922898,0.00013470031,0.00030931577,0.00012526772,0.00038267951],"domain_scores_gemma":[0.9995537,0.000048204834,0.00004337457,0.00018460875,0.000034613542,0.00013551771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003235975,0.00014301146,0.00010987294,0.00004383101,0.00021802567,0.000029362784,0.00015235772,0.000085638305,0.000024684228],"category_scores_gemma":[0.0000071140103,0.00010349693,0.000047436508,0.00017590875,0.0001735738,0.0000083879695,0.000003859477,0.00009702649,0.0000048638217],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026566777,0.00013647674,0.00016286441,0.0000066474536,0.00000842433,0.0000017516528,0.000014776101,0.0014553379,0.72837055,0.0000013017532,0.0000037016077,0.26981157],"study_design_scores_gemma":[0.00033284878,0.0005754836,0.0006029242,0.000025120424,0.000022375973,0.000042331805,0.000031201373,0.078908004,0.9184181,0.0000025832796,0.000766832,0.00027216552],"about_ca_topic_score_codex":0.000017264778,"about_ca_topic_score_gemma":0.0000065274016,"teacher_disagreement_score":0.6196513,"about_ca_system_score_codex":0.000022219077,"about_ca_system_score_gemma":0.000050059152,"threshold_uncertainty_score":0.42204824},"labels":[],"label_agreement":null},{"id":"W2087143193","doi":"10.1063/1.4907513","title":"Persistency and permanency of two stages DNA splicing languages with respect to one initial string and two rules via Yusof-Goode (Y-G) approach","year":2015,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universiti Malaysia Pahang; Centre in Green Chemistry and Catalysis","keywords":"Corollary; RNA splicing; String (physics); Formal language; Computer science; Recombinant DNA; Perspective (graphical); Recombination; Recursively enumerable language; Mathematics; Theoretical computer science; Computational biology; Biology; Genetics; Discrete mathematics; Algorithm; Artificial intelligence; Gene","score_opus":0.04019090265901535,"score_gpt":0.2906416097216008,"score_spread":0.25045070706258543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087143193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898854,0.00034274138,0.0038163003,0.00007766649,0.000010195534,0.00017368617,0.0000066612456,0.00001982044,0.005667568],"genre_scores_gemma":[0.99325985,0.000026069078,0.0064223725,0.00007829418,0.00011935968,0.000008255037,0.000015286312,0.000011094427,0.00005942396],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904925,0.000014098174,0.00016455998,0.0004022022,0.00013557545,0.00023433259],"domain_scores_gemma":[0.9994615,0.000011101626,0.00008850742,0.00008002451,0.00021156893,0.0001472967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022176972,0.000167155,0.00021275564,0.000049427814,0.00006644412,0.00006305174,0.00014113943,0.00006809808,0.0000025474978],"category_scores_gemma":[0.00008454993,0.00012926491,0.000021607879,0.000075482065,0.00012424812,0.0000135164655,0.00023565443,0.000099412886,6.9458827e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018860419,0.00006172064,0.08517363,0.00010813189,0.000046382127,0.0000029015507,0.0016379307,0.000002863789,0.9057737,0.0016182796,0.000019174517,0.005366698],"study_design_scores_gemma":[0.009372447,0.013790721,0.08233589,0.0010491549,0.00038581216,0.0005282263,0.027645083,0.004718329,0.85188985,0.0045565157,0.0007948286,0.0029331448],"about_ca_topic_score_codex":0.000088396046,"about_ca_topic_score_gemma":0.000011956181,"teacher_disagreement_score":0.053883836,"about_ca_system_score_codex":0.000008502125,"about_ca_system_score_gemma":0.00004139997,"threshold_uncertainty_score":0.527127},"labels":[],"label_agreement":null},{"id":"W2088855462","doi":"10.1016/j.tcs.2006.10.007","title":"On codes defined by bio-operations","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Baoji University of Arts And Sciences","keywords":"Code (set theory); Block code; Computer science; Decidability; Function (biology); Reed–Muller code; Linear code; Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Programming language; Biology; Decoding methods; Genetics","score_opus":0.005389987106981573,"score_gpt":0.23005966072130168,"score_spread":0.2246696736143201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088855462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75849056,0.00003333321,0.23640592,0.00039790376,0.00011530656,0.000058275444,0.0000061817577,0.000027231155,0.0044652903],"genre_scores_gemma":[0.99013007,0.000001945689,0.008726977,0.0008706085,0.00018289668,0.00000244403,0.000030928448,0.0000042898646,0.000049813825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989881,0.00004609667,0.00012837278,0.00039676786,0.00015925968,0.00028141163],"domain_scores_gemma":[0.9995824,0.000040801606,0.000015583211,0.00022584196,0.000060285503,0.00007510141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031236594,0.000106342355,0.00008347852,0.000027965103,0.00027134208,0.000094217365,0.00038162962,0.000057854766,0.000026536592],"category_scores_gemma":[0.00006581139,0.00007397132,0.00003967238,0.00018340252,0.0012588407,0.0000032592143,0.00020223658,0.00006459815,0.000033906374],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125850465,0.00009183373,0.00013891798,9.313837e-7,0.0000016585337,9.826766e-7,0.0000026672974,0.0004888547,0.31316486,0.68226343,0.0012371562,0.0025961138],"study_design_scores_gemma":[0.00066613714,0.0025099174,0.0038582599,0.000023169794,0.0000105071795,0.000027713902,0.0000042029606,0.078521855,0.8151266,0.093750626,0.004795158,0.0007058393],"about_ca_topic_score_codex":0.000004723386,"about_ca_topic_score_gemma":0.000001426497,"teacher_disagreement_score":0.58851284,"about_ca_system_score_codex":0.000008456914,"about_ca_system_score_gemma":0.000025665891,"threshold_uncertainty_score":0.46382508},"labels":[],"label_agreement":null},{"id":"W2092237630","doi":"10.1016/j.jcss.2008.08.002","title":"On pseudoknot-bordered words and their properties","year":2008,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Pseudoknot; Complementarity (molecular biology); Context (archaeology); Generalization; Word (group theory); DNA; Computer science; Mathematics; Base sequence; Biology; Genetics; Geometry","score_opus":0.028216077377469315,"score_gpt":0.2300313340057564,"score_spread":0.2018152566282871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092237630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99384964,0.0016516855,0.0037302,0.00009235514,0.00018971041,0.000033780645,4.0333097e-7,0.0000033275705,0.00044887338],"genre_scores_gemma":[0.99867207,0.00009308976,0.0008042324,0.00012337502,0.0002782886,2.53518e-7,1.3744805e-7,0.0000016757277,0.000026852695],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944234,0.00006042016,0.00018038353,0.0001248742,0.00009091404,0.00010107647],"domain_scores_gemma":[0.9997282,0.000021026879,0.000105011764,0.00004480592,0.000048399554,0.000052550935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034292325,0.0000760174,0.00014169181,0.000035798774,0.00018451862,0.000042015046,0.00012635275,0.00003853324,4.1785816e-7],"category_scores_gemma":[0.0000114134145,0.000036802834,0.00003817141,0.000050497878,0.00018903692,0.0000054913676,0.00006290092,0.000047238067,2.854457e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010905181,0.0005332898,0.10417372,0.00053277984,0.00045017008,0.00023014787,0.0065291985,0.002599415,0.62857753,0.006155405,0.007747585,0.24138024],"study_design_scores_gemma":[0.014287536,0.10022795,0.26233104,0.006012997,0.00014425149,0.06642034,0.018824324,0.13527703,0.34055308,0.002663063,0.04817373,0.0050846576],"about_ca_topic_score_codex":0.0000013794211,"about_ca_topic_score_gemma":3.5740683e-7,"teacher_disagreement_score":0.2880245,"about_ca_system_score_codex":0.0000026368189,"about_ca_system_score_gemma":0.000029617406,"threshold_uncertainty_score":0.1500776},"labels":[],"label_agreement":null},{"id":"W2092302289","doi":"10.1145/977091.977112","title":"Biologically inspired rule-based multiset programming paradigm for soft-computing","year":2004,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiset; Computer science; Theoretical computer science; Genetic programming; Nondeterministic algorithm; Artificial intelligence; Mathematics","score_opus":0.02178145547715145,"score_gpt":0.2731776250027477,"score_spread":0.2513961695255963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092302289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68701124,0.00011387257,0.3115889,0.00040030899,0.00010067234,0.00041954417,0.000009296657,0.000102193124,0.0002539613],"genre_scores_gemma":[0.9046609,0.0000030570418,0.093338475,0.0013683534,0.000278174,0.000028828965,0.00027013934,0.000014640769,0.000037439266],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986119,0.000034348064,0.00028489475,0.0005219509,0.00007352228,0.0004733571],"domain_scores_gemma":[0.9994833,0.000044832035,0.00009631356,0.00020665885,0.000062326115,0.000106587824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002627057,0.00021247054,0.0001927919,0.000027631233,0.0001925514,0.000049772585,0.00025435834,0.00024204973,0.000006072346],"category_scores_gemma":[0.00021607146,0.00015093516,0.00019067364,0.000092011855,0.00009738549,0.0000020500352,0.000106038664,0.00007971137,0.000008136247],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004332808,0.00059861137,0.013082327,0.000074173455,0.00009643487,0.000011458506,0.000027584467,0.0065240925,0.7257539,0.0023321395,0.00021764028,0.25084838],"study_design_scores_gemma":[0.013778465,0.007459495,0.024048815,0.00016698976,0.00008293241,0.00004742367,0.00013899147,0.009988287,0.737686,0.0062964396,0.19765148,0.0026547408],"about_ca_topic_score_codex":0.00001726683,"about_ca_topic_score_gemma":0.000009043748,"teacher_disagreement_score":0.24819364,"about_ca_system_score_codex":0.000017551472,"about_ca_system_score_gemma":0.00006469525,"threshold_uncertainty_score":0.61549574},"labels":[],"label_agreement":null},{"id":"W2092820948","doi":"10.1023/b:naco.0000006770.91995.ec","title":"Algorithms for testing that sets of DNA words concatenate without secondary structure","year":2003,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Set (abstract data type); Theory of computation; Computer science; Algorithm; Nucleic acid secondary structure; Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; RNA; Genetics; Biology","score_opus":0.028398655593426917,"score_gpt":0.2862824322705501,"score_spread":0.2578837766771232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092820948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946666,0.0011021903,0.002662352,0.000021327847,0.00050623104,0.00024221053,0.000023681587,0.00003262908,0.00074280327],"genre_scores_gemma":[0.9617271,0.000002172166,0.037645783,0.00024345826,0.0002009088,0.0000013010563,0.00009116125,0.000018705881,0.000069439004],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874,0.00008369247,0.00027505576,0.00040859156,0.00011572937,0.00037691696],"domain_scores_gemma":[0.99923706,0.000121551595,0.00022412205,0.00017063881,0.00018584022,0.000060785114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031401592,0.00021158897,0.00026013117,0.000032284104,0.00016760336,0.000028027649,0.00021319774,0.00019885266,0.000005561557],"category_scores_gemma":[0.00048974255,0.00016202388,0.00011581283,0.00012867783,0.000077910605,0.000004471365,0.00012737938,0.00024326175,4.7612866e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043528613,0.000018924133,0.01400264,0.000075458796,0.00006516843,0.0000023230134,0.000048804777,0.00017112037,0.90889126,0.00010748178,0.00015940868,0.07641391],"study_design_scores_gemma":[0.0017393322,0.0005788153,0.011540379,0.00010658188,0.000037844547,0.00011071696,0.00018513307,0.011786778,0.96749705,0.00076994696,0.005005613,0.0006417966],"about_ca_topic_score_codex":0.0000042388087,"about_ca_topic_score_gemma":0.0000030520164,"teacher_disagreement_score":0.07577211,"about_ca_system_score_codex":0.000012356711,"about_ca_system_score_gemma":0.000061346866,"threshold_uncertainty_score":0.6607142},"labels":[],"label_agreement":null},{"id":"W2093831923","doi":"10.4161/cib.28303","title":"On the computational ability of the RNA polymerase II carboxy terminal domain","year":2014,"lang":"en","type":"article","venue":"Communicative & Integrative Biology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computational biology; RNA polymerase II; Transcription (linguistics); Biology; Computer science; Polymerase; Cell biology; Genetics; Gene; Philosophy","score_opus":0.015640918077754085,"score_gpt":0.28126643979887206,"score_spread":0.265625521721118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093831923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98331165,0.00025744442,0.0023279053,0.0021807293,0.00008879415,0.00023506225,0.000044042332,0.000008080284,0.011546293],"genre_scores_gemma":[0.9976683,0.000012792901,0.0006947215,0.0014003583,0.000070896465,0.00002572048,0.00006948301,0.0000067950987,0.00005087711],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972255,0.0019363321,0.00028696776,0.00028566888,0.00007271877,0.000192776],"domain_scores_gemma":[0.99785423,0.0008181751,0.00024765884,0.00086254266,0.00018186042,0.0000355071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062829774,0.00019765687,0.00023259815,0.000018372846,0.000407205,0.000006963486,0.0011477062,0.00014897286,0.000039104172],"category_scores_gemma":[0.0008902732,0.00008683211,0.00018712557,0.000116681826,0.0016550756,0.0000017084749,0.00087780453,0.00034512562,0.0000035705916],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020551171,0.0002495366,0.004689884,0.0000039393253,0.00010971843,1.3254868e-7,0.0005497984,0.00003176384,0.7901811,0.19619872,0.0006941264,0.0070857927],"study_design_scores_gemma":[0.0015817757,0.0070348457,0.07519426,0.0001592971,0.000049874317,0.000020901174,0.0023052413,0.0013820967,0.6313978,0.23326705,0.046785254,0.0008215952],"about_ca_topic_score_codex":0.000043112155,"about_ca_topic_score_gemma":0.000039214538,"teacher_disagreement_score":0.15878329,"about_ca_system_score_codex":0.000020535348,"about_ca_system_score_gemma":0.000052076197,"threshold_uncertainty_score":0.6098195},"labels":[],"label_agreement":null},{"id":"W2097025603","doi":"10.1109/18.930944","title":"Relationships between different error-correcting capabilities of a code","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Hamming distance; Error detection and correction; Hamming code; Levenshtein distance; Algorithm; Channel (broadcasting); Computer science; Type (biology); Mathematics; Code (set theory); Discrete mathematics; Block code; Decoding methods; Telecommunications","score_opus":0.028585560061617523,"score_gpt":0.25362485343716373,"score_spread":0.2250392933755462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097025603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60040957,0.000008798166,0.39779294,0.000024214261,0.000113796545,0.00007920478,0.000024261477,0.000020352227,0.0015268815],"genre_scores_gemma":[0.99940187,0.000012562511,0.00017608705,0.000064265834,0.000046159123,0.000012954671,0.00004114561,0.0000048172305,0.00024015571],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921346,0.00014624947,0.00032669218,0.0000928749,0.00009213138,0.00012860734],"domain_scores_gemma":[0.99946004,0.00014393491,0.000117434196,0.0001632171,0.00007110981,0.000044279084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037289408,0.00010300082,0.000112643495,0.00007480472,0.00017517759,0.000013958569,0.00009852601,0.0001311931,0.000045681725],"category_scores_gemma":[0.000056605742,0.00008300748,0.0000952848,0.00008992718,0.00007300015,0.000018819466,0.000002273395,0.00017064819,0.000016815191],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002507246,0.0007992705,0.047180608,0.00038971845,0.0007609758,0.0000015697277,0.010452609,0.070637845,0.08187931,0.0071749557,0.00052444916,0.7776914],"study_design_scores_gemma":[0.002038762,0.0017473928,0.030736532,0.00016883442,0.00015342177,0.000055234294,0.011223474,0.0021459218,0.93441224,0.0076966886,0.008654019,0.00096746476],"about_ca_topic_score_codex":0.000004824478,"about_ca_topic_score_gemma":0.0000075150083,"teacher_disagreement_score":0.8525329,"about_ca_system_score_codex":0.000015599651,"about_ca_system_score_gemma":0.00001614547,"threshold_uncertainty_score":0.33849466},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015434950500011336,"score_gpt":0.36066984633973614,"score_spread":0.34523489583972483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099378738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41013142,0.000114705006,0.5884967,0.000578036,0.00028911952,0.000022651926,0.0000030078158,0.0000024485873,0.00036191588],"genre_scores_gemma":[0.56208444,0.000032807504,0.43751925,0.0001102208,0.00024250627,2.1540117e-7,0.0000032928997,0.0000011676103,0.000006064419],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992835,0.000032691998,0.00029199204,0.000107547006,0.00021006042,0.000074212985],"domain_scores_gemma":[0.9988658,0.000030347634,0.00025817667,0.000114731454,0.000687899,0.00004308307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070747884,0.000051351522,0.000076709606,0.00011887742,0.000069055444,0.00006744118,0.0005168265,0.000027878694,0.0000071731524],"category_scores_gemma":[0.000246245,0.000041653606,0.000044247026,0.0001098527,0.00031803883,0.000048428097,0.00023684476,0.000047461286,4.2818476e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055293236,0.00012149645,0.010054303,0.0000065789036,0.000081618826,0.0000020064829,0.0001435779,0.0010664253,0.19656698,0.021580122,0.00042686242,0.7698947],"study_design_scores_gemma":[0.0040163253,0.0018879441,0.14491701,0.00020640755,0.00008298495,0.0031522845,0.00047089902,0.045253552,0.6665817,0.018995821,0.113668874,0.00076621026],"about_ca_topic_score_codex":0.0000028657016,"about_ca_topic_score_gemma":0.000002181959,"teacher_disagreement_score":0.7691285,"about_ca_system_score_codex":0.00001738915,"about_ca_system_score_gemma":0.00009897824,"threshold_uncertainty_score":0.16985847},"labels":[],"label_agreement":null},{"id":"W2104887572","doi":"10.1109/icme.2004.1394285","title":"Length-constrained MAP decoding revisited","year":2005,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Directed acyclic graph; Maximum a posteriori estimation; Parameterized complexity; Algorithm; Sequential decoding; Markov chain; Directed graph; Path (computing); Sequence (biology); Computer science; Heuristic; Binary number; Graph; Mathematics; List decoding; Mathematical optimization; Theoretical computer science; Maximum likelihood; Concatenated error correction code; Block code","score_opus":0.013119206737674641,"score_gpt":0.25507496796101686,"score_spread":0.24195576122334223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104887572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9447805,0.0005476989,0.006401281,0.0009061242,0.00007322868,0.00009941165,0.0000031557843,0.000057297253,0.04713128],"genre_scores_gemma":[0.9859135,0.0000287665,0.010230575,0.0013130629,0.0005029675,0.0000017175967,0.00004394627,0.0000057099555,0.0019597672],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993832,0.00002502682,0.00013664684,0.00022322962,0.00004428993,0.00018761397],"domain_scores_gemma":[0.99973536,0.000010159663,0.00002946881,0.00014051101,0.000029342902,0.000055147884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013446755,0.00008996538,0.000081554885,0.000014864144,0.0000579223,0.000018894585,0.00011556708,0.00009380807,0.00018299758],"category_scores_gemma":[0.000055809458,0.00006672062,0.00006515735,0.000038999246,0.000033545955,0.0000014265858,0.00008330138,0.00005062212,0.0000764912],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022836375,0.00003682728,0.0025912046,0.000007154166,0.000025607009,0.0000021356059,0.0000068935315,0.000021929334,0.88658595,0.0013846948,0.006620467,0.10269432],"study_design_scores_gemma":[0.0005924386,0.00025187235,0.001388178,0.000016520293,0.000011213563,0.000025051395,0.000045637356,0.001358986,0.3292308,0.00011476222,0.6665922,0.0003723878],"about_ca_topic_score_codex":0.0000012801147,"about_ca_topic_score_gemma":0.0000036111,"teacher_disagreement_score":0.6599717,"about_ca_system_score_codex":0.0000050645453,"about_ca_system_score_gemma":0.000010498826,"threshold_uncertainty_score":0.27207878},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.18783905441084853,"score_gpt":0.4148317964148738,"score_spread":0.22699274200402525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110917769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83074677,0.00020528444,0.16611896,0.0002669094,0.0005742515,0.0010887722,0.00007705179,0.000024993622,0.00089700526],"genre_scores_gemma":[0.9648479,0.000037542904,0.030993884,0.00006706638,0.0010922634,0.00015822274,0.0025500327,0.000017228786,0.00023584557],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781364,0.00038473905,0.00033370356,0.00061594887,0.00041737396,0.00043458893],"domain_scores_gemma":[0.9985984,0.00025189266,0.00011190046,0.0003803034,0.00055181904,0.000105677806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029029367,0.00014490346,0.00021739196,0.00023642361,0.00023918561,0.00018302923,0.0009184562,0.00011798233,0.00005792771],"category_scores_gemma":[0.0017957017,0.000109333814,0.00013842524,0.00019072519,0.00033655163,0.000021155878,0.0007315982,0.00017445166,0.000010381724],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028820161,0.00017049079,0.00055965176,0.000031433116,0.00025269925,0.000001389736,0.000020213165,0.000043257605,0.97724617,0.00021460075,0.004420338,0.014157754],"study_design_scores_gemma":[0.0318376,0.00038274415,0.00038574566,0.00007049927,0.000034528028,0.00009618998,0.0004746796,0.80558795,0.14324212,0.0025150748,0.014778891,0.0005939675],"about_ca_topic_score_codex":0.00012074216,"about_ca_topic_score_gemma":0.000002882776,"teacher_disagreement_score":0.83400404,"about_ca_system_score_codex":0.000032196876,"about_ca_system_score_gemma":0.00007564962,"threshold_uncertainty_score":0.44585034},"labels":[],"label_agreement":null},{"id":"W2113215959","doi":"10.1007/978-0-387-69216-6_13","title":"The DNA Computer","year":2008,"lang":"en","type":"book-chapter","venue":"Springer undergraduate texts in mathematics and technology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Computational biology; Biology","score_opus":0.01244416600960284,"score_gpt":0.22181349881252588,"score_spread":0.20936933280292302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113215959","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14371522,0.050324723,0.007054237,0.0138216885,0.0017520285,0.0028393029,0.000040008345,0.00067130814,0.77978146],"genre_scores_gemma":[0.527164,0.06408597,0.029905288,0.0005231595,0.001123914,0.00007321277,0.000093811046,0.00033424483,0.37669644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986061,0.000010387346,0.0004206209,0.00048875157,0.00012223265,0.00035189535],"domain_scores_gemma":[0.99908566,0.00006200811,0.00021283925,0.0005349449,0.000059182184,0.000045340403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019354465,0.00034998535,0.0003584188,0.0001349883,0.00020417906,0.00003762153,0.00041093794,0.0007125088,0.000004107838],"category_scores_gemma":[0.00004427384,0.00023932611,0.00008838899,0.000055220386,0.0005693986,0.0000014710495,0.0006862138,0.00043552564,0.00002309798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024359764,0.00011920034,0.00031027588,0.00016095125,0.00029210976,0.00012375084,0.000039649283,0.000007768615,0.0065838792,0.82518697,0.004967852,0.16218323],"study_design_scores_gemma":[0.00042977702,0.0003813073,0.00006171747,0.00020294891,0.000027777545,0.00021459715,0.000012762656,0.0004107339,0.001533932,0.41527796,0.5807969,0.00064959447],"about_ca_topic_score_codex":9.444808e-7,"about_ca_topic_score_gemma":0.000030284818,"teacher_disagreement_score":0.575829,"about_ca_system_score_codex":0.000017966093,"about_ca_system_score_gemma":0.00003591786,"threshold_uncertainty_score":0.97594357},"labels":[],"label_agreement":null},{"id":"W2113265444","doi":"10.1109/isita.2010.5649672","title":"A secure authentication system based on variable-length codes","year":2010,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Code word; Computer science; Code (set theory); Message authentication code; Authentication (law); Permutation (music); Protocol (science); Table (database); Lookup table; Theoretical computer science; Variable (mathematics); Computer network; Cryptography; Algorithm; Computer security; Mathematics; Set (abstract data type); Decoding methods; Data mining","score_opus":0.005368624861761499,"score_gpt":0.21868632954499928,"score_spread":0.21331770468323777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113265444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9341121,0.0000112637335,0.022953123,0.00015511567,0.00031376467,0.00014799471,0.000012480634,0.0000736,0.042220578],"genre_scores_gemma":[0.9935854,5.536088e-7,0.0052896542,0.000385399,0.00021303573,0.0000072662633,0.00010251644,0.0000064713377,0.00040971907],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994229,0.000036927486,0.0001033232,0.00023227342,0.00006616099,0.0001384196],"domain_scores_gemma":[0.9996086,0.000020175934,0.00003566999,0.00023748475,0.0000482989,0.000049771108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020976555,0.00008822978,0.00007197134,0.000015708705,0.00006623528,0.000022497274,0.00012781126,0.00015562402,0.00004857351],"category_scores_gemma":[0.00007310983,0.00006037731,0.000040069033,0.00004965636,0.000027220285,7.126727e-7,0.00003556224,0.00009612729,0.000024197223],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031999625,0.000056447163,0.0008582163,0.000017774457,0.000009047924,7.18346e-7,0.000004019953,0.000058799156,0.9830129,0.014559035,0.00046043712,0.0009306021],"study_design_scores_gemma":[0.0016377547,0.0015551905,0.0064179995,0.0000829507,0.000056923,0.000029374516,0.00018462408,0.16889529,0.6703106,0.00038349032,0.14955094,0.00089488033],"about_ca_topic_score_codex":0.0000053567687,"about_ca_topic_score_gemma":0.0000043108257,"teacher_disagreement_score":0.3127023,"about_ca_system_score_codex":0.0000039585548,"about_ca_system_score_gemma":0.000024369401,"threshold_uncertainty_score":0.24621153},"labels":[],"label_agreement":null},{"id":"W2114383698","doi":"10.1007/978-4-431-88981-6_9","title":"Towards the Sequence Design Preventing Pseudoknot Formation","year":2008,"lang":"en","type":"book-chapter","venue":"Proceedings in information and communications technology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Pseudoknot; Complementarity (molecular biology); Word (group theory); Computer science; DNA; Mathematics; Computational biology; Algorithm; Theoretical computer science; Biology; Base sequence; Genetics; Geometry","score_opus":0.05824764797806454,"score_gpt":0.2698205557614088,"score_spread":0.21157290778334426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114383698","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017161705,0.014618433,0.014215034,0.012854103,0.00016590147,0.0030251506,0.000037385948,0.0004570961,0.9374652],"genre_scores_gemma":[0.90103686,0.0676361,0.02444493,0.001060484,0.000070958245,0.00025358523,0.00034727168,0.0000291117,0.0051207026],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991188,0.000010791941,0.00047315084,0.00014049506,0.00009201577,0.00016472251],"domain_scores_gemma":[0.9989834,0.000020056785,0.00037289338,0.0003947245,0.00020692767,0.000022031112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035382112,0.00018037221,0.00015459022,0.00022311664,0.00031139376,0.000053800773,0.00082433264,0.00049910304,0.0000036449624],"category_scores_gemma":[0.00017353594,0.00014018711,0.000042769425,0.00011386239,0.00039015643,0.000041119354,0.0008398101,0.00045186034,0.000012874506],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005374229,0.000039963314,0.00031998532,0.00017037247,0.000066611625,7.7496543e-7,0.0010716204,0.000018281271,0.0047859224,0.30955374,0.004612475,0.6793065],"study_design_scores_gemma":[0.00039832218,0.00027826356,0.00010928358,0.0002887641,0.000024849496,0.00040009723,0.0004916647,0.0038551877,0.0037718904,0.01824775,0.9716369,0.000497019],"about_ca_topic_score_codex":0.0000019790095,"about_ca_topic_score_gemma":0.0000038833323,"teacher_disagreement_score":0.96702445,"about_ca_system_score_codex":0.00003300546,"about_ca_system_score_gemma":0.000049640206,"threshold_uncertainty_score":0.5716665},"labels":[],"label_agreement":null},{"id":"W2115302316","doi":"10.1080/09720529.2007.10698134","title":"<i>k</i>-involution codes and related sets","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Mathematical Sciences and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Involution (esoterism); Mathematics; Combinatorics; Discrete mathematics; Biology","score_opus":0.011065538727022513,"score_gpt":0.27551271671791083,"score_spread":0.2644471779908883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115302316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98446023,0.0012235177,0.010870277,0.00017786259,0.000041546853,0.000037924554,8.982573e-7,0.0000030830197,0.0031846322],"genre_scores_gemma":[0.99082005,0.00019369644,0.008854876,0.000077370336,0.000045672674,1.6260337e-7,6.6662307e-7,0.000002123275,0.0000053590156],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992615,0.000028931294,0.00027553277,0.00012360775,0.00014395517,0.00016647649],"domain_scores_gemma":[0.9996106,0.000049492086,0.00014195115,0.00004211243,0.00004115183,0.000114704584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011867722,0.00007674544,0.00013094505,0.000054640637,0.0001279218,0.000044569442,0.00009526797,0.00007140504,0.000008084953],"category_scores_gemma":[0.000081150545,0.000044166016,0.00007843941,0.00015417645,0.00044256763,0.000007999742,0.000060923696,0.000073447256,3.5470924e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003348204,0.0003581488,0.1268363,0.00018063758,0.00024187239,0.000059611222,0.00057528936,0.000025982848,0.62415034,0.179522,0.0007512111,0.0669638],"study_design_scores_gemma":[0.0025640754,0.010377148,0.2032008,0.0005532632,0.00022602867,0.0027167795,0.004192602,0.0017386089,0.03730674,0.7297601,0.006219013,0.0011448051],"about_ca_topic_score_codex":6.9957775e-7,"about_ca_topic_score_gemma":9.753504e-7,"teacher_disagreement_score":0.58684355,"about_ca_system_score_codex":0.0000014571186,"about_ca_system_score_gemma":0.000008854738,"threshold_uncertainty_score":0.18010378},"labels":[],"label_agreement":null},{"id":"W2115303412","doi":"10.1109/isita.2008.4895457","title":"Simple and efficient solution of the identifiability problem for hidden Markov sources and quantum random walks","year":2008,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Identifiability; Hidden Markov model; Markov chain; Simple (philosophy); Random walk; Markov process; Computer science; Mathematics; Ergodicity; Variable-order Markov model; Algorithm; Markov model; Theoretical computer science; Discrete mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.012607084028318331,"score_gpt":0.2312989537284225,"score_spread":0.21869186970010415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115303412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955828,0.0003314299,0.0034865143,0.0000977605,0.000030490957,0.00031298908,0.0000070417645,0.000005452873,0.0001454838],"genre_scores_gemma":[0.99912935,0.000026615235,0.0006200314,0.000044052707,0.000033617944,0.000007699188,0.000009555484,0.0000029109788,0.00012614469],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994483,0.000049335555,0.00014262636,0.00019590577,0.00004769792,0.000116124065],"domain_scores_gemma":[0.9997247,0.000042173455,0.000055107,0.000109058914,0.00004355182,0.000025443185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022823688,0.00006666251,0.00009920488,0.000006596765,0.00014915691,0.000007658884,0.00006722446,0.00006614004,0.0000027224564],"category_scores_gemma":[0.00009503014,0.000036842244,0.00005411731,0.000026770293,0.0001813756,8.996865e-7,0.0001489364,0.000026333562,9.1537636e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026721478,0.00007730316,0.04973452,0.00007627924,0.000026588268,1.5782845e-7,0.00009108201,0.0000209047,0.943418,0.00015579782,0.0005608353,0.0055712746],"study_design_scores_gemma":[0.005438833,0.0010773737,0.3443803,0.00003460208,0.000070118636,0.000055321063,0.00029279102,0.021744268,0.61524135,0.004290331,0.006866809,0.000507894],"about_ca_topic_score_codex":0.000027234893,"about_ca_topic_score_gemma":0.000011337932,"teacher_disagreement_score":0.32817668,"about_ca_system_score_codex":0.0000023179052,"about_ca_system_score_gemma":0.000011583709,"threshold_uncertainty_score":0.15023832},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008116660906839171,"score_gpt":0.2500124413008852,"score_spread":0.24189578039404602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115404543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69999576,0.000053278192,0.29855296,0.00011400624,0.00030006494,0.000118927186,0.000004520223,0.000037490554,0.0008230142],"genre_scores_gemma":[0.99157655,0.0000025765764,0.0077599864,0.000290079,0.00033050642,0.0000021287674,0.000014305379,0.0000075657085,0.00001631526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983865,0.00006248296,0.0002064846,0.0005720118,0.0003625768,0.0004099439],"domain_scores_gemma":[0.9991895,0.000031741663,0.000079747064,0.00028864562,0.00022305256,0.00018733059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055165146,0.00016266636,0.00016725049,0.0000592576,0.0003067462,0.0001480238,0.00065377937,0.000063079126,0.0000033166834],"category_scores_gemma":[0.000060397586,0.00012574696,0.00006163567,0.00028587962,0.0018803793,0.000009465584,0.0004936927,0.00010833109,0.00002254696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006376082,0.0001636107,0.0019242929,0.000020937974,0.000019866247,0.000029703422,0.00020391996,0.049306937,0.04432052,0.9027077,0.000038993767,0.0011997418],"study_design_scores_gemma":[0.013985264,0.009818445,0.063830554,0.0011422897,0.00016154797,0.0015501388,0.001597085,0.59419495,0.21487305,0.08764955,0.005295689,0.0059014577],"about_ca_topic_score_codex":0.000011474176,"about_ca_topic_score_gemma":0.0000016932332,"teacher_disagreement_score":0.8150582,"about_ca_system_score_codex":0.000055589844,"about_ca_system_score_gemma":0.00017690644,"threshold_uncertainty_score":0.69283354},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Closure (psychology); Decidability; Mathematics; Ciliate; Computer science; Discrete mathematics; Biology; Ecology; Political science","score_opus":0.011038720805139993,"score_gpt":0.24515593442266154,"score_spread":0.23411721361752155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120837895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97683716,0.00012557792,0.022362918,0.00019375773,0.000035019435,0.00013410738,0.0000019210952,0.000010722483,0.00029880012],"genre_scores_gemma":[0.9832713,0.0000037383297,0.016399045,0.00027098606,0.000039965154,0.0000031395336,7.3367346e-7,0.0000031468064,0.000007937521],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911106,0.000088301575,0.00012263452,0.00034809095,0.00013282592,0.00019706195],"domain_scores_gemma":[0.9995302,0.00001935489,0.00001619854,0.00023346454,0.00009899241,0.000101819125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052961777,0.00008918692,0.00010824011,0.000030268588,0.00012953687,0.00004814018,0.0002067376,0.000038236936,0.0000052219234],"category_scores_gemma":[0.0002242146,0.00005167831,0.000020289264,0.00019646955,0.0014327575,0.000006919361,0.00017656191,0.000049969607,0.0000016436288],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006703871,0.00005742081,0.003911086,0.000012065084,0.0000059351714,0.0000016284004,0.00014161888,0.00016097953,0.8271269,0.16657199,0.000005831754,0.0019374678],"study_design_scores_gemma":[0.00020478907,0.0013478138,0.0074675395,0.000030438501,0.0000060642024,0.000018020171,0.000048836184,0.0009450229,0.98753685,0.002089981,0.00012632605,0.00017834055],"about_ca_topic_score_codex":0.0000026046162,"about_ca_topic_score_gemma":0.0000048972793,"teacher_disagreement_score":0.164482,"about_ca_system_score_codex":0.000005820806,"about_ca_system_score_gemma":0.00006329134,"threshold_uncertainty_score":0.52790546},"labels":[],"label_agreement":null},{"id":"W2121693375","doi":"10.1016/j.tcs.2006.08.022","title":"Codes defined by multiple sets of trajectories","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Mathematics; Computer science; Algorithm; Combinatorics; Discrete mathematics","score_opus":0.006236922189298416,"score_gpt":0.22849628015321546,"score_spread":0.22225935796391705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121693375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8837205,0.000087609216,0.11466353,0.000059451453,0.000105105224,0.00005405643,0.000010506182,0.00001748704,0.0012817199],"genre_scores_gemma":[0.9853033,0.0000025529937,0.014461378,0.00009735873,0.000099172365,0.0000013427897,0.000020221141,0.000003991147,0.000010692014],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990274,0.000044656714,0.0001726458,0.0003231402,0.00016854897,0.0002636283],"domain_scores_gemma":[0.99954015,0.000067051296,0.000045131248,0.00019916202,0.00008886082,0.000059621576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035488346,0.00010159899,0.00012503062,0.000021550813,0.00011391477,0.000030114701,0.0004009385,0.000059977272,0.000009783951],"category_scores_gemma":[0.000093817136,0.00007297055,0.00004928726,0.00017992001,0.0019236881,0.000003620333,0.00024244109,0.00004898479,0.000002864768],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031117743,0.00010377249,0.005253911,0.0000059943545,0.0000034947936,8.9078867e-7,0.000009816465,0.00007530124,0.8807104,0.10946617,0.0003897229,0.003949387],"study_design_scores_gemma":[0.00031950945,0.00062383816,0.0090190545,0.000010730275,0.000005116733,0.0000093747,0.0000052798678,0.010707385,0.9637199,0.014549301,0.00081296684,0.00021756723],"about_ca_topic_score_codex":0.000011135019,"about_ca_topic_score_gemma":0.0000017845185,"teacher_disagreement_score":0.10158276,"about_ca_system_score_codex":0.0000052927103,"about_ca_system_score_gemma":0.000027041318,"threshold_uncertainty_score":0.7087909},"labels":[],"label_agreement":null},{"id":"W2121944353","doi":"10.1007/978-3-642-39074-6_13","title":"Hypergraph Automata: A Theoretical Model for Patterned Self-assembly","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hypergraph; Automaton; Computer science; Expressive power; Mobile automaton; Theoretical computer science; Existential quantification; Regular language; Automata theory; Algorithm; Discrete mathematics; Mathematics","score_opus":0.012181823205912682,"score_gpt":0.2427925638809109,"score_spread":0.2306107406749982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121944353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015211948,0.00017680331,0.9819984,0.00026129556,0.00035731492,0.00045951808,0.000013891413,0.00006126208,0.0014596117],"genre_scores_gemma":[0.8587632,0.000039999835,0.13868307,0.0016904154,0.00052215223,0.000021452826,0.000039888622,0.000030673866,0.00020912025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785966,0.000018921888,0.0003047517,0.0010555245,0.00024835274,0.00051278406],"domain_scores_gemma":[0.99895185,0.000106584615,0.00012036436,0.0005375775,0.00016409036,0.0001195573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037990249,0.00037843428,0.0003295659,0.000118357486,0.0001350575,0.00013155495,0.00090175046,0.00050430757,0.000009983307],"category_scores_gemma":[0.000069896465,0.00028233614,0.00018633496,0.00007573386,0.0004925058,0.0000067852243,0.0005985985,0.00026013597,0.00001147038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001461494,0.00026637228,0.00025622718,0.00023210143,0.00014501617,0.00002935173,0.0002623818,0.03780364,0.113507375,0.072428614,0.0005126078,0.7744102],"study_design_scores_gemma":[0.0003527605,0.0004907748,0.000036231537,0.00007910514,0.000015902979,0.000021145208,7.856712e-8,0.89765704,0.008939612,0.0909161,0.00095234544,0.00053889834],"about_ca_topic_score_codex":0.0000017768749,"about_ca_topic_score_gemma":0.000005212845,"teacher_disagreement_score":0.8598534,"about_ca_system_score_codex":0.000035573088,"about_ca_system_score_gemma":0.0001696029,"threshold_uncertainty_score":0.99996287},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Membrane; Computer science; Chemistry; Biochemistry","score_opus":0.014410572727532992,"score_gpt":0.21624832726827894,"score_spread":0.20183775454074596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122157334","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004039946,0.00040488524,0.00023259629,0.000027046552,0.00011595963,0.00018974043,0.000014344251,0.000026819214,0.9949487],"genre_scores_gemma":[0.21027572,0.00022998411,0.000038744758,0.00032459295,0.0005021903,0.0000052305836,0.00021401091,0.000033851727,0.7883757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999171,0.000011402503,0.00012598444,0.0004157587,0.00011088816,0.00016495994],"domain_scores_gemma":[0.99952716,0.000018122346,0.000092366914,0.00024456566,0.000059900663,0.00005789813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004237543,0.0002609633,0.00021880066,0.000026058522,0.000047792404,0.000021471931,0.0001412289,0.00039689968,0.00013178833],"category_scores_gemma":[0.000008334849,0.0001544333,0.00008211487,0.000009040724,0.0000601654,5.067187e-7,0.000063232714,0.00014462446,0.000061928185],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058223368,0.00039943148,0.00012389373,0.0006956134,0.0035282506,0.00076681905,0.00004684064,0.0019726504,0.08221767,0.74903595,0.04759871,0.10779185],"study_design_scores_gemma":[0.00034622586,0.001838011,0.000012410684,0.00015188013,0.0000388926,0.000074791606,0.000014203965,0.000020073105,0.0057713995,0.0007664899,0.9903971,0.00056854344],"about_ca_topic_score_codex":0.0000075748485,"about_ca_topic_score_gemma":0.000008141411,"teacher_disagreement_score":0.9427984,"about_ca_system_score_codex":0.000010117451,"about_ca_system_score_gemma":0.000024778565,"threshold_uncertainty_score":0.62976074},"labels":[],"label_agreement":null},{"id":"W2123164976","doi":"10.1109/cwit.2009.5069539","title":"Convolutional codes for channels with deletion errors","year":2009,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Convolutional code; Viterbi algorithm; Trellis (graph); Sequential decoding; Computer science; Algorithm; Iterative Viterbi decoding; Viterbi decoder; Soft output Viterbi algorithm; Decoding methods; Code word; List decoding; Computational complexity theory; Theoretical computer science; Concatenated error correction code; Block code","score_opus":0.014861594338582522,"score_gpt":0.25474936581844276,"score_spread":0.23988777147986023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123164976","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.912536,0.00008604033,0.0838848,0.0007592161,0.00004587506,0.00014529476,0.0000052739297,0.000019967138,0.002517508],"genre_scores_gemma":[0.9949453,0.000004716475,0.0029471342,0.0009302276,0.00018905103,0.0000031463994,0.00013074602,0.0000025073948,0.0008472048],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999612,0.000008976855,0.00006279121,0.00015375395,0.000036577978,0.00012593399],"domain_scores_gemma":[0.9998312,0.00000611557,0.000021468686,0.000056554734,0.000055311353,0.000029337383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066041044,0.00006157213,0.000055057557,0.000008246548,0.000055841956,0.000008558964,0.000052421423,0.00006086257,0.000009102602],"category_scores_gemma":[0.000018197403,0.000039369734,0.000033475248,0.000023969344,0.000026155276,8.7447177e-7,0.000007651777,0.000019207948,0.0000020342218],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003893057,0.00010910499,0.001892834,0.0000064705528,0.00003227523,9.711555e-7,0.000007571839,0.0005746354,0.975063,0.008243807,0.0065755034,0.007104487],"study_design_scores_gemma":[0.0025505964,0.009504107,0.025688654,0.000028011875,0.000032720865,0.00005677592,0.00010536107,0.004535956,0.77057254,0.0046006585,0.18154985,0.0007747575],"about_ca_topic_score_codex":0.0000016051018,"about_ca_topic_score_gemma":0.0000025582888,"teacher_disagreement_score":0.20449047,"about_ca_system_score_codex":0.0000031689624,"about_ca_system_score_gemma":0.000012888065,"threshold_uncertainty_score":0.16054511},"labels":[],"label_agreement":null},{"id":"W2124342026","doi":"10.1007/11925903_10","title":"DNA Codes and Their Properties","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":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computational biology; Computer science; Genetics; Biology","score_opus":0.016149814994548994,"score_gpt":0.21396516235836513,"score_spread":0.19781534736381615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124342026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1326686,0.0047791265,0.85561067,0.00028784183,0.0004891509,0.00032551348,0.000013942609,0.000044092885,0.00578105],"genre_scores_gemma":[0.99324507,0.000058703023,0.005091453,0.0006204957,0.00050482235,0.0000018718347,0.000019068993,0.0000131163315,0.00044542563],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987599,0.000015085868,0.00017785042,0.0006645127,0.000115311246,0.00026734133],"domain_scores_gemma":[0.9995109,0.000030525192,0.00007406498,0.00027067185,0.00006516524,0.000048668153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002226846,0.0002616076,0.00021824685,0.00007357122,0.00011741094,0.000093760624,0.00039304944,0.00025540948,0.0000030217511],"category_scores_gemma":[0.00003505512,0.00016489645,0.000053734628,0.000050674527,0.0006821839,0.0000033487784,0.0005383934,0.0001916568,0.000002441774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034499095,0.000033137007,0.00064542505,0.00006512247,0.000023289602,0.00001621108,0.00010598884,0.00406549,0.3894809,0.00034863557,0.00013146941,0.60504985],"study_design_scores_gemma":[0.0009494637,0.0022962466,0.002249219,0.0009888445,0.000027319598,0.00027486248,0.0000015053373,0.0544859,0.8212472,0.055373214,0.059043393,0.0030628291],"about_ca_topic_score_codex":0.0000083710565,"about_ca_topic_score_gemma":0.000035266272,"teacher_disagreement_score":0.86057645,"about_ca_system_score_codex":0.000015853604,"about_ca_system_score_gemma":0.0000726075,"threshold_uncertainty_score":0.67242825},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012131125040752326,"score_gpt":0.24580332724383253,"score_spread":0.2336722022030802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124920465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896766,0.000059625912,0.0049166325,0.00008213025,0.00003283614,0.00018216719,0.0000058402575,0.000012506466,0.0050316835],"genre_scores_gemma":[0.9982182,0.000014213857,0.0011782811,0.0004921447,0.000033220716,0.0000013009665,0.00003144543,0.0000033262377,0.000027860717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994273,0.000014498039,0.00023814761,0.00009078042,0.000099059056,0.00013016876],"domain_scores_gemma":[0.9996215,0.00003441861,0.00014335923,0.00012406804,0.00005306463,0.000023586947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009746985,0.00009455544,0.00012936488,0.00003876332,0.00002586198,0.000013900882,0.00008942764,0.000094529845,0.0000010143883],"category_scores_gemma":[0.0000873506,0.00006616077,0.000026985168,0.000094589705,0.00003305052,0.0000056510567,0.000018996041,0.0000577402,0.0000017485008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009826735,0.00029531095,0.0014931533,0.00029076537,0.000055711007,0.0000051885677,0.0007149181,0.88290495,0.030801093,0.0013007376,0.00022689381,0.0809286],"study_design_scores_gemma":[0.0038913304,0.008466813,0.027954984,0.00083467644,0.00003945495,0.000036450492,0.0010902254,0.7240358,0.2115726,0.0003598126,0.020550363,0.0011674961],"about_ca_topic_score_codex":0.000010927013,"about_ca_topic_score_gemma":0.0000015267573,"teacher_disagreement_score":0.1807715,"about_ca_system_score_codex":0.000008147507,"about_ca_system_score_gemma":0.000016223195,"threshold_uncertainty_score":0.26979578},"labels":[],"label_agreement":null},{"id":"W2126751817","doi":"10.1162/106454606775186446","title":"Chemical Genetic Algorithms—Evolutionary Optimization of Binary-to-Real-Value Translation in Genetic Algorithms","year":2005,"lang":"en","type":"article","venue":"Artificial Life","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Institute of Information and Communications Technology","keywords":"Evolvability; Algorithm; Binary number; Evolutionary algorithm; Fitness landscape; Computer science; Mathematical optimization; Biology; Mathematics; Genetics","score_opus":0.021378158806618447,"score_gpt":0.26595921179284415,"score_spread":0.2445810529862257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126751817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96522,0.00039507612,0.033180278,0.0005603639,0.000101566555,0.0002549025,0.000016387705,0.000020060204,0.00025140645],"genre_scores_gemma":[0.8880926,0.00007051905,0.110839926,0.00023014953,0.00060293503,0.00001369665,0.00011620755,0.000015046827,0.000018923569],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862003,0.00008517945,0.00047728032,0.00038758977,0.0001565983,0.00027334146],"domain_scores_gemma":[0.9995168,0.000025330517,0.000082330465,0.00018391825,0.000070063186,0.00012154609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013982126,0.00015320798,0.0001807529,0.00007745856,0.000048135087,0.000011245823,0.00016224697,0.00019957258,0.00002652397],"category_scores_gemma":[0.00009090091,0.000149304,0.00008211811,0.0002414408,0.000067422465,0.000005279531,0.00006852377,0.00007887914,0.000015464871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010699822,0.00019943071,0.002182719,0.000008771555,0.000013926115,0.0000024853907,0.00006653233,0.3181612,0.6360529,0.000041104802,0.00012204499,0.043041904],"study_design_scores_gemma":[0.0008659448,0.0008105519,0.050233416,0.00004228052,0.000039468177,0.000014224063,0.000087440254,0.74769187,0.1961536,0.00020713074,0.0031723042,0.0006818002],"about_ca_topic_score_codex":0.00006230598,"about_ca_topic_score_gemma":0.00001558765,"teacher_disagreement_score":0.4398993,"about_ca_system_score_codex":0.000023043049,"about_ca_system_score_gemma":0.00006823419,"threshold_uncertainty_score":0.60884404},"labels":[],"label_agreement":null},{"id":"W2127519911","doi":"","title":"Tiling Layouts with Dominoes","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Colored; Domino; Tile; Mathematics; Hexagonal tiling; Set (abstract data type); Combinatorics; Square tiling; Tessellation (computer graphics); Plane (geometry); Unit square; Discrete mathematics; Computer science; Grid; Geometry","score_opus":0.019659232827445576,"score_gpt":0.2392991311069203,"score_spread":0.21963989827947472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127519911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9831044,0.00005006774,0.0076896716,0.00067682,0.00008016394,0.000090532194,0.000027747732,0.000014426886,0.008266183],"genre_scores_gemma":[0.994985,0.000003141505,0.0029514888,0.0015664498,0.00013288774,0.000003855639,0.00020297035,0.00000870819,0.00014549674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992119,0.000016512922,0.000107470194,0.00029178985,0.00011554854,0.00025675356],"domain_scores_gemma":[0.99946964,0.000016829961,0.000037171492,0.00011207541,0.00013114295,0.00023316492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000732899,0.00012511208,0.00009569076,0.00010825524,0.00012670089,0.00004817571,0.00015131546,0.00009107526,0.0000481214],"category_scores_gemma":[0.00004175523,0.000100246456,0.00003413681,0.00015278319,0.00007406123,0.0000026972923,0.000022616176,0.00009482122,0.00004920363],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005817493,0.00036649988,0.044878002,0.00007730838,0.00043928126,0.0003913608,0.0002621765,0.63096607,0.03537726,0.20179796,0.0021068938,0.08275543],"study_design_scores_gemma":[0.020921182,0.016527014,0.6115958,0.0012704214,0.00017408484,0.0010103561,0.0021085916,0.01928105,0.08428956,0.1055562,0.12862922,0.008636477],"about_ca_topic_score_codex":0.0011038582,"about_ca_topic_score_gemma":0.0046320343,"teacher_disagreement_score":0.61168504,"about_ca_system_score_codex":0.00004281474,"about_ca_system_score_gemma":0.00059435284,"threshold_uncertainty_score":0.40879318},"labels":[],"label_agreement":null},{"id":"W2127955734","doi":"10.1016/j.jcss.2004.08.005","title":"Language equations, maximality and error-detection","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Nondeterministic algorithm; Prefix; Closure (psychology); Type (biology); Mathematics; Hierarchy; Regular language; Discrete mathematics; Code (set theory); Characterization (materials science); Computer science; Theoretical computer science; Linguistics; Programming language; Automaton; Set (abstract data type)","score_opus":0.020679599311732345,"score_gpt":0.2753569463597711,"score_spread":0.25467734704803874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127955734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9024916,0.0012421035,0.09588226,0.00008924164,0.00015176898,0.000023942916,4.211545e-7,0.0000028227387,0.00011580701],"genre_scores_gemma":[0.9968939,0.000020065136,0.0027868904,0.00003931174,0.00025389975,1.5910902e-7,2.1350712e-7,9.308615e-7,0.0000046235527],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999561,0.000041241674,0.00015358232,0.000092484865,0.00008352035,0.00006818451],"domain_scores_gemma":[0.9997738,0.000012841877,0.00010389119,0.00003196101,0.00003806602,0.000039432452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053495634,0.000044086428,0.000081940925,0.000028044105,0.00010750359,0.00005206809,0.00007023502,0.00003208646,2.6819876e-7],"category_scores_gemma":[0.00001215105,0.000027426368,0.000026795033,0.00004794579,0.00007507271,0.0000066942207,0.000043645425,0.000034399032,2.467869e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001354371,0.00013927951,0.022758858,0.00027873303,0.00011082022,0.000064553285,0.0013947234,0.0033572237,0.7363351,0.005405595,0.0001082657,0.22991142],"study_design_scores_gemma":[0.013367642,0.037666593,0.475516,0.0024532988,0.0002802156,0.018225193,0.024515385,0.060978442,0.34761897,0.0053764037,0.011041447,0.002960406],"about_ca_topic_score_codex":0.0000080674845,"about_ca_topic_score_gemma":0.000004360679,"teacher_disagreement_score":0.45275715,"about_ca_system_score_codex":0.000005113671,"about_ca_system_score_gemma":0.00001918354,"threshold_uncertainty_score":0.111841485},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018634289169360062,"score_gpt":0.29572710698552385,"score_spread":0.2770928178161638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132713666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895512,0.002195178,0.005772223,0.0008006172,0.001049397,0.00020992856,0.0000028247714,0.000019332478,0.00039931055],"genre_scores_gemma":[0.9982352,0.00024390753,0.00025891152,0.00014147577,0.0007722046,0.00003398407,0.00008250214,0.000007944922,0.00022386016],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991653,0.00003833881,0.00024743736,0.00026086258,0.000016474407,0.000271577],"domain_scores_gemma":[0.99965173,0.00015894185,0.00003989476,0.00010024428,0.000025675085,0.000023527171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045441426,0.00012806464,0.00017673704,0.00006712365,0.000042008312,0.000004069723,0.000096145275,0.00018312545,0.0000012959247],"category_scores_gemma":[0.00025918425,0.00007727156,0.000025051564,0.000105815416,0.00013127638,0.0000015383295,0.000029130999,0.00012047675,8.966173e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001179036,0.000035990277,0.05653344,0.000019474743,0.000012713401,0.0000023466177,0.000012556549,0.00096707453,0.927426,0.0012623034,0.0046454663,0.008964732],"study_design_scores_gemma":[0.0069744657,0.0057780044,0.23892125,0.00020886336,0.00003232173,0.00010380839,0.00008328331,0.03873021,0.023657933,0.0029032861,0.6816826,0.00092396804],"about_ca_topic_score_codex":0.00006722386,"about_ca_topic_score_gemma":0.00032712505,"teacher_disagreement_score":0.90376806,"about_ca_system_score_codex":0.00001098179,"about_ca_system_score_gemma":0.000009177202,"threshold_uncertainty_score":0.31510425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009755713941148563,"score_gpt":0.26802959689483413,"score_spread":0.2582738829536856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132853600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956164,0.0011765852,0.0008656583,0.00033507007,0.00035168862,0.0001398245,9.075222e-7,0.00006592453,0.0014479418],"genre_scores_gemma":[0.9947191,0.000010055451,0.003267147,0.0012751031,0.0005893886,2.6412033e-7,0.000054828077,0.000011053457,0.00007308762],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99827486,0.000109578425,0.00037913342,0.0005248373,0.00015553294,0.0005560833],"domain_scores_gemma":[0.99948025,0.00005385555,0.00011704912,0.00020909197,0.000064398366,0.00007535938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004116195,0.00023718923,0.00025858806,0.00007321465,0.00015856326,0.000056126493,0.0003399627,0.00019972173,0.0000044643834],"category_scores_gemma":[0.0001818214,0.0001951079,0.00012836025,0.0002687165,0.000041181833,0.0000047385483,0.00022175876,0.00037282796,0.000010731737],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009925798,0.0001733926,0.034374326,0.000025865806,0.000034707708,0.00007333833,0.0002322474,0.0016636347,0.6028205,0.00048694716,0.00087774673,0.359138],"study_design_scores_gemma":[0.0038685258,0.0019341736,0.7600059,0.00041313007,0.00003097729,0.0003281208,0.0004743697,0.07741291,0.13937376,0.0015579422,0.012159235,0.002440958],"about_ca_topic_score_codex":0.000008610288,"about_ca_topic_score_gemma":0.0000055425994,"teacher_disagreement_score":0.7256316,"about_ca_system_score_codex":0.000027445361,"about_ca_system_score_gemma":0.000023269255,"threshold_uncertainty_score":0.79562694},"labels":[],"label_agreement":null},{"id":"W2137261954","doi":"10.1145/1140378.1140380","title":"Jordan algebras arising from intermolecular recombination","year":2005,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intermolecular force; Identity (music); Recombination; Linearization; Representation (politics); Mathematics; Degree (music); Polynomial; Combinatorics; Pure mathematics; Physics; Quantum mechanics; Genetics; Biology; Molecule; Nonlinear system; Mathematical analysis; Political science","score_opus":0.011870466347536704,"score_gpt":0.2415329319094654,"score_spread":0.2296624655619287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137261954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920111,0.00054876256,0.002178718,0.0031193465,0.0001492096,0.00009708103,0.0000061590845,0.000037020778,0.0018526397],"genre_scores_gemma":[0.98745626,0.000037725225,0.009435601,0.001901441,0.00054826605,0.0000062365452,0.0002742299,0.000017453911,0.0003227582],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894255,0.00009065798,0.0002176096,0.00041331863,0.0000974232,0.00023843486],"domain_scores_gemma":[0.99935305,0.00004819528,0.00005899211,0.00042035262,0.000050278988,0.00006911101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017633803,0.00015432954,0.00012774089,0.000025077921,0.00009017543,0.000046226527,0.00038475468,0.00016647163,0.0002897199],"category_scores_gemma":[0.0005688524,0.00013793528,0.00009742083,0.000049750583,0.000043258988,0.0000018244108,0.00034789366,0.00012516209,0.00018864807],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004737666,0.00010462113,0.001563468,0.0000037250913,0.000047299833,0.000007269342,0.000031688,0.000031062347,0.8269953,0.00012268679,0.015913233,0.15513228],"study_design_scores_gemma":[0.00042558674,0.00025131844,0.004243463,0.000025392843,0.000015675732,0.000008150467,0.000034894045,0.00008883322,0.39682227,0.0009233069,0.5968454,0.00031568995],"about_ca_topic_score_codex":0.000026324748,"about_ca_topic_score_gemma":0.00000802816,"teacher_disagreement_score":0.5809322,"about_ca_system_score_codex":0.00001659776,"about_ca_system_score_gemma":0.000011894627,"threshold_uncertainty_score":0.5624837},"labels":[],"label_agreement":null},{"id":"W2139956811","doi":"10.3233/fi-2015-1206","title":"A Formal Language Model of DNA Polymerase Enzymatic Activity","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"DNA polymerase; Polymerase; Computer science; Enzyme; Computational biology; Chemistry; Biochemistry; Biology","score_opus":0.03267416658293723,"score_gpt":0.274254291025642,"score_spread":0.2415801244427048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139956811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823393,0.00006114847,0.008651569,0.00004922084,0.000050069295,0.0001352312,0.000027932037,0.000016464497,0.00866907],"genre_scores_gemma":[0.9970026,0.000004306268,0.0022517587,0.00038013936,0.000048563437,0.0000075508847,0.000059358183,0.0000059651425,0.00023973236],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992239,0.000024652312,0.000257822,0.000098016964,0.00014864473,0.00024696853],"domain_scores_gemma":[0.99946207,0.000010595169,0.00013152961,0.00023375232,0.000039049755,0.00012297703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025062042,0.000119763434,0.00015527089,0.000030947776,0.000040387065,0.000020002266,0.00018066063,0.00008492,0.000016218168],"category_scores_gemma":[0.00007570063,0.00009160033,0.00007336095,0.00005897146,0.00006492369,0.00002091164,0.00023711118,0.00006466776,0.000021483542],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003397384,0.0002538663,0.0012803522,0.00016359019,0.00009618243,0.0000018432042,0.0020632849,0.0009044064,0.96788615,0.00059909845,0.0027654232,0.023646092],"study_design_scores_gemma":[0.0017742076,0.001077531,0.0003976073,0.000039419836,0.000032612286,0.000019102246,0.0019514312,0.08236178,0.9097479,0.00018722255,0.002003938,0.00040723913],"about_ca_topic_score_codex":0.000012728626,"about_ca_topic_score_gemma":0.0000029843086,"teacher_disagreement_score":0.08145737,"about_ca_system_score_codex":0.000014807968,"about_ca_system_score_gemma":0.00006666,"threshold_uncertainty_score":0.3735353},"labels":[],"label_agreement":null},{"id":"W2140709916","doi":"10.1002/jcd.21506","title":"Well‐Balanced Designs for Data Placement","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Abbotsford Veterinary Clinic; University of the Fraser Valley","funders":"Agence Nationale de la Recherche","keywords":"Conjecture; Mathematics; Variance (accounting); Set (abstract data type); Combinatorics; Replication (statistics); Value (mathematics); Server; Expected value; Element (criminal law); File size; Discrete mathematics; Existential quantification; Computer science; Statistics","score_opus":0.13556485426302842,"score_gpt":0.33849804791881555,"score_spread":0.20293319365578713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140709916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63909066,0.001540615,0.34132096,0.00065766624,0.014105238,0.0007853873,0.000038775484,0.000024488323,0.0024362253],"genre_scores_gemma":[0.9892816,0.000032022537,0.008204898,0.00018003769,0.0020643554,0.000002888724,0.00006250599,0.000013824267,0.0001578915],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885225,0.00011843144,0.00039228503,0.00019989195,0.00021149013,0.00022564548],"domain_scores_gemma":[0.99877864,0.000060239927,0.00031166078,0.0003112796,0.00035801416,0.00018018499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013695187,0.00013054711,0.00023481475,0.000032942953,0.000057093468,0.000040046147,0.00064400217,0.0001358263,0.0000057979682],"category_scores_gemma":[0.0006321596,0.00009770063,0.00009493053,0.000064501844,0.00003806939,0.000009738018,0.00018459301,0.00010610495,0.00000398118],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047067436,0.00068219414,0.0022441384,0.000034163157,0.00034934745,0.000028555069,0.000061786784,0.0004519472,0.6551972,0.0036654698,0.32877845,0.0037999793],"study_design_scores_gemma":[0.01347559,0.014871164,0.00025243306,0.00007230829,0.00016922012,0.000117332114,0.00019968892,0.0015886499,0.2056321,0.01664962,0.7463241,0.00064774614],"about_ca_topic_score_codex":0.0000014565801,"about_ca_topic_score_gemma":3.9670638e-7,"teacher_disagreement_score":0.44956514,"about_ca_system_score_codex":0.000026665597,"about_ca_system_score_gemma":0.00023337746,"threshold_uncertainty_score":0.3984116},"labels":[],"label_agreement":null},{"id":"W2141090792","doi":"10.1109/icc.2011.5963254","title":"Tight Capacity Bounds for Discrete Memoryless Channels with Synchronization Errors, Additive Noise, and Large Alphabets","year":2011,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Synchronization (alternating current); Channel capacity; Upper and lower bounds; Noise (video); Mathematics; Capacity planning; Topology (electrical circuits); Computer science; Algorithm; Discrete mathematics; Channel (broadcasting); Combinatorics; Telecommunications; Mathematical analysis","score_opus":0.019935289416904166,"score_gpt":0.2305397572176547,"score_spread":0.21060446780075054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141090792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.876845,0.00010377177,0.119903274,0.000041395386,0.00008063441,0.00028402187,0.00008753845,0.000022346088,0.002631991],"genre_scores_gemma":[0.995819,0.00001846435,0.002927607,0.00024668142,0.00015122884,0.000025488971,0.00029531255,0.000011814095,0.0005044251],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992505,0.000028735634,0.000105263156,0.00031977936,0.000051154522,0.00024457672],"domain_scores_gemma":[0.9996522,0.000010538292,0.000056283865,0.000118887365,0.000090635,0.00007143338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011860566,0.00013507491,0.00012168375,0.000012257325,0.00013801572,0.000020462341,0.0000840054,0.00011661149,0.00003768767],"category_scores_gemma":[0.000030687337,0.00008772265,0.00003453344,0.000044842232,0.000090941554,0.0000053599483,0.00007722464,0.000041891784,0.0000013437735],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043662046,0.002013992,0.12011556,0.0006741615,0.0018629231,0.00004440809,0.0043713683,0.00004895206,0.74385214,0.031490613,0.01953153,0.07162815],"study_design_scores_gemma":[0.0035058502,0.0046387217,0.024929272,0.00007899375,0.000120957695,0.000042076346,0.00073567696,0.0032553799,0.9202314,0.0012027296,0.040078588,0.0011803375],"about_ca_topic_score_codex":0.000015217983,"about_ca_topic_score_gemma":0.00007485687,"teacher_disagreement_score":0.1763793,"about_ca_system_score_codex":0.0000059636823,"about_ca_system_score_gemma":0.000016850248,"threshold_uncertainty_score":0.35772258},"labels":[],"label_agreement":null},{"id":"W2142652930","doi":"10.1109/cicybs.2009.4925098","title":"Genetic algorithm cryptanalysis of a substitution permutation network","year":2009,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Substitution (logic); Permutation (music); Computer science; Genetic algorithm; Cipher; Cryptanalysis; Algorithm; Cryptography; Theoretical computer science; Encryption; Computer network; Machine learning","score_opus":0.007615153256506683,"score_gpt":0.23731229888604768,"score_spread":0.229697145629541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142652930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7504114,0.00039910068,0.24784872,0.00003515221,0.00003161069,0.00004674765,9.933249e-7,0.000009401285,0.001216891],"genre_scores_gemma":[0.9625278,0.000043466018,0.036891837,0.00020171615,0.00020685978,8.49718e-7,0.000038588685,0.0000018953303,0.00008695484],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99947387,0.00002996229,0.00015354165,0.00015908339,0.000060908686,0.00012262218],"domain_scores_gemma":[0.9997447,0.0000043513105,0.000054475593,0.00010892514,0.00005869813,0.000028843777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008398769,0.00006590272,0.00008953735,0.000015147428,0.00003925643,0.00000670391,0.00007112198,0.00007504141,0.000020625308],"category_scores_gemma":[0.000021748883,0.00005022558,0.00007740917,0.00011516067,0.000026814341,0.0000010069465,0.000017646937,0.00002541332,0.0000029804316],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041707266,0.00010615309,0.006453617,0.0000050285917,0.0000686158,0.0000037965344,0.000011033272,0.0100904275,0.6597776,0.0014561525,0.00046537715,0.32152054],"study_design_scores_gemma":[0.0012775928,0.0029969881,0.6279936,0.00003423568,0.00020876115,0.000044751752,0.00006510994,0.06783358,0.27690932,0.007758723,0.014018357,0.000859017],"about_ca_topic_score_codex":0.000003884338,"about_ca_topic_score_gemma":0.000001599588,"teacher_disagreement_score":0.62153995,"about_ca_system_score_codex":0.0000037661714,"about_ca_system_score_gemma":0.000012433198,"threshold_uncertainty_score":0.20481397},"labels":[],"label_agreement":null},{"id":"W2152149926","doi":"10.1186/1471-2164-12-280","title":"Seeds for effective oligonucleotide design","year":2011,"lang":"en","type":"article","venue":"BMC Genomics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oligonucleotide; Biology; Computer science; Algorithm; Computational biology; Measure (data warehouse); Seeding; Data mining; DNA; Genetics; Agronomy","score_opus":0.047079620880345875,"score_gpt":0.2474410788837994,"score_spread":0.20036145800345354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152149926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73857,0.00013002167,0.25922683,0.000004102744,0.000117097676,0.00040025354,0.000006204111,0.0000150091955,0.0015305174],"genre_scores_gemma":[0.91135985,0.000011217845,0.087992035,0.00017658735,0.00022400318,0.000036056677,0.000020631947,0.000014413803,0.00016518029],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939376,0.000046506208,0.00010753816,0.00023187774,0.000022282064,0.0001980533],"domain_scores_gemma":[0.99968016,0.00003372672,0.000045080367,0.00015223351,0.00003954875,0.000049249382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020396958,0.000102416816,0.00009419084,0.000013515651,0.00006382849,0.000008931032,0.0001485614,0.000105372776,0.000005909405],"category_scores_gemma":[0.00007848838,0.000085144355,0.00009057397,0.000025872065,0.000035603414,9.2838076e-7,0.0000835659,0.000033359636,0.00001448816],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041255975,0.000061887804,0.003838651,0.000019043575,0.00004539785,8.256986e-7,0.000095620046,0.0001488609,0.9850505,0.00033057685,0.00077393895,0.009222134],"study_design_scores_gemma":[0.0005685003,0.001055935,0.0096291965,0.0000041183803,0.000024169656,0.0000069971425,0.0000571987,0.0006147017,0.9686032,0.0012966526,0.017876979,0.00026238218],"about_ca_topic_score_codex":0.000005296369,"about_ca_topic_score_gemma":0.0000059560607,"teacher_disagreement_score":0.1727899,"about_ca_system_score_codex":0.0000105768395,"about_ca_system_score_gemma":0.000029260664,"threshold_uncertainty_score":0.3472086},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007725269626223187,"score_gpt":0.2393898409633678,"score_spread":0.2316645713371446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156204758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9171789,0.000024732608,0.07806081,0.00014029184,0.000082348415,0.00004553967,8.0550416e-7,0.000009695745,0.0044568405],"genre_scores_gemma":[0.994843,0.0000058108612,0.0048489072,0.00020329235,0.0000915744,6.18758e-7,0.0000018271564,0.0000023540356,0.0000026155074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935454,0.00001997543,0.000090897665,0.00025604712,0.00012335171,0.00015519962],"domain_scores_gemma":[0.9997129,0.000018404031,0.000024351975,0.00013322112,0.000047954654,0.0000631901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026289077,0.000068573274,0.00007690821,0.000024158175,0.000082554485,0.000020801623,0.00018130138,0.00004022765,0.0000043732744],"category_scores_gemma":[0.00006207123,0.000048155,0.00002314407,0.00011923966,0.0013969118,0.000002812555,0.00014853034,0.00004577495,0.0000036697334],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025853946,0.0000359353,0.000103091326,0.000003528179,0.0000018790951,0.0000010718801,0.000020725989,0.00012563326,0.18747865,0.8071505,0.0000040168457,0.005049156],"study_design_scores_gemma":[0.000423972,0.0027231046,0.008123254,0.000033706518,0.0000044814255,0.000023480365,0.000008263304,0.0010458167,0.86706835,0.12013006,0.00022957704,0.00018590408],"about_ca_topic_score_codex":8.627153e-7,"about_ca_topic_score_gemma":4.1127032e-7,"teacher_disagreement_score":0.6870204,"about_ca_system_score_codex":0.000006276861,"about_ca_system_score_gemma":0.00003027989,"threshold_uncertainty_score":0.51469797},"labels":[],"label_agreement":null},{"id":"W2161391539","doi":"10.1109/isise.2009.37","title":"RFID Network Planning Based on MCPSO Alogorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Software deployment; Radio-frequency identification; Scheduling (production processes); Greedy algorithm; Wireless network; Distributed computing; Wireless; Computer network; Mathematical optimization; Algorithm; Telecommunications; Computer security","score_opus":0.013104179013398557,"score_gpt":0.2611281796093467,"score_spread":0.24802400059594815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161391539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79949045,0.00037065247,0.034584887,0.0009822268,0.0003167452,0.00017578538,0.000003200562,0.00011128247,0.16396476],"genre_scores_gemma":[0.9865488,0.0000031981167,0.004507955,0.0078242505,0.0006369553,0.0000011314384,0.000057581816,0.000004488541,0.00041565546],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993012,0.000032775053,0.00010514677,0.0002470549,0.00006744925,0.00024635892],"domain_scores_gemma":[0.99971634,0.000015770274,0.000028415834,0.00016308961,0.000019873665,0.000056490528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013175697,0.000106776264,0.00009166417,0.000011920826,0.000080408914,0.000017415403,0.00011864877,0.000115135095,0.000027370446],"category_scores_gemma":[0.000028388411,0.00007608187,0.000061584135,0.000062026054,0.000017446308,6.2623656e-7,0.00002684927,0.00007195438,0.000014001537],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086503493,0.0005944537,0.026525993,0.000014869305,0.000075246775,0.00008432186,0.00003522563,0.10082547,0.37460098,0.0038325617,0.114522755,0.3780231],"study_design_scores_gemma":[0.0033976221,0.013299884,0.113143645,0.0001555343,0.000038536637,0.00002786346,0.0000885297,0.06702348,0.17614648,0.0035554282,0.62109214,0.0020308804],"about_ca_topic_score_codex":0.0000013448771,"about_ca_topic_score_gemma":3.1948548e-7,"teacher_disagreement_score":0.5065694,"about_ca_system_score_codex":0.000004022606,"about_ca_system_score_gemma":0.000012196431,"threshold_uncertainty_score":0.31025288},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.004512639951644926,"score_gpt":0.24192520145966326,"score_spread":0.23741256150801834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162572810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987003,0.00009322282,0.010072593,0.00013220613,0.00002695741,0.00004469407,0.0000018806273,0.000009974386,0.002615418],"genre_scores_gemma":[0.99419755,0.00001511454,0.005407706,0.00025742073,0.00009532839,6.2763127e-7,0.000004334751,0.0000024776832,0.000019425162],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993459,0.000037699767,0.00010149192,0.00025143192,0.0001020914,0.0001614092],"domain_scores_gemma":[0.99971086,0.000016186359,0.000019337205,0.00015317497,0.000038487546,0.000061953295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031131887,0.00006535802,0.00007942169,0.000017785133,0.00007518515,0.000022939776,0.0002174105,0.000044629007,0.000065295266],"category_scores_gemma":[0.000022398544,0.000046637448,0.000025397529,0.00010511536,0.0012825333,0.0000032355144,0.00013812976,0.00004069325,0.0000050630492],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096399395,0.000089019944,0.0062447195,0.000019249534,0.000009880493,0.000003736401,0.00009396673,0.00007430746,0.5877197,0.089479215,0.00010635566,0.31606346],"study_design_scores_gemma":[0.0011443357,0.0031431837,0.10193577,0.00008589661,0.000025303176,0.00014200876,0.00004566489,0.01937634,0.8505664,0.019720655,0.0030783508,0.0007360808],"about_ca_topic_score_codex":0.0000016334147,"about_ca_topic_score_gemma":2.6013902e-7,"teacher_disagreement_score":0.31532738,"about_ca_system_score_codex":0.0000021350452,"about_ca_system_score_gemma":0.000012380774,"threshold_uncertainty_score":0.47255474},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01483284745428979,"score_gpt":0.2743296738512333,"score_spread":0.2594968263969435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163677685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87073267,0.000021841865,0.12495256,0.0006028375,0.00013590186,0.00018768903,0.0000022414642,0.000023979743,0.0033402515],"genre_scores_gemma":[0.9600326,0.0000022290217,0.036470223,0.003180575,0.00025291234,0.000002953921,0.000002193131,0.000006396311,0.000049914044],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984581,0.00006972598,0.00017539364,0.0005371083,0.00027253374,0.00048712554],"domain_scores_gemma":[0.9991978,0.000050929215,0.000027657103,0.00041614525,0.0001261341,0.00018138278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774105,0.00014427271,0.000109948225,0.000030222975,0.0005141933,0.00019410624,0.0010702965,0.00006292429,0.00015502094],"category_scores_gemma":[0.00008023465,0.00008518716,0.000060575716,0.00040685644,0.0018058905,0.0000074794066,0.0005269754,0.00011203294,0.000085733554],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021537524,0.000077569624,0.0001180666,0.00000446068,0.000008420063,0.000008406935,0.00019774702,0.0010980429,0.76399183,0.16686219,0.00015002958,0.067267865],"study_design_scores_gemma":[0.0013782583,0.007392548,0.010990493,0.00021694798,0.000060374194,0.00074436073,0.00012374253,0.24160405,0.6034977,0.09922866,0.032234296,0.0025285662],"about_ca_topic_score_codex":0.000004687497,"about_ca_topic_score_gemma":0.0000012533837,"teacher_disagreement_score":0.24050601,"about_ca_system_score_codex":0.000016740385,"about_ca_system_score_gemma":0.00009513211,"threshold_uncertainty_score":0.66538787},"labels":[],"label_agreement":null},{"id":"W2165734290","doi":"10.1142/s0129054105003145","title":"OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS","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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Substitution (logic); Computer science; Generalization; Closure (psychology); Coding (social sciences); Theoretical computer science; Cryptanalysis; Algorithm; Mathematics; Cryptography; Programming language","score_opus":0.016088233679205848,"score_gpt":0.3034733916116786,"score_spread":0.2873851579324727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165734290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3637076,0.0000085187985,0.6349248,0.00092156156,0.000093873066,0.00005200821,0.0000030132696,0.000001987737,0.0002866196],"genre_scores_gemma":[0.7929815,0.000010701706,0.20649472,0.00026507652,0.00022375592,0.0000014230017,0.000003377079,0.0000013676627,0.000018075196],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994189,0.0000071062914,0.00021119205,0.00008174688,0.00021832723,0.00006271813],"domain_scores_gemma":[0.9991477,0.000020895808,0.00009355263,0.00007650325,0.00060835405,0.000052956202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039539,0.000047862115,0.00005904578,0.00013245323,0.00008873378,0.00008829607,0.00033339582,0.0000144751975,0.0000027824321],"category_scores_gemma":[0.000043587155,0.000034286615,0.000020426596,0.00013605814,0.00014916193,0.00003196573,0.000077087636,0.000038371676,0.0000024993954],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001871352,0.00043160733,0.003951639,0.000011920079,0.00016048749,0.0000020807909,0.00074561086,0.124120675,0.2644287,0.036401443,0.0008198463,0.5687388],"study_design_scores_gemma":[0.003947925,0.010802641,0.07538555,0.0005760021,0.00008174982,0.0012375525,0.0004949692,0.14910889,0.50837415,0.00088189804,0.24787636,0.0012323238],"about_ca_topic_score_codex":6.976638e-7,"about_ca_topic_score_gemma":0.0000041031212,"teacher_disagreement_score":0.5675065,"about_ca_system_score_codex":0.000016479435,"about_ca_system_score_gemma":0.00010119407,"threshold_uncertainty_score":0.13981676},"labels":[],"label_agreement":null},{"id":"W2165739941","doi":"10.1109/ease.2009.8","title":"Design Pattern for Self-Organizing Emergent Systems Based on Digital Infochemicals","year":2009,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; USable; Generality; Context (archaeology); Set (abstract data type); Terminology; Human–computer interaction; Artificial intelligence; Distributed computing; Programming language; World Wide Web","score_opus":0.018732648130215517,"score_gpt":0.24207488437451297,"score_spread":0.22334223624429744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165739941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33291206,0.00009708535,0.66386133,0.00027967105,0.00014725071,0.00048502337,0.000010687574,0.000092424285,0.0021144405],"genre_scores_gemma":[0.99660456,0.0000037945317,0.0017043119,0.0012232135,0.00022920687,0.0000091743,0.00008987427,0.000008582402,0.00012728958],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922943,0.000021043148,0.00018019686,0.00026953866,0.00007430306,0.00022547714],"domain_scores_gemma":[0.9996283,0.000033337135,0.000047901663,0.0001643867,0.00005748751,0.00006859061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012264533,0.00013284231,0.00011427488,0.000016450891,0.00005397558,0.000057884998,0.0001364521,0.000120522054,0.0000072695916],"category_scores_gemma":[0.00007796138,0.00009566031,0.00007335219,0.000043342687,0.000008505138,0.0000018562426,0.000026131349,0.000038791357,0.0000090822305],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009790398,0.00025115712,0.0011379252,0.000022734868,0.000033606284,0.0000020698178,0.000009310488,0.0015857919,0.9740115,0.000054448137,0.0048023937,0.017991193],"study_design_scores_gemma":[0.0013096718,0.004102015,0.00059452147,0.00004608139,0.000023622486,0.0000071275695,0.000046022506,0.060128655,0.90646076,0.000111928704,0.026475998,0.0006936183],"about_ca_topic_score_codex":7.67037e-7,"about_ca_topic_score_gemma":5.91051e-8,"teacher_disagreement_score":0.6636925,"about_ca_system_score_codex":0.000010082103,"about_ca_system_score_gemma":0.000017859002,"threshold_uncertainty_score":0.39009145},"labels":[],"label_agreement":null},{"id":"W2170505565","doi":"10.1007/3-540-48017-x_31","title":"On P Systems with Global Rules","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":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Rewriting; Membrane computing; Universality (dynamical systems); Computer science; P system; String (physics); Theoretical computer science; Turing machine; Algorithm; Programming language; Mathematics","score_opus":0.013085861484728532,"score_gpt":0.22715342041083375,"score_spread":0.2140675589261052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170505565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012058315,0.0011154714,0.9595425,0.00010488055,0.00080897287,0.0003068539,0.000024037116,0.000040640698,0.025998292],"genre_scores_gemma":[0.9793579,0.000044904955,0.018056072,0.0009677806,0.0008549682,0.0000036125887,0.000032751217,0.00002005299,0.0006619398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983138,0.000017744816,0.00018599398,0.0008395627,0.0003009586,0.00034193366],"domain_scores_gemma":[0.9992504,0.00004239126,0.00010945204,0.00043395718,0.00008173196,0.000082069346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017271547,0.00030793253,0.00024544293,0.000060439314,0.00010266564,0.000113320304,0.0006127983,0.000305575,0.000009551922],"category_scores_gemma":[0.00003476261,0.00020445918,0.00006117814,0.000087961256,0.00039563567,0.0000026751907,0.0002816406,0.00022772141,0.000025971896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019229029,0.00014405214,0.001194885,0.00012151223,0.000093195464,0.00028395996,0.00004780499,0.12153541,0.003230612,0.019410156,0.00036650003,0.8533796],"study_design_scores_gemma":[0.00638542,0.034379,0.0047784843,0.00807748,0.00019731748,0.002623218,0.0000019643337,0.57759255,0.02304592,0.18954946,0.13967977,0.013689414],"about_ca_topic_score_codex":0.0000066123475,"about_ca_topic_score_gemma":0.000009715468,"teacher_disagreement_score":0.9672996,"about_ca_system_score_codex":0.000059918606,"about_ca_system_score_gemma":0.000071377945,"threshold_uncertainty_score":0.8337604},"labels":[],"label_agreement":null},{"id":"W2181361588","doi":"","title":"Parse Trees and Unique Queries in Context-Free Parallel Communicating Grammar Systems ∗","year":2013,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Computer science; Parsing; Programming language; Parse tree; Context (archaeology); Grammar; Tree (set theory); Construct (python library); Conjunction (astronomy); Theoretical computer science; Mathematics; Linguistics","score_opus":0.01654758649446355,"score_gpt":0.23247676245037324,"score_spread":0.21592917595590969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181361588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99319804,0.0017863198,0.0005755217,0.00037057008,0.000027760574,0.00022516507,0.0000019099402,0.000021132311,0.0037936051],"genre_scores_gemma":[0.99690527,0.00023258217,0.0020169553,0.00028902266,0.000035273577,0.000036725425,0.000024412868,0.000006561818,0.00045320386],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99924165,0.00013115388,0.0002045876,0.00019417048,0.000038385242,0.00019004982],"domain_scores_gemma":[0.9994543,0.000044354143,0.00005121929,0.00036039055,0.00003679885,0.000052895688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018000299,0.00011142495,0.00014722877,0.000016511147,0.000059603695,0.00005270279,0.0002625484,0.00012403856,0.000008947385],"category_scores_gemma":[0.00012713233,0.00007904906,0.000027789632,0.000038881135,0.000111227935,0.000003897944,0.00038978105,0.000086010645,0.000003937561],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010269277,0.00024702746,0.31293204,0.00009936715,0.00009800315,0.000009761729,0.0003234759,0.00017569665,0.6067393,0.02803621,0.004906803,0.04632962],"study_design_scores_gemma":[0.012911022,0.005734008,0.5584037,0.00076653564,0.00006842295,0.00029746236,0.031957835,0.029497279,0.085974485,0.016576126,0.25270694,0.0051061916],"about_ca_topic_score_codex":0.0014734515,"about_ca_topic_score_gemma":0.0011227067,"teacher_disagreement_score":0.5207648,"about_ca_system_score_codex":0.000004611841,"about_ca_system_score_gemma":0.000010110901,"threshold_uncertainty_score":0.32235274},"labels":[],"label_agreement":null},{"id":"W2201326897","doi":"10.1007/s00200-019-00386-y","title":"Greedy construction of DNA codes and new bounds","year":2019,"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":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Bounded function; Greedy algorithm; Upper and lower bounds; Mathematics; Constant (computer programming); GC-content; Construct (python library); Content (measure theory); Discrete mathematics; Algorithm; Computer science; Biology; Genetics; Genome","score_opus":0.0066870112552000205,"score_gpt":0.20987445508176425,"score_spread":0.20318744382656423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201326897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99005145,0.0010720169,0.008316128,0.000052519983,0.000021914195,0.00010628946,5.56889e-7,0.000016693682,0.00036243393],"genre_scores_gemma":[0.98747265,0.00018434307,0.012234344,0.00004169146,0.000023495371,0.0000016056499,0.000018306875,0.000006496984,0.000017052009],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994931,0.000020473397,0.00017739317,0.00015961193,0.000037692986,0.00011170382],"domain_scores_gemma":[0.99962056,0.000047670503,0.00006009571,0.00021725461,0.000017840517,0.00003658485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001784214,0.0000828772,0.00012950019,0.000033334345,0.000033145596,0.000018418903,0.0001214172,0.000073644085,0.000002488491],"category_scores_gemma":[0.000020389161,0.00008250337,0.000017075163,0.00008891154,0.00004184559,0.0000040095374,0.0002325348,0.00008734202,8.5092586e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028851173,0.00004093743,0.1166043,0.00013727289,0.000039234015,2.3492068e-7,0.00014998135,0.003739303,0.8005955,0.01931157,0.00003415116,0.059318658],"study_design_scores_gemma":[0.005087724,0.0009905151,0.31825987,0.00076156604,0.000050010676,0.00017960841,0.0011472177,0.39047563,0.25186592,0.0056061866,0.023847412,0.0017283349],"about_ca_topic_score_codex":0.000042927702,"about_ca_topic_score_gemma":0.0000033033248,"teacher_disagreement_score":0.5487296,"about_ca_system_score_codex":0.000004603114,"about_ca_system_score_gemma":0.000009977264,"threshold_uncertainty_score":0.33643898},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007562128177110418,"score_gpt":0.2532331923620461,"score_spread":0.2456710641849357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257571149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.968067,0.000028473123,0.0041840435,0.0003410974,0.00017277474,0.00012249098,0.0000012543992,0.000029023035,0.02705384],"genre_scores_gemma":[0.9952534,0.000009398542,0.0045236666,0.00014937694,0.000028900236,0.0000036161807,0.000003141998,0.0000013652173,0.000027121838],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998658,0.000012034798,0.00029492163,0.00023891228,0.0003717642,0.0004243745],"domain_scores_gemma":[0.9994896,0.000013367545,0.00013975517,0.00016712635,0.00012845999,0.00006169295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023423114,0.00010366172,0.00009583017,0.00059906003,0.0004179936,0.00015954963,0.0006800788,0.000080386046,0.0000046808277],"category_scores_gemma":[0.00040041853,0.00006593825,0.000017051332,0.003764457,0.0015417017,0.00017333259,0.0001978258,0.00008074871,0.000010603028],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002664263,0.00009771224,0.4353499,0.00006488592,0.000008479699,0.0000101849455,0.0016280445,0.0016001548,0.3216353,0.091284476,0.00012945903,0.14792497],"study_design_scores_gemma":[0.0007178301,0.0034811874,0.30418563,0.00009676949,0.0000034870557,0.00030490206,0.012088749,0.00127115,0.63997453,0.0024630884,0.034586478,0.00082622236],"about_ca_topic_score_codex":0.000016305556,"about_ca_topic_score_gemma":0.0000538285,"teacher_disagreement_score":0.31833923,"about_ca_system_score_codex":0.00002690933,"about_ca_system_score_gemma":0.00018248125,"threshold_uncertainty_score":0.56804645},"labels":[],"label_agreement":null},{"id":"W2272561321","doi":"10.1007/s11047-015-9538-x","title":"On the overlap assembly of strings and languages","year":2016,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; String (physics); Formal language; Concatenation (mathematics); Substitution (logic); Theoretical computer science; Extension (predicate logic); Catenation; Context (archaeology); Algorithm; Mathematics; Programming language; DNA; Arithmetic; Genetics; Biology","score_opus":0.008136046411732654,"score_gpt":0.2525398961503987,"score_spread":0.24440384973866602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272561321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978238,0.00042580345,0.00024737764,0.00032980286,0.000050821225,0.00004888447,0.0000016519058,0.000009670336,0.0010621921],"genre_scores_gemma":[0.9992715,0.000009577971,0.00017983638,0.0003030168,0.000119813514,2.395367e-7,0.0000018921496,0.0000039000397,0.0001102117],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951535,0.00004160812,0.00009584621,0.00015665592,0.000066324166,0.00012423906],"domain_scores_gemma":[0.9996122,0.00017389221,0.000061852326,0.00010173581,0.00003184145,0.000018483084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017552379,0.0000729769,0.00007421461,0.000010848298,0.000059341943,0.0000090232525,0.00011349635,0.000055041917,0.0000024511007],"category_scores_gemma":[0.00027992623,0.00003184756,0.000037988044,0.000035273722,0.000052641946,0.0000011743772,0.00014597939,0.000065649845,0.000001403087],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021908627,0.0000073901965,0.0035721366,0.0000045069005,0.000013119456,8.447974e-7,0.000008427409,0.0000023372195,0.9479377,0.0031564473,0.0002262749,0.045048896],"study_design_scores_gemma":[0.00065677427,0.00062177825,0.07134007,0.00016576638,0.000010061459,0.000018977382,0.00017901599,0.00043952934,0.92391133,0.00037135492,0.0020032858,0.00028202325],"about_ca_topic_score_codex":0.000003966569,"about_ca_topic_score_gemma":8.9518716e-7,"teacher_disagreement_score":0.06776793,"about_ca_system_score_codex":0.0000033231659,"about_ca_system_score_gemma":0.000005409851,"threshold_uncertainty_score":0.1298706},"labels":[],"label_agreement":null},{"id":"W2317982700","doi":"10.3765/bls.v30i2.910","title":"On the Two Salish Object Agreement Suffixes","year":2014,"lang":"en","type":"article","venue":"Proceedings of the Annual Meeting of the Berkeley Linguistics Society","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Linguistics; Object (grammar); Agreement; Computer science; Natural language processing; Artificial intelligence; Philosophy","score_opus":0.009889603648924907,"score_gpt":0.24072010306093047,"score_spread":0.23083049941200556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317982700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9752774,0.00008448681,0.000014828917,0.00063234905,0.00051036006,0.00023283437,0.000021488902,0.000013117521,0.023213118],"genre_scores_gemma":[0.99698305,0.000018996598,0.00088723516,0.0008481881,0.0009098018,0.000005192218,0.000002354206,0.000016304231,0.0003288667],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986892,0.000051952222,0.00035953213,0.0002840738,0.00032971226,0.00028553736],"domain_scores_gemma":[0.99811584,0.00021863096,0.00052182475,0.00028513544,0.0008220263,0.000036536803],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0014682931,0.00019455438,0.00020849462,0.000007442725,0.0003467635,0.000031369666,0.0011173775,0.000120223995,0.0000023948476],"category_scores_gemma":[0.010066585,0.00009245354,0.0004445054,0.00015642845,0.0003504397,0.0000015793521,0.0008738519,0.0002420941,9.597658e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021080086,0.0004770012,0.055817265,0.00043130227,0.00057320116,9.122335e-8,0.0029127034,0.0007171827,0.7661839,0.07877093,0.09261567,0.0012899397],"study_design_scores_gemma":[0.0007609728,0.00081577164,0.0059920754,0.0006354357,0.0001962088,0.0000032718924,0.002146601,0.00092378596,0.93265,0.015113774,0.04026133,0.0005007526],"about_ca_topic_score_codex":0.00003758821,"about_ca_topic_score_gemma":0.0000032712712,"teacher_disagreement_score":0.16646612,"about_ca_system_score_codex":0.000015463429,"about_ca_system_score_gemma":0.000029540566,"threshold_uncertainty_score":0.99827206},"labels":[],"label_agreement":null},{"id":"W2328225175","doi":"10.1142/9789812704313_0009","title":"CREATING A NATURAL LANGUAGE INTERFACE FOR MULTI-AGENT SYSTEMS","year":2003,"lang":"en","type":"article","venue":"Active Media Technology","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Natural language user interface; Interface (matter); Natural (archaeology); Human–computer interaction; Interface description language; Natural language; User interface; Programming language; Natural language processing; Operating system","score_opus":0.019289617706065403,"score_gpt":0.29474049858475676,"score_spread":0.27545088087869135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328225175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97366834,0.004225399,0.02073047,0.00006330364,0.0005233982,0.00032671547,0.000014027027,0.000073284784,0.00037507722],"genre_scores_gemma":[0.99309826,0.000018661787,0.006358097,0.000052792755,0.00009801897,0.000074037875,0.000035839108,0.000013571775,0.0002507382],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991419,0.000049488295,0.0001466919,0.00033067897,0.0000449344,0.00028635998],"domain_scores_gemma":[0.99956083,0.0000528048,0.00008228991,0.00019432185,0.00007468441,0.000035063604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012897528,0.000138561,0.00016604953,0.000059704827,0.00007699968,0.000010785806,0.000184429,0.00025016448,0.000003795634],"category_scores_gemma":[0.0013654078,0.00010713475,0.000060835657,0.00010456047,0.000103625796,0.0000020132761,0.00009472906,0.00014904974,0.0000059284976],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039686005,0.000055952387,0.0010987284,0.000014500911,0.000058767808,0.000004312073,0.00013149151,0.000008526917,0.9802221,0.0011520209,0.00011973093,0.017094148],"study_design_scores_gemma":[0.0008314167,0.00035801792,0.00030403264,0.000021198275,0.000015981925,0.000043160253,0.003709276,0.00069746707,0.97207093,0.00007036065,0.021642173,0.00023595554],"about_ca_topic_score_codex":0.0000066820558,"about_ca_topic_score_gemma":0.00001228403,"teacher_disagreement_score":0.021522442,"about_ca_system_score_codex":0.000022089958,"about_ca_system_score_gemma":0.00002042891,"threshold_uncertainty_score":0.43688285},"labels":[],"label_agreement":null},{"id":"W2340406802","doi":"","title":"Dna watson-crick complementarity in computer science","year":2010,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Combinatorics; Mathematics; Complementarity (molecular biology); Prefix; Discrete mathematics; DNA; Base pair; Genetics; Philosophy; Biology","score_opus":0.013392567940052674,"score_gpt":0.2721695159290608,"score_spread":0.25877694798900813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340406802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99239445,0.0000057817892,0.004343786,0.00016566443,0.00025142095,0.00007197408,0.0000014904698,0.000011582743,0.0027538587],"genre_scores_gemma":[0.9866807,0.0000015265465,0.012291993,0.0007637136,0.00018716784,0.000001579686,0.000017325074,0.0000027555895,0.000053224092],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922717,0.000014355175,0.00012227814,0.00030071344,0.00008467027,0.00025079155],"domain_scores_gemma":[0.9996865,0.0000076636725,0.000020878466,0.00018477434,0.00003937608,0.000060854785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003397503,0.00007637133,0.0000716577,0.000030106126,0.00008090632,0.000031119336,0.0002723526,0.000055157932,0.00008591275],"category_scores_gemma":[0.000027129674,0.000055446384,0.00002914486,0.000121729725,0.00019288492,0.0000024187348,0.00031993253,0.000111375586,0.000014680203],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059396452,0.000048436264,0.0476105,0.0000014488184,0.000001628435,0.0000012437768,0.0000070635415,0.000005242956,0.94047165,0.00046960916,0.00029133557,0.011085894],"study_design_scores_gemma":[0.00070203206,0.00037801536,0.23643498,0.000004650083,0.0000025512647,0.000017818284,0.000024021549,0.0037736867,0.72522837,0.00060439087,0.032471232,0.00035828067],"about_ca_topic_score_codex":0.00007331068,"about_ca_topic_score_gemma":0.00038593417,"teacher_disagreement_score":0.21524331,"about_ca_system_score_codex":0.00000547127,"about_ca_system_score_gemma":0.000032826534,"threshold_uncertainty_score":0.2261038},"labels":[],"label_agreement":null},{"id":"W2379462493","doi":"","title":"Discussion of the Application of Recursion Algorithm in Programming","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Recursion (computer science); Mutual recursion; Computer science; Double recursion; Realization (probability); Algorithm; Divide and conquer algorithms; Theoretical computer science; Mathematics","score_opus":0.005012542226036987,"score_gpt":0.2467196181740431,"score_spread":0.2417070759480061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2379462493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1982045,0.00015068655,0.80028695,0.00046091538,0.000008735846,0.00073035964,0.0000063479097,0.000009374601,0.00014209711],"genre_scores_gemma":[0.895152,0.000008176679,0.10459557,0.000079819154,0.000059164893,0.000035987545,0.000037032645,0.0000030666029,0.000029214061],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944544,0.000026000273,0.0002074091,0.00018031882,0.000049499326,0.00009132361],"domain_scores_gemma":[0.99961793,0.000005214685,0.000111274785,0.00020831826,0.00004136446,0.000015911022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009287656,0.00006298324,0.00008336439,0.000022142014,0.000036060173,0.0000037118698,0.00022914686,0.000067626024,4.517505e-7],"category_scores_gemma":[9.5132214e-7,0.00003550375,0.000059558275,0.00019784251,0.0000411834,0.0000015129062,0.00008605858,0.000049841667,6.859194e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024473213,0.00008342238,0.00091996667,0.000004232706,0.0000013717957,1.0625652e-8,0.000012395345,0.000021352036,0.4137779,0.00011684666,0.000023511748,0.5850366],"study_design_scores_gemma":[0.00042993837,0.00023568746,0.06288126,0.00004874288,0.000009347377,0.000005641346,0.000034994126,0.0015831817,0.6203527,0.0016701064,0.3125668,0.00018163101],"about_ca_topic_score_codex":0.0000050107674,"about_ca_topic_score_gemma":0.0000023762718,"teacher_disagreement_score":0.69694746,"about_ca_system_score_codex":0.0000059592394,"about_ca_system_score_gemma":0.000012059871,"threshold_uncertainty_score":0.14478008},"labels":[],"label_agreement":null},{"id":"W2394530209","doi":"","title":"Template-Guided DNA Recombination.","year":2003,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Saskatchewan","funders":"","keywords":"Recombination; DNA; Gene; Genetics; Process (computing); Computer science; Genome; Computational biology; Biology; Homologous recombination; Theoretical computer science; Evolutionary biology; Programming language","score_opus":0.024802027438084077,"score_gpt":0.2664438342051604,"score_spread":0.2416418067670763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394530209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95033664,0.00014732992,0.0007651695,0.000115382645,0.00019215322,0.00006017317,0.0000015249932,0.00001794079,0.04836369],"genre_scores_gemma":[0.9964125,0.000016054031,0.0008624497,0.00035518775,0.00008885615,0.0000033941628,0.00003800644,0.000005708054,0.0022178285],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994901,0.000048148257,0.000102463724,0.00017946737,0.000041728523,0.00013809952],"domain_scores_gemma":[0.99975926,0.000007675306,0.000029786446,0.00012992875,0.000035033736,0.00003832544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014814196,0.00006825549,0.000059884776,0.000012089298,0.00005898407,0.000013184958,0.000080427264,0.00008691794,0.000058791582],"category_scores_gemma":[0.00014501848,0.000054784832,0.00004411215,0.000051272764,0.000021205644,9.404688e-7,0.000029792594,0.00003895694,0.000045107037],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011662702,0.000063755346,0.007056236,0.0000073655006,0.000027844293,0.0000051133934,0.000013666917,0.000018231394,0.95781696,0.004520648,0.022633947,0.007824588],"study_design_scores_gemma":[0.00036620558,0.00017277093,0.002799093,0.000004057987,0.0000041802055,0.00002144123,0.00001765764,0.000017406606,0.41146335,0.0014709543,0.5834929,0.00017002926],"about_ca_topic_score_codex":0.0000020857344,"about_ca_topic_score_gemma":9.477473e-7,"teacher_disagreement_score":0.5608589,"about_ca_system_score_codex":0.0000045382894,"about_ca_system_score_gemma":0.000017950533,"threshold_uncertainty_score":0.22340606},"labels":[],"label_agreement":null},{"id":"W2394623614","doi":"","title":"Descriptional Complexity of Block-Synchronization Context-Free Grammars.","year":2002,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Context-sensitive grammar; Tree-adjoining grammar; Symbol (formal); Indexed grammar; Context-free grammar; Abstract family of languages; Synchronization (alternating current); Computer science; L-attributed grammar; Context (archaeology); Rule-based machine translation; Block (permutation group theory); Mathematics; Theoretical computer science; Programming language; Natural language processing; Combinatorics; Second-generation programming language; Topology (electrical circuits)","score_opus":0.05291241192464367,"score_gpt":0.23365970887435047,"score_spread":0.18074729694970681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394623614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98989004,0.00079359073,0.00541109,0.00034097536,0.0001290176,0.000093839684,0.000030082922,0.000017588336,0.0032937892],"genre_scores_gemma":[0.9978055,0.000029380331,0.0014206918,0.0002124312,0.00018770149,0.0000019240788,0.00008599782,0.0000048041697,0.00025162258],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994726,0.00003344332,0.00014076056,0.00015763317,0.000075124,0.000120425655],"domain_scores_gemma":[0.99964476,0.000006931637,0.0000578094,0.00018538868,0.000070979586,0.000034137403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006882725,0.00007199039,0.000087847846,0.000013461548,0.000047431167,0.000007538257,0.00016640725,0.0000809114,0.00012147059],"category_scores_gemma":[0.00010380929,0.000060749982,0.000055349068,0.000052945135,0.00014245116,0.0000014294756,0.00011311648,0.00004061994,0.000010969673],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001093768,0.00038912307,0.029066544,0.00005316283,0.0001059914,0.0000053018766,0.000082419334,0.00013567714,0.8666218,0.016058989,0.024920588,0.06245106],"study_design_scores_gemma":[0.0069951657,0.004798861,0.090636134,0.00012214456,0.00010586862,0.00014775251,0.00028377544,0.024927502,0.4465792,0.025161482,0.39842483,0.001817308],"about_ca_topic_score_codex":0.00001197916,"about_ca_topic_score_gemma":0.000016494158,"teacher_disagreement_score":0.42004257,"about_ca_system_score_codex":0.000006215311,"about_ca_system_score_gemma":0.0000061544497,"threshold_uncertainty_score":0.24773124},"labels":[],"label_agreement":null},{"id":"W2395723593","doi":"","title":"Deciding if a Regular Language is Generated by a Splicing System","year":2011,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Syntactic monoid; RNA splicing; Regular language; Computer science; Class (philosophy); Function (biology); Word (group theory); Subclass; Mathematics; Genetics; Combinatorics; Monoid; Theoretical computer science; Artificial intelligence; Biology; Gene; Free monoid","score_opus":0.014914647604156863,"score_gpt":0.22012459200630557,"score_spread":0.2052099444021487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395723593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98067135,0.00050298474,0.0071536545,0.000014778387,0.000060573864,0.00008007157,0.000005223338,0.000055276727,0.011456097],"genre_scores_gemma":[0.9946293,0.000009621809,0.0032266246,0.00048864144,0.00012075195,0.0000042756383,0.000040939634,0.000011352382,0.0014684615],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992365,0.000039958137,0.00014933254,0.00029541925,0.000057546964,0.0002212289],"domain_scores_gemma":[0.9996464,0.0000041070143,0.00004578119,0.00020516232,0.00003389016,0.00006462803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001396652,0.00011762697,0.000110742534,0.000015294134,0.00007264187,0.000016597203,0.00014836693,0.00012962297,0.000049713733],"category_scores_gemma":[0.00001468305,0.00008548454,0.00006200863,0.00006957629,0.00002182501,0.0000013968545,0.0001102904,0.000046801168,0.000022382825],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015376289,0.000015920037,0.00079340965,0.00000940262,0.0000233362,0.0000063847256,0.000095193674,6.172492e-7,0.9942043,0.0001396719,0.0030346345,0.00166175],"study_design_scores_gemma":[0.00017622305,0.00012757425,0.0001932313,0.000015289117,0.000008775264,0.00002083082,0.00051145884,0.00044177397,0.99507946,0.000005645043,0.0032616558,0.00015805497],"about_ca_topic_score_codex":0.00009833345,"about_ca_topic_score_gemma":0.0000033473739,"teacher_disagreement_score":0.013957991,"about_ca_system_score_codex":0.0000092646505,"about_ca_system_score_gemma":0.000009602014,"threshold_uncertainty_score":0.34859586},"labels":[],"label_agreement":null},{"id":"W239667665","doi":"","title":"Combinatorics of geometrically distributed random variables: Words and permutations avoiding two or three adjacent patterns.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014683049783149306,"score_gpt":0.2530496073354097,"score_spread":0.2383665575522604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W239667665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800346,0.0005590629,0.018367443,0.00008416657,0.00045008986,0.00023513792,0.00004748038,0.00002600497,0.00019602117],"genre_scores_gemma":[0.99924695,0.00016782415,0.00027119048,0.00006691067,0.000020722591,0.000012920884,0.00017570764,0.000015623304,0.000022139637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872035,0.000084113126,0.0003552176,0.0003638274,0.00017562164,0.00030084405],"domain_scores_gemma":[0.9991798,0.00014154102,0.00015514431,0.00024942728,0.00014801278,0.00012609157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824458,0.00019690832,0.0002935677,0.00006760536,0.00017742315,0.000037249978,0.00022433145,0.00015291946,0.000011753839],"category_scores_gemma":[0.00056754926,0.00015258483,0.00008509006,0.00042075705,0.00009141124,0.0000067941646,0.00023933973,0.00017253867,0.000001826857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014969909,0.0022391928,0.22841397,0.00030319951,0.00061762345,0.00008374105,0.000401259,0.0016577421,0.17664309,0.581005,0.00030631223,0.0068319086],"study_design_scores_gemma":[0.048276912,0.0054792664,0.071958035,0.0004353985,0.00033751348,0.0001307437,0.00087483117,0.000981584,0.14145185,0.72512764,0.0029542611,0.001991932],"about_ca_topic_score_codex":0.000056176857,"about_ca_topic_score_gemma":0.000016246073,"teacher_disagreement_score":0.15645593,"about_ca_system_score_codex":0.000038669867,"about_ca_system_score_gemma":0.00008266005,"threshold_uncertainty_score":0.6222229},"labels":[],"label_agreement":null},{"id":"W2397253249","doi":"","title":"Monophonic and Geodetic Domination in the Join, Corona and Composition of Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Geodetic datum; Mathematics; Corona (planetary geology); Composition (language); Combinatorics; Geography; Geodesy; Linguistics; Physics; Astrobiology","score_opus":0.006414856909951176,"score_gpt":0.2134124954096739,"score_spread":0.20699763849972275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397253249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.998846,0.0006049441,0.000006058249,0.00013088669,0.00006559908,0.000145925,7.5525634e-7,0.0000023860975,0.00019747905],"genre_scores_gemma":[0.9996769,0.00011901057,0.00006451081,0.00010436467,0.0000031934471,0.000008755409,0.00001496105,0.000002564619,0.0000057503635],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9995762,0.000066904424,0.000107509106,0.00012223792,0.0000445955,0.00008253323],"domain_scores_gemma":[0.9997957,0.00002944506,0.00004268354,0.000084532716,0.00003065622,0.000017002047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014107238,0.000058052312,0.00007309472,0.000017921857,0.000034440196,0.00001483543,0.00006356947,0.00005995668,0.0000023734876],"category_scores_gemma":[0.000017889268,0.000039705734,0.000015824982,0.00005019999,0.00007130989,0.000003223582,0.000051379182,0.00004549463,8.305113e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027209671,0.0001089168,0.04111113,0.000024809919,0.000013207594,0.0000011146676,0.00013978405,0.0000027890283,0.92605263,0.022600602,0.00021110784,0.009706669],"study_design_scores_gemma":[0.0013698076,0.00075640983,0.78551316,0.000027538345,0.0000136932185,0.000018072597,0.00018273512,0.00056009763,0.059693627,0.1514987,0.00018776319,0.00017840468],"about_ca_topic_score_codex":0.00003892515,"about_ca_topic_score_gemma":0.0000029391779,"teacher_disagreement_score":0.86635906,"about_ca_system_score_codex":0.0000025817158,"about_ca_system_score_gemma":0.0000042753654,"threshold_uncertainty_score":0.16191529},"labels":[],"label_agreement":null},{"id":"W2397983538","doi":"","title":"Linked reduction systems for permutations.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reduction (mathematics); Mathematics; Geometry","score_opus":0.012522776211883049,"score_gpt":0.25960557873859136,"score_spread":0.2470828025267083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397983538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949971,0.00012994542,0.0002778154,0.000090218324,0.00354282,0.00022175413,0.000004735297,0.000025193434,0.00071041525],"genre_scores_gemma":[0.9989647,0.000011139855,0.0002757481,0.000031542513,0.00013436416,0.000038023627,0.00011240269,0.000009056041,0.0004230199],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947065,0.000021161566,0.00012118917,0.00020188086,0.00004615859,0.00013897922],"domain_scores_gemma":[0.9996246,0.000014716271,0.000049638576,0.00015922877,0.00010769513,0.000044092376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016163339,0.00007578753,0.000075575816,0.000015226805,0.00011029411,0.000029407363,0.00010634461,0.00015024413,0.0000033689173],"category_scores_gemma":[0.00012787794,0.000064805085,0.000055399392,0.00004479544,0.00003669482,0.0000020030266,0.00003390801,0.00008409818,0.0000068258946],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023194356,0.000044923854,0.00055630604,0.000010476837,0.000015540065,2.923961e-7,0.000012579818,0.000016179634,0.91186225,0.08428171,0.0023884806,0.0007880551],"study_design_scores_gemma":[0.0050595654,0.0028494534,0.013984308,0.000043578137,0.000100140904,0.0001720822,0.00047907987,0.0043112445,0.34850153,0.18323134,0.43982375,0.0014439211],"about_ca_topic_score_codex":0.000006233451,"about_ca_topic_score_gemma":9.132588e-7,"teacher_disagreement_score":0.5633607,"about_ca_system_score_codex":0.000004095801,"about_ca_system_score_gemma":0.000022369153,"threshold_uncertainty_score":0.26426744},"labels":[],"label_agreement":null},{"id":"W2398805757","doi":"","title":"Two kinds of equipackable paths and cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01355741222375918,"score_gpt":0.26237390274752986,"score_spread":0.2488164905237707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398805757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99362147,0.0011699187,0.000014492722,0.000022868015,0.00036252936,0.00005106765,0.000002412301,0.000008084359,0.004747136],"genre_scores_gemma":[0.9994708,0.00004160338,0.00025805653,0.00009444905,0.000034135322,0.0000022368974,0.00001435001,0.000006817047,0.00007759939],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994344,0.000036300793,0.0001192106,0.00013338523,0.000058276404,0.0002184284],"domain_scores_gemma":[0.99967504,0.000015092246,0.000053511507,0.00014734342,0.000031543306,0.00007748828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020130113,0.00008347713,0.00010972356,0.000013195786,0.00003854795,0.000006857237,0.00009048073,0.00008016098,0.0000088511115],"category_scores_gemma":[0.000051150622,0.000067858324,0.000037466536,0.00004881085,0.0000644127,0.0000031836335,0.00016756612,0.00004926803,0.000003924214],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031143478,0.000160165,0.22944029,0.000019914927,0.000033529977,9.745052e-7,0.00004633961,0.0000014870409,0.69546545,0.069841675,0.00057966006,0.004379351],"study_design_scores_gemma":[0.002341318,0.0009862949,0.12655224,0.000036702364,0.00004167568,0.000027283158,0.0001431131,0.000053294407,0.8092284,0.039897017,0.020135323,0.0005573345],"about_ca_topic_score_codex":0.000009926269,"about_ca_topic_score_gemma":8.149506e-7,"teacher_disagreement_score":0.11376294,"about_ca_system_score_codex":0.0000034229938,"about_ca_system_score_gemma":0.000009529902,"threshold_uncertainty_score":0.27671823},"labels":[],"label_agreement":null},{"id":"W2399631585","doi":"","title":"Watson-Crick automata: determinism and state complexity","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Automaton; Watson; Unary operation; Determinism; Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Philosophy; DNA; Epistemology; Base pair","score_opus":0.04379430995703225,"score_gpt":0.25591044169363136,"score_spread":0.2121161317365991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399631585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972316,0.00021405348,0.0004986936,0.00010665593,0.00006869296,0.000056422392,0.000009421863,0.00002693735,0.0017875048],"genre_scores_gemma":[0.99734724,0.00011888617,0.00146403,0.00035287504,0.00012978114,0.000002109568,0.00003646861,0.0000059417875,0.0005426559],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9994204,0.000030393521,0.00010344048,0.00022009567,0.00005028237,0.00017536055],"domain_scores_gemma":[0.9997398,0.000008389514,0.00003066954,0.00013772784,0.000020763826,0.00006261686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006696699,0.00009029093,0.00009565618,0.000010413732,0.00011582087,0.000010747803,0.00008871964,0.000059167305,0.000007318734],"category_scores_gemma":[0.000025201321,0.00006925345,0.000034492867,0.000028304685,0.00015129984,0.0000015263275,0.00014869877,0.000049978487,0.000013134356],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001437897,0.00016469693,0.05664932,0.000046779667,0.000079200974,0.00015661897,0.0003392096,0.000011380153,0.8426726,0.0003375149,0.0072456645,0.092153236],"study_design_scores_gemma":[0.0019288465,0.0014871616,0.42343673,0.00002086345,0.000018374087,0.0006493174,0.000058154223,0.0016145975,0.2107675,0.0021824464,0.3569165,0.0009195297],"about_ca_topic_score_codex":0.000012516743,"about_ca_topic_score_gemma":0.0000050683198,"teacher_disagreement_score":0.6319051,"about_ca_system_score_codex":0.00000281144,"about_ca_system_score_gemma":0.000012530736,"threshold_uncertainty_score":0.28240737},"labels":[],"label_agreement":null},{"id":"W2401023328","doi":"","title":"Transposition H v -Groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transposition (logic); Pure mathematics; Combinatorics; Geometry","score_opus":0.010445061080482574,"score_gpt":0.23586242015150044,"score_spread":0.22541735907101787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401023328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953726,0.00055624836,0.00009816655,0.00008064703,0.0007527824,0.000057355282,0.0000020479204,0.000021137652,0.0030590186],"genre_scores_gemma":[0.9992817,0.000019905072,0.00014775395,0.00030087074,0.00007019987,0.0000046339637,0.00006277355,0.000007400694,0.0001047763],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994646,0.000038343605,0.00008913349,0.00012525442,0.000056665518,0.00022605763],"domain_scores_gemma":[0.9997453,0.0000071762643,0.000024695515,0.00012579447,0.00002135424,0.00007569887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013136049,0.00007975638,0.0000664345,0.000010549146,0.00006105831,0.000008592099,0.000092694805,0.00009954961,0.000017075565],"category_scores_gemma":[0.000017442388,0.00006687356,0.00005573676,0.00004910934,0.000026781096,0.000003153233,0.00003527896,0.000053235988,0.000033503235],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052679086,0.0002478339,0.07922348,0.000009917556,0.000033289212,0.0000013948243,0.00006631017,0.0000023628047,0.8107033,0.10351074,0.0018230747,0.0043256613],"study_design_scores_gemma":[0.0017922997,0.0010876664,0.23057058,0.000023181425,0.000046705733,0.000038582155,0.00011047997,0.0000365169,0.65725064,0.037439782,0.07082719,0.00077634776],"about_ca_topic_score_codex":0.0000020113398,"about_ca_topic_score_gemma":3.2291973e-7,"teacher_disagreement_score":0.1534526,"about_ca_system_score_codex":0.000005985168,"about_ca_system_score_gemma":0.0000057172365,"threshold_uncertainty_score":0.27270246},"labels":[],"label_agreement":null},{"id":"W2401727667","doi":"","title":"Catalytic Search in Dynamic Environments.","year":2010,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Evolutionary algorithm; Catalysis; Population; Fitness function; Genetic algorithm; Function (biology); Face (sociological concept); Evolutionary dynamics; Biological system; Biochemical engineering; Mathematical optimization; Artificial intelligence; Chemistry; Mathematics; Evolutionary biology; Biology; Machine learning; Engineering","score_opus":0.006713276547444927,"score_gpt":0.24797653312354498,"score_spread":0.24126325657610004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401727667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921719,0.00002227817,0.00032309457,0.0000988419,0.000056644974,0.00005153707,9.954855e-7,0.0000043584387,0.007270358],"genre_scores_gemma":[0.99718535,0.000010448563,0.0005051175,0.00015064761,0.000035230827,0.0000019749352,0.000041501364,0.000004084187,0.0020656318],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953336,0.000012873139,0.000075520235,0.00018178624,0.000042091986,0.00015436311],"domain_scores_gemma":[0.9998043,0.0000051326942,0.0000084148105,0.00014417901,0.0000028868255,0.000035078876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011481896,0.00005586797,0.000047168112,0.000015222832,0.000019063744,0.0000068762165,0.00011494001,0.00008911064,0.00003842021],"category_scores_gemma":[0.000020350746,0.00004195111,0.000024301968,0.00003150123,0.000045158926,6.503274e-7,0.00011098271,0.00011119572,0.00004632969],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056292542,0.0000301695,0.011665146,0.0000011423217,0.0000023562498,0.000002031093,0.0000034819159,0.0000102980775,0.9798026,0.000062456646,0.000032380267,0.00838231],"study_design_scores_gemma":[0.0007049817,0.00031070126,0.21723881,0.0000040029117,0.0000037234322,0.000023752633,0.00006576982,0.0024067461,0.7266794,0.00020248274,0.05198921,0.0003704089],"about_ca_topic_score_codex":0.000015778442,"about_ca_topic_score_gemma":0.000116052535,"teacher_disagreement_score":0.2531232,"about_ca_system_score_codex":0.0000035768026,"about_ca_system_score_gemma":0.000008838294,"threshold_uncertainty_score":0.17107166},"labels":[],"label_agreement":null},{"id":"W2402710531","doi":"","title":"Semi-Deterministic Virtual Finite Automaton(SDVFA) of order (s, t) and Regular Grammar.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Two-way deterministic finite automaton; Deterministic automaton; Büchi automaton; Order (exchange); Nondeterministic finite automaton; Automaton; Deterministic finite automaton; Finite-state machine; Theoretical computer science; Computer science; Algorithm; Automata theory","score_opus":0.006092339025272047,"score_gpt":0.22023321515871075,"score_spread":0.2141408761334387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402710531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99784714,0.00013434618,0.00042327994,0.000052965475,0.00044864262,0.00008097642,0.0000040108152,0.000023997323,0.0009846507],"genre_scores_gemma":[0.9991545,0.000026653042,0.00032111295,0.00015818875,0.00003804919,0.000003953301,0.00003765329,0.000012949409,0.00024692246],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990911,0.0000941002,0.00021374132,0.00029617225,0.00009733103,0.00020756862],"domain_scores_gemma":[0.99939686,0.00007575525,0.00009720351,0.00027113274,0.00008147389,0.00007758582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023896655,0.00014434989,0.00019800155,0.000024172396,0.00006861309,0.00001758716,0.00016715386,0.00016453632,0.000006784328],"category_scores_gemma":[0.0004012454,0.00012201853,0.000051959425,0.000087695655,0.00014148265,0.0000024244077,0.00019892037,0.00007711515,0.0000045431398],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020139354,0.00037444363,0.03313748,0.00014220632,0.0001722608,0.000015265508,0.00010711037,0.000111260044,0.74295014,0.18280083,0.004040182,0.035947435],"study_design_scores_gemma":[0.00945538,0.013761384,0.074269645,0.00029996777,0.00023404151,0.000118556396,0.00023473117,0.026694845,0.44911367,0.21684462,0.2061029,0.0028702738],"about_ca_topic_score_codex":0.000005292377,"about_ca_topic_score_gemma":0.0000012617131,"teacher_disagreement_score":0.29383647,"about_ca_system_score_codex":0.0000039051693,"about_ca_system_score_gemma":0.000022782884,"threshold_uncertainty_score":0.4975771},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Statistics; Geometry","score_opus":0.010605030798647835,"score_gpt":0.25718626835275066,"score_spread":0.24658123755410283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404127378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99509203,0.00018501881,0.00021326644,0.00023748186,0.0005413109,0.00017453945,0.000005623832,0.000029082536,0.0035216229],"genre_scores_gemma":[0.99823946,0.000016006026,0.00062971783,0.0005703552,0.0000643774,0.000008410694,0.000079225545,0.0000079403435,0.00038449833],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930966,0.000025355814,0.00012675837,0.0002519326,0.000057971884,0.00022831577],"domain_scores_gemma":[0.9996317,0.000015754624,0.000041620286,0.00018851498,0.00006071952,0.00006169561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012136479,0.00011130158,0.000113059206,0.00000824845,0.0000839835,0.00001995975,0.00015499433,0.00013354063,0.0000124915405],"category_scores_gemma":[0.00008132235,0.000092712085,0.00010316016,0.00005203139,0.000021988895,0.0000017375546,0.000036223973,0.00005279386,0.00001690957],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003470332,0.00066331733,0.027875345,0.000037545928,0.00009350957,0.000015072785,0.00007415121,0.00001684039,0.53999287,0.30290547,0.065688156,0.06229069],"study_design_scores_gemma":[0.004335893,0.0037566521,0.039824832,0.0000411419,0.000044409724,0.00004190009,0.000067882094,0.00021831195,0.21649428,0.4151842,0.3189203,0.0010702027],"about_ca_topic_score_codex":0.0000012839604,"about_ca_topic_score_gemma":3.5802458e-7,"teacher_disagreement_score":0.32349858,"about_ca_system_score_codex":0.000007945375,"about_ca_system_score_gemma":0.000017001492,"threshold_uncertainty_score":0.37806892},"labels":[],"label_agreement":null},{"id":"W2404764228","doi":"","title":"Closed Monophonic and Minimal Closed Monophonic Numbers of a Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Arithmetic; Combinatorics","score_opus":0.01552330662189666,"score_gpt":0.22314184700167305,"score_spread":0.2076185403797764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404764228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99618244,0.00069799315,0.000011165427,0.0000145450795,0.0004073429,0.0001425315,0.0000060917755,0.00001870033,0.0025191854],"genre_scores_gemma":[0.9990468,0.00013387106,0.0006046466,0.00007263423,0.000014096276,0.0000072668063,0.000018041372,0.000015038611,0.00008763037],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894226,0.00006835263,0.0002624754,0.00036194565,0.00008846087,0.00027649963],"domain_scores_gemma":[0.9994088,0.00002163102,0.00012648356,0.00028303076,0.00006173285,0.00009831167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016944762,0.00017575976,0.00022354048,0.000036824862,0.00006196529,0.000009422727,0.00022241176,0.00019978947,0.000019642317],"category_scores_gemma":[0.000053331652,0.00015263222,0.00011083906,0.00012704878,0.00015928329,0.0000045294523,0.00018082588,0.00010420264,0.000006108087],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047909186,0.00040167943,0.056219175,0.000050028037,0.0001780845,0.000016325908,0.00033330047,9.734487e-7,0.9190604,0.018494533,0.00064398197,0.004122435],"study_design_scores_gemma":[0.0039634965,0.0033570873,0.16982011,0.00004814178,0.00008049274,0.000022641387,0.0003012026,0.00007610548,0.71414864,0.10548561,0.0019183923,0.00077808293],"about_ca_topic_score_codex":0.00007177388,"about_ca_topic_score_gemma":0.0000063204725,"teacher_disagreement_score":0.20491175,"about_ca_system_score_codex":0.00000694889,"about_ca_system_score_gemma":0.000037662314,"threshold_uncertainty_score":0.6224161},"labels":[],"label_agreement":null},{"id":"W2404829170","doi":"","title":"(k, α n-1 )-Fibonacci numbers and P k -matchings in multigraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics","score_opus":0.005764450171992145,"score_gpt":0.21962561792052132,"score_spread":0.21386116774852917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404829170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99689776,0.00027518946,0.000004322919,0.00015050574,0.00019999458,0.00013584521,6.8847e-7,0.000014389007,0.0023213017],"genre_scores_gemma":[0.9991726,0.00004972589,0.00029317042,0.00030774035,0.000009386971,0.000013368061,0.000013206286,0.0000078586145,0.0001329274],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993027,0.00004056115,0.00013823027,0.00025531152,0.000054671964,0.00020856585],"domain_scores_gemma":[0.9997153,0.000020145679,0.000035773133,0.0001328961,0.000028200904,0.00006767546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011163899,0.00010890475,0.000110066365,0.000026378311,0.000043806394,0.000029290795,0.000114713956,0.00011683316,0.000016171225],"category_scores_gemma":[0.000058710535,0.00009117758,0.00003579265,0.00007736671,0.000051203242,0.0000046326854,0.00012688049,0.00009178546,0.000018573968],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033015534,0.00018396798,0.4954502,0.000024630966,0.000035711702,0.000008690285,0.0001583177,0.0000048645334,0.46735692,0.018535621,0.0042519877,0.013956071],"study_design_scores_gemma":[0.0034786689,0.0007299639,0.74554706,0.000060578528,0.0000125799415,0.000032758107,0.0003729609,0.00037682883,0.04882435,0.18348102,0.01612069,0.00096251525],"about_ca_topic_score_codex":0.00027120556,"about_ca_topic_score_gemma":0.00002318875,"teacher_disagreement_score":0.41853255,"about_ca_system_score_codex":0.000005237193,"about_ca_system_score_gemma":0.000008661156,"threshold_uncertainty_score":0.3718114},"labels":[],"label_agreement":null},{"id":"W2405146722","doi":"","title":"An Infinite Hierarchy Induced by Depth Synchronization.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Saskatchewan; Western University","funders":"","keywords":"Synchronization (alternating current); Measure (data warehouse); Hierarchy; Logarithm; Mathematics; Bounded function; Context (archaeology); Grammar; Constant (computer programming); Discrete mathematics; Computer science; Combinatorics; Topology (electrical circuits); Mathematical analysis; Linguistics; Programming language; Data mining; Geography","score_opus":0.009276167141911087,"score_gpt":0.2451326274002813,"score_spread":0.2358564602583702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405146722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887078,0.00022245578,0.0053431434,0.00006768875,0.000059300964,0.000058862177,0.000008138637,0.000027950095,0.0055046813],"genre_scores_gemma":[0.9978248,0.0000083699215,0.00048805794,0.00036737442,0.00041861902,0.0000034106592,0.00063764426,0.000008899804,0.00024284216],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999405,0.000042426753,0.00011300007,0.00021723963,0.000056033667,0.0001662745],"domain_scores_gemma":[0.999719,0.0000059246895,0.000035337103,0.00016050074,0.000035652647,0.00004356065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006900275,0.00008668636,0.00006564868,0.000015054021,0.000069277114,0.000027354065,0.00012926916,0.00011881646,0.000017735218],"category_scores_gemma":[0.000021593858,0.00007157143,0.000029654835,0.0000744258,0.00002874645,0.0000024223018,0.00004483027,0.00005360656,0.0000137227735],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009544312,0.000047803405,0.00914024,0.000002596688,0.0000059307895,0.0000011316718,0.0000041214716,0.000049764516,0.9740156,0.00018537325,0.0023127156,0.014225193],"study_design_scores_gemma":[0.0010142028,0.0013589431,0.049326327,0.000012859636,0.00001636879,0.000012832973,0.00003281737,0.0015577174,0.6554351,0.00091274903,0.28959844,0.0007216617],"about_ca_topic_score_codex":0.00003791333,"about_ca_topic_score_gemma":0.000019297357,"teacher_disagreement_score":0.3185805,"about_ca_system_score_codex":0.0000058712208,"about_ca_system_score_gemma":0.000017503655,"threshold_uncertainty_score":0.2918598},"labels":[],"label_agreement":null},{"id":"W2405695800","doi":"","title":"The Induced Matching Extendability of C 2n (1, k).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Statistics","score_opus":0.009758420077197174,"score_gpt":0.25530096853625955,"score_spread":0.24554254845906237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405695800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9973398,0.000057365298,0.000009111883,0.00011566475,0.0010882257,0.000077520555,0.0000012766388,0.000010207725,0.0013008576],"genre_scores_gemma":[0.99972314,0.0000078318535,0.00012973291,0.00004760539,0.000025457932,0.0000035359362,0.000005715247,0.00000568376,0.000051296833],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999363,0.000055778088,0.00016561625,0.00017743495,0.000077136174,0.00016102359],"domain_scores_gemma":[0.9994201,0.000059747766,0.000075033146,0.00033432004,0.000070285154,0.000040533774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494944,0.000080074395,0.000087202665,0.0000067336505,0.00013541369,0.000016271197,0.00026997266,0.00011804157,0.0000058407027],"category_scores_gemma":[0.00024608112,0.000049861785,0.00006592612,0.00005323058,0.00009364664,0.0000014618713,0.00017015723,0.000170124,0.0000034900288],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001906819,0.00004116173,0.004637307,0.0000034042162,0.00001079411,3.556991e-7,0.000014098311,3.878395e-7,0.95357287,0.037582144,0.00013779488,0.0039806175],"study_design_scores_gemma":[0.00048011748,0.00039601797,0.05484357,0.0000064828537,0.000008627654,0.000006731046,0.00007802917,0.000021875814,0.7400234,0.19362397,0.010305389,0.00020582869],"about_ca_topic_score_codex":0.000017563769,"about_ca_topic_score_gemma":0.000015847958,"teacher_disagreement_score":0.21354951,"about_ca_system_score_codex":0.0000025519898,"about_ca_system_score_gemma":0.000026337093,"threshold_uncertainty_score":0.20333046},"labels":[],"label_agreement":null},{"id":"W2406034771","doi":"","title":"On the Synchronized Derivation Depth of Context-Free Grammars.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Tree-adjoining grammar; Indexed grammar; Rule-based machine translation; L-attributed grammar; Context-free grammar; Measure (data warehouse); Embedded pushdown automaton; Context (archaeology); Context-sensitive grammar; Mathematics; Synchronization (alternating current); Tree (set theory); Deterministic context-free grammar; Computer science; Combinatorics; Artificial intelligence; Geography; Topology (electrical circuits)","score_opus":0.023048097899154907,"score_gpt":0.228789765466021,"score_spread":0.2057416675668661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406034771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99548525,0.00019927953,0.0015200581,0.00032160844,0.000050129365,0.00008321449,0.000003097688,0.000007663032,0.002329726],"genre_scores_gemma":[0.9988614,0.00003158708,0.00025628298,0.00058557536,0.00009314514,0.0000037544032,0.000025367443,0.000004215956,0.00013872389],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995697,0.000042624684,0.0001046125,0.00012124337,0.00006297565,0.00009883783],"domain_scores_gemma":[0.9996146,0.000039400293,0.000052550888,0.00023924296,0.000036263344,0.000017929991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009100889,0.00006263906,0.000072170726,0.000008021657,0.00006835075,0.0000032952219,0.00018647358,0.000063699285,0.000017053058],"category_scores_gemma":[0.00029569175,0.000036605827,0.00005407085,0.0000415987,0.0000852282,6.3457503e-7,0.00007915411,0.00004488933,0.0000057921216],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021962002,0.00010763915,0.01064389,0.000012497217,0.00006594175,0.0000066742646,0.00006941727,0.000046644636,0.93295807,0.01054122,0.014026604,0.031301793],"study_design_scores_gemma":[0.0019624212,0.0016554043,0.05283334,0.00003718423,0.000017833947,0.000037572383,0.00010985077,0.00047703198,0.8909685,0.004304657,0.047217604,0.0003785751],"about_ca_topic_score_codex":0.000011009851,"about_ca_topic_score_gemma":0.000008515217,"teacher_disagreement_score":0.04218945,"about_ca_system_score_codex":0.000003749993,"about_ca_system_score_gemma":0.000015727595,"threshold_uncertainty_score":0.14927423},"labels":[],"label_agreement":null},{"id":"W2406707922","doi":"","title":"Two Constructions of Authentication Codes with Multiple Arbiters.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Authentication (law); Computer science; Computer security","score_opus":0.007116645898977458,"score_gpt":0.22987979319818552,"score_spread":0.22276314729920807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406707922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99722695,0.000028870949,0.0007429778,0.000036114438,0.0001766831,0.00006753514,0.0000029616988,0.000012722985,0.0017051703],"genre_scores_gemma":[0.99834704,0.0000033395768,0.0015056343,0.000041044168,0.000013734318,0.000004126016,0.000037785605,0.0000054738407,0.000041802334],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952185,0.000045151144,0.00011378018,0.00015840362,0.000056699617,0.000104091814],"domain_scores_gemma":[0.9996128,0.000029531237,0.00007300463,0.00017580861,0.00007477884,0.000034053024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010383174,0.000070388785,0.00009264354,0.000016031752,0.00005070948,0.000007898523,0.000094830044,0.000048761314,0.000004235155],"category_scores_gemma":[0.00007863764,0.00005321102,0.000032268807,0.00005903071,0.00011685798,0.0000017109644,0.000043133212,0.000041447667,0.0000029806033],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065392676,0.00011203349,0.15228498,0.00001437206,0.000049407077,3.507665e-7,0.00003421923,0.000029093144,0.726737,0.118454605,0.00013011886,0.0020883735],"study_design_scores_gemma":[0.0042111464,0.0019333471,0.06076136,0.000063845364,0.00007138802,0.000033885695,0.00023855947,0.0022043148,0.87150127,0.050994266,0.007460489,0.000526107],"about_ca_topic_score_codex":0.000010302547,"about_ca_topic_score_gemma":0.0000052482533,"teacher_disagreement_score":0.14476424,"about_ca_system_score_codex":0.0000033326482,"about_ca_system_score_gemma":0.000012998208,"threshold_uncertainty_score":0.21698824},"labels":[],"label_agreement":null},{"id":"W2411113113","doi":"10.1385/1-59259-192-2:413","title":"Computing with DNA","year":2003,"lang":"en","type":"article","venue":"Humana Press eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computation; Computer science; Electronics; Engineering; Electrical engineering; Algorithm","score_opus":0.03504260878322126,"score_gpt":0.25163198567823536,"score_spread":0.2165893768950141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411113113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77820915,0.00076498213,0.0027963284,0.0000033452088,0.00006475939,0.000119722725,0.0000011208333,0.00003441878,0.21800621],"genre_scores_gemma":[0.9966579,0.000007467525,0.001113987,0.00020808137,0.00011980938,0.0000031477077,0.000008683068,0.000011569527,0.0018693521],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992861,0.000060077542,0.0001066416,0.0002605973,0.00006792,0.00021863736],"domain_scores_gemma":[0.9996576,0.0000084071635,0.00004733306,0.00020198897,0.000033938028,0.0000507362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001102962,0.00011438318,0.00009359357,0.000010443218,0.00011394878,0.000028716233,0.00012412567,0.000071075745,0.0000059032964],"category_scores_gemma":[0.000019999621,0.00008205907,0.000038532115,0.000007632663,0.00006800947,6.717087e-7,0.00006610703,0.00006693934,0.000002396605],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032146304,0.00028316877,0.003267106,0.0001490058,0.00047298885,0.000107567306,0.000495775,0.0006016465,0.6849755,0.12486561,0.00527625,0.17918395],"study_design_scores_gemma":[0.0007884016,0.0005916528,0.0009435041,0.000029380606,0.000021989816,0.000042171858,0.000043189357,0.0000831581,0.42144927,0.00022250402,0.57535315,0.00043161758],"about_ca_topic_score_codex":0.000008524183,"about_ca_topic_score_gemma":0.0000076202255,"teacher_disagreement_score":0.5700769,"about_ca_system_score_codex":0.0000032232465,"about_ca_system_score_gemma":0.000013533098,"threshold_uncertainty_score":0.3346272},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024882591835930796,"score_gpt":0.25187970547834265,"score_spread":0.22699711364241185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471342003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70755875,0.00003839806,0.28909078,0.00011925754,0.00002670284,0.00014528299,0.0000024018816,0.0000068105596,0.003011602],"genre_scores_gemma":[0.9943681,0.0000011820065,0.0049376367,0.00031029413,0.00010636193,0.0000023273706,0.000014029926,0.0000034206973,0.00025665428],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999621,0.00003514024,0.000099808065,0.00011113703,0.000032103784,0.000100864694],"domain_scores_gemma":[0.9996772,0.00015217897,0.000039723785,0.00008981187,0.000032895146,0.000008198676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021652646,0.000054045206,0.000060690654,0.000005593021,0.000055804638,0.000006332,0.00009907737,0.000045258173,0.000006040671],"category_scores_gemma":[0.000072040755,0.000027986354,0.00004783291,0.000023478062,0.000037602975,2.1481631e-7,0.00003426118,0.000018968205,0.0000011310144],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005114212,0.000043158663,0.00032260825,0.000004718048,0.000011033191,1.17287215e-7,0.0000022415475,0.0018304097,0.97060555,0.019365372,0.006156282,0.001607367],"study_design_scores_gemma":[0.0002103514,0.0005709702,0.001075627,0.0000075336984,0.000004824684,0.0000010964051,0.00001926595,0.0050237505,0.9863544,0.0038489471,0.002795773,0.00008743129],"about_ca_topic_score_codex":0.0000047085564,"about_ca_topic_score_gemma":0.0000013198554,"teacher_disagreement_score":0.28680936,"about_ca_system_score_codex":0.0000014445766,"about_ca_system_score_gemma":0.000006928352,"threshold_uncertainty_score":0.11412504},"labels":[],"label_agreement":null},{"id":"W2475597120","doi":"","title":"Trajectory-based operations","year":2004,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Closure (psychology); Suffix; Regular language; Decidability; Mathematics; Prefix; Iterated function; Set (abstract data type); Class (philosophy); Binary number; Discrete mathematics; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence; Arithmetic; Linguistics; Automaton","score_opus":0.013438984002784224,"score_gpt":0.24878495121237626,"score_spread":0.23534596720959203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475597120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94160247,0.000044755285,0.051650718,0.000302529,0.000046718254,0.0000478081,0.0000015061936,0.000020384092,0.0062830853],"genre_scores_gemma":[0.9878664,0.0000018490286,0.01050966,0.0012318582,0.000098644865,0.0000031134857,0.00003919563,0.000003134332,0.00024613753],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968904,0.000009445368,0.00005815559,0.00012516217,0.000028461383,0.000089749585],"domain_scores_gemma":[0.9998527,0.0000017827599,0.000005145254,0.000090035304,0.000019597202,0.00003072446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000038910646,0.000047906193,0.000034898236,0.000007802598,0.000052432693,0.000011503494,0.00006347529,0.000050716448,0.00003612001],"category_scores_gemma":[0.00002086973,0.000033995704,0.00003742707,0.00003094387,0.000022025475,4.3975365e-7,0.000017800514,0.000024581768,0.000020724363],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007543636,0.000049675607,0.00048207468,0.0000013127994,0.0000052354944,0.000001058476,0.0000028184525,0.011483341,0.9858566,0.0011055331,0.00015363617,0.00085116003],"study_design_scores_gemma":[0.00071043096,0.00042909707,0.0030700515,0.00000386512,0.0000040573213,0.000003955098,0.000018192917,0.00030545998,0.97900677,0.00016381293,0.016107773,0.00017654504],"about_ca_topic_score_codex":0.000012005517,"about_ca_topic_score_gemma":0.00003929875,"teacher_disagreement_score":0.04626391,"about_ca_system_score_codex":0.000003852785,"about_ca_system_score_gemma":0.00003679423,"threshold_uncertainty_score":0.13863045},"labels":[],"label_agreement":null},{"id":"W2482993936","doi":"10.4018/978-1-59140-333-3.ch003","title":"DNA Computing and Errors","year":2011,"lang":"en","type":"book-chapter","venue":"Advances in web services research series/Advances in web services research (AWSR) book  series","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"DNA computing; Computation; Computer science; Perspective (graphical); Software; Reduction (mathematics); Theoretical computer science; Algorithm; Computer engineering; Artificial intelligence; Mathematics; Programming language","score_opus":0.027335509609921784,"score_gpt":0.356415986753097,"score_spread":0.32908047714317523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482993936","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116089605,0.33362776,0.000008908431,0.00042745264,0.0008094667,0.0031850592,0.00037456112,0.00022328929,0.5452539],"genre_scores_gemma":[0.27244258,0.6746658,0.001417924,0.0005010702,0.001365582,0.00027979637,0.00081563904,0.0003707794,0.04814082],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9866813,0.0013992253,0.0019911178,0.003632571,0.0025941029,0.0037017292],"domain_scores_gemma":[0.9941419,0.00078168354,0.0006538723,0.0020378847,0.0016350363,0.0007496325],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0053013763,0.0016256105,0.0018081275,0.0017383674,0.0012184373,0.00050657894,0.0038573402,0.0017124912,0.00038840735],"category_scores_gemma":[0.0001693449,0.0015071064,0.0003055818,0.0011174666,0.0035722575,0.0015348544,0.0065247044,0.0042486773,0.00013054878],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.038014416,0.0027321687,0.060438704,0.06250725,0.0017438498,0.0057635573,0.022146171,0.0022042303,0.2810172,0.24483867,0.00071826484,0.27787548],"study_design_scores_gemma":[0.0013969395,0.0026637577,0.00024585577,0.0034417259,0.000018846624,0.00010308765,0.0053956592,0.0004886046,0.0053569004,0.019128859,0.95997834,0.0017814391],"about_ca_topic_score_codex":0.00023699432,"about_ca_topic_score_gemma":0.033956416,"teacher_disagreement_score":0.95926005,"about_ca_system_score_codex":0.0003772198,"about_ca_system_score_gemma":0.00073505315,"threshold_uncertainty_score":0.9996491},"labels":[],"label_agreement":null},{"id":"W2493758942","doi":"10.1016/j.tcs.2017.03.040","title":"Outfix-guided insertion","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; Ministry of Science, ICT and Future Planning","keywords":"Mathematics; Computer science","score_opus":0.021440013269191774,"score_gpt":0.2984234565227588,"score_spread":0.27698344325356705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493758942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88136137,0.000013435661,0.107357495,0.00044509777,0.00035395758,0.00006425075,7.543931e-7,0.00002196293,0.010381676],"genre_scores_gemma":[0.99032104,0.000004049108,0.00875003,0.0005036832,0.00037214067,0.0000015757562,0.0000026430132,0.0000041624253,0.000040694256],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989583,0.000034035962,0.0001226217,0.00041452967,0.0001719058,0.00029864415],"domain_scores_gemma":[0.99906904,0.000011451987,0.00006184649,0.0006370375,0.00009747168,0.0001231337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006333996,0.00009771925,0.0000891795,0.000021566693,0.00075721054,0.0002434287,0.0010815816,0.000063627485,0.000018328572],"category_scores_gemma":[0.00026920234,0.0000699062,0.000049483184,0.000050220082,0.0023129538,0.000008846368,0.0009217989,0.00007109427,0.000034424505],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046998575,0.00007429802,0.0064019742,0.0000060926923,0.000007953634,0.00000807155,0.000026507143,0.000050742023,0.54809695,0.3862865,0.00038429268,0.058609616],"study_design_scores_gemma":[0.0012194038,0.0019026189,0.2081895,0.00006463803,0.000017909182,0.000110225374,0.0000109696375,0.061509937,0.6498072,0.06921778,0.0069122096,0.0010375929],"about_ca_topic_score_codex":0.0000027559718,"about_ca_topic_score_gemma":5.903275e-7,"teacher_disagreement_score":0.31706873,"about_ca_system_score_codex":0.0000075907087,"about_ca_system_score_gemma":0.000035148478,"threshold_uncertainty_score":0.85221744},"labels":[],"label_agreement":null},{"id":"W2498348315","doi":"10.3233/fun-2008-861-207","title":"Involution Solid and Join codes","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Join (topology); Computer science; Involution (esoterism); Discrete mathematics; Mathematics; Combinatorics; Law","score_opus":0.02241134773385848,"score_gpt":0.2514886468805699,"score_spread":0.2290772991467114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498348315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925643,0.00014578665,0.0010985906,0.00006769393,0.000051955896,0.00008751361,0.00000613643,0.000017395832,0.005960589],"genre_scores_gemma":[0.9971855,0.00015238859,0.0013350128,0.0008722641,0.00007846698,0.000004935718,0.000079249956,0.0000034633226,0.00028866602],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948144,0.000016135018,0.0001787027,0.00009549185,0.00006642053,0.00016182411],"domain_scores_gemma":[0.99975306,0.00000800743,0.00005057089,0.000106394386,0.000021170514,0.000060792383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009111381,0.00008408702,0.00008858203,0.00001869934,0.00014598596,0.00001848753,0.000071815426,0.00006969124,0.000020849306],"category_scores_gemma":[0.000037596317,0.00006541396,0.000029977336,0.000035807177,0.00011627076,0.000006878989,0.00013455746,0.000049143924,0.00003222622],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031382378,0.00031762672,0.23641084,0.00021531607,0.00020870051,0.000017889835,0.0018576988,0.0001494724,0.66844225,0.0028745225,0.051300224,0.03789165],"study_design_scores_gemma":[0.0032514571,0.003156813,0.26958495,0.00009826886,0.000045705332,0.00077787525,0.0014473504,0.009349134,0.24351668,0.0008714167,0.4664881,0.0014122513],"about_ca_topic_score_codex":0.000005043297,"about_ca_topic_score_gemma":0.0000020293003,"teacher_disagreement_score":0.42492554,"about_ca_system_score_codex":0.0000074735967,"about_ca_system_score_gemma":0.000016088276,"threshold_uncertainty_score":0.26675037},"labels":[],"label_agreement":null},{"id":"W2515013923","doi":"","title":"DNA Computing: 11th International Workshop on DNA Computing, DNA11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers. (Lecture Notes in Computer Science)","year":2006,"lang":"en","type":"book","venue":"Springer eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"DNA computing; Computer science; Library science; DNA; Computational biology; Biology; Genetics","score_opus":0.007937586425214123,"score_gpt":0.22290742871347782,"score_spread":0.2149698422882637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515013923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54453945,0.0014531427,0.019386439,0.0017363545,0.009393238,0.0032624977,0.00020227394,0.00048120905,0.41954538],"genre_scores_gemma":[0.9336341,0.000019065372,0.0016322858,0.0036515803,0.004160604,0.000006613718,0.00084741623,0.00012972018,0.055918626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955909,0.000121451725,0.00079333497,0.0016543061,0.000766078,0.0010739104],"domain_scores_gemma":[0.998098,0.00017264007,0.00048802787,0.00067424955,0.00032903513,0.00023800286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056534325,0.00082016614,0.00070976967,0.00030884886,0.0003067933,0.000178321,0.001178657,0.00069306034,0.00003008832],"category_scores_gemma":[0.00018890593,0.00072129414,0.00022001167,0.00017344848,0.00038458465,0.0000032655937,0.00067032705,0.0010040154,0.000013072819],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013248329,0.00082670245,0.0048103095,0.0004530985,0.0010734099,0.0008919519,0.00027997678,0.032793537,0.20345087,0.0014589888,0.17839113,0.5742452],"study_design_scores_gemma":[0.0026266982,0.00063873705,0.009295584,0.00213637,0.00007528397,0.00005076864,0.000004207281,0.005072096,0.0552593,0.00024966942,0.9217914,0.0027998928],"about_ca_topic_score_codex":0.0012808766,"about_ca_topic_score_gemma":0.028758066,"teacher_disagreement_score":0.7434003,"about_ca_system_score_codex":0.0005892425,"about_ca_system_score_gemma":0.0017241138,"threshold_uncertainty_score":0.9995238},"labels":[],"label_agreement":null},{"id":"W2522877794","doi":"10.1142/s0129626416500122","title":"Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Decidability; Computer science; Context (archaeology); Theoretical computer science; Grammar; Context-free grammar; Rule-based machine translation; Tree (set theory); Programming language; Mathematics; Combinatorics; Artificial intelligence; Linguistics","score_opus":0.07896733959060385,"score_gpt":0.27018019728767195,"score_spread":0.19121285769706808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522877794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82620794,0.004464699,0.16196075,0.0063108294,0.00012233679,0.000736316,0.00007941769,0.00005161767,0.00006609306],"genre_scores_gemma":[0.9919051,0.0001858208,0.006826768,0.0006764122,0.00016344461,0.00010118023,0.000040900297,0.000024365243,0.00007601659],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836046,0.00021946935,0.00047287284,0.0004522268,0.0001447399,0.00035025575],"domain_scores_gemma":[0.9982111,0.0004677039,0.00046333295,0.0005663288,0.0002008335,0.000090739995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057772506,0.00024150762,0.00038483442,0.000034855126,0.00021608837,0.000079750964,0.0004777385,0.00016456432,3.4257846e-7],"category_scores_gemma":[0.0010977167,0.00016041762,0.00011510922,0.000070139344,0.00033524306,0.000016686103,0.000222747,0.000099025296,8.366052e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080559915,0.0002548583,0.026715476,0.001123467,0.00021865542,0.000003217767,0.00045526767,0.0037059658,0.94789207,0.0010159891,0.0024233863,0.015386076],"study_design_scores_gemma":[0.048975524,0.0088327695,0.0717586,0.011957665,0.0013136289,0.00030188417,0.015873568,0.15798423,0.08053735,0.0033719619,0.58830535,0.0107874945],"about_ca_topic_score_codex":0.000091112284,"about_ca_topic_score_gemma":0.000044550317,"teacher_disagreement_score":0.8673547,"about_ca_system_score_codex":0.000020881354,"about_ca_system_score_gemma":0.00003248467,"threshold_uncertainty_score":0.6541641},"labels":[],"label_agreement":null},{"id":"W2524140413","doi":"","title":"ANALYSIS OF REPETITIVE DNA BY FLOW CYTOMETRY USING CHROMOSOME FLOW FISH","year":2011,"lang":"en","type":"article","venue":"Data Archiving and Networked Services (DANS)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Terry Fox Research Institute","funders":"","keywords":"Fish <Actinopterygii>; Flow cytometry; Flow (mathematics); Chromosome; Biology; Genetics; Fishery; Mechanics; Physics; Gene","score_opus":0.027261147130367737,"score_gpt":0.2519700490500067,"score_spread":0.22470890191963896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524140413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884481,0.00037507346,0.009168548,0.000006831817,0.000067822715,0.000072883224,0.0011147656,0.000018848114,0.0007271634],"genre_scores_gemma":[0.9876159,0.00023342796,0.006078274,0.00021307213,0.00016532048,0.0000016564876,0.0056456537,0.00001443895,0.000032279542],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984977,0.00014177352,0.00029783687,0.0006375695,0.0001133478,0.00031176402],"domain_scores_gemma":[0.9989219,0.000051504245,0.00016582021,0.0007196421,0.000036010486,0.000105149615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036160936,0.00019975491,0.00033152878,0.000086523825,0.0001379378,0.000027000326,0.00070201803,0.000113186645,0.000022590135],"category_scores_gemma":[0.000018811506,0.00016288912,0.00009268158,0.00042814767,0.000119657176,0.000013826987,0.000965736,0.00010769053,6.632388e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035388686,0.00028446494,0.21417744,0.0002282544,0.0026903155,0.000020903442,0.0014004884,0.0023019668,0.75385773,0.000008658506,0.0004874933,0.024188409],"study_design_scores_gemma":[0.00045081662,0.0003619782,0.089623444,0.00017986727,0.0010021491,0.000016871072,0.00048244337,0.88122845,0.02326654,0.000041014584,0.0027233006,0.0006231384],"about_ca_topic_score_codex":0.00018784584,"about_ca_topic_score_gemma":0.00031979184,"teacher_disagreement_score":0.87892646,"about_ca_system_score_codex":0.0000050357025,"about_ca_system_score_gemma":0.000013540851,"threshold_uncertainty_score":0.66424257},"labels":[],"label_agreement":null},{"id":"W2531289487","doi":"10.3233/fun-2008-873-401","title":"Characterizing DNA Bond Shapes Using Trajectories","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decidability; Computer science; Set (abstract data type); Extension (predicate logic); DNA computing; Bond; Rotation (mathematics); Algorithm; Theoretical computer science; Artificial intelligence; Programming language; Computation","score_opus":0.036337564022386935,"score_gpt":0.2591193400557657,"score_spread":0.22278177603337876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531289487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938765,0.00007310525,0.0008543149,0.000038873433,0.0001329496,0.00011493975,0.000012112016,0.000029758912,0.004867438],"genre_scores_gemma":[0.9961192,0.000035269004,0.0023950574,0.0009883464,0.00024225221,0.0000046188848,0.00008252743,0.000008887666,0.0001238438],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914557,0.000016302942,0.00029238997,0.00014473745,0.00011517982,0.0002858395],"domain_scores_gemma":[0.9996406,0.000011570794,0.00010034616,0.00013850695,0.000031700958,0.000077275676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102652084,0.00014865177,0.00014679132,0.000030062562,0.00024452095,0.00004007683,0.00016490128,0.000096176074,0.00005398802],"category_scores_gemma":[0.000043939803,0.0001195362,0.000080175494,0.00007425388,0.000108020395,0.000016638809,0.00015549196,0.00007652541,0.00003479298],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046193538,0.000044724562,0.010155399,0.000034852324,0.000047366495,0.0000054772268,0.00048249602,0.000015406275,0.9860668,0.00010265334,0.00066491344,0.0023336818],"study_design_scores_gemma":[0.0013920078,0.0010565255,0.05077474,0.0000919283,0.00004189119,0.0005110736,0.0015262731,0.0025061707,0.71688694,0.00008526636,0.22397925,0.0011479632],"about_ca_topic_score_codex":0.0000067672595,"about_ca_topic_score_gemma":0.0000010512348,"teacher_disagreement_score":0.26917994,"about_ca_system_score_codex":0.000017091901,"about_ca_system_score_gemma":0.000037069312,"threshold_uncertainty_score":0.48745447},"labels":[],"label_agreement":null},{"id":"W2535511171","doi":"10.1109/itw2.2006.323799","title":"Construction of Optimal Edit Metric Codes","year":2006,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Brock University","funders":"National Science Foundation","keywords":"Edit distance; Hamming distance; Hamming code; Block code; Linear code; Hamming bound; Concatenated error correction code; Computer science; Longest common subsequence problem; Metric (unit); Code word; Algorithm; Mathematics; Theoretical computer science; Discrete mathematics; Decoding methods","score_opus":0.006100342524308951,"score_gpt":0.22141241002618048,"score_spread":0.21531206750187154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535511171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97273695,0.00016534251,0.012367611,0.000021896944,0.00009044451,0.000031087508,0.0000030760268,0.000008988139,0.014574603],"genre_scores_gemma":[0.9856104,0.000009259929,0.013696407,0.000027276099,0.0002576234,6.989452e-7,0.000036314137,0.0000021843507,0.0003598134],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996391,0.00001558816,0.000108332446,0.00011224985,0.000042062802,0.000082686835],"domain_scores_gemma":[0.9998314,0.000007740415,0.000038957925,0.00006738682,0.000041263673,0.000013267366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007050781,0.000047511738,0.00006550577,0.000021951111,0.000020238795,0.000004456083,0.000054192216,0.000067197405,0.000029936315],"category_scores_gemma":[0.000024398318,0.000034317865,0.000042104013,0.00007951156,0.000060511393,6.0834464e-7,0.000040579333,0.000021252434,0.000002507163],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022265365,0.000041600513,0.015822425,0.000005669775,0.000013110807,5.3112143e-7,8.4540164e-7,0.00020452248,0.9732339,0.00255328,0.001984537,0.006117341],"study_design_scores_gemma":[0.00020373393,0.00025553268,0.009737836,0.0000022346044,0.0000072487023,0.000011857044,0.000025389112,0.00017097677,0.97716403,0.00024083948,0.012085288,0.000095008705],"about_ca_topic_score_codex":0.00002837956,"about_ca_topic_score_gemma":0.0000030135482,"teacher_disagreement_score":0.0142147895,"about_ca_system_score_codex":0.0000018448777,"about_ca_system_score_gemma":0.0000081246835,"threshold_uncertainty_score":0.1399442},"labels":[],"label_agreement":null},{"id":"W2536847431","doi":"10.1017/cbo9781316155318.005","title":"Detection and Delimitation","year":2016,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Food Inspection Agency","funders":"","keywords":"Computer science","score_opus":0.01740549043322229,"score_gpt":0.19020127299754927,"score_spread":0.17279578256432698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536847431","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008117481,0.00017387711,0.0027400362,0.000007493177,0.00011554987,0.00012773847,0.000031024763,0.000025226218,0.9886616],"genre_scores_gemma":[0.09786586,0.00015587926,0.000052642154,0.000046186848,0.00017478877,1.9413993e-7,0.000026235113,0.000012779819,0.90166545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943143,0.000018656976,0.0000726147,0.00031228852,0.00005318923,0.00011184714],"domain_scores_gemma":[0.9996308,0.000012524371,0.00008133884,0.00014748998,0.00006782821,0.000059999984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044487897,0.00014916676,0.00011033592,0.00003260894,0.000090167494,0.000012091498,0.00009743525,0.00030990056,5.774108e-7],"category_scores_gemma":[0.000010427109,0.00013279781,0.00006799153,0.0000015751639,0.00010238151,0.00000169164,0.00019527419,0.00008676722,0.0000026169832],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052556576,0.000011068604,0.000018333994,0.000088625064,0.0002646495,0.00006809573,0.000010910421,0.0000011594294,0.34862623,0.46506065,0.005588776,0.17973594],"study_design_scores_gemma":[0.00029455288,0.00017537679,0.00005619312,0.00003716926,0.000044682398,0.0000123569,0.000004228488,0.000010632506,0.012172083,0.000013002112,0.98694503,0.00023467068],"about_ca_topic_score_codex":0.0000041222956,"about_ca_topic_score_gemma":0.0000012561474,"teacher_disagreement_score":0.98135626,"about_ca_system_score_codex":0.00001830753,"about_ca_system_score_gemma":0.000014636843,"threshold_uncertainty_score":0.54153377},"labels":[],"label_agreement":null},{"id":"W2547510902","doi":"10.1007/978-3-319-46376-6_8","title":"Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts","year":2016,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Computer science; Underspecification; Component (thermodynamics); Parsing; Reset (finance); Context (archaeology); Grammar; Synchronization (alternating current); Process (computing); Factor (programming language); Distributed computing; Programming language; Theoretical computer science; Artificial intelligence; Computer network; Linguistics","score_opus":0.04305922777302051,"score_gpt":0.27112791666149183,"score_spread":0.22806868888847132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547510902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8606221,0.072106995,0.03012301,0.002952641,0.005303602,0.006170965,0.0012673314,0.00048953644,0.020963797],"genre_scores_gemma":[0.9900593,0.0044906284,0.0006952303,0.00012046227,0.00033234348,0.00006341971,0.0003327633,0.000041815194,0.00386404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723417,0.00024743643,0.00085670257,0.00094141316,0.0002865169,0.00043374026],"domain_scores_gemma":[0.9982763,0.000110359215,0.0006277123,0.00058080436,0.00023541623,0.00016941428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004468365,0.00056304614,0.000675933,0.00010284159,0.00037444232,0.0001627174,0.00056355377,0.0004788456,0.000017647835],"category_scores_gemma":[0.00006854088,0.00037028713,0.00014145332,0.000050471295,0.0004165959,0.000033804532,0.0009449507,0.00030656977,0.000005050112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022455333,0.0004889097,0.006823833,0.007300268,0.0016822986,0.00026029727,0.0045885704,0.0017944868,0.04725775,0.6872494,0.0020236566,0.23828499],"study_design_scores_gemma":[0.02872106,0.009849009,0.02838775,0.06624881,0.0018854963,0.0012088654,0.09864203,0.21901791,0.01793018,0.27336466,0.22453849,0.030205756],"about_ca_topic_score_codex":0.00011533785,"about_ca_topic_score_gemma":0.0007957529,"teacher_disagreement_score":0.41388476,"about_ca_system_score_codex":0.000021674763,"about_ca_system_score_gemma":0.000036218706,"threshold_uncertainty_score":0.9998749},"labels":[],"label_agreement":null},{"id":"W2555455530","doi":"10.1109/allerton.2009.5394927","title":"Controlling errors in the process of molecular self-assembly","year":2009,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Tile; Proofreading; Process (computing); Computer science; Set (abstract data type); Computation; Algorithm; Programming language; Physics; Materials science","score_opus":0.007066150729280214,"score_gpt":0.2596362722475675,"score_spread":0.2525701215182873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555455530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924603,0.0002216082,0.0010246082,0.0003012286,0.000012723568,0.00011238151,3.6662405e-7,0.000008407877,0.005858349],"genre_scores_gemma":[0.99829173,0.000009841963,0.0004915041,0.001157026,0.000030332882,0.000002323626,0.000005396902,0.0000022217243,0.00000961591],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944735,0.000050612474,0.00014602621,0.00014530844,0.000072633105,0.00013806489],"domain_scores_gemma":[0.99977297,0.000010759707,0.000043067732,0.00012142485,0.000035768855,0.000016033438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023175475,0.00007143999,0.00009414611,0.000014690304,0.000019590603,0.0000072982425,0.00019631024,0.00007166268,0.0000016692901],"category_scores_gemma":[0.000041173276,0.000040336206,0.000051572875,0.000088723624,0.00001374279,9.465079e-7,0.000015194388,0.000051113864,7.962964e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031593197,0.000109999135,0.002210355,0.0000056856197,0.00000878325,0.0000048075226,0.00006158404,0.00034716737,0.99507487,0.00043281663,0.000021751819,0.001690604],"study_design_scores_gemma":[0.00071140664,0.0008203294,0.013167828,0.000012425854,0.000011486067,0.000009475378,0.000343745,0.0007448435,0.9824856,0.0010171989,0.00050625333,0.00016941605],"about_ca_topic_score_codex":0.0000044506332,"about_ca_topic_score_gemma":0.0000029368634,"teacher_disagreement_score":0.012589261,"about_ca_system_score_codex":0.0000019309305,"about_ca_system_score_gemma":0.000015653208,"threshold_uncertainty_score":0.16448627},"labels":[],"label_agreement":null},{"id":"W2555585814","doi":"","title":"Space-Efficient Generation of Nonisomorphic Maps and Hypermaps","year":2015,"lang":"en","type":"article","venue":"J. Integer Seq.","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Bipartite graph; Orientation (vector space); Isomorphism (crystallography); Bijection; Combinatorics; Vertex (graph theory); Mathematics; Code (set theory); Coding (social sciences); Computer science; Geometry; Graph","score_opus":0.050688538803507814,"score_gpt":0.25832432671643335,"score_spread":0.20763578791292553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555585814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945033,0.0005970122,0.0023175662,0.00021636087,0.00016883279,0.00007003428,0.000008351865,0.0000074696472,0.0021110706],"genre_scores_gemma":[0.9985487,0.00001685037,0.0006827358,0.00016967715,0.00022353492,0.0000025796703,0.00006783739,0.000005354994,0.00028273737],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947256,0.000037434053,0.00012535973,0.00018167937,0.000071388415,0.000111562986],"domain_scores_gemma":[0.999662,0.0000055537557,0.00004961169,0.00012595313,0.00009154479,0.00006534435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016376717,0.00008013006,0.000096223885,0.000018774532,0.000024621286,0.0000118031585,0.00006873067,0.00009336556,0.000004873985],"category_scores_gemma":[0.000062504994,0.00005922878,0.000032913802,0.000042335825,0.00006475848,0.0000010787917,0.000101798636,0.00004895101,0.0000065682234],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030410914,0.000053893946,0.003334328,0.0000081059,0.00001523526,0.0000023247098,0.00005702728,0.00028547263,0.9901719,0.0006804533,0.0036888698,0.001671954],"study_design_scores_gemma":[0.0009296381,0.0010730642,0.0023700118,0.000023406505,0.000023089055,0.00006290414,0.0002209142,0.009738,0.9312404,0.00025261627,0.053725272,0.00034071098],"about_ca_topic_score_codex":0.000010625512,"about_ca_topic_score_gemma":0.0000043987607,"teacher_disagreement_score":0.058931552,"about_ca_system_score_codex":0.0000064699902,"about_ca_system_score_gemma":0.000028799855,"threshold_uncertainty_score":0.24152794},"labels":[],"label_agreement":null},{"id":"W2573386179","doi":"10.1016/j.ic.2017.01.009","title":"Further remarks on DNA overlap assembly","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Western University; National Science Foundation","keywords":"Iterated function; Decidability; String (physics); Completeness (order theory); Computer science; Closure (psychology); Formal language; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.012628625070501309,"score_gpt":0.2728790361605946,"score_spread":0.2602504110900933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573386179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96618545,0.000013474425,0.013565668,0.00032675444,0.00012588264,0.00007561041,0.0000024339163,0.000013821856,0.01969092],"genre_scores_gemma":[0.99859315,0.0000114663835,0.00037466758,0.0007797052,0.000077901204,0.0000020298698,0.00010196024,0.0000020304701,0.00005711688],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996587,0.000014628701,0.00011552921,0.000075111384,0.00006247155,0.00007358057],"domain_scores_gemma":[0.99968946,0.0000069152165,0.00012250507,0.00010654408,0.00004560208,0.000028998124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010775405,0.000060766317,0.000048039492,0.000018465274,0.0001943894,0.00014622007,0.000071197435,0.00006711173,0.0000028890936],"category_scores_gemma":[0.00006446001,0.000048677462,0.000022615806,0.000010203315,0.000026471902,0.000020995209,0.000051538424,0.000035979494,0.00002470797],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020213018,0.00004640677,0.008143306,0.000032147163,0.000035634013,0.0000010866819,0.00026373015,0.000955225,0.025865022,0.0027443664,0.003004193,0.95870674],"study_design_scores_gemma":[0.003131704,0.0018212715,0.7402784,0.00009330613,0.00002096554,0.00003472377,0.0005685471,0.05643503,0.03888333,0.002216372,0.15567398,0.0008423748],"about_ca_topic_score_codex":0.000004339878,"about_ca_topic_score_gemma":0.0000015751772,"teacher_disagreement_score":0.9578644,"about_ca_system_score_codex":0.0000037018583,"about_ca_system_score_gemma":0.000008788605,"threshold_uncertainty_score":0.19850093},"labels":[],"label_agreement":null},{"id":"W2573653203","doi":"","title":"Reconstruction Number Of Separable Self Complementary Graphs And Others.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Separable space; Combinatorics; Mathematical analysis","score_opus":0.008815491616570912,"score_gpt":0.24589201067754055,"score_spread":0.23707651906096963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573653203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99744934,0.00009274303,0.000014877144,0.000067768575,0.00026684237,0.00006148435,0.000006157769,0.000014420186,0.0020263745],"genre_scores_gemma":[0.99907345,0.00009714796,0.00066201325,0.000061491104,0.0000069640487,0.0000022505496,0.000006505185,0.0000054074603,0.000084746],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994874,0.000039605024,0.00013024634,0.00017685095,0.000045473975,0.00012042139],"domain_scores_gemma":[0.9997304,0.000018038447,0.00006123043,0.00011845627,0.000035773137,0.00003607178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011193823,0.000073768846,0.00009462375,0.000011389198,0.000041130585,0.0000047112803,0.000068807116,0.00006378993,0.0000490038],"category_scores_gemma":[0.000014242621,0.00004930801,0.000036222893,0.00004067021,0.00007291731,0.0000030433262,0.000068341236,0.000024244442,0.000004503146],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005390349,0.000078147736,0.39549515,0.00001585295,0.0000874126,0.0000010136971,0.000022692597,1.3462733e-7,0.5439487,0.04251472,0.0013544906,0.016427772],"study_design_scores_gemma":[0.003974712,0.0009312202,0.04761166,0.00009777596,0.000050303766,0.000121082325,0.0001341698,0.000022419488,0.49917364,0.42522252,0.022101263,0.0005592336],"about_ca_topic_score_codex":0.000012309466,"about_ca_topic_score_gemma":0.0000017338338,"teacher_disagreement_score":0.38270777,"about_ca_system_score_codex":0.000005088726,"about_ca_system_score_gemma":0.000009233398,"threshold_uncertainty_score":0.20107223},"labels":[],"label_agreement":null},{"id":"W2573697211","doi":"","title":"On Row-Cyclic Array Codes Detecting and Correcting CT-Bursts Array Errors.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm","score_opus":0.010654156326985981,"score_gpt":0.2405789633342636,"score_spread":0.2299248070072776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573697211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959719,0.00020850977,0.0003649899,0.00016253517,0.0010386425,0.00011797686,0.0000030308718,0.00005116804,0.0020812063],"genre_scores_gemma":[0.9992174,0.000029732784,0.00019224969,0.00022814919,0.000060554805,0.00000809698,0.0000063305324,0.00002121119,0.00023628723],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870175,0.000106764026,0.00021293771,0.00049571786,0.000112812806,0.00037004243],"domain_scores_gemma":[0.99928236,0.0001739713,0.00012026731,0.00025964822,0.000049482667,0.00011427776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003198116,0.00021124764,0.00019795528,0.000034033015,0.00021389606,0.000035348283,0.00017939416,0.0001148546,0.000010561503],"category_scores_gemma":[0.0006378522,0.00014135469,0.00007413668,0.00008456313,0.000096754025,0.00000530209,0.00009272628,0.00012995114,0.00001754106],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049663093,0.00004726436,0.01751054,0.0000076136457,0.000029584515,0.000005662279,0.000025258287,0.0000013910677,0.957611,0.0016137782,0.00020862653,0.022889586],"study_design_scores_gemma":[0.0009878944,0.0007558561,0.005119956,0.00010631062,0.000013690558,0.00004828899,0.000076449374,0.000005565479,0.9721106,0.017724702,0.0026677414,0.00038290748],"about_ca_topic_score_codex":0.000011247818,"about_ca_topic_score_gemma":0.000008499145,"teacher_disagreement_score":0.022506678,"about_ca_system_score_codex":0.000021000973,"about_ca_system_score_gemma":0.00001842463,"threshold_uncertainty_score":0.57642764},"labels":[],"label_agreement":null},{"id":"W2576274719","doi":"10.1515/ausi-2016-0007","title":"Parallel communicating grammar systems with context-free components are Turing complete for any communication model","year":2016,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Computer science; Grammar; USable; Programming language; Theoretical computer science; Linguistics","score_opus":0.02517941558516766,"score_gpt":0.21599213534783668,"score_spread":0.190812719762669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576274719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8120158,0.00028974953,0.18292636,0.0010007359,0.00005986018,0.0008489867,0.00029635933,0.00007577715,0.002486429],"genre_scores_gemma":[0.968807,0.00008270698,0.030393165,0.0001854519,0.000016404842,0.000016666323,0.00032014755,0.0000152953,0.00016315174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886405,0.000089010944,0.0003442795,0.0002014502,0.0001527546,0.0003484347],"domain_scores_gemma":[0.99816334,0.00018171436,0.00039319377,0.0009313755,0.00022246108,0.000107924374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023966967,0.00020315209,0.00024602783,0.00005684813,0.00042191727,0.00006735337,0.001035055,0.000117466065,0.0000043683926],"category_scores_gemma":[0.00011399523,0.00014029225,0.000087435794,0.000069562644,0.00020475415,0.000053247353,0.0006804021,0.00009256966,0.000007004945],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007277423,0.0014701653,0.0397315,0.0023895286,0.0046046926,0.00002468847,0.009725607,0.020444933,0.701584,0.07773979,0.08159173,0.05341597],"study_design_scores_gemma":[0.048808187,0.0050151064,0.022167314,0.0057366686,0.0008370808,0.0002275644,0.035537988,0.61417174,0.008955971,0.0047519305,0.24793087,0.0058595785],"about_ca_topic_score_codex":0.000027760578,"about_ca_topic_score_gemma":0.00004252541,"teacher_disagreement_score":0.692628,"about_ca_system_score_codex":0.000042260537,"about_ca_system_score_gemma":0.00002718568,"threshold_uncertainty_score":0.5720952},"labels":[],"label_agreement":null},{"id":"W2578137639","doi":"","title":"A Construction of Multi-receiver Authentication Codes with Dynamic Sender from Linear Codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Communication source; Mathematics; Authentication (law); Computer science; Computer security; Statistics","score_opus":0.00990950214851381,"score_gpt":0.24099058594119024,"score_spread":0.23108108379267644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578137639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99510455,0.000088859146,0.0042790854,0.00007620396,0.00022662799,0.00009470785,0.00003148754,0.00001704424,0.00008142711],"genre_scores_gemma":[0.99563235,0.00003905936,0.0041067936,0.00002498715,0.000010466909,0.0000040786426,0.00006964557,0.000008821377,0.00010378985],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993473,0.00005206128,0.00014923267,0.0002466502,0.000078271565,0.00012644482],"domain_scores_gemma":[0.9995266,0.000031911837,0.00010859298,0.00018374479,0.00010947261,0.00003965442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007693376,0.000102709426,0.00012685433,0.000017504364,0.000039761868,0.000005619286,0.000106691936,0.000115624185,0.000016359816],"category_scores_gemma":[0.000051942192,0.000062339954,0.00004086738,0.000052467527,0.0001640113,0.0000037011469,0.00005314661,0.000039334216,0.000008287464],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010289819,0.00009706162,0.020997498,0.0000059190443,0.00007551538,0.0000010090822,0.000027359825,0.000003300204,0.97061586,0.0029414755,0.000032204105,0.0050998935],"study_design_scores_gemma":[0.0045203026,0.00090866786,0.071807235,0.00013479621,0.00008592633,0.000014472311,0.0001473632,0.0017104665,0.90106785,0.017779093,0.0013250767,0.00049875496],"about_ca_topic_score_codex":0.00002175427,"about_ca_topic_score_gemma":0.0000115068315,"teacher_disagreement_score":0.06954802,"about_ca_system_score_codex":0.000012770254,"about_ca_system_score_gemma":0.000026403923,"threshold_uncertainty_score":0.25421497},"labels":[],"label_agreement":null},{"id":"W2579425220","doi":"","title":"Duplications and pseudo-duplications","year":2016,"lang":"en","type":"article","venue":"International journal of unconventional computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Gene duplication; Nondeterministic finite automaton; Nondeterministic algorithm; String (physics); Computer science; Mathematics; Algorithm; Automaton; Theoretical computer science; Automata theory; Data structure; Genetics; Biology; Programming language","score_opus":0.012083702524488689,"score_gpt":0.28452689376425866,"score_spread":0.27244319123976996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579425220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9036034,0.00021239294,0.091804504,0.0033266523,0.0004383301,0.000041385007,0.0000095630085,0.000006983702,0.00055680936],"genre_scores_gemma":[0.99373186,0.000070348666,0.004833314,0.0002578547,0.00086408143,8.1030197e-7,0.000011510105,0.00000597103,0.00022426088],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999159,0.000038671405,0.00035525303,0.00014989036,0.00019538919,0.00010182361],"domain_scores_gemma":[0.99893165,0.00008489349,0.00029213348,0.000080005746,0.00054416887,0.0000671815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031742227,0.00007947227,0.000088840236,0.000072665214,0.00006870814,0.000031766813,0.00028560671,0.00005165629,0.000029044377],"category_scores_gemma":[0.00024343221,0.000053299595,0.00010901443,0.00004457671,0.00007857896,0.00001035853,0.00015432946,0.00006112224,0.0000071898426],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011101747,0.0001802064,0.06406054,0.000005395479,0.0003358591,0.000010761589,0.000025866264,0.00011783627,0.8025146,0.020288868,0.0020247786,0.11032428],"study_design_scores_gemma":[0.0077102347,0.001677801,0.5851293,0.0008056238,0.00012688454,0.004121689,0.00021791887,0.0020346236,0.09596028,0.03752719,0.26348907,0.0011993563],"about_ca_topic_score_codex":0.0000014983627,"about_ca_topic_score_gemma":0.0000011031061,"teacher_disagreement_score":0.7065543,"about_ca_system_score_codex":0.000021363721,"about_ca_system_score_gemma":0.000054130956,"threshold_uncertainty_score":0.21734944},"labels":[],"label_agreement":null},{"id":"W2594785953","doi":"","title":"Star Bi-Coloring of Bipartite Graphs using Column Generation.","year":2015,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bipartite graph; Combinatorics; Column (typography); Star (game theory); Computer science; Mathematics; Computer network; Graph","score_opus":0.041415223447748686,"score_gpt":0.2686880458231554,"score_spread":0.22727282237540675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594785953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99309605,0.000541666,0.004115488,0.00004503164,0.0016536611,0.00026760856,0.0000060978623,0.000025065687,0.0002493223],"genre_scores_gemma":[0.99602145,0.0002678199,0.0032452885,0.000116478564,0.00016827165,0.000012043929,0.000112445276,0.000015278616,0.000040897157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883467,0.00012200077,0.00030853567,0.00035580093,0.00015667088,0.00022234725],"domain_scores_gemma":[0.9992289,0.00002679399,0.00018898759,0.00018016576,0.0002471555,0.00012799604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273829,0.00017389632,0.00022498664,0.00009875834,0.00014469838,0.00004437307,0.00012262542,0.0002247044,0.0000059515396],"category_scores_gemma":[0.00017058646,0.0001590064,0.00007781047,0.00033716374,0.000121283716,0.00001086471,0.00011791491,0.00009753304,4.784549e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025084398,0.0014400042,0.030859977,0.00006891532,0.00039166404,0.000014672523,0.00026646318,0.60879725,0.29238343,0.05387708,0.004282332,0.0051097716],"study_design_scores_gemma":[0.022017976,0.015492852,0.003714411,0.00042776804,0.00053561747,0.000041537493,0.0011136419,0.79710805,0.12351351,0.016790487,0.01597677,0.0032673592],"about_ca_topic_score_codex":0.000010389042,"about_ca_topic_score_gemma":0.0000042299384,"teacher_disagreement_score":0.18831082,"about_ca_system_score_codex":0.000018592651,"about_ca_system_score_gemma":0.00005458063,"threshold_uncertainty_score":0.64840925},"labels":[],"label_agreement":null},{"id":"W2599580500","doi":"10.1109/ita.2016.7888180","title":"On coding for data analytics: New information distances","year":2016,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Coding (social sciences); Bounded function; Code word; Theoretical computer science; Computer science; Discrete mathematics; Analytics; Information theory; Algorithm; Combinatorics; Mathematics; Decoding methods; Data mining; Statistics","score_opus":0.05599704649347067,"score_gpt":0.29620506387771334,"score_spread":0.24020801738424266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599580500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0966874,0.000038853188,0.8957848,0.00090377004,0.00013892303,0.00013641665,0.000047599355,0.00003199547,0.0062302332],"genre_scores_gemma":[0.99543786,0.000025419458,0.0026748572,0.0005935028,0.0001675029,0.0000012084905,0.0001457642,0.000002663188,0.00095122383],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996448,0.0000055633905,0.00009511131,0.0001222516,0.000035385638,0.00009688962],"domain_scores_gemma":[0.9996679,0.000033276723,0.000034875542,0.00020971712,0.000021438062,0.000032816464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009589374,0.00004932747,0.000045026885,0.000009370865,0.00003393992,0.000018471863,0.0001849817,0.00004186272,0.000016101336],"category_scores_gemma":[0.00022976096,0.000024954817,0.000021284188,0.000018596542,0.00001415479,0.0000066379644,0.00009177162,0.000010240261,0.000016495247],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030860046,0.000031757972,0.0019557213,0.000019786828,0.000058192763,2.3230427e-7,0.000009702201,0.000014883944,0.22839206,0.02682571,0.15802592,0.58435744],"study_design_scores_gemma":[0.0010578263,0.00067883305,0.00068878423,0.000034012948,0.000012306782,0.0000012439517,0.000030040288,0.0017643252,0.09001306,0.0033562472,0.9021109,0.00025245137],"about_ca_topic_score_codex":0.0000028993486,"about_ca_topic_score_gemma":0.0000074089808,"teacher_disagreement_score":0.8987505,"about_ca_system_score_codex":0.0000034186698,"about_ca_system_score_gemma":0.000015954538,"threshold_uncertainty_score":0.101762794},"labels":[],"label_agreement":null},{"id":"W2620910963","doi":"10.14232/actacyb.22.2.2015.3","title":"Methods for Relativizing Properties of Codes","year":2015,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Decidability; Alphabet; Class (philosophy); Computer science; Set (abstract data type); Realm; Property (philosophy); Code (set theory); Simplicity; Discrete mathematics; Theoretical computer science; Mathematics; Linguistics; Artificial intelligence; Programming language; Philosophy; Epistemology","score_opus":0.0825713404205394,"score_gpt":0.34630335875625046,"score_spread":0.263732018335711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620910963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97140616,0.0016707042,0.02012242,0.00023074185,0.00010715742,0.0002187,0.0000035103033,0.00001551203,0.006225074],"genre_scores_gemma":[0.9201032,0.000013866138,0.07926178,0.00007743737,0.000089965186,0.000010835508,0.000011550255,0.000008195,0.000423185],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938935,0.00008739054,0.00015355108,0.00017623359,0.000045285477,0.00014820934],"domain_scores_gemma":[0.9995888,0.000036214748,0.00006118321,0.00014921576,0.00010793346,0.00005663702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041146218,0.00008117285,0.00012878289,0.0000125731785,0.000024920877,0.000008607032,0.00013392148,0.000096086034,0.000002300708],"category_scores_gemma":[0.0006966279,0.000057124096,0.000060232534,0.000036970487,0.00008777029,0.000001550111,0.000106851425,0.000038001603,0.0000012358561],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007614181,0.000026279586,0.00044461357,0.000011808988,0.00002439214,8.655761e-8,0.000057205983,0.0000054106217,0.98549473,0.0004601281,0.00059675536,0.012802435],"study_design_scores_gemma":[0.00034876095,0.00054750004,0.00034610918,0.000020698635,0.00001784943,0.000004520813,0.00008470844,0.00042698704,0.90316886,0.00094438164,0.09396214,0.00012749109],"about_ca_topic_score_codex":0.0000065998834,"about_ca_topic_score_gemma":0.0000014898045,"teacher_disagreement_score":0.093365386,"about_ca_system_score_codex":0.0000042226116,"about_ca_system_score_gemma":0.00003380821,"threshold_uncertainty_score":0.2329453},"labels":[],"label_agreement":null},{"id":"W2728231354","doi":"10.1007/978-3-319-62389-4_37","title":"Bend Complexity and Hamiltonian Cycles in Grid Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hamiltonian path; Transpose; Hamiltonian path problem; Hamiltonian (control theory); Grid; Computer science; Computational complexity theory; Combinatorics; Graph; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Geometry; Physics; Mathematical optimization; Quantum mechanics","score_opus":0.02927127404288834,"score_gpt":0.2694253609652324,"score_spread":0.24015408692234405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728231354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6415715,0.006993902,0.31933817,0.0014770848,0.0046303067,0.0013055875,0.00010971702,0.000096350195,0.024477357],"genre_scores_gemma":[0.9819341,0.00017129928,0.016584989,0.00057270273,0.0005669999,0.0000020044927,0.000035092075,0.0000149021735,0.000117963194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982862,0.00002263567,0.00023647104,0.00090579374,0.00018060647,0.00036830676],"domain_scores_gemma":[0.9991488,0.000045505723,0.00014226355,0.00052334805,0.000051303545,0.000088816865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038726538,0.0002938829,0.0003073885,0.0001575841,0.0002042728,0.00014335536,0.00077492703,0.00033203917,0.0000054865623],"category_scores_gemma":[0.00007891494,0.00023907091,0.00006910392,0.000045263572,0.0013164686,0.000007090111,0.0008886973,0.0003564987,0.0000023070336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006934279,0.0000733738,0.020441758,0.00009359508,0.000031095366,0.00014674722,0.00018646508,0.0013746334,0.028577745,0.0047059925,0.00006416211,0.9442351],"study_design_scores_gemma":[0.0028412535,0.002679052,0.24985035,0.0018370188,0.000045225213,0.00041560736,0.000001667746,0.028151011,0.035648733,0.6315716,0.04207333,0.004885154],"about_ca_topic_score_codex":0.000043235967,"about_ca_topic_score_gemma":0.0007135243,"teacher_disagreement_score":0.93934995,"about_ca_system_score_codex":0.000023581173,"about_ca_system_score_gemma":0.000082053084,"threshold_uncertainty_score":0.97490287},"labels":[],"label_agreement":null},{"id":"W2737619095","doi":"10.1007/978-3-642-32208-2_8","title":"Deciding Whether a Regular Language Is Generated by a Splicing System","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Programming language; Theoretical computer science; Natural language processing","score_opus":0.011365670235612392,"score_gpt":0.2351745338984587,"score_spread":0.2238088636628463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737619095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082629666,0.0078034415,0.90662616,0.00009547886,0.0006162218,0.00028463316,0.000017834593,0.000062596366,0.0018639795],"genre_scores_gemma":[0.974076,0.000044886092,0.022703476,0.0012812092,0.0011349476,0.000003777706,0.000050402028,0.000038884595,0.00066643825],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99804187,0.000035511162,0.00028532377,0.0008589292,0.00027106883,0.0005073169],"domain_scores_gemma":[0.9990732,0.000039480234,0.00016169836,0.00052366214,0.00008633574,0.00011564217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000526861,0.0003521139,0.00031209216,0.00010764093,0.00015219877,0.00010332414,0.0006499298,0.00045398145,0.000014007472],"category_scores_gemma":[0.000035838424,0.0002769334,0.0001073893,0.00013203395,0.00022228595,0.0000052301484,0.0005383248,0.00029890248,0.000014329434],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011704431,0.000013022199,0.00012321518,0.00004407339,0.000022670065,0.000016182228,0.00018699381,0.0005261917,0.80827445,0.00015204928,0.0001122939,0.19051714],"study_design_scores_gemma":[0.00051268045,0.00040221514,0.000050151997,0.0008045237,0.000040695853,0.00019014596,0.0000039245383,0.030182898,0.9476555,0.0006594756,0.018012458,0.0014853205],"about_ca_topic_score_codex":0.000021004005,"about_ca_topic_score_gemma":0.000011363593,"teacher_disagreement_score":0.8914463,"about_ca_system_score_codex":0.00008174582,"about_ca_system_score_gemma":0.00007313223,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null},{"id":"W2754500190","doi":"10.1142/s0129054114400048","title":"HYPERGRAPH AUTOMATA: A THEORETICAL MODEL FOR PATTERNED SELF-ASSEMBLY","year":2014,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hypergraph; Automaton; Mobile automaton; Computer science; Expressive power; Regular language; Büchi automaton; Theoretical computer science; Automata theory; Discrete mathematics; Deterministic automaton; Mathematics","score_opus":0.011402478454349137,"score_gpt":0.2961747853438949,"score_spread":0.28477230688954575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754500190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43271717,0.000005230557,0.5664541,0.00035003468,0.00034133202,0.00002946573,0.000002250634,0.0000035799549,0.000096799326],"genre_scores_gemma":[0.8728822,0.000007796872,0.12652512,0.00024883225,0.0003222122,0.0000011745861,0.000004610159,0.0000029723174,0.0000051036864],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990901,0.00002547144,0.0003132262,0.00015018883,0.0003047102,0.00011633828],"domain_scores_gemma":[0.99849665,0.000063486965,0.0002389599,0.00012301804,0.0010210052,0.000056873178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074489496,0.00006851946,0.00010452249,0.00011842293,0.00006677385,0.00007605236,0.0008450301,0.00003567358,0.000001821685],"category_scores_gemma":[0.00017440977,0.00005206731,0.00011577113,0.000085321444,0.00024313433,0.000022870163,0.00015942498,0.00004558501,7.1684934e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025949627,0.0007531214,0.0036724184,0.00002042545,0.0002549617,0.0000024721912,0.0002274465,0.02667224,0.6000915,0.22228414,0.00073274656,0.14502901],"study_design_scores_gemma":[0.0007152097,0.00067598576,0.0025093295,0.000029066186,0.000013479477,0.00006306769,0.000004181803,0.95393836,0.029295761,0.01134641,0.0012995318,0.00010960604],"about_ca_topic_score_codex":4.977906e-7,"about_ca_topic_score_gemma":4.4271397e-7,"teacher_disagreement_score":0.9272661,"about_ca_system_score_codex":0.000014922566,"about_ca_system_score_gemma":0.0001449003,"threshold_uncertainty_score":0.21232432},"labels":[],"label_agreement":null},{"id":"W2756098802","doi":"10.1016/j.ic.2017.09.004","title":"Transducer descriptions of DNA code properties and undecidability of antimorphic problems","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Western University","keywords":"Undecidable problem; Decidability; Property (philosophy); Permutation (music); Discrete mathematics; Involution (esoterism); Mathematics; Regular language; Computer science; Automaton; Theoretical computer science","score_opus":0.05689885418023543,"score_gpt":0.2635822840208109,"score_spread":0.20668342984057547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756098802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984699,0.00006266981,0.014629863,0.00008672063,0.00002523442,0.000117973716,0.000007836935,0.0000039357287,0.00036677686],"genre_scores_gemma":[0.99940467,0.00003240036,0.00048980146,0.000028309787,0.000008300319,0.0000023666792,0.000027574077,0.0000010756174,0.0000055179553],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996583,0.00001546665,0.0001847456,0.000054715987,0.000043410007,0.000043354587],"domain_scores_gemma":[0.99966294,0.0000041211388,0.00015037916,0.00006993635,0.00009583974,0.000016812639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001236944,0.000042704552,0.00006818416,0.000017756687,0.00009474046,0.000029638564,0.000044058695,0.00004449326,9.654652e-7],"category_scores_gemma":[0.00004351303,0.00003242011,0.000016766815,0.000013633674,0.00012621825,0.000025601514,0.00003439552,0.000020316495,2.51276e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014587937,0.00009112939,0.054205995,0.0005325242,0.000049909737,7.2041395e-8,0.0012713064,0.0016995909,0.720545,0.0009894413,0.00004776877,0.22042136],"study_design_scores_gemma":[0.0012977882,0.0008337704,0.8030571,0.00011468297,0.000026872729,0.0000109393,0.00041413947,0.031586934,0.1593596,0.001532694,0.0015369667,0.00022853324],"about_ca_topic_score_codex":0.000016760532,"about_ca_topic_score_gemma":0.000008118632,"teacher_disagreement_score":0.74885106,"about_ca_system_score_codex":0.0000015787047,"about_ca_system_score_gemma":0.0000130738745,"threshold_uncertainty_score":0.13220537},"labels":[],"label_agreement":null},{"id":"W2761665680","doi":"10.1109/cibcb.2017.8058568","title":"Evaluation of the salmon algorithm","year":2017,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Algorithm; Computer science; Spawn (biology); Metaheuristic; Mathematical optimization; Mathematics; Fishery; Biology","score_opus":0.04458964236650626,"score_gpt":0.3217032764539765,"score_spread":0.27711363408747025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761665680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9690106,0.00007773052,0.00080699765,0.0001238223,0.00012580167,0.00007068414,0.0000012213287,0.0000018959312,0.02978126],"genre_scores_gemma":[0.99890685,0.0000039019174,0.00059521885,0.00005150383,0.00008589436,0.0000014100001,0.0000024529,0.0000014333123,0.00035136344],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964935,0.000045710254,0.0000539295,0.00008166446,0.00011900928,0.000050327108],"domain_scores_gemma":[0.99952817,0.0000021472144,0.00006200832,0.00028949967,0.00010901905,0.000009141144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004902227,0.000030351208,0.000031556785,0.0000021550477,0.00010400957,0.000010154274,0.00020551987,0.000041388776,0.000017837803],"category_scores_gemma":[0.00021230496,0.000015637816,0.000039018047,0.0000065008435,0.000050128565,5.8760514e-7,0.0001475427,0.000018036983,0.0000016000231],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000278489,0.000020107891,0.0067972774,0.0000011575012,0.00001609033,4.7358874e-8,0.0000031693799,0.000014844492,0.49898285,0.00008439027,0.00039858627,0.49367872],"study_design_scores_gemma":[0.00031686132,0.000096849224,0.21300767,0.0000059452204,0.00003048331,0.0000018191546,0.000013545972,0.0054548373,0.7753261,0.00093385857,0.0047403076,0.00007176921],"about_ca_topic_score_codex":0.000013268413,"about_ca_topic_score_gemma":0.000007716169,"teacher_disagreement_score":0.49360695,"about_ca_system_score_codex":0.0000022766544,"about_ca_system_score_gemma":0.00002085702,"threshold_uncertainty_score":0.0799968},"labels":[],"label_agreement":null},{"id":"W2765086360","doi":"10.1007/978-3-319-94812-6_10","title":"State Complexity of Overlap Assembly","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki","keywords":"Unary operation; Upper and lower bounds; State (computer science); Regular language; Mathematics; Combinatorics; Deterministic finite automaton; Alphabet; Binary number; Discrete mathematics; Operand; Finite-state machine; Automaton; Algorithm; Computer science; Arithmetic; Theoretical computer science","score_opus":0.034177454178357436,"score_gpt":0.2959145557577035,"score_spread":0.26173710157934604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765086360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50817025,0.000105674946,0.490998,0.000059782466,0.0005134409,0.000102517704,0.000009283088,0.000009362899,0.000031733605],"genre_scores_gemma":[0.9077176,0.000016200118,0.09145689,0.00036970183,0.00040115925,0.000002557578,0.00002703049,0.000007794881,0.0000010736334],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99800646,0.000087553846,0.00033276537,0.00090084015,0.0002764662,0.00039593343],"domain_scores_gemma":[0.9987834,0.00004814294,0.00022072809,0.00065081945,0.00022226163,0.000074626725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067731686,0.00024513717,0.00031080795,0.000103187456,0.00007902258,0.00007252491,0.0011533593,0.00024453184,0.000004344236],"category_scores_gemma":[0.00019639794,0.00019536426,0.00010859648,0.00029396298,0.0012979517,0.000003359833,0.0028861505,0.00031680046,0.00000269483],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011313816,0.0002618037,0.035284214,0.0002176309,0.000048305894,0.000015527763,0.00027066594,0.077851534,0.63639206,0.000057242527,0.00006508667,0.24942282],"study_design_scores_gemma":[0.00034589536,0.0008805273,0.036075562,0.00022992496,0.000008277117,0.000015129144,5.265542e-7,0.12502266,0.8042511,0.032301966,0.00019795363,0.0006704876],"about_ca_topic_score_codex":0.00005326939,"about_ca_topic_score_gemma":0.00005214055,"teacher_disagreement_score":0.39954737,"about_ca_system_score_codex":0.00003044816,"about_ca_system_score_gemma":0.00024900268,"threshold_uncertainty_score":0.79667234},"labels":[],"label_agreement":null},{"id":"W2767445968","doi":"","title":"All good (bad) words consisting of four blocks.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.02432879216988814,"score_gpt":0.271579906478491,"score_spread":0.24725111430860286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767445968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98471206,0.00016902896,0.000019152822,0.00015460413,0.0006600922,0.00007356739,0.0000041871945,0.000012965737,0.014194332],"genre_scores_gemma":[0.9990548,0.000019197538,0.00037946066,0.00015931496,0.000041763567,0.0000029478363,0.000014674109,0.00000958961,0.00031825659],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919075,0.00003799912,0.00019511714,0.00025903704,0.00009265053,0.00022447415],"domain_scores_gemma":[0.99909323,0.000026671258,0.00021770605,0.000513254,0.00008356173,0.000065585766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024960982,0.000121528596,0.0001727893,0.000013782024,0.0001815088,0.000037847567,0.0004216607,0.0001430361,0.000012046812],"category_scores_gemma":[0.00043507785,0.00010408126,0.00009334722,0.000022275097,0.00013100603,0.0000027346014,0.00035945183,0.000088595676,0.0000052463124],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010130879,0.0002426176,0.23549385,0.00003753632,0.00021583398,0.000029105144,0.000048865797,0.0000071588634,0.70277673,0.046838745,0.0037820695,0.010426175],"study_design_scores_gemma":[0.0042517204,0.0016398205,0.16780776,0.00014868329,0.00011597333,0.000051654402,0.000100028294,0.00027865887,0.65807176,0.08490505,0.081522375,0.0011065326],"about_ca_topic_score_codex":0.000031494186,"about_ca_topic_score_gemma":0.0000052226465,"teacher_disagreement_score":0.077740304,"about_ca_system_score_codex":0.000005408667,"about_ca_system_score_gemma":0.000028936223,"threshold_uncertainty_score":0.42443106},"labels":[],"label_agreement":null},{"id":"W2771084866","doi":"","title":"Erasing Pattern Languages Distinguishable by a Finite Number of Strings","year":2017,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.006884749596829058,"score_gpt":0.2788451375763609,"score_spread":0.27196038797953187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771084866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764548,0.0002453289,0.013215843,0.000037980182,0.000090304464,0.00005719847,0.000011308393,0.000025247256,0.009862007],"genre_scores_gemma":[0.9958035,0.00003079934,0.0007573952,0.00007383244,0.00024674012,0.0000026127268,0.000059826583,0.000016241052,0.0030090902],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999161,0.00012913256,0.00015287429,0.0002585353,0.000077832396,0.00022061648],"domain_scores_gemma":[0.999303,0.000085504,0.00022569703,0.00029438245,0.000048868376,0.000042550993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047625854,0.00012162149,0.00014481561,0.000010376226,0.0002880279,0.00005189613,0.00032101377,0.00010791888,0.000053981516],"category_scores_gemma":[0.0011170714,0.000102085476,0.00007434394,0.00001805818,0.00013547338,0.000004250912,0.00026533537,0.0001674518,0.0000146102975],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007797133,0.000090837326,0.23005417,0.000052920725,0.0001328556,0.000020150184,0.00021738064,0.00007313527,0.28877205,0.00028152048,0.00063995854,0.47958705],"study_design_scores_gemma":[0.0059860144,0.0021354337,0.112511955,0.00086038857,0.00024235902,0.00018855798,0.002787833,0.008096768,0.5879699,0.006599295,0.26927722,0.0033442716],"about_ca_topic_score_codex":0.00008304948,"about_ca_topic_score_gemma":0.0000011413815,"teacher_disagreement_score":0.47624278,"about_ca_system_score_codex":0.0000058538476,"about_ca_system_score_gemma":0.000013831507,"threshold_uncertainty_score":0.4162925},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017815190517854525,"score_gpt":0.2726757459853574,"score_spread":0.25486055546750286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796415147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9612679,0.00084744015,0.032210123,0.00055598177,0.0012159825,0.0006005457,0.000101358884,0.0001293613,0.003071301],"genre_scores_gemma":[0.99536973,0.000039338698,0.0022471484,0.00057937374,0.0011941292,0.00012171389,0.00018898307,0.000044821354,0.00021477493],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99708235,0.00033704386,0.00050848327,0.0010881673,0.00006458109,0.0009193927],"domain_scores_gemma":[0.9984572,0.00017824836,0.00021549185,0.00075068715,0.00024575106,0.0001526426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007167763,0.00039824608,0.0005090867,0.00009104604,0.00029458775,0.00002915637,0.00067376555,0.00081440894,0.000027538175],"category_scores_gemma":[0.0005555154,0.00030341515,0.00025053526,0.00013767011,0.00071194436,0.0000035233072,0.0003556129,0.00013611416,0.00009454263],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014581383,0.000074152966,0.00063511037,0.000049034672,0.00011397018,0.0000017999955,0.000018182158,0.0000020639425,0.9785691,0.008250652,0.0002608955,0.011879233],"study_design_scores_gemma":[0.0009891673,0.0040548556,0.00032731853,0.000087959444,0.000098769066,0.00016799929,0.00014190956,0.0006609891,0.84518933,0.0024383727,0.14506641,0.0007769191],"about_ca_topic_score_codex":0.00002143565,"about_ca_topic_score_gemma":0.000012637064,"teacher_disagreement_score":0.14480552,"about_ca_system_score_codex":0.000035046658,"about_ca_system_score_gemma":0.00007848771,"threshold_uncertainty_score":0.99994177},"labels":[],"label_agreement":null},{"id":"W2798802328","doi":"","title":"Curly-coated Retriever","year":2006,"lang":"en","type":"book","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Labrador Retriever; Medicine; Surgery","score_opus":0.01020606467948992,"score_gpt":0.2228721755248797,"score_spread":0.21266611084538978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798802328","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026255823,0.0005267764,0.0007202886,0.00003534772,0.00018715448,0.00013200012,0.0000239084,0.00003719498,0.99571174],"genre_scores_gemma":[0.012077562,0.000023017848,0.00021368405,0.0005895704,0.0009848485,0.0000021104665,0.0021130966,0.00002792384,0.9839682],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989506,0.000023135148,0.00022159624,0.0004549505,0.00010812361,0.00024158068],"domain_scores_gemma":[0.9994729,0.000010306008,0.000095924974,0.00029035957,0.00007500193,0.000055462246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009234059,0.0002481497,0.00021093972,0.000025310475,0.000046757046,0.000022368211,0.00023261881,0.0007607129,0.00016500846],"category_scores_gemma":[0.000032640943,0.00018437828,0.00017073075,0.000033741653,0.000068630034,4.905391e-7,0.00020079067,0.00018777988,0.000088336514],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019616411,0.000020693162,0.000063411266,0.000013589862,0.00003936522,0.000008625872,5.018137e-7,0.0000026404562,0.021845236,0.00044220602,0.975917,0.0016271521],"study_design_scores_gemma":[0.00014656215,0.00019000979,0.000059851485,0.000015837313,0.000015132391,0.0000059134004,4.5067316e-7,0.0000068694767,0.017769653,0.00058005605,0.9808996,0.00031010248],"about_ca_topic_score_codex":0.000007830107,"about_ca_topic_score_gemma":0.000008256894,"teacher_disagreement_score":0.01174356,"about_ca_system_score_codex":0.000019060675,"about_ca_system_score_gemma":0.000100135105,"threshold_uncertainty_score":0.75187284},"labels":[],"label_agreement":null},{"id":"W2799617232","doi":"10.1088/1742-6596/1000/1/012067","title":"Decomposition of a Tadpole Graph","year":2018,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Tadpole (physics); Graph; Mathematics; Decomposition; Computer science; Combinatorics; Discrete mathematics; Physics; Biology; Particle physics","score_opus":0.017585922822608454,"score_gpt":0.27772962467439777,"score_spread":0.2601437018517893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799617232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9690549,0.00006526577,0.029634895,0.00007254136,0.0001293037,0.000021498585,0.0000032643945,0.000001834496,0.0010164982],"genre_scores_gemma":[0.9973926,0.00004274671,0.001965852,0.000050478287,0.0005014358,2.2879051e-7,0.0000045964107,0.000003067689,0.00003898788],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955356,0.000030467814,0.0001900283,0.00006718888,0.000075291515,0.000083449035],"domain_scores_gemma":[0.9992381,0.000005869644,0.0002368457,0.00007652431,0.0004113293,0.000031367017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009441497,0.000062886036,0.00012466732,0.000015051498,0.00003680679,0.000013088761,0.00012664004,0.000045177672,0.000011974465],"category_scores_gemma":[0.000023947652,0.00004632561,0.00008341384,0.000054878634,0.00017442538,0.000008052408,0.00004564934,0.00005221251,0.0000012698601],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113907074,0.000041126645,0.0009397047,0.000006996868,0.000029944407,8.4935715e-7,0.000055797944,0.0000039782844,0.9757608,0.0026280326,0.00014248762,0.02027638],"study_design_scores_gemma":[0.00014846498,0.0015978869,0.0020112633,0.000028850858,0.000010512425,0.00001934518,0.000086611886,0.0000066854936,0.9869305,0.007838028,0.0012613137,0.00006053069],"about_ca_topic_score_codex":0.0000016922911,"about_ca_topic_score_gemma":0.0000024811513,"teacher_disagreement_score":0.028337708,"about_ca_system_score_codex":0.0000022137986,"about_ca_system_score_gemma":0.00005030131,"threshold_uncertainty_score":0.18891037},"labels":[],"label_agreement":null},{"id":"W2801247434","doi":"10.2316/j.2010.216.680-0099","title":"Encryption System with Indexing DNA Chromosomes Cryptographic Algorithm","year":2010,"lang":"en","type":"article","venue":"Mechatronic systems and control","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Encryption; Computer science; Cryptography; Search engine indexing; Computational biology; Algorithm; Biology; Information retrieval; Computer security","score_opus":0.0031816651026099494,"score_gpt":0.18463571146267804,"score_spread":0.1814540463600681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801247434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.901727,0.001863309,0.095125556,0.000033776912,0.00045874197,0.00038445627,0.000011300548,0.00006024405,0.00033559193],"genre_scores_gemma":[0.99871933,0.000022227669,0.00037565842,0.000042233733,0.00068160344,0.000057726727,0.000017217842,0.000015819582,0.00006816152],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888176,0.0000743705,0.00021248542,0.00038531062,0.00012829163,0.00031776162],"domain_scores_gemma":[0.9994619,0.000017140625,0.000119877965,0.00023357182,0.00006922209,0.00009829516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035724408,0.0001899029,0.00024407759,0.00004364812,0.00016356533,0.00008278566,0.00012686332,0.00021806914,0.0000033939393],"category_scores_gemma":[0.000011826402,0.00012715576,0.00006583821,0.000072306015,0.00006346789,0.0000054308653,0.000041420237,0.00016379303,0.0000031179263],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078723824,0.000035339985,0.005287357,0.000097903976,0.00017429171,0.00001153946,0.000021757874,0.000039542138,0.9656458,0.009912694,0.000019155363,0.018675921],"study_design_scores_gemma":[0.069018155,0.0266381,0.07583987,0.0028504087,0.0016793616,0.0088959485,0.014342718,0.38225296,0.19289762,0.0012154172,0.21266957,0.011699873],"about_ca_topic_score_codex":0.00007511097,"about_ca_topic_score_gemma":0.000035838348,"teacher_disagreement_score":0.7727482,"about_ca_system_score_codex":0.00000941813,"about_ca_system_score_gemma":0.00003689871,"threshold_uncertainty_score":0.5185261},"labels":[],"label_agreement":null},{"id":"W2810611251","doi":"10.37236/6149","title":"Binary Covering Arrays on Tournaments","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Alphabet; Tournament; Partition (number theory); Graph; Arc (geometry); Transitive relation; Discrete mathematics; Geometry","score_opus":0.00865639612589671,"score_gpt":0.2467909626199264,"score_spread":0.23813456649402967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810611251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930302,0.00082966365,0.0032830976,0.0003234095,0.0005026888,0.000046537814,3.2211972e-7,0.000004163476,0.0019799154],"genre_scores_gemma":[0.99843985,0.00030899548,0.000011825394,0.0003720253,0.00062384177,4.458996e-7,0.0000010753998,0.000009379214,0.00023254273],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990851,0.0000831564,0.00021469349,0.00009983911,0.00017115733,0.0003460383],"domain_scores_gemma":[0.9994025,0.000027405276,0.00021319157,0.00016725385,0.00014082917,0.000048776354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059144147,0.00010434784,0.00012228312,0.000028702363,0.00014166873,0.000020445113,0.00038946304,0.00006830439,0.000008164457],"category_scores_gemma":[0.00009434306,0.00006174917,0.00009864741,0.00010920353,0.000069914684,0.0000031943143,0.000080708334,0.00030286814,0.000008855565],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014419063,0.0006738393,0.0035645324,0.000013483477,0.0005018857,0.000028660188,0.00015915658,0.00035245944,0.85986394,0.11642038,0.009069267,0.007910493],"study_design_scores_gemma":[0.003628761,0.041565843,0.004358417,0.00012439975,0.00011230208,0.0006235216,0.00023639982,0.00029970572,0.53430367,0.17965806,0.23440605,0.00068287377],"about_ca_topic_score_codex":7.6447486e-7,"about_ca_topic_score_gemma":5.8799463e-7,"teacher_disagreement_score":0.32556027,"about_ca_system_score_codex":0.000060869017,"about_ca_system_score_gemma":0.00011229043,"threshold_uncertainty_score":0.2518058},"labels":[],"label_agreement":null},{"id":"W2894957266","doi":"10.1109/tcomm.2018.2873345","title":"Minimal Sets for Capacity-Approaching Variable-Length Constrained Sequence Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoder; Variable (mathematics); Sequence (biology); State (computer science); Computer science; Set (abstract data type); Code (set theory); Algorithm; Finite-state machine; Mathematics","score_opus":0.09192691104221765,"score_gpt":0.32281140746618825,"score_spread":0.2308844964239706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894957266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12460642,0.00004939784,0.86874384,0.00053273956,0.00019061072,0.0003785124,0.0003285228,0.000067942696,0.0051020267],"genre_scores_gemma":[0.89140505,0.000048553436,0.10777344,0.0003526869,0.0000633738,0.00009044387,0.00008889007,0.000013219376,0.00016436634],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990553,0.00014046325,0.0002237892,0.00027983962,0.000065787346,0.00023479555],"domain_scores_gemma":[0.9986695,0.00017571294,0.000070776136,0.0008481333,0.0001631158,0.00007273697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029766007,0.00014544534,0.0001315146,0.000041469826,0.000763853,0.00003707352,0.00056999776,0.00015220822,0.000019044235],"category_scores_gemma":[0.00004333241,0.00013396161,0.00009984981,0.00012702591,0.0004954712,0.00000662411,0.000011127374,0.00018711023,0.000010596593],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001552098,0.0005540595,0.000045275825,0.00002478023,0.00018731048,2.2184331e-7,0.00022166788,0.00043104918,0.9655445,0.0047724936,0.00039270648,0.027670683],"study_design_scores_gemma":[0.0032963576,0.004678121,0.0002700871,0.00018410331,0.00030226583,0.00013150169,0.00075654016,0.089217864,0.7470178,0.005165072,0.14728577,0.0016945156],"about_ca_topic_score_codex":0.000028285363,"about_ca_topic_score_gemma":0.00008817094,"teacher_disagreement_score":0.7667986,"about_ca_system_score_codex":0.000018606244,"about_ca_system_score_gemma":0.000069886155,"threshold_uncertainty_score":0.5875017},"labels":[],"label_agreement":null},{"id":"W2925765780","doi":"10.1007/s00224-020-09993-6","title":"Space Lower Bounds for the Signal Detection Problem","year":2020,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Object (grammar); Upper and lower bounds; Blackboard (design pattern); Value (mathematics); Conjecture; SIGNAL (programming language); Process (computing); Theoretical computer science; Space (punctuation); Sequence (biology); Discrete mathematics; Combinatorics; Mathematics; Algorithm; Artificial intelligence; Machine learning; Programming language","score_opus":0.019015541732518664,"score_gpt":0.23634104685697363,"score_spread":0.21732550512445498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925765780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5031175,0.0006991898,0.49468938,0.00016357707,0.0002727359,0.0003691221,0.0000037083914,0.000029065377,0.0006557244],"genre_scores_gemma":[0.9985177,0.00000280264,0.00036918995,0.00016451548,0.00082770985,0.000005441363,0.0000056017902,0.000011138587,0.00009591012],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991788,0.00014463296,0.00021866437,0.000210238,0.00007738833,0.00017023347],"domain_scores_gemma":[0.9994218,0.00017337671,0.0001551388,0.00012711494,0.00008264035,0.00003998132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073911017,0.000104686405,0.00014804157,0.000008727284,0.00014782423,0.000028193523,0.00021183303,0.00008243503,0.0000021025282],"category_scores_gemma":[0.000085771615,0.000066776534,0.00010742288,0.000066181274,0.000080108926,0.00000126623,0.00009325001,0.000066116845,0.0000022809404],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042119698,0.000031167532,0.00016300689,0.0001632363,0.00011575531,5.65424e-7,0.00024658046,0.007954703,0.9699539,0.005728566,0.00042367107,0.014797657],"study_design_scores_gemma":[0.0025844974,0.007810933,0.001125626,0.00029924183,0.00018829336,0.00006430629,0.002093172,0.19904798,0.6545789,0.0031705329,0.12794149,0.0010950239],"about_ca_topic_score_codex":0.0000041521566,"about_ca_topic_score_gemma":4.6641344e-7,"teacher_disagreement_score":0.4954002,"about_ca_system_score_codex":0.0000050646204,"about_ca_system_score_gemma":0.000017701665,"threshold_uncertainty_score":0.27230683},"labels":[],"label_agreement":null},{"id":"W2937741582","doi":"10.1007/s11568-010-9143-0","title":"HGM 2010 Programme / Abstract","year":2010,"lang":"en","type":"article","venue":"The HUGO Journal","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Biocenter, University of Oulu; Medical Research Council; Terveyden ja hyvinvoinnin laitos; Université de Montréal; Retina France; Institut de Cardiologie de Montréal; Turun Yliopistollinen Keskussairaala; King Abdullah University of Science and Technology; RIKEN; Union Nationale des Aveugles et Déficients Visuels; Cardiff University; Massachusetts General Hospital; Génome Québec; University of Edinburgh; University of California, San Diego; Oulun Yliopisto; Broad Institute; Tampereen Yliopisto; Turun Yliopisto; Cold Spring Harbor Laboratory; Imperial College London; University of Dundee; Helsingin ja Uudenmaan Sairaanhoitopiiri; Tays; University of the Western Cape; Wellcome Trust; Helsingin Yliopisto","keywords":"Computer science","score_opus":0.022207284790359303,"score_gpt":0.2616925960362043,"score_spread":0.23948531124584502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937741582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943007,0.00016151356,0.0001250717,0.0007995166,0.00076618255,0.000053730495,9.703947e-7,0.000009013152,0.0037832607],"genre_scores_gemma":[0.99644744,0.000032425545,0.0006694556,0.0003615536,0.001658687,0.0000013708534,0.00000489984,0.000006854985,0.0008173179],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993903,0.000026659804,0.000138452,0.00010796448,0.000084878,0.0002517618],"domain_scores_gemma":[0.99958986,0.0000136957715,0.000082664745,0.00017007235,0.000052973126,0.00009073507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005370953,0.00008350307,0.00006432878,0.000010175336,0.00020956197,0.00007919105,0.00031138558,0.0001047389,0.00011999694],"category_scores_gemma":[0.00011424051,0.000042953343,0.00009343323,0.000031417978,0.00008925144,0.0000018582916,0.000081335085,0.00048631136,0.000037151254],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025265095,0.000038590668,0.0019549474,0.0000012187489,0.000020142663,0.000006678673,0.000013568616,0.0000035994624,0.9502529,0.000116356365,0.0042674793,0.043299235],"study_design_scores_gemma":[0.00093960844,0.00081149244,0.12812495,0.000015235663,0.000034187193,0.002313392,0.00014756723,0.000076832504,0.1958585,0.004649456,0.6665586,0.00047017058],"about_ca_topic_score_codex":0.0000033909907,"about_ca_topic_score_gemma":0.000010807934,"teacher_disagreement_score":0.7543944,"about_ca_system_score_codex":0.0000021035016,"about_ca_system_score_gemma":0.000031865224,"threshold_uncertainty_score":0.21128078},"labels":[],"label_agreement":null},{"id":"W2941869658","doi":"10.1023/b:naco.0000006773.31625.55","title":"Unexpected universality results for three classes of P systems with symport/antiport","year":2003,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Antiporter; Symporter; Membrane computing; Universality (dynamical systems); Computer science; Computation; Theoretical computer science; Mathematics; Algorithm; Membrane; Physics; Chemistry","score_opus":0.01635541717707765,"score_gpt":0.2524889441129755,"score_spread":0.23613352693589787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941869658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867705,0.0006651335,0.010097801,0.000021878866,0.00026288838,0.0002834822,0.000013313042,0.000031206797,0.0018537806],"genre_scores_gemma":[0.99678916,0.0000032671169,0.0028472063,0.00002460339,0.00012538224,0.0000011590806,0.00010460741,0.000009779896,0.000094853065],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890316,0.00006673268,0.00030834097,0.0003527879,0.00011548229,0.00025352498],"domain_scores_gemma":[0.9991604,0.000081547514,0.00025273758,0.00020481457,0.00025667192,0.000043836502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037425346,0.00014852236,0.00021896603,0.000026514585,0.00010621301,0.000018193536,0.00015159321,0.0001296954,3.8817925e-7],"category_scores_gemma":[0.000254985,0.00010436182,0.000082382285,0.0001439995,0.00007033058,0.0000030272581,0.00005628055,0.000108669716,2.7764798e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002353352,0.0002843934,0.10641238,0.0004154324,0.0005944998,0.000031336866,0.00011190236,0.0078254165,0.8612363,0.011339359,0.0018407323,0.0075548906],"study_design_scores_gemma":[0.019861868,0.009215884,0.15135834,0.0011264762,0.0003812408,0.000477402,0.0022985933,0.07692539,0.64443165,0.00063042034,0.08945987,0.003832855],"about_ca_topic_score_codex":0.000022264905,"about_ca_topic_score_gemma":0.000020329759,"teacher_disagreement_score":0.21680464,"about_ca_system_score_codex":0.000012972607,"about_ca_system_score_gemma":0.000062650164,"threshold_uncertainty_score":0.42557514},"labels":[],"label_agreement":null},{"id":"W2942699488","doi":"10.1109/access.2019.2913339","title":"Construction of Multi-State Capacity-Approaching Variable-Length Constrained Sequence Codes With State-Independent Decoding","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Decoding methods; Encoder; Huffman coding; Computer science; Constraint (computer-aided design); Sequence (biology); Algorithm; State (computer science); Coding (social sciences); Variable (mathematics); Theoretical computer science; Mathematics; Data compression","score_opus":0.04514387786130067,"score_gpt":0.2879050768249769,"score_spread":0.24276119896367623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942699488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8832476,0.00002413299,0.11535046,0.0000058429287,0.00018781496,0.00021905397,0.000035540652,0.000020185274,0.0009093676],"genre_scores_gemma":[0.97858584,0.000017800745,0.021196911,0.00007494262,0.00003522772,0.0000040727227,0.000030383135,0.000012013413,0.000042804546],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884117,0.00007613268,0.00027277137,0.0003855052,0.00014140029,0.0002830066],"domain_scores_gemma":[0.99932367,0.000047241505,0.00022061648,0.00021263301,0.00012842246,0.00006739238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004044306,0.00016759658,0.00021722777,0.00004556456,0.00007061421,0.00005649813,0.0002951923,0.00010726111,0.00001153671],"category_scores_gemma":[0.00003464966,0.00012634524,0.000043804066,0.000121222234,0.00017838749,0.000017825416,0.00009809256,0.00015795598,0.0000022205752],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014848345,0.00005340715,0.07248471,0.00007452522,0.00008349818,0.0000044705575,0.00005062598,0.0038182382,0.9153259,0.00015676128,0.0000029957282,0.0077964216],"study_design_scores_gemma":[0.0014422275,0.00041533328,0.0030783904,0.00010119408,0.000023442382,0.00009177928,0.00018125736,0.0071439585,0.9866328,0.00029731676,0.00018077006,0.0004114895],"about_ca_topic_score_codex":0.00013149879,"about_ca_topic_score_gemma":0.00005037939,"teacher_disagreement_score":0.09533824,"about_ca_system_score_codex":0.00001705393,"about_ca_system_score_gemma":0.00006987444,"threshold_uncertainty_score":0.515221},"labels":[],"label_agreement":null},{"id":"W2945683434","doi":"10.1049/iet-com.2018.6053","title":"Construction of tandem duplication correcting codes","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Tandem exon duplication; Tandem; Gene duplication; Computer network","score_opus":0.01971857925417302,"score_gpt":0.279202590832194,"score_spread":0.259484011578021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945683434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839456,0.00033592308,0.0023402392,0.000236341,0.00008477686,0.00012423817,0.0000051541974,0.000016718413,0.012910975],"genre_scores_gemma":[0.9916414,0.00014026556,0.007858679,0.00006302378,0.000027657328,0.0000064978813,0.00012689442,0.000004356606,0.00013120573],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954766,0.000064420696,0.00015746958,0.00011551078,0.00004060436,0.00007431288],"domain_scores_gemma":[0.99905264,0.000047857477,0.000115173694,0.00067117997,0.00009489871,0.000018273873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014484985,0.000052127405,0.00007923211,0.000016704364,0.00007463757,0.0000073988945,0.0003049381,0.00007080446,0.0000146569255],"category_scores_gemma":[0.00007346902,0.000047469333,0.000043453678,0.000083227205,0.00009444864,0.0000022345675,0.00019263849,0.00006682736,0.000013944493],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011053376,0.00006381607,0.12881717,0.000008505589,0.000026741465,1.9988079e-8,0.000041310177,0.00004769368,0.84391975,0.004068692,0.00016524644,0.02282997],"study_design_scores_gemma":[0.0013989273,0.0009556781,0.14875452,0.00014328955,0.00007065012,0.00008532945,0.0016646148,0.006432627,0.7252789,0.003960376,0.11047505,0.00078003836],"about_ca_topic_score_codex":0.000013246321,"about_ca_topic_score_gemma":0.000011062818,"teacher_disagreement_score":0.11864088,"about_ca_system_score_codex":0.0000057986063,"about_ca_system_score_gemma":0.00001983612,"threshold_uncertainty_score":0.19357432},"labels":[],"label_agreement":null},{"id":"W2951723643","doi":"10.48550/arxiv.1112.4897","title":"Deciding Whether a Regular Language is Generated by a Splicing System","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Syntactic monoid; RNA splicing; Regular language; Computer science; Class (philosophy); Function (biology); Word (group theory); Subclass; Mathematics; Genetics; Monoid; Biology; Artificial intelligence; Combinatorics; Gene; Free monoid","score_opus":0.046845619986486835,"score_gpt":0.18024413111465562,"score_spread":0.13339851112816878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951723643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9758039,0.00067791133,0.019842096,0.000009191364,0.00018542183,0.0001937929,0.000038780974,0.00008184221,0.0031670572],"genre_scores_gemma":[0.99616545,0.00009440919,0.00029472515,0.00016397901,0.00019262423,8.845384e-7,0.00016823468,0.00003006953,0.0028896222],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834406,0.00014436124,0.0001771276,0.00095488655,0.00004441041,0.00033514062],"domain_scores_gemma":[0.99896514,0.000010480794,0.00019302605,0.000626232,0.00008643573,0.00011865978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002013986,0.000307893,0.0002852611,0.000056096098,0.00011953263,0.00003580135,0.00052491727,0.00057713094,0.000026099515],"category_scores_gemma":[0.000021084941,0.00029768687,0.00021358335,0.00013403101,0.00006743903,0.000002587898,0.00095364795,0.0002774984,0.000026471667],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014117143,0.0000800689,0.002570693,0.00017337821,0.00033728493,0.00017993223,0.00020633098,0.0021353133,0.98965746,0.0015517708,0.0023692031,0.0005974011],"study_design_scores_gemma":[0.0016831843,0.00046606807,0.00037792829,0.0006531356,0.00043092287,0.00004690821,0.0017737584,0.036436487,0.94709,0.00086753344,0.007825073,0.002348964],"about_ca_topic_score_codex":0.00023868046,"about_ca_topic_score_gemma":0.000016491118,"teacher_disagreement_score":0.042567417,"about_ca_system_score_codex":0.0000616634,"about_ca_system_score_gemma":0.000048462203,"threshold_uncertainty_score":0.99994755},"labels":[],"label_agreement":null},{"id":"W2952551747","doi":"10.48550/arxiv.1302.2840","title":"Hypergraph Automata: A Theoretical Model for Patterned Self-assembly","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hypergraph; Automaton; Computer science; Expressive power; Mobile automaton; Class (philosophy); Existential quantification; Theoretical computer science; Automata theory; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04285513498320683,"score_gpt":0.19431310162510423,"score_spread":0.1514579666418974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952551747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82537913,0.00004355243,0.17287032,0.00005717505,0.00015353895,0.00040905934,0.000046610152,0.000102141086,0.0009384651],"genre_scores_gemma":[0.9965483,0.00014199637,0.0019586154,0.00027634672,0.00018723465,0.000006720282,0.0002049918,0.00002897614,0.00064679945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982859,0.00008265492,0.00018418286,0.0009972116,0.000045193716,0.00040485917],"domain_scores_gemma":[0.9989118,0.000041331023,0.00013783065,0.0006070497,0.00015142362,0.00015056817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017272233,0.00033069402,0.00029621707,0.000057322435,0.000111938985,0.0000518041,0.000653084,0.00064430886,0.00001269296],"category_scores_gemma":[0.000045216766,0.0003027523,0.00037478516,0.000075391006,0.00013823567,0.0000043628074,0.001092603,0.00024737825,0.000019507488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012213531,0.0017392993,0.011809164,0.00091937656,0.0018916901,0.00013450372,0.00020750132,0.27114454,0.113706805,0.58534926,0.008727168,0.0031493295],"study_design_scores_gemma":[0.00074040936,0.00024490422,0.00029223075,0.00003301284,0.00012699723,0.000003330792,0.00002033798,0.9555809,0.0028730156,0.039030895,0.0005064637,0.00054748607],"about_ca_topic_score_codex":0.000010677965,"about_ca_topic_score_gemma":0.0000049632554,"teacher_disagreement_score":0.6844364,"about_ca_system_score_codex":0.000034336546,"about_ca_system_score_gemma":0.00010983447,"threshold_uncertainty_score":0.9999425},"labels":[],"label_agreement":null},{"id":"W2952965578","doi":"10.48550/arxiv.1204.3238","title":"Reliable communication over non-binary insertion/deletion channels","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Binary number; Decodes; Algorithm; Sequence (biology); Computer science; Additive white Gaussian noise; Redundancy (engineering); Set (abstract data type); Symbol (formal); EXIT chart; Code (set theory); Pseudorandom binary sequence; Decoding methods; Theoretical computer science; Mathematics; Arithmetic; White noise; Block code; Concatenated error correction code; Telecommunications","score_opus":0.05381484063976958,"score_gpt":0.19890739690425235,"score_spread":0.14509255626448278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952965578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889807,0.00038404003,0.007330387,0.000050244646,0.00036315274,0.00022050837,0.000010860043,0.00004138662,0.0026187235],"genre_scores_gemma":[0.99602103,0.0007204949,0.00019582732,0.00016529605,0.0002781567,0.0000016458205,0.00067621365,0.0000178427,0.0019234744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988566,0.00011057827,0.00016114069,0.00054631056,0.000042580978,0.0002827806],"domain_scores_gemma":[0.9988184,0.000014613635,0.00019196606,0.00076420954,0.00010985116,0.00010094166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024205947,0.00022859077,0.00018961485,0.000057242803,0.00016775809,0.000029452889,0.00052107684,0.00055910327,0.00004652164],"category_scores_gemma":[0.000024508372,0.00023563992,0.00016610284,0.00012349656,0.000092885144,0.000009181848,0.001384343,0.00034776996,0.000046160854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014994261,0.0019415356,0.12505865,0.00064420013,0.00090465375,0.000114203904,0.0003387014,0.41897228,0.41076922,0.01225316,0.024735335,0.0027686239],"study_design_scores_gemma":[0.00838316,0.0026839634,0.21800882,0.0017124208,0.0013297389,0.00006161198,0.00083544874,0.4262927,0.09899144,0.037996817,0.19446993,0.009233964],"about_ca_topic_score_codex":0.000104888466,"about_ca_topic_score_gemma":0.000008472855,"teacher_disagreement_score":0.3117778,"about_ca_system_score_codex":0.00005609794,"about_ca_system_score_gemma":0.000050077535,"threshold_uncertainty_score":0.9609117},"labels":[],"label_agreement":null},{"id":"W2953365201","doi":"10.48550/arxiv.1207.3385","title":"Construction of Cyclic Codes over $\\mathbb{F}_2+u\\mathbb{F}_2$ for DNA Computing","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Complement (music); BCH code; Ring (chemistry); Constraint (computer-aided design); Construct (python library); Code (set theory); Combinatorics; Discrete mathematics; Mathematics; DNA; Physics; Computer science; Algorithm; Decoding methods; Chemistry; Biology; Genetics; Computer network; Programming language; Geometry","score_opus":0.05896943219125268,"score_gpt":0.2080864407065754,"score_spread":0.14911700851532272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953365201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9317583,0.00022795954,0.06581102,0.000013237329,0.0005718579,0.00036888506,0.000098893586,0.000047642312,0.0011022408],"genre_scores_gemma":[0.996539,0.0001273269,0.0022638743,0.00006406322,0.00045631782,9.563034e-7,0.00030141222,0.000026152571,0.00022090547],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982616,0.00011670872,0.000333391,0.0007912097,0.00006203681,0.00043508725],"domain_scores_gemma":[0.9985947,0.00008188409,0.00049443165,0.0005160073,0.00018234758,0.00013063426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031343388,0.00034922757,0.00045764094,0.00008826456,0.00015083989,0.000025526995,0.0004834741,0.00064439804,0.00001987337],"category_scores_gemma":[0.000089300214,0.00035240068,0.00040039435,0.0001330289,0.0002754144,0.0000075355492,0.0009822304,0.00026958546,0.000006014315],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015312424,0.001051959,0.1615703,0.0020897689,0.0018602726,0.000047405076,0.00030469065,0.038919225,0.70329463,0.074856445,0.0016093274,0.012864719],"study_design_scores_gemma":[0.012576012,0.0030464535,0.08032947,0.001837945,0.0028374763,0.00015766395,0.0019816363,0.16226509,0.6365794,0.052346405,0.037351016,0.008691418],"about_ca_topic_score_codex":0.000033535875,"about_ca_topic_score_gemma":0.0000103935345,"teacher_disagreement_score":0.12334587,"about_ca_system_score_codex":0.00004681687,"about_ca_system_score_gemma":0.00008008973,"threshold_uncertainty_score":0.9998928},"labels":[],"label_agreement":null},{"id":"W2955229755","doi":"10.1007/978-3-030-23247-4_15","title":"State Complexity of Simple Splicing","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"RNA splicing; Regular language; Axiom; Theoretical computer science; Computer science; Recursively enumerable language; Finite-state machine; Mathematics; Discrete mathematics; Algorithm; Genetics; Automaton; Biology; RNA","score_opus":0.02795678863435677,"score_gpt":0.264530784009426,"score_spread":0.2365739953750692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955229755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09325347,0.0003377966,0.90155,0.00006738298,0.00044087926,0.00027584707,0.000023115206,0.000016488126,0.0040350403],"genre_scores_gemma":[0.9798705,0.000026740674,0.019025216,0.00049928314,0.00023563321,5.5290514e-7,0.00003988216,0.000015878471,0.00028630334],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984234,0.000018579443,0.000307253,0.0006948607,0.0002352998,0.0003205909],"domain_scores_gemma":[0.99906474,0.00005861336,0.0001995575,0.00049869454,0.00012130106,0.00005706135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003509585,0.00024716932,0.00033344995,0.00010525652,0.00006213368,0.000033465567,0.00068016635,0.0002076139,0.000016628002],"category_scores_gemma":[0.000052849224,0.000198574,0.000104704755,0.000094308605,0.00072153006,0.0000035168719,0.00075941393,0.00024813606,0.000008234049],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090502486,0.000066787,0.0034219888,0.0001977736,0.000052638985,0.00002181947,0.000141476,0.0434618,0.3288253,0.0030917486,0.00006114493,0.620567],"study_design_scores_gemma":[0.0015547499,0.0036817533,0.0068632727,0.0008928034,0.00004132556,0.000095059186,9.1240594e-7,0.102175884,0.5774436,0.28473914,0.01955261,0.0029589115],"about_ca_topic_score_codex":0.000020869264,"about_ca_topic_score_gemma":0.000052129235,"teacher_disagreement_score":0.88661706,"about_ca_system_score_codex":0.000027186508,"about_ca_system_score_gemma":0.00016900411,"threshold_uncertainty_score":0.8097613},"labels":[],"label_agreement":null},{"id":"W2963047229","doi":"10.37236/7591","title":"Counting Compositions over Finite Abelian Groups","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Bijection, injection and surjection; Abelian group; Type (biology); Combinatorics; Finite field; Group (periodic table); Matrix (chemical analysis); Transfer (computing); Discrete mathematics; Pure mathematics; Bijection","score_opus":0.006386209221983236,"score_gpt":0.24084554787247342,"score_spread":0.23445933865049018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963047229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98494005,0.0014976105,0.011495138,0.0003925463,0.00038235474,0.000050800623,0.0000010325773,0.0000061343744,0.0012343223],"genre_scores_gemma":[0.9985244,0.00022598554,0.000021806703,0.00040971866,0.00067915325,5.479626e-7,0.0000041169574,0.0000094346415,0.00012479062],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904484,0.00008910067,0.00025216435,0.00009921654,0.00015307807,0.00036158913],"domain_scores_gemma":[0.9992642,0.00005531282,0.00023638704,0.00015904453,0.00023956705,0.00004547943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006621741,0.00010216975,0.00012662636,0.000029886265,0.00022464078,0.000031236134,0.00036401206,0.0000780804,0.000011962628],"category_scores_gemma":[0.00009567965,0.00006424085,0.00010713891,0.00016251516,0.00011645702,0.000004753139,0.00008872104,0.00030105756,0.0000068904747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004752992,0.000553194,0.009893292,0.000019580008,0.00055974803,0.000015248601,0.00023554279,0.00014556292,0.6002268,0.3762607,0.008316326,0.003298685],"study_design_scores_gemma":[0.0045607393,0.016795196,0.015100606,0.00013612125,0.0002959634,0.0008880689,0.0003142035,0.0014982797,0.172625,0.4503165,0.3364371,0.001032233],"about_ca_topic_score_codex":0.0000024009055,"about_ca_topic_score_gemma":0.0000039392876,"teacher_disagreement_score":0.4276018,"about_ca_system_score_codex":0.00004076439,"about_ca_system_score_gemma":0.00011871319,"threshold_uncertainty_score":0.26196656},"labels":[],"label_agreement":null},{"id":"W2963474241","doi":"","title":"Rank Modulation for Translocation Error Correction","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hamming code; Permutation (music); Rank (graph theory); Error detection and correction; Fountain code; Mathematics; Hamming distance; Decoding methods; Linear code; Extension (predicate logic); Discrete mathematics; Combinatorics; Algorithm; Block code; Computer science; Physics","score_opus":0.06893063690376933,"score_gpt":0.20273825637934376,"score_spread":0.13380761947557443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963474241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7066095,0.000035704103,0.29263234,0.000017221111,0.00025729722,0.00010250213,0.0000018190879,0.000015310288,0.00032830233],"genre_scores_gemma":[0.9986821,0.000018329105,0.00019337509,0.00005635544,0.00022282898,6.8316683e-7,0.00008326673,0.0000054059283,0.0007376623],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956703,0.000030264035,0.000060355043,0.00017712961,0.0000139581125,0.0001512375],"domain_scores_gemma":[0.99975514,0.00001294186,0.00003916645,0.000099070145,0.000045974022,0.00004772711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119052995,0.00006656555,0.00005486549,0.000021113385,0.000086806416,0.0000050124145,0.00006466482,0.00009474739,0.0000073260726],"category_scores_gemma":[0.000028354832,0.000065866516,0.00006493039,0.00008365537,0.000022705004,0.000008616561,0.000015980688,0.000030246898,0.0000071135046],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009883159,0.00039279714,0.074869536,0.00003773762,0.00011705879,0.0000014597464,0.00015006894,0.06986776,0.7927524,0.011619682,0.002117828,0.047085367],"study_design_scores_gemma":[0.0042319084,0.0012377166,0.10169755,0.000037746708,0.00015729811,0.000017035336,0.0004916709,0.60566276,0.22124465,0.0025003287,0.061565258,0.0011560858],"about_ca_topic_score_codex":0.0000070790866,"about_ca_topic_score_gemma":0.000007120927,"teacher_disagreement_score":0.57150775,"about_ca_system_score_codex":0.000013363605,"about_ca_system_score_gemma":0.000008524785,"threshold_uncertainty_score":0.26859584},"labels":[],"label_agreement":null},{"id":"W2971833028","doi":"","title":"DNA graph characterization for line digraph of dicycle with one chord","year":2013,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Digraph; Combinatorics; Chord (peer-to-peer); Mathematics; DNA; Graph; Genetics; Biology; Computer science","score_opus":0.008891721651368301,"score_gpt":0.22586219378443195,"score_spread":0.21697047213306364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971833028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921786,0.0001631881,0.0069855293,0.00027731634,0.00021534051,0.00009275503,0.000009580668,0.000002672127,0.00007500355],"genre_scores_gemma":[0.99881417,0.00046244575,0.00043060805,0.00012469135,0.00007956173,0.000004058771,0.000043639655,0.0000065220966,0.000034315184],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99937564,0.000016832519,0.0002611174,0.00010060122,0.00015757704,0.000088226014],"domain_scores_gemma":[0.9988711,0.000024437655,0.00030714553,0.000058862155,0.00068599277,0.000052452862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012107233,0.00008183356,0.00013454336,0.000085225365,0.000031672444,0.000028810555,0.00017868719,0.00006208745,0.000004114524],"category_scores_gemma":[0.000044377597,0.000058614558,0.000086477456,0.00008512738,0.00005841829,0.000013937863,0.000039882176,0.00005910062,1.3944133e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044919841,0.0005302558,0.062085945,0.000030255642,0.00041244173,0.0000031467664,0.000039488194,0.000008710348,0.89420825,0.0113355955,0.00014587838,0.030750813],"study_design_scores_gemma":[0.0063789855,0.013107412,0.43515116,0.00031184315,0.00016289698,0.00017337404,0.0001817629,0.00030453462,0.4199033,0.11389631,0.009754775,0.00067362085],"about_ca_topic_score_codex":0.0000047623166,"about_ca_topic_score_gemma":8.427418e-7,"teacher_disagreement_score":0.47430494,"about_ca_system_score_codex":0.0000037377024,"about_ca_system_score_gemma":0.000016898295,"threshold_uncertainty_score":0.23902322},"labels":[],"label_agreement":null},{"id":"W2979662338","doi":"10.4230/lipics.stacs.2020.40","title":"Succinct Population Protocols for Presburger Arithmetic","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Presburger arithmetic; Computer science; Arithmetic; Population; Mathematics; Theoretical computer science; Medicine; Decidability","score_opus":0.08722865809221507,"score_gpt":0.22929115838908806,"score_spread":0.142062500296873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979662338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9359001,0.000037282884,0.055445664,0.0000256807,0.00024601287,0.007472746,0.000047011294,0.00004175514,0.00078376045],"genre_scores_gemma":[0.9960213,0.000012564909,0.00039365838,0.000080093305,0.00025561886,0.00007364556,0.0005122466,0.000019936935,0.0026309795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986484,0.00007853313,0.00016543867,0.0008079361,0.000036482794,0.00026320678],"domain_scores_gemma":[0.9990738,0.00003133854,0.00018737848,0.0005247533,0.00011427049,0.00006847817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019174808,0.00023139034,0.00024581118,0.000051981337,0.000077654484,0.000035331926,0.00038449996,0.00048019498,0.0000151025215],"category_scores_gemma":[0.00008115464,0.00022014332,0.00026101395,0.00007330908,0.000035817277,0.000003346675,0.00061777554,0.00018294419,0.00001219822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002574721,0.0008199162,0.4196658,0.001908022,0.00085041864,0.00006182223,0.00004293901,0.48888925,0.057380144,0.014619715,0.0067275204,0.0064597246],"study_design_scores_gemma":[0.010612184,0.005426182,0.22617108,0.0013341536,0.00095497386,0.000025927846,0.0001498511,0.43636617,0.04872344,0.074278206,0.18886167,0.007096169],"about_ca_topic_score_codex":0.000034985907,"about_ca_topic_score_gemma":0.000009125613,"teacher_disagreement_score":0.19349474,"about_ca_system_score_codex":0.000035317258,"about_ca_system_score_gemma":0.00005990402,"threshold_uncertainty_score":0.8977184},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04411487236689308,"score_gpt":0.23364959603991672,"score_spread":0.18953472367302365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989600529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9707991,0.0003500191,0.028484032,0.000025463483,0.00018490976,0.00008559526,0.000024575547,0.000015620662,0.00003069619],"genre_scores_gemma":[0.9607092,0.00010205593,0.03876472,0.000080463644,0.00029887233,2.864044e-7,0.000024019922,0.000012957084,0.0000074061236],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988813,0.0000524489,0.0003508005,0.00033031823,0.00010705665,0.00027809912],"domain_scores_gemma":[0.9992206,0.000063989304,0.0002168445,0.0002960694,0.00008627369,0.00011620987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058998156,0.00019588022,0.0003377081,0.000049383136,0.00005090287,0.000047671372,0.00036039436,0.00013095037,0.000011472342],"category_scores_gemma":[0.00025400022,0.0001217827,0.00005028182,0.00008701958,0.00005359537,0.000021399057,0.00036824276,0.00025560847,9.0476107e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100897516,0.000028418839,0.0053658998,0.000032573716,0.00011226399,0.0000316494,0.0000070126625,0.027842749,0.9657225,0.00007480939,0.000015992951,0.00066520623],"study_design_scores_gemma":[0.009655558,0.01101911,0.12476959,0.002011262,0.00037623465,0.008867965,0.00039056691,0.42868277,0.3549455,0.00055902876,0.054439854,0.0042825732],"about_ca_topic_score_codex":0.0000063983507,"about_ca_topic_score_gemma":2.936743e-7,"teacher_disagreement_score":0.610777,"about_ca_system_score_codex":0.000018305256,"about_ca_system_score_gemma":0.00002376003,"threshold_uncertainty_score":0.49661547},"labels":[],"label_agreement":null},{"id":"W2991497250","doi":"10.3233/fi-2020-1877","title":"Word Blending in Formal Languages*","year":2019,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Word (group theory); Iterated function; Computer science; Binary number; Artificial intelligence; Natural language processing; Mathematics; Arithmetic","score_opus":0.008372549510784335,"score_gpt":0.2555086193009242,"score_spread":0.24713606979013988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991497250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9524821,0.000050181432,0.00017291335,0.000038934493,0.0001032179,0.00016367163,0.0000037282207,0.000014279967,0.04697095],"genre_scores_gemma":[0.9974851,0.000011305758,0.00075325917,0.000719414,0.00006281018,0.000006328066,0.00008481825,0.0000053494223,0.00087161764],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992482,0.000017073286,0.0002344369,0.000114115785,0.00008230574,0.00030386235],"domain_scores_gemma":[0.99970657,0.000013011711,0.000055800592,0.00017023555,0.000010319897,0.000044092776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021024722,0.000098778124,0.00010788708,0.000042833224,0.000031827112,0.000033602082,0.00016234856,0.00008029174,0.00026108304],"category_scores_gemma":[0.000027134409,0.0000784475,0.0000478553,0.00007924606,0.000020170777,0.000015243009,0.00020692365,0.000089225585,0.00027207163],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003404952,0.00021059654,0.38143042,0.00029358247,0.00010084976,0.000013104121,0.0009931473,0.00042939043,0.43770063,0.0037405775,0.003206119,0.17154106],"study_design_scores_gemma":[0.006012474,0.0024566476,0.14419222,0.00028603032,0.000022549753,0.00008895666,0.0075789746,0.004935449,0.12444455,0.00028587025,0.7080572,0.0016390607],"about_ca_topic_score_codex":0.0000063914904,"about_ca_topic_score_gemma":0.000004551778,"teacher_disagreement_score":0.7048511,"about_ca_system_score_codex":0.000016907612,"about_ca_system_score_gemma":0.000014917059,"threshold_uncertainty_score":0.34970212},"labels":[],"label_agreement":null},{"id":"W2996341931","doi":"10.1109/cwit.2019.8929898","title":"Index Assignment Optimized for Partial Encryption","year":2019,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Bitstream; Encryption; Entropy (arrow of time); Computer science; Algorithm; Maximization; Binary number; Theoretical computer science; Mathematics; Mathematical optimization; Arithmetic; Decoding methods; Computer network","score_opus":0.01208518005425412,"score_gpt":0.25371950638887947,"score_spread":0.24163432633462534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996341931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8161109,0.00003188939,0.17863217,0.00011819829,0.00018014555,0.0002849278,0.0000022516756,0.000015006441,0.0046245162],"genre_scores_gemma":[0.99297625,0.0000057612565,0.004100483,0.00034386743,0.00017483898,0.000016846647,0.00006151978,0.000004487189,0.0023159734],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995141,0.000017672972,0.00009387206,0.00019292012,0.00004272758,0.00013871182],"domain_scores_gemma":[0.9998016,0.000010642249,0.000028269676,0.000105342966,0.00002342174,0.00003073279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011907808,0.000063813226,0.00007082519,0.00000722021,0.000025985159,0.0000120809045,0.000069544534,0.000089663066,0.00010814842],"category_scores_gemma":[0.000021528978,0.000044958935,0.00006551433,0.000016236125,0.000011045074,8.6639363e-7,0.000052022344,0.000023049435,0.00002444147],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022180207,0.000041655785,0.0042584855,0.0000062125464,0.000021091275,1.3875663e-7,0.0000031508755,0.00072741864,0.98702717,0.0004916223,0.0012542771,0.0059469473],"study_design_scores_gemma":[0.0035320737,0.0018258994,0.0034674255,0.000009329165,0.000014969226,0.0000036307667,0.00006471761,0.018476397,0.7670023,0.0004587708,0.20471539,0.00042912748],"about_ca_topic_score_codex":0.0000016622482,"about_ca_topic_score_gemma":4.273731e-7,"teacher_disagreement_score":0.22002493,"about_ca_system_score_codex":0.0000045598485,"about_ca_system_score_gemma":0.000010924426,"threshold_uncertainty_score":0.18333721},"labels":[],"label_agreement":null},{"id":"W3004260013","doi":"10.1017/s0960129519000215","title":"Multisets, heaps, bags, families: What is a multiset?","year":2020,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiset; Morphism; Intersection (aeronautics); Complement (music); Connection (principal bundle); Mathematics; Simple (philosophy); Category theory; Current (fluid); Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Epistemology","score_opus":0.019840929839952937,"score_gpt":0.2744189667916013,"score_spread":0.2545780369516484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004260013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76559955,0.00058248255,0.23186935,0.0011782247,0.00028608425,0.00026288896,0.0000066455154,0.00004197475,0.00017278997],"genre_scores_gemma":[0.9323439,0.000048009693,0.06219067,0.005167382,0.0002279131,0.000004227408,0.0000058329956,0.0000080566715,0.000004005398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982657,0.00004166597,0.00029453452,0.0006919877,0.00028761462,0.000418525],"domain_scores_gemma":[0.999331,0.00004346192,0.000056813526,0.00030372856,0.00005226015,0.00021272813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022992535,0.00019317477,0.0002142762,0.00003912048,0.00012176057,0.00023033509,0.0007887377,0.00009256364,0.00004548541],"category_scores_gemma":[0.0001553134,0.00014006544,0.00007289152,0.00033591993,0.0004532838,0.000022251199,0.00077283994,0.00014239652,0.000020359319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105214676,0.00021019012,0.0066934777,0.0002364773,0.000029597946,0.00007118941,0.002729525,0.001890053,0.2310139,0.004332314,0.0017994887,0.7508886],"study_design_scores_gemma":[0.00209366,0.0010679117,0.022410043,0.00025063351,0.000015859207,0.00012610169,0.0004206372,0.763777,0.16907635,0.02688031,0.012325773,0.0015556826],"about_ca_topic_score_codex":0.000003474441,"about_ca_topic_score_gemma":0.0000011706334,"teacher_disagreement_score":0.76188695,"about_ca_system_score_codex":0.000015194831,"about_ca_system_score_gemma":0.000043735905,"threshold_uncertainty_score":0.5711703},"labels":[],"label_agreement":null},{"id":"W3023908378","doi":"","title":"Characterizing DNA Bond Shapes Using Trajectories","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decidability; Set (abstract data type); DNA computing; Extension (predicate logic); DNA; Bond; Rotation (mathematics); Mathematics; Algorithm; Computer science; Geometry; Biology; Genetics; Programming language; Computation","score_opus":0.036337564022386935,"score_gpt":0.2591193400557657,"score_spread":0.22278177603337876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023908378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938765,0.00007310525,0.0008543149,0.000038873433,0.0001329496,0.00011493975,0.000012112016,0.000029758912,0.004867438],"genre_scores_gemma":[0.9961192,0.000035269004,0.0023950574,0.0009883464,0.00024225221,0.0000046188848,0.00008252743,0.000008887666,0.0001238438],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914557,0.000016302942,0.00029238997,0.00014473745,0.00011517982,0.0002858395],"domain_scores_gemma":[0.9996406,0.000011570794,0.00010034616,0.00013850695,0.000031700958,0.000077275676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102652084,0.00014865177,0.00014679132,0.000030062562,0.00024452095,0.00004007683,0.00016490128,0.000096176074,0.00005398802],"category_scores_gemma":[0.000043939803,0.0001195362,0.000080175494,0.00007425388,0.000108020395,0.000016638809,0.00015549196,0.00007652541,0.00003479298],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046193538,0.000044724562,0.010155399,0.000034852324,0.000047366495,0.0000054772268,0.00048249602,0.000015406275,0.9860668,0.00010265334,0.00066491344,0.0023336818],"study_design_scores_gemma":[0.0013920078,0.0010565255,0.05077474,0.0000919283,0.00004189119,0.0005110736,0.0015262731,0.0025061707,0.71688694,0.00008526636,0.22397925,0.0011479632],"about_ca_topic_score_codex":0.0000067672595,"about_ca_topic_score_gemma":0.0000010512348,"teacher_disagreement_score":0.26917994,"about_ca_system_score_codex":0.000017091901,"about_ca_system_score_gemma":0.000037069312,"threshold_uncertainty_score":0.48745447},"labels":[],"label_agreement":null},{"id":"W3028360845","doi":"10.1109/access.2020.2995812","title":"Construction of Duplication Correcting Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Construct (python library); Palindrome; Extension (predicate logic); Tandem exon duplication; Gene duplication; Code (set theory); Computer science; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Genetics; Biology; Genome; Programming language; Set (abstract data type)","score_opus":0.04037929659307958,"score_gpt":0.30403573636864323,"score_spread":0.26365643977556363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028360845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97838926,0.000054933764,0.020342289,0.00015825205,0.00013008752,0.000052549818,0.0000029242424,0.00001257912,0.0008571072],"genre_scores_gemma":[0.998805,0.000014345894,0.0006146208,0.00030783392,0.00022811281,0.0000019859035,0.000017584485,0.000003256869,0.000007265032],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962175,0.000019538838,0.000110573535,0.00014480694,0.000037097703,0.000066228095],"domain_scores_gemma":[0.99976283,0.00000995213,0.00008025399,0.00006808079,0.000050220828,0.000028687406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004612614,0.000046362853,0.0000674927,0.000006702154,0.000029544079,0.00001301316,0.00013666376,0.00005319375,0.0000072874777],"category_scores_gemma":[0.00007923322,0.00003912812,0.000029865167,0.00007029854,0.000038654307,0.000002728413,0.000052520863,0.000034379496,0.000002206933],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031323467,0.000009165341,0.029155955,0.000014155763,0.00000971846,2.2634529e-7,0.000014314163,0.00011093957,0.9441542,0.00004139935,0.00028693257,0.02617166],"study_design_scores_gemma":[0.000108194974,0.000104824,0.0039207023,0.0000051554157,0.000004986181,0.0000044106173,0.000031244617,0.00044803158,0.9938198,0.00006395057,0.0014248654,0.000063840525],"about_ca_topic_score_codex":0.000007980625,"about_ca_topic_score_gemma":0.0000013650944,"teacher_disagreement_score":0.049665585,"about_ca_system_score_codex":0.000001741145,"about_ca_system_score_gemma":0.000010286118,"threshold_uncertainty_score":0.15955985},"labels":[],"label_agreement":null},{"id":"W3037302787","doi":"10.1007/978-3-030-51466-2_25","title":"Theoretical and Implementational Aspects of the Formal Language Server (LaSer)","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Prefix; Formal language; Programming language; Theoretical computer science; Linguistics","score_opus":0.008618757042745477,"score_gpt":0.24822439231726856,"score_spread":0.23960563527452308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037302787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4538508,0.0010255802,0.5243752,0.0022773847,0.00081536075,0.00071807567,0.000068255154,0.000026924807,0.016842391],"genre_scores_gemma":[0.9942252,0.000007122314,0.004294042,0.0012049604,0.00023038106,7.349491e-7,0.000014788106,0.0000059479535,0.0000168216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991118,0.000017071403,0.00015880293,0.00035633068,0.00018807275,0.00016793914],"domain_scores_gemma":[0.9996017,0.000048191076,0.000079363934,0.0001871149,0.000040867788,0.00004271316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019013243,0.00013584066,0.00013029485,0.000025050043,0.00006958161,0.000026714097,0.00038799492,0.000115920026,0.00002577107],"category_scores_gemma":[0.00005975709,0.00008363802,0.00005948687,0.000057417587,0.0006500814,0.0000036615625,0.0008060298,0.00016502503,8.2773835e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011883875,0.00005096294,0.0027931374,0.00014918826,0.000071347014,0.000036880094,0.00059662585,0.0022651718,0.14209406,0.47220644,0.000045271456,0.37957206],"study_design_scores_gemma":[0.0014222357,0.0018336233,0.009729352,0.00033586015,0.0000543789,0.00015349333,0.0000053899184,0.0280651,0.5333535,0.42176956,0.0020316506,0.0012458235],"about_ca_topic_score_codex":0.0000019999552,"about_ca_topic_score_gemma":0.000016797796,"teacher_disagreement_score":0.5403744,"about_ca_system_score_codex":0.000009279798,"about_ca_system_score_gemma":0.000087111395,"threshold_uncertainty_score":0.34106597},"labels":[],"label_agreement":null},{"id":"W3082628805","doi":"10.48550/arxiv.2009.00602","title":"Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Projection (relational algebra); Computer science; Column (typography); Context (archaeology); Unary operation; Nondeterministic finite automaton; Cover (algebra); Automaton; Regular language; Mathematics; Automata theory; Discrete mathematics; Combinatorics; Algorithm; Theoretical computer science","score_opus":0.18735797620052103,"score_gpt":0.24750872247453548,"score_spread":0.060150746274014455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082628805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942013,0.000042076597,0.0043566995,0.00006226025,0.00007665374,0.00027884034,0.00042143202,0.000027670143,0.000533074],"genre_scores_gemma":[0.99652773,0.000027203045,0.0017222847,0.00005330938,0.00012248536,7.119875e-7,0.0014527058,0.0000062101362,0.000087344415],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991778,0.00006249347,0.00012826493,0.00050384185,0.00002419802,0.00010336214],"domain_scores_gemma":[0.9995007,0.00002979725,0.0001638627,0.00015822609,0.00010227583,0.00004516325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013196516,0.000121830395,0.0001580509,0.000029993667,0.00005222709,0.00000863177,0.00011631192,0.00017645009,0.0000019672482],"category_scores_gemma":[0.00010212874,0.00011986934,0.000087597684,0.000055023516,0.00009951606,0.0000023431232,0.00045111615,0.00010746636,0.0000014315843],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011131141,0.00089075154,0.0074245553,0.0019862375,0.0011202703,0.00010589931,0.00029480012,0.026756778,0.9178041,0.006472787,0.005081998,0.020930674],"study_design_scores_gemma":[0.019563064,0.0066763232,0.028910747,0.0008954956,0.0009925213,0.000056543064,0.0007423815,0.46836624,0.29657152,0.17022325,0.0036818748,0.0033200376],"about_ca_topic_score_codex":0.00006632385,"about_ca_topic_score_gemma":0.00002897975,"teacher_disagreement_score":0.62123257,"about_ca_system_score_codex":0.000010178774,"about_ca_system_score_gemma":0.000038042235,"threshold_uncertainty_score":0.48881298},"labels":[],"label_agreement":null},{"id":"W3108501164","doi":"10.1007/978-3-030-62536-8_17","title":"Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Automaton; Projection (relational algebra); Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.057440604303737285,"score_gpt":0.2945945398114124,"score_spread":0.23715393550767513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108501164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11242693,0.00064702454,0.88122874,0.00083801075,0.0006521321,0.0011408384,0.00043766678,0.00006661055,0.0025620265],"genre_scores_gemma":[0.8505138,0.00001383819,0.1477914,0.00057917665,0.0005758028,0.000004294149,0.00046062598,0.0000123667105,0.00004868076],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989285,0.000016562333,0.00022037844,0.0005668271,0.00012963277,0.00013809669],"domain_scores_gemma":[0.9994581,0.000080815655,0.00014881349,0.00015592876,0.000116005365,0.000040365794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029277033,0.00015179274,0.00018809413,0.00006376317,0.00006726553,0.00002425222,0.00018093198,0.00015285576,0.0000012767448],"category_scores_gemma":[0.00016076419,0.00012233542,0.000050596092,0.000057236455,0.00035569884,0.0000038562875,0.0002801828,0.00012312489,8.639387e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042297837,0.000049874896,0.00007790599,0.00016768447,0.000032235417,0.000008059937,0.00011261184,0.0018335098,0.1889446,0.00044148986,0.00009537284,0.8078137],"study_design_scores_gemma":[0.005801708,0.007841038,0.0017852797,0.001247097,0.0000891811,0.00020798751,0.0000022209583,0.31435162,0.4296229,0.23316127,0.0037417924,0.002147895],"about_ca_topic_score_codex":0.000010937141,"about_ca_topic_score_gemma":0.000031204116,"teacher_disagreement_score":0.8056658,"about_ca_system_score_codex":0.000012204324,"about_ca_system_score_gemma":0.00006943246,"threshold_uncertainty_score":0.4988694},"labels":[],"label_agreement":null},{"id":"W3130094013","doi":"10.1142/s0129054121410057","title":"Generalizations of Code Languages with Marginal Errors","year":2021,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Prefix; Suffix; String (physics); Prefix code; Context-free language; Regular language; Mathematics; Combinatorics; Discrete mathematics; Compressed suffix array; Computer science; Suffix tree; Automaton; Algorithm; Theoretical computer science; Linguistics; Linear code; Natural language processing; Rule-based machine translation","score_opus":0.014953662195514748,"score_gpt":0.31410213911426543,"score_spread":0.2991484769187507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130094013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.705405,0.000072359966,0.2936597,0.0003306,0.00021800002,0.000014020084,0.00000633713,0.0000011967788,0.0002928089],"genre_scores_gemma":[0.9224157,0.000023463517,0.077267654,0.0000837668,0.00015948236,2.0754767e-7,0.00001267298,0.0000019441204,0.00003510618],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992528,0.000023903242,0.00024885964,0.00010262683,0.000304447,0.00006739633],"domain_scores_gemma":[0.9978917,0.000019007088,0.0002718892,0.00010064072,0.0016830482,0.000033679167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021005892,0.000047177145,0.000085472144,0.000093889765,0.000039930885,0.000032058746,0.00044549283,0.000019356228,0.000015761832],"category_scores_gemma":[0.000090842426,0.000035361903,0.000051651194,0.00019252925,0.00024329801,0.000018803374,0.00012411649,0.00003839757,3.6214226e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006625829,0.00025579362,0.023082208,0.000008476162,0.00014984258,0.000026619387,0.0001144156,0.018472811,0.9326807,0.0064702025,0.00026584038,0.01840678],"study_design_scores_gemma":[0.001188812,0.0010990106,0.08013802,0.00018045773,0.000037367343,0.0009329649,0.00019073322,0.0068605016,0.89909,0.0006506945,0.009397012,0.00023443565],"about_ca_topic_score_codex":0.000002962097,"about_ca_topic_score_gemma":0.00000751832,"teacher_disagreement_score":0.2170107,"about_ca_system_score_codex":0.000010573238,"about_ca_system_score_gemma":0.00031754022,"threshold_uncertainty_score":0.14420167},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.048185655747851365,"score_gpt":0.26152536582179964,"score_spread":0.21333971007394828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141810508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871509,0.00009913902,0.005428907,0.00012322985,0.000052302054,0.000076203774,0.0000015281265,0.000015007534,0.007052766],"genre_scores_gemma":[0.9956002,0.00003682323,0.0037270754,0.00025345886,0.00013854589,7.702953e-7,0.0000108508375,0.0000039319243,0.0002283144],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939394,0.000041121275,0.00019119497,0.00015516412,0.00006852925,0.00015007451],"domain_scores_gemma":[0.999623,0.00003976571,0.000068654044,0.00019587886,0.000041930085,0.000030793824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016219665,0.00008773489,0.000119944045,0.000007878409,0.00009656406,0.000003601242,0.00023761395,0.00009515625,0.000025220974],"category_scores_gemma":[0.00010932982,0.000041994037,0.00009381213,0.00005695639,0.00029852262,4.50843e-7,0.00018653276,0.00005522882,0.000008232616],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023112307,0.00016258734,0.012851147,0.000008598775,0.00003955596,0.000004112919,0.00008612886,0.000033577704,0.9799817,0.003227134,0.0019431543,0.0016391854],"study_design_scores_gemma":[0.00063631084,0.0012860955,0.046167057,0.000016022295,0.000014064718,0.00026977016,0.00038282786,0.0012882274,0.9250072,0.0013794526,0.023138933,0.00041399215],"about_ca_topic_score_codex":0.000002448841,"about_ca_topic_score_gemma":5.690181e-7,"teacher_disagreement_score":0.05497446,"about_ca_system_score_codex":0.000001691841,"about_ca_system_score_gemma":0.000014205854,"threshold_uncertainty_score":0.17124672},"labels":[],"label_agreement":null},{"id":"W3149692886","doi":"","title":"Symmetric-key cryptosystem with DNA technology","year":2007,"lang":"zh","type":"article","venue":"中国科学(F辑:信息科学)(英文版)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"DNA computing; Encryption; Cryptosystem; Computer science; Cryptography; Symmetric-key algorithm; Key (lock); Theoretical computer science; Public-key cryptography; Computer security; Algorithm; Computation","score_opus":0.008324216001826264,"score_gpt":0.22970198341821765,"score_spread":0.2213777674163914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149692886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93486106,0.008320374,0.008129121,0.001645647,0.0010369321,0.00084269664,0.00006520779,0.0002558057,0.044843175],"genre_scores_gemma":[0.9927908,0.00036969467,0.0028223419,0.000796904,0.0013692079,0.000023244711,0.00017293965,0.00010282883,0.001552014],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99453455,0.00018877615,0.0011024697,0.0017350299,0.00052439276,0.001914789],"domain_scores_gemma":[0.9969782,0.00015377144,0.00058742997,0.0013453906,0.00046661263,0.0004685834],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012303509,0.0009422858,0.000962986,0.00055695424,0.00040443463,0.00014922692,0.0011960934,0.001872985,0.0001004199],"category_scores_gemma":[0.0004517356,0.00073156884,0.00036392245,0.00188008,0.0005694905,0.000014460516,0.0008557375,0.0008439422,0.0003016922],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017479112,0.0015998883,0.065038525,0.00070710457,0.0014166707,0.0011280628,0.0005387501,0.000058329788,0.74845886,0.02948139,0.00456422,0.1452603],"study_design_scores_gemma":[0.005810976,0.01113607,0.013065236,0.00080181286,0.0005113343,0.0011171919,0.0061270706,0.00034457448,0.53696585,0.001349013,0.41862196,0.004148905],"about_ca_topic_score_codex":0.00009166408,"about_ca_topic_score_gemma":0.00017697483,"teacher_disagreement_score":0.41405773,"about_ca_system_score_codex":0.00013663157,"about_ca_system_score_gemma":0.00022249391,"threshold_uncertainty_score":0.99951357},"labels":[],"label_agreement":null},{"id":"W3188501935","doi":"10.22230/src.2021v12n1a399","title":"Editorial: On Syntheses, Reflections, and Conjectures: SRC 1+1","year":2021,"lang":"en","type":"editorial","venue":"Scholarly and Research Communication","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Proto-oncogene tyrosine-protein kinase Src; Cell biology; Biology","score_opus":0.05821502271692158,"score_gpt":0.40209494856180605,"score_spread":0.34387992584488447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188501935","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048490944,0.040749576,0.000039227238,0.0011294832,0.94397706,0.00051823055,0.00011180553,0.000046323523,0.008579209],"genre_scores_gemma":[0.028314145,0.032648098,0.00048304297,0.00006538196,0.9362731,0.000046259855,0.0010088676,0.000029712008,0.001131399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964684,0.0017055641,0.00022775563,0.00058194884,0.00070608663,0.00031021814],"domain_scores_gemma":[0.9962104,0.0013687968,0.00008885208,0.0009081127,0.0012928159,0.00013100535],"candidate_categories":["metaresearch","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0033773913,0.00020191188,0.00022599148,0.00011363043,0.00090789585,0.0008616296,0.00052205176,0.001412056,0.000007628611],"category_scores_gemma":[0.016002292,0.00016301738,0.00005700548,0.00016815933,0.0003604214,0.000018581166,0.0008352757,0.0027304483,0.000005166594],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012223597,0.00005572305,0.000017633762,0.00004894785,0.00005037121,0.0000010639039,0.00003580242,4.0895554e-7,0.016039107,0.000108874345,0.9785497,0.0049700844],"study_design_scores_gemma":[0.00020115543,0.0005517287,0.000036947542,0.00025219293,0.000009973582,0.0000020202883,0.0001456789,0.0000017154639,0.0021093988,0.00039976108,0.99610287,0.00018657153],"about_ca_topic_score_codex":0.00010267446,"about_ca_topic_score_gemma":0.00012053496,"teacher_disagreement_score":0.02346505,"about_ca_system_score_codex":0.000039112532,"about_ca_system_score_gemma":0.00028514213,"threshold_uncertainty_score":0.9998843},"labels":[],"label_agreement":null},{"id":"W3194721684","doi":"10.1088/1367-2630/ac1d38","title":"Design and fabrication of networks for bacterial computing","year":2021,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"FP7 Coordination of Non-Community Research Programmes; H2020 Future and Emerging Technologies; European Commission; Natural Sciences and Engineering Research Council of Canada; Advanced Research Projects Agency; Defense Advanced Research Projects Agency; Queensland University of Technology","keywords":"Computation; Massively parallel; Computational complexity theory; Frame (networking); Computer science; Scaling; Physics; Algorithm; Parallel computing; Mathematics","score_opus":0.02557087735536538,"score_gpt":0.26363790348512867,"score_spread":0.2380670261297633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194721684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36241928,0.00025706927,0.63716036,0.000023221082,0.000103596176,0.00002340238,3.7237882e-7,5.555616e-7,0.000012160712],"genre_scores_gemma":[0.96089417,0.000048269372,0.03756502,0.000048196565,0.0014175847,8.084523e-8,0.0000087058115,0.000003491083,0.000014512002],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996445,0.000036127007,0.00015595778,0.000064380845,0.000034650126,0.000064364685],"domain_scores_gemma":[0.9995093,0.000042028627,0.00018677383,0.000043397657,0.00018759658,0.000030923213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013107588,0.000042780943,0.0001028217,0.0000042134143,0.000022486947,0.000009811929,0.000048497328,0.000043259548,0.0000010607407],"category_scores_gemma":[0.000064466585,0.000034620265,0.000052350817,0.000031511172,0.000014904352,0.00000198152,0.000033393033,0.000037358957,3.5086394e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008412921,0.000025313459,0.0002658569,0.0000073501037,0.0000305506,5.716962e-7,0.000014912597,0.0040371767,0.8845567,0.00009818712,0.00058230694,0.110296935],"study_design_scores_gemma":[0.0011288467,0.00088195247,0.0015603736,0.000044778106,0.00004340255,0.00003245747,0.00002693569,0.0093552675,0.9820112,0.0014751718,0.0033293993,0.00011020178],"about_ca_topic_score_codex":3.7169838e-7,"about_ca_topic_score_gemma":8.1650484e-8,"teacher_disagreement_score":0.5995953,"about_ca_system_score_codex":0.0000022994218,"about_ca_system_score_gemma":0.000052920335,"threshold_uncertainty_score":0.14117734},"labels":[],"label_agreement":null},{"id":"W3196448279","doi":"10.1007/s11047-021-09867-x","title":"Conjugate word blending: formal model and experimental implementation by XPCR","year":2021,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Word (group theory); Conjugate; Programming language; Linguistics; Mathematics; Philosophy","score_opus":0.012563575136313117,"score_gpt":0.29963643549953817,"score_spread":0.28707286036322505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196448279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99491733,0.0027315754,0.0016800157,0.000088912086,0.00013876168,0.00006895981,0.000006217,0.000021658947,0.00034657234],"genre_scores_gemma":[0.9961304,0.000015008467,0.002777999,0.00053087634,0.00014042204,0.0000011342638,0.00025956263,0.000008346903,0.00013621712],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991241,0.00003718887,0.0001696922,0.0003081441,0.000081754,0.0002790882],"domain_scores_gemma":[0.9997446,0.00001294929,0.000061106046,0.00008132815,0.00004611432,0.000053901575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118312695,0.00012391555,0.00010554697,0.000011872176,0.00018955777,0.000054774955,0.00007554427,0.00007658216,0.000007763156],"category_scores_gemma":[0.000018564318,0.000109124456,0.00004811641,0.000051167477,0.000032068798,0.000007648758,0.00032883097,0.00011604002,0.0000010858577],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019960278,0.00001588178,0.0009763297,0.000005464038,0.000016010805,0.0000028486195,0.00004498054,0.00015180848,0.98053735,0.00012475066,0.0006906429,0.017413953],"study_design_scores_gemma":[0.0007844572,0.00012183102,0.00064207654,0.000011117637,0.000007721266,0.000043586468,0.0004800945,0.040516492,0.9548817,0.000050109225,0.0022098152,0.00025095526],"about_ca_topic_score_codex":0.000003793309,"about_ca_topic_score_gemma":0.000003403262,"teacher_disagreement_score":0.040364683,"about_ca_system_score_codex":0.0000125193055,"about_ca_system_score_gemma":0.000020788728,"threshold_uncertainty_score":0.4449966},"labels":[],"label_agreement":null},{"id":"W3198331920","doi":"10.1007/978-3-030-87993-8_3","title":"Robust Real-Time Computing with Chemical Reaction Networks","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Real number; Turing machine; Class (philosophy); Computation; Algebraic number; Discrete mathematics; Mathematics; Computer science; Combinatorics; Algorithm; Mathematical analysis","score_opus":0.014296448545736388,"score_gpt":0.23923277375610713,"score_spread":0.22493632521037074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198331920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4725567,0.00010441104,0.5268022,0.00006344712,0.0003079094,0.000106789725,6.8712944e-7,0.000028798248,0.000029072608],"genre_scores_gemma":[0.8576769,0.00003477856,0.14082181,0.00031941515,0.001006561,0.0000032801472,0.00012056548,0.000015734895,9.266419e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973604,0.000097927375,0.0003040777,0.0014049747,0.00028028808,0.00055234606],"domain_scores_gemma":[0.99878603,0.00008652111,0.0001886987,0.00063088036,0.00019632108,0.00011156982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005741188,0.00034410518,0.00035256476,0.0000796772,0.00013783606,0.00025100773,0.000775102,0.00048794685,0.0000033183787],"category_scores_gemma":[0.00011486866,0.0002691147,0.000098171535,0.00047673908,0.0003808041,0.000006446506,0.0021826837,0.0007051101,0.0000013163268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003017466,0.000053253523,0.0014162565,0.000021762768,0.000014901889,0.000027775815,0.0000473293,0.62194735,0.2994207,0.0000013179167,0.000006315293,0.077012844],"study_design_scores_gemma":[0.00027747726,0.00023750296,0.0033061467,0.00033929583,0.000013412539,0.00010432105,0.0000013169299,0.9027547,0.09219469,0.0001264274,0.000021086553,0.00062360475],"about_ca_topic_score_codex":0.00005199879,"about_ca_topic_score_gemma":0.00001994489,"teacher_disagreement_score":0.38598034,"about_ca_system_score_codex":0.00007578963,"about_ca_system_score_gemma":0.00025937168,"threshold_uncertainty_score":0.9999761},"labels":[],"label_agreement":null},{"id":"W3202438242","doi":"10.3390/act10100246","title":"UV-Vis Spectrophotometric Analysis of DNA Retrieval for DNA Storage Applications","year":2021,"lang":"en","type":"article","venue":"Actuators","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"DNA; Biological system; Computer science; Process (computing); Biochemical engineering; Process engineering; Chemistry; Environmental science; Biology; Biochemistry; Engineering","score_opus":0.013075306386144238,"score_gpt":0.27124376075195294,"score_spread":0.2581684543658087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202438242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95726734,0.0003882667,0.041596994,0.000039139497,0.000043499007,0.00014903556,0.000060254064,0.000010474542,0.0004449757],"genre_scores_gemma":[0.9973875,0.000077838704,0.0017204168,0.00012003565,0.00012222635,0.0000119459555,0.00039583707,0.00000819087,0.00015598595],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918556,0.000030054045,0.00020126652,0.00031653413,0.000092873386,0.00017368188],"domain_scores_gemma":[0.99932766,0.00006310956,0.00010428425,0.00030243708,0.00014365507,0.000058839185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014667952,0.00009800119,0.00021292735,0.00014157838,0.000060326332,0.000012434913,0.00015131047,0.00011534663,0.00004864834],"category_scores_gemma":[0.0002525552,0.00008449291,0.00027280013,0.0014710488,0.00003965258,0.0000011777182,0.00008566602,0.000044037155,0.0000024049962],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053105123,0.000102511905,0.00575659,0.000018136338,0.0007283583,0.0000017400414,0.000014369902,0.000031776664,0.9858133,0.00034962813,0.00026223005,0.006868207],"study_design_scores_gemma":[0.00027877922,0.00024041285,0.016093424,0.000002440737,0.00043892715,0.0000020303708,0.00006672705,0.00030578853,0.9573536,0.00015912681,0.024866736,0.00019200727],"about_ca_topic_score_codex":0.0000023382934,"about_ca_topic_score_gemma":0.0000036817987,"teacher_disagreement_score":0.040120162,"about_ca_system_score_codex":0.000014206052,"about_ca_system_score_gemma":0.00004995099,"threshold_uncertainty_score":0.34455207},"labels":[],"label_agreement":null},{"id":"W3212819223","doi":"10.1088/1367-2630/ac3883","title":"As good as it gets: a scaling comparison of DNA computing, network biocomputing, and electronic computing approaches to an NP-complete problem","year":2021,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Defense Advanced Research Projects Agency","keywords":"DNA computing; Massively parallel; Benchmark (surveying); Computer science; Unconventional computing; Supercomputer; Computation; Scaling; NP; Subset sum problem; Parallel computing; Theoretical computer science; Algorithm; Turing machine; Mathematics","score_opus":0.0591441130082886,"score_gpt":0.2946060402501146,"score_spread":0.23546192724182602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212819223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93864536,0.0019713114,0.058187835,0.0003201257,0.00013007072,0.00014820388,0.0000018513518,0.000012470292,0.0005827593],"genre_scores_gemma":[0.9700221,0.00003621166,0.027383013,0.0005502564,0.0019245477,2.6919327e-7,0.00002680006,0.000026670594,0.000030165911],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976836,0.00022912292,0.00080071157,0.00044026066,0.00027241395,0.0005738765],"domain_scores_gemma":[0.9984119,0.00008084848,0.0007503939,0.00023865339,0.00023792898,0.00028030542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006335537,0.00028234112,0.00063728495,0.000036422003,0.00019241718,0.00008882892,0.00036811995,0.00015656813,0.000003778009],"category_scores_gemma":[0.00007978394,0.00025042726,0.00020673148,0.00024473673,0.00007634883,0.00001210521,0.00041887816,0.00039970197,0.0000025149366],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003679292,0.00094390975,0.021076137,0.00018737618,0.00069081946,0.000036013498,0.001847691,0.10027651,0.5577667,0.007555597,0.0014652942,0.30778608],"study_design_scores_gemma":[0.006899733,0.018186325,0.0077860435,0.0018773375,0.00059091777,0.0015513584,0.0034156283,0.05887517,0.80521446,0.02546805,0.06737046,0.0027645212],"about_ca_topic_score_codex":0.000022446306,"about_ca_topic_score_gemma":0.000013502245,"teacher_disagreement_score":0.30502155,"about_ca_system_score_codex":0.0000267314,"about_ca_system_score_gemma":0.00029609908,"threshold_uncertainty_score":0.9999948},"labels":[],"label_agreement":null},{"id":"W342881643","doi":"10.1007/978-94-015-9634-3_32","title":"Context-Free Recombinations","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Corollary; Context (archaeology); Computational biology; RNA splicing; Computer science; Genetics; Theoretical computer science; Gene; Biology; Mathematics; Combinatorics","score_opus":0.023071527135848143,"score_gpt":0.23602165782002396,"score_spread":0.21295013068417581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W342881643","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041785988,0.0006765773,0.00053507276,0.00034299557,0.00019267698,0.000120609875,0.000020120819,0.000032376767,0.9976617],"genre_scores_gemma":[0.032915507,0.0003727339,0.00029449337,0.0010121623,0.00039925522,0.000003156891,0.00035999774,0.000024928464,0.9646178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922764,0.000009152699,0.0001862663,0.0003455621,0.00007586464,0.00015549146],"domain_scores_gemma":[0.99932474,0.0000130255985,0.000080425874,0.00043952285,0.00008178503,0.00006047324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074893505,0.00019788995,0.00016601125,0.000028535424,0.00006343793,0.000018477902,0.00032649701,0.00044863645,0.0008565798],"category_scores_gemma":[0.0000609912,0.00015711291,0.00015803587,0.000009609351,0.000063570136,5.646959e-7,0.0003029343,0.00013982883,0.000119771335],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044736007,0.0000644119,0.00009988911,0.000018845314,0.00022586717,0.000026877522,0.000005289112,0.0000021462859,0.010290633,0.5464636,0.30848622,0.13427144],"study_design_scores_gemma":[0.00021706136,0.00021521327,0.000019980942,0.000016474092,0.000014154383,0.000015509873,0.0000033232195,0.000003213574,0.00086017395,0.02468204,0.97370476,0.00024809872],"about_ca_topic_score_codex":0.0000047546,"about_ca_topic_score_gemma":0.000041185587,"teacher_disagreement_score":0.66521853,"about_ca_system_score_codex":0.000009581195,"about_ca_system_score_gemma":0.000027057125,"threshold_uncertainty_score":0.9378948},"labels":[],"label_agreement":null},{"id":"W39440519","doi":"10.1007/978-3-642-21341-0_24","title":"Extended Watson-Crick L Systems with Regular Trigger Languages","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Recursively enumerable language; Watson; Computer science; Expressive power; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Bounded function; Complementarity (molecular biology); Formal language; Relation (database); Recursively enumerable set; Regular language; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Automaton; DNA; Artificial intelligence; Base pair","score_opus":0.013943044915379723,"score_gpt":0.23268963096823006,"score_spread":0.21874658605285033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39440519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081186155,0.0045766947,0.97288215,0.00010239864,0.00071904453,0.00048228374,0.0000099083445,0.000063666834,0.013045227],"genre_scores_gemma":[0.9767292,0.000106475534,0.017906692,0.0005580443,0.0011041798,0.000008286733,0.00004734626,0.00004447072,0.0034952627],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99796385,0.00003207126,0.0002628161,0.000999463,0.00030144418,0.0004403743],"domain_scores_gemma":[0.9989068,0.000040964725,0.00016487589,0.00064156775,0.00014268776,0.00010311632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003716997,0.00037798742,0.00035606808,0.0001362395,0.000114558534,0.00010173326,0.0007954495,0.0003905857,0.000015771995],"category_scores_gemma":[0.000040313524,0.00024634792,0.00008982648,0.00012051696,0.00051436736,0.0000060715643,0.0004202176,0.00031772078,0.000012537589],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041064378,0.00021926535,0.0009339891,0.00033333822,0.00023835801,0.00070337567,0.00050269853,0.009138308,0.08310112,0.006359266,0.0005057872,0.89755386],"study_design_scores_gemma":[0.007960549,0.022289285,0.006145574,0.0070548723,0.00048510503,0.0038596622,0.000019893712,0.050597895,0.48449934,0.076208726,0.323908,0.016971106],"about_ca_topic_score_codex":0.000021695467,"about_ca_topic_score_gemma":0.000016330901,"teacher_disagreement_score":0.96861064,"about_ca_system_score_codex":0.000035351502,"about_ca_system_score_gemma":0.00013733422,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W4200076258","doi":"10.1016/j.biosystems.2021.104583","title":"Effective decoders for DNA codes","year":2021,"lang":"en","type":"article","venue":"Biosystems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Decoding methods; Edit distance; Metric (unit); Computer science; Algorithm; Code (set theory); Measure (data warehouse); Set (abstract data type); Extension (predicate logic); List decoding; Error detection and correction; Theoretical computer science; Concatenated error correction code; Data mining; Block code","score_opus":0.011626360981535836,"score_gpt":0.26120613069475807,"score_spread":0.24957976971322224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200076258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99030834,0.0010991222,0.0066539925,0.00006628152,0.00039633454,0.00028245352,0.000029848046,0.000020000558,0.0011435994],"genre_scores_gemma":[0.9979681,0.0000135317705,0.00078402855,0.00019923224,0.0004523944,0.000038902777,0.00012744813,0.000008597371,0.00040781635],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933594,0.000060047012,0.00011719163,0.00027297577,0.000042901705,0.00017092814],"domain_scores_gemma":[0.9996388,0.000035703364,0.00004074501,0.00014787121,0.000092335074,0.00004457354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015225404,0.000089277266,0.00012136021,0.00000876895,0.000069360205,0.000023578767,0.000079648875,0.00011738391,0.000004638717],"category_scores_gemma":[0.0001578826,0.00007037078,0.00010423155,0.00004636561,0.000021631316,8.038358e-7,0.00005939543,0.00002523052,0.000009511648],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030025807,0.000025756486,0.0023875535,0.00004292597,0.00004631728,0.0000028445356,0.000008388036,0.0000046306563,0.9911796,0.00012738278,0.002028852,0.004115715],"study_design_scores_gemma":[0.00042094078,0.0002757627,0.0019762293,0.000024211837,0.000011259418,0.000020747902,0.00009878445,0.00017556042,0.84822065,0.000046295165,0.1485673,0.00016225444],"about_ca_topic_score_codex":0.00000264082,"about_ca_topic_score_gemma":0.000016216782,"teacher_disagreement_score":0.14653845,"about_ca_system_score_codex":0.0000077569475,"about_ca_system_score_gemma":0.000026696998,"threshold_uncertainty_score":0.2869637},"labels":[],"label_agreement":null},{"id":"W4205118740","doi":"10.1016/s0304-3975(04)00130-6","title":"Deletion along trajectories*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decidability; Closure (psychology); Regular language; Mathematical proof; Formal language; Mathematics; Inverse; Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.007638670920687556,"score_gpt":0.24085453925113437,"score_spread":0.2332158683304468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205118740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67574936,0.00002273127,0.32239878,0.00016646489,0.00019995372,0.000051387164,6.178935e-7,0.000025872194,0.0013848119],"genre_scores_gemma":[0.9813472,0.000003888548,0.017758394,0.0005157882,0.00035873582,0.0000018234582,0.000005396192,0.0000046864757,0.000004080033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989127,0.000030099569,0.00013240513,0.00040918367,0.00018927427,0.00032636052],"domain_scores_gemma":[0.9995177,0.000013599808,0.000025860896,0.00023476097,0.000083215324,0.00012488641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004774777,0.000103885825,0.000085022555,0.000028809922,0.00021738536,0.00006346939,0.00044078263,0.00006430039,0.0000119925735],"category_scores_gemma":[0.000080222446,0.000076555676,0.000049432187,0.00023821417,0.0014244936,0.000005438652,0.00028813694,0.000078965284,0.000022651462],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029250576,0.000060815422,0.0005080824,0.0000031932473,0.0000041774397,0.000005825521,0.000038544695,0.0005751055,0.23847781,0.743454,0.000016530974,0.016826667],"study_design_scores_gemma":[0.0011746021,0.0025251391,0.016235324,0.000042676576,0.000012969166,0.00015576743,0.000021895814,0.0050503737,0.79182595,0.1802086,0.0019759273,0.00077080366],"about_ca_topic_score_codex":0.0000035205674,"about_ca_topic_score_gemma":0.000001007861,"teacher_disagreement_score":0.5632454,"about_ca_system_score_codex":0.000018315455,"about_ca_system_score_gemma":0.000066592285,"threshold_uncertainty_score":0.5248606},"labels":[],"label_agreement":null},{"id":"W4205207469","doi":"10.1137/1.9781611977073.58","title":"Recognizing <i>k</i>-leaf powers in polynomial time, for constant <i>k</i>","year":2022,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Combinatorics; Graph; Time complexity; Mathematics; Degree (music); Tree (set theory); Function (biology); Polynomial; Constant (computer programming); Discrete mathematics; Computer science; Physics; Biology","score_opus":0.04073694120796241,"score_gpt":0.23813625026076157,"score_spread":0.19739930905279918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205207469","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013943226,0.0005425212,0.0011377463,0.00019637575,0.00071903475,0.0069390256,0.0018473373,0.00009517325,0.9745796],"genre_scores_gemma":[0.038813267,0.0006203461,0.117905274,0.005573711,0.011547439,0.0028059643,0.0077276737,0.0010841446,0.81392217],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983933,0.0000058065807,0.0005328216,0.0005655949,0.0001274733,0.00037501848],"domain_scores_gemma":[0.9991733,0.0001766734,0.0003264547,0.0002019053,0.00003684653,0.00008484376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005729758,0.0003885733,0.0005566064,0.000028710157,0.00024054905,0.00004404346,0.00020338708,0.0008516323,0.000029922809],"category_scores_gemma":[0.000042262636,0.0003550541,0.0005365373,0.000013521078,0.0001775354,0.0000013852912,0.00027912157,0.0003764339,0.0000015769356],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023512356,0.00029302933,0.000004804738,0.0012144335,0.0018253878,0.0000046478117,0.0011120591,0.000027119007,0.4088826,0.2764812,0.1823243,0.12547916],"study_design_scores_gemma":[0.0038994937,0.0006673166,4.714192e-8,0.00012119079,0.00019008372,0.00000900421,0.00031899122,0.00008852981,0.0077752196,0.022451939,0.9636221,0.0008560978],"about_ca_topic_score_codex":0.0000012002336,"about_ca_topic_score_gemma":0.0000016013562,"teacher_disagreement_score":0.7812978,"about_ca_system_score_codex":0.00004026147,"about_ca_system_score_gemma":0.00013614664,"threshold_uncertainty_score":0.99989015},"labels":[],"label_agreement":null},{"id":"W4206968670","doi":"10.1111/cag.12741","title":"Matters (and metaphors) of life and death: How DNA storage doubles back on its promise to the world","year":2022,"lang":"en","type":"article","venue":"Canadian Geographies / Géographies canadiennes","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cloud computing; Cloud storage; Temporality; Data science; Sustainability; Computer science; Sociology; Environmental ethics; Aesthetics; Epistemology; Political science; Biology; Ecology; Art; Law; Philosophy","score_opus":0.015465085433591865,"score_gpt":0.20098273988541385,"score_spread":0.18551765445182197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206968670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9849166,0.003527222,0.000001306341,0.010259539,0.0002189084,0.00045206063,0.00029174724,0.000010807566,0.00032180015],"genre_scores_gemma":[0.99413735,0.00038331473,0.00006249325,0.0047076526,0.000085031075,0.00007829426,0.000062715684,0.000023727907,0.00045941325],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984288,0.00012901679,0.00020087356,0.00051359367,0.00013723318,0.00059044006],"domain_scores_gemma":[0.99874955,0.000055731234,0.000095841075,0.00034276958,0.000064741245,0.00069135235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027696282,0.00027085812,0.00027016707,0.000987079,0.0006311448,0.00007342656,0.00038462513,0.000067300185,0.00003640758],"category_scores_gemma":[0.000071544586,0.00021098624,0.00013738769,0.0013481361,0.0003533052,0.0000067558785,0.00022564395,0.00016290555,8.3309976e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015837568,0.00025320763,0.5196115,0.0006295792,0.0028062626,0.0001954923,0.0037472078,0.0014905473,0.06241549,0.02138687,0.3613029,0.024577161],"study_design_scores_gemma":[0.00071501074,0.0014065104,0.11039054,0.00003705284,0.00007892117,0.000042348915,0.006276809,0.000028862947,0.0016877919,0.00013747947,0.8783509,0.0008477459],"about_ca_topic_score_codex":0.031294897,"about_ca_topic_score_gemma":0.78657305,"teacher_disagreement_score":0.75527817,"about_ca_system_score_codex":0.000016650762,"about_ca_system_score_gemma":0.00007180627,"threshold_uncertainty_score":0.9751558},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023677495020257643,"score_gpt":0.25377332279406106,"score_spread":0.2300958277738034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220848411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94288945,0.00070686935,0.052670185,0.00008287169,0.00065707456,0.00022766866,0.000028125858,0.000014007202,0.0027237346],"genre_scores_gemma":[0.99965703,0.000006294994,0.000020561612,0.00020024269,0.000052431107,0.00001790576,0.000026370504,0.0000015693054,0.000017568804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990731,0.00010399524,0.00030835773,0.00010842902,0.00025805208,0.00014808138],"domain_scores_gemma":[0.99960965,0.000021930413,0.00019006069,0.00010028771,0.00004986968,0.000028228393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930433,0.000066949586,0.0000994695,0.000048583748,0.00026700055,0.00006442222,0.00025893192,0.000029079974,0.0000075227076],"category_scores_gemma":[0.000035334408,0.000049885188,0.00004469948,0.00013259146,0.00008949896,0.000021796595,0.00013660878,0.000050725826,0.0000029736782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005934176,0.000042073923,0.010465815,0.00010450544,0.00003410213,8.2206776e-7,0.0002944935,0.87699056,0.10021707,0.0069204615,0.00031882888,0.0045519527],"study_design_scores_gemma":[0.002677828,0.0062414994,0.03358609,0.00010635584,0.000050254504,0.00021515897,0.02545358,0.75136393,0.010122483,0.0002667528,0.1687415,0.0011745911],"about_ca_topic_score_codex":0.000057545993,"about_ca_topic_score_gemma":7.087598e-7,"teacher_disagreement_score":0.16842267,"about_ca_system_score_codex":0.00001417744,"about_ca_system_score_gemma":0.000056544755,"threshold_uncertainty_score":0.20535794},"labels":[],"label_agreement":null},{"id":"W4224819209","doi":"10.1155/2022/5055019","title":"A New Way to Model the Wireless Sensor Network Maintenance Job","year":2022,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; National Natural Science Foundation of China; University of Alberta","keywords":"Computer science; Heuristics; Heuristic; Latency (audio); Wireless sensor network; Mathematical optimization; Network planning and design; Wireless network; Point (geometry); Distributed computing; Wireless; Computer network; Artificial intelligence","score_opus":0.019991542409431816,"score_gpt":0.26532289408684223,"score_spread":0.2453313516774104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224819209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9213926,0.0015671112,0.07403571,0.0013088533,0.00010649922,0.00043409204,0.000011712955,0.000045186727,0.0010982071],"genre_scores_gemma":[0.9850269,0.00023789528,0.01230042,0.001397036,0.00018164406,0.00007244042,0.000043059463,0.000019389623,0.00072123593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998695,0.00022603992,0.00026540525,0.00034592758,0.000111317946,0.00035626764],"domain_scores_gemma":[0.9985775,0.00010096672,0.000106330044,0.0010409465,0.00006167851,0.000112584035],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005025214,0.00015981408,0.00017063254,0.000021524445,0.0014932692,0.000059843638,0.0010351925,0.00005327424,0.0000069504877],"category_scores_gemma":[0.000016919004,0.00012339123,0.000076821,0.00022894004,0.00009563667,0.0000026566406,0.0035113548,0.0002922982,0.000002391041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010020876,0.00015239127,0.0043455614,0.00001862944,0.00010434358,0.0000028878133,0.001277342,0.28562307,0.091272905,0.010388481,0.018586995,0.5881272],"study_design_scores_gemma":[0.00054965535,0.0005071912,0.0015739235,0.000047875757,0.000025534988,0.000069085276,0.0013288925,0.7515284,0.00060921215,0.00041200884,0.24279647,0.00055176165],"about_ca_topic_score_codex":0.00005700269,"about_ca_topic_score_gemma":0.000029710687,"teacher_disagreement_score":0.58757544,"about_ca_system_score_codex":0.000021759775,"about_ca_system_score_gemma":0.000051774772,"threshold_uncertainty_score":0.99980664},"labels":[],"label_agreement":null},{"id":"W4232052944","doi":"10.1093/oso/9780190843861.003.0005","title":"Algol Genes","year":2018,"lang":"en","type":"book-chapter","venue":"Oxford University Press eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Successor cardinal; Computer science; Library science; Task (project management); Process (computing); Jurisdiction; Operations research; Mathematics education; Programming language; Political science; Engineering; Law; Psychology; Mathematics","score_opus":0.022654038200870034,"score_gpt":0.20582946154057213,"score_spread":0.1831754233397021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232052944","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037452097,0.00021836477,0.00038882997,0.0000055009095,0.0001477451,0.00015329136,0.00005599757,0.00003769152,0.99524736],"genre_scores_gemma":[0.002925747,0.00031432224,0.00043118722,0.00009592183,0.00052572816,2.2760551e-7,0.00013535906,0.000024817622,0.9955467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991106,0.000020073048,0.00010748673,0.00045339423,0.00009481103,0.00021365259],"domain_scores_gemma":[0.99934155,0.000008079815,0.00011726322,0.00035108588,0.00009132951,0.00009066544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005331107,0.000250617,0.00019392918,0.00003493632,0.00012613216,0.000018631848,0.00039994263,0.00052581116,0.000058577258],"category_scores_gemma":[0.0000048231104,0.0002417137,0.00018580344,0.000002669759,0.00019950634,0.0000012223921,0.00058973866,0.00014110676,0.0000032561331],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017983682,0.00011677908,0.000140829,0.00032579678,0.002230438,0.00061180355,0.00018289585,0.00001878834,0.12080331,0.45556727,0.10572554,0.31247818],"study_design_scores_gemma":[0.00020897052,0.0002455454,0.000005930352,0.000026975866,0.000052905554,0.000007662093,0.000005588292,0.000008132434,0.006200598,0.00016881888,0.9927527,0.00031619312],"about_ca_topic_score_codex":0.000004943433,"about_ca_topic_score_gemma":0.0000059531017,"teacher_disagreement_score":0.88702714,"about_ca_system_score_codex":0.000017363654,"about_ca_system_score_gemma":0.000038490998,"threshold_uncertainty_score":0.98567986},"labels":[],"label_agreement":null},{"id":"W4235417955","doi":"10.24908/iqurcp.7884","title":"12. Solving a Maze Using DNA Computing","year":2017,"lang":"en","type":"article","venue":"Inquiry Queen s Undergraduate Research Conference Proceedings","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"DNA computing; Computer science; In silico; Supercomputer; Routing (electronic design automation); Scope (computer science); Parallel computing; Computation; Distributed computing; Algorithm; Theoretical computer science; Chemistry","score_opus":0.17406940919539035,"score_gpt":0.40695189117718955,"score_spread":0.2328824819817992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235417955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98304,0.0000714008,0.005109336,0.002838892,0.0002392333,0.000367347,0.000003260133,0.000061072984,0.00826949],"genre_scores_gemma":[0.9953255,0.00014892976,0.0026572067,0.00010431408,0.0010301423,0.0000099193885,0.000014678308,0.0000377734,0.00067151646],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99677837,0.00009824382,0.0003909401,0.00094707543,0.00061720284,0.0011681475],"domain_scores_gemma":[0.9978099,0.000058989284,0.00028606472,0.00049226644,0.001066119,0.00028666112],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019946108,0.00031186026,0.00031890575,0.00014449575,0.001581876,0.0012768406,0.0013962355,0.00030478038,0.000011570207],"category_scores_gemma":[0.0015227301,0.00027399702,0.00013191719,0.00009965038,0.0011411322,0.000048085334,0.001997484,0.00060950185,0.00002688059],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013309096,0.000095555726,0.031076128,0.00012235584,0.00009276977,0.00002271743,0.0005841415,0.000009599246,0.9467068,0.007641838,0.0015361615,0.011978878],"study_design_scores_gemma":[0.005635124,0.0045791115,0.04832198,0.0027311738,0.00012781068,0.000404308,0.007513374,0.07242092,0.68623036,0.094602026,0.072408505,0.005025288],"about_ca_topic_score_codex":0.0002420693,"about_ca_topic_score_gemma":0.00001987917,"teacher_disagreement_score":0.26047638,"about_ca_system_score_codex":0.000081156766,"about_ca_system_score_gemma":0.00030468957,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W4236469658","doi":"10.3410/f.717965471.793466494","title":"Faculty Opinions recommendation of Three-dimensional structures self-assembled from DNA bricks.","year":2012,"lang":"en","type":"dataset","venue":"Faculty Opinions – Post-Publication Peer Review of the Biomedical Literature","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Stem Cell Network","funders":"","keywords":"Nanotechnology; Engineering; Materials science","score_opus":0.02805786305754526,"score_gpt":0.32648277998822706,"score_spread":0.2984249169306818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236469658","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008770063,0.0024881107,0.00004605376,0.026133025,0.0010083348,0.00078961416,0.96938753,0.000027833172,0.000031783242],"genre_scores_gemma":[0.00029996713,0.00014219074,0.0016012795,0.0033221904,0.0008736443,0.000059537248,0.9935716,0.000022338936,0.000107277534],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996318,0.00041882473,0.0012441201,0.00074070925,0.00088171154,0.0003966528],"domain_scores_gemma":[0.9942302,0.000096563315,0.0013281696,0.0011810131,0.002892214,0.00027185807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008450449,0.00053583446,0.0007854582,0.00012534254,0.00021022918,0.00007338418,0.0013986535,0.0010761203,0.00035231822],"category_scores_gemma":[0.0025080408,0.00032214247,0.00064424303,0.0007224308,0.00014426102,0.00002617193,0.00092366117,0.00069719745,0.000027398119],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020689917,0.00029673972,0.000035744328,0.001117198,0.00024039423,1.2573649e-7,0.000012318106,1.7964393e-7,0.0003236115,0.000049323255,0.99636954,0.0015341353],"study_design_scores_gemma":[0.00049157435,0.0001609077,0.0040856632,0.0017892845,0.00018634216,0.000017370472,0.000004807558,0.000008556882,0.00058385305,0.00005073647,0.99225867,0.0003622476],"about_ca_topic_score_codex":0.00007509427,"about_ca_topic_score_gemma":0.000011421624,"teacher_disagreement_score":0.02418403,"about_ca_system_score_codex":0.000045537032,"about_ca_system_score_gemma":0.0003274499,"threshold_uncertainty_score":0.99992305},"labels":[],"label_agreement":null},{"id":"W4237833787","doi":"10.1080/17445760.2019.1659260","title":"Membrane computing","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Imperial Experimental Cancer Medicine Centre; National Natural Science Foundation of China; Canadian Celiac Association","keywords":"Computer science","score_opus":0.011610995780733357,"score_gpt":0.26480905962849743,"score_spread":0.25319806384776405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237833787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98098886,0.000990453,0.015480457,0.00016861502,0.0018285763,0.00006513291,0.000020091662,0.0000041949424,0.00045363978],"genre_scores_gemma":[0.99878454,0.00015550577,0.00014021457,0.00005482919,0.0005975425,2.7758824e-7,0.000111857946,0.000004698787,0.00015051101],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991592,0.00004586881,0.0003669,0.000120811674,0.00019586881,0.0001113094],"domain_scores_gemma":[0.9993325,0.000013336893,0.0002615018,0.0000642439,0.0002597226,0.00006873682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024785346,0.00008814591,0.00014838457,0.000033778942,0.00002630005,0.000043000553,0.00022912133,0.00006679378,0.000028007142],"category_scores_gemma":[0.00004698895,0.00006540508,0.000092167036,0.000031296157,0.000018650655,0.0000052985242,0.00009795239,0.000071360715,0.000008241833],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009850826,0.00029669664,0.23600344,0.000080841135,0.0013485978,0.00009643673,0.00009923874,0.054049898,0.6877079,0.0033538947,0.011887209,0.0040907525],"study_design_scores_gemma":[0.011725756,0.0032834248,0.08456522,0.0006547002,0.00014646337,0.0029212963,0.0024575263,0.04305187,0.016817845,0.00028853992,0.8324563,0.0016310464],"about_ca_topic_score_codex":0.000008235685,"about_ca_topic_score_gemma":6.0975486e-7,"teacher_disagreement_score":0.8205691,"about_ca_system_score_codex":0.000010810067,"about_ca_system_score_gemma":0.00001857847,"threshold_uncertainty_score":0.2667142},"labels":[],"label_agreement":null},{"id":"W4246011204","doi":"10.1109/isit.1993.748393","title":"Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel","year":2005,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Adder; Binary number; Channel (broadcasting); Binary symmetric channel; Block (permutation group theory); Code (set theory); Block code; Computer science; Boundary (topology); Binary code; Mathematics; Discrete mathematics; Set (abstract data type); Combinatorics; Decoding methods; Algorithm; Arithmetic; Channel capacity; Telecommunications","score_opus":0.01712520353141347,"score_gpt":0.2730596928115211,"score_spread":0.25593448928010765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246011204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99198055,0.00045530827,0.0026553175,0.0006476266,0.000053886914,0.00022564337,0.000007957572,0.0000216504,0.003952072],"genre_scores_gemma":[0.9870504,0.000054929365,0.0056559537,0.0020685452,0.00018582003,0.000034479704,0.00008055585,0.000012025282,0.0048572477],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991733,0.000029384086,0.00016857768,0.00029091208,0.00004195696,0.00029588633],"domain_scores_gemma":[0.99970716,0.000022096769,0.000030562416,0.00014250871,0.000045195455,0.000052502375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001898669,0.0001223491,0.00012370573,0.00003424027,0.000059867154,0.0000233848,0.00013961594,0.00017039131,0.000047877165],"category_scores_gemma":[0.000044296765,0.000090867805,0.00007315586,0.00006505206,0.00003929946,0.0000037379316,0.00011077567,0.000057879053,0.000012148282],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046701176,0.00060906605,0.015020734,0.00004888291,0.000079066165,0.000006405838,0.00008069634,0.0007169048,0.93878037,0.0027178244,0.027674237,0.013798819],"study_design_scores_gemma":[0.0019816163,0.0012922894,0.008788861,0.000036142705,0.000014452501,0.000017114216,0.0001649606,0.0055980235,0.45750958,0.0018562794,0.5220401,0.0007005416],"about_ca_topic_score_codex":0.000016839298,"about_ca_topic_score_gemma":0.00012685402,"teacher_disagreement_score":0.49436593,"about_ca_system_score_codex":0.000011512785,"about_ca_system_score_gemma":0.000032074593,"threshold_uncertainty_score":0.37054816},"labels":[],"label_agreement":null},{"id":"W4246964304","doi":"10.4018/9781591403333.ch003","title":"DNA Computing and Errors","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computation; Computer science; DNA computing; Perspective (graphical); Software; Theoretical computer science; Reduction (mathematics); Data science; Algorithm; Software engineering; Programming language; Artificial intelligence; Mathematics","score_opus":0.02144829029314354,"score_gpt":0.24579793350432774,"score_spread":0.2243496432111842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246964304","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03471417,0.0008365536,0.00021363796,0.000011018063,0.00021625524,0.0001428671,0.00003256725,0.000039171904,0.96379375],"genre_scores_gemma":[0.96733963,0.000013796025,0.0004860227,0.00052670005,0.00047238934,9.958248e-7,0.00002059188,0.000025589208,0.031114299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988531,0.000016056505,0.00023640147,0.00052912434,0.00009235657,0.00027294448],"domain_scores_gemma":[0.9994141,0.000006790225,0.00014480761,0.00025979997,0.00005144445,0.00012309504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009216253,0.00032389798,0.00027404903,0.000015674606,0.00009156669,0.000026664235,0.00020648095,0.000549498,0.000012713131],"category_scores_gemma":[0.000016661228,0.00027538455,0.00013757094,0.000005103914,0.0001510554,5.998206e-7,0.00045165722,0.00015526291,0.000025890471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010999444,0.000016998782,0.00044549443,0.000060707076,0.00024197971,0.00006333246,0.00002913014,0.0000012558232,0.011805454,0.9206743,0.002514274,0.06403708],"study_design_scores_gemma":[0.0015125694,0.002222608,0.0016631974,0.00052145263,0.0002782914,0.00050515996,0.000029818539,0.0000406687,0.010526039,0.37730572,0.6022427,0.0031517437],"about_ca_topic_score_codex":0.000013925453,"about_ca_topic_score_gemma":0.000015807113,"teacher_disagreement_score":0.9326795,"about_ca_system_score_codex":0.000016978036,"about_ca_system_score_gemma":0.000043578693,"threshold_uncertainty_score":0.99996984},"labels":[],"label_agreement":null},{"id":"W4247118964","doi":"10.1109/vtest.1994.292340","title":"Delay-fault testability preservation of the concurrent decomposition and factorization transformations","year":2002,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Testability; Computer science; Test set; Factorization; Design for testing; Algorithm; Set (abstract data type); Boolean function; Theoretical computer science; Mathematics; Artificial intelligence; Programming language; Statistics","score_opus":0.021170526223766094,"score_gpt":0.2536683733845902,"score_spread":0.2324978471608241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247118964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9641764,0.00009330468,0.034170035,0.00017969204,0.000042887343,0.00012485738,0.000007662891,0.000005678414,0.0011994448],"genre_scores_gemma":[0.99963284,0.00003798742,0.00017627716,0.000051524847,0.000020101063,0.0000027118106,0.000034864905,0.000001411206,0.000042268584],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966496,0.000036257174,0.0001189535,0.0000833813,0.00004470079,0.000051719162],"domain_scores_gemma":[0.99980724,0.000012027571,0.00003781912,0.00007497755,0.000052994703,0.000014958468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054171956,0.00004169382,0.00003886244,0.0000055064365,0.0000579604,0.00000695617,0.0000495985,0.00004716763,0.000020481728],"category_scores_gemma":[0.00004063973,0.000025133615,0.000026003923,0.000046274738,0.000037231704,0.0000049147293,0.00002592779,0.000025618618,4.0241727e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072502257,0.0001122569,0.050094314,0.000028494711,0.000012750223,2.3908058e-8,0.0001342595,0.00016271898,0.9282955,0.001072316,0.00023750217,0.019842638],"study_design_scores_gemma":[0.0007442806,0.0005003469,0.2440842,0.000023426179,0.00002935901,0.000007688104,0.00008060279,0.03469421,0.70844585,0.0007217493,0.010430918,0.0002373681],"about_ca_topic_score_codex":0.000005203816,"about_ca_topic_score_gemma":0.00000923132,"teacher_disagreement_score":0.21984962,"about_ca_system_score_codex":0.0000032154517,"about_ca_system_score_gemma":0.0000028884886,"threshold_uncertainty_score":0.10249191},"labels":[],"label_agreement":null},{"id":"W4247249777","doi":"10.1090/fim/020/19","title":"Induced representations","year":2009,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"","keywords":"Computer science","score_opus":0.025193402701393735,"score_gpt":0.281272012280329,"score_spread":0.25607860957893525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247249777","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059350873,0.000055542183,0.0015613514,0.00018519368,0.00003580456,0.00028053825,0.000012432828,0.00006573305,0.9918683],"genre_scores_gemma":[0.13296442,0.000074050164,0.017942952,0.0044107246,0.0010434125,0.000025933865,0.00020163666,0.000108972505,0.8432279],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860156,0.000022099208,0.0003545494,0.0005222652,0.00020433705,0.0002952047],"domain_scores_gemma":[0.99900836,0.000054184307,0.00025354399,0.00047448135,0.00006951767,0.00013992056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013616671,0.00032688983,0.0004204052,0.000013846368,0.00012009799,0.000034797657,0.00027552122,0.00032963048,0.00008304294],"category_scores_gemma":[0.000056470675,0.0002674546,0.00058064115,0.000015839474,0.00040001853,8.542155e-7,0.0001983418,0.0003144128,0.00008823844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007917239,0.00022546321,0.000035030545,0.00017653427,0.0013164935,0.000030601823,0.0005326237,0.000004956172,0.19339877,0.30865595,0.030593418,0.46495098],"study_design_scores_gemma":[0.00080432626,0.0029400573,0.00017959383,0.00030434364,0.00039101686,0.00009066646,0.00040732184,0.00019586468,0.012681408,0.39673156,0.5826545,0.0026193666],"about_ca_topic_score_codex":0.0000035041094,"about_ca_topic_score_gemma":0.000001306508,"teacher_disagreement_score":0.5520611,"about_ca_system_score_codex":0.000016292934,"about_ca_system_score_gemma":0.000055966662,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W4247296931","doi":"10.22215/etd/2005-08071","title":"A linear algebra approach to synchronizing automata","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada; Carleton University; ASTER","funders":"","keywords":"Synchronizing; Algebra over a field; Mathematics; Computer science; Pure mathematics; Combinatorics","score_opus":0.014760540343463248,"score_gpt":0.27287256947827987,"score_spread":0.2581120291348166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247296931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6821327,0.000628538,0.0026061323,0.000059010625,0.00032670485,0.0003897623,0.000011669468,0.00010529019,0.31374013],"genre_scores_gemma":[0.9242252,0.00007645074,0.029430484,0.0009786587,0.0018466137,0.00004189551,0.006439075,0.00005613283,0.03690545],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.998695,0.000031488977,0.00024272186,0.00059807295,0.00012640368,0.00030629017],"domain_scores_gemma":[0.99938357,0.000006344412,0.000076917015,0.0003260142,0.00009258804,0.0001145458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000128508,0.00026698102,0.0002232199,0.000048564936,0.000082015766,0.000035895482,0.00033589936,0.00049029733,0.000035893365],"category_scores_gemma":[0.00009495713,0.00021077812,0.000118029304,0.00012201489,0.000012055401,0.0000011789127,0.00011163833,0.0001596838,0.00009042697],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036687392,0.00068235386,0.00018224107,0.00037293936,0.0003570623,0.00000796026,0.00024172316,0.00047830734,0.7911626,0.0018165851,0.038095586,0.16623577],"study_design_scores_gemma":[0.0013985973,0.001785825,0.0049702153,0.00026685826,0.0001742471,0.000053387612,0.0015242886,0.006754766,0.39088345,0.000099254285,0.5887465,0.0033426355],"about_ca_topic_score_codex":0.000009595148,"about_ca_topic_score_gemma":0.000032510925,"teacher_disagreement_score":0.5506509,"about_ca_system_score_codex":0.000015460837,"about_ca_system_score_gemma":0.00007859891,"threshold_uncertainty_score":0.85952824},"labels":[],"label_agreement":null},{"id":"W4247371785","doi":"10.1109/access.2020.3011803","title":"Mobile Membranes","year":2020,"lang":"it","type":"article","venue":"IEEE Access","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ontario Ministry of Research, Innovation and Science","keywords":"Membrane; Computer science; Endocytosis; Exocytosis; Computation; Membrane computing; Distributed computing; Chemistry; Cell; Theoretical computer science; Algorithm","score_opus":0.04031660811452216,"score_gpt":0.30502857915276105,"score_spread":0.2647119710382389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247371785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98348904,0.0047134706,0.0017249252,0.0007374122,0.0008047966,0.0003264978,0.000038405047,0.000048830218,0.0081166],"genre_scores_gemma":[0.9914916,0.0009149865,0.00007854874,0.0048122257,0.0021367208,0.000014337167,0.000056177145,0.000022104523,0.0004732648],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985106,0.00009007728,0.00027956764,0.0006130587,0.00012754541,0.00037917853],"domain_scores_gemma":[0.99930626,0.00001983675,0.00011423982,0.00025687943,0.00007461765,0.00022817697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097266624,0.0002484945,0.00025642634,0.000014564865,0.000114281,0.00016924072,0.0008314636,0.00029695814,0.00018567636],"category_scores_gemma":[0.00007589234,0.00020590801,0.00017072224,0.0001771678,0.00009881195,0.000008134948,0.00041598474,0.00018019335,0.00014537346],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021569463,0.00013664388,0.0051046894,0.00023877193,0.00014632777,0.00004890422,0.00015152076,0.00087967596,0.95386183,0.000024358831,0.015247066,0.023944542],"study_design_scores_gemma":[0.0005085582,0.0010657966,0.00035350455,0.000023462204,0.000042070442,0.0000074084314,0.000055996385,0.00089549104,0.59657717,0.000045146437,0.39997476,0.00045065847],"about_ca_topic_score_codex":0.000012792371,"about_ca_topic_score_gemma":0.0000017164563,"teacher_disagreement_score":0.3847277,"about_ca_system_score_codex":0.0000062918534,"about_ca_system_score_gemma":0.000052169882,"threshold_uncertainty_score":0.8396685},"labels":[],"label_agreement":null},{"id":"W4250521445","doi":"10.1007/978-3-319-41192-7_16","title":"Biomolecular Computing","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Natural computing; Membrane computing; DNA computing; Computer science; Unconventional computing; Computation; Theoretical computer science; Computational science; Distributed computing; Algorithm","score_opus":0.014942762811706825,"score_gpt":0.23849380462616557,"score_spread":0.22355104181445873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250521445","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079564226,0.000771487,0.01569553,0.00010333006,0.000208071,0.00012065884,0.000013970461,0.000046566125,0.98224473],"genre_scores_gemma":[0.11081746,0.00012472455,0.0010996988,0.0009625539,0.0011704023,8.250118e-7,0.0001298334,0.00005544573,0.8856391],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988806,0.000013200005,0.00023057818,0.0005192795,0.00010884158,0.00024747226],"domain_scores_gemma":[0.9993823,0.000013127009,0.0001152647,0.0003381862,0.00006775015,0.00008335832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110919784,0.00028642267,0.00021614335,0.00003509736,0.00006639935,0.000019914636,0.00025143652,0.0005041822,0.00027621578],"category_scores_gemma":[0.000023161052,0.00018724069,0.00021900688,0.000008381181,0.00009809818,4.796191e-7,0.00036848418,0.00010707598,0.0002512314],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004558104,0.000021548878,0.000047806796,0.000032939428,0.00027717478,0.00008482064,0.0000033805845,0.000001355724,0.6506589,0.15529992,0.013152248,0.18037428],"study_design_scores_gemma":[0.0001959607,0.00024012101,0.000009580281,0.00007121957,0.000017568931,0.000033797816,8.929099e-7,0.000007705235,0.018285401,0.0036090298,0.9770667,0.00046200585],"about_ca_topic_score_codex":6.2739934e-7,"about_ca_topic_score_gemma":0.0000010706868,"teacher_disagreement_score":0.96391445,"about_ca_system_score_codex":0.000010055393,"about_ca_system_score_gemma":0.000031953212,"threshold_uncertainty_score":0.7635454},"labels":[],"label_agreement":null},{"id":"W4283790178","doi":"10.3390/e24070928","title":"From Random Numbers to Random Objects","year":2022,"lang":"en","type":"article","venue":"Entropy","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Random permutation; Random number generation; Computer science; Random function; Cryptography; Random field; Theoretical computer science; Random compact set; Object (grammar); Random graph; Mathematics; Algorithm; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.006907217697714202,"score_gpt":0.23325222888661462,"score_spread":0.2263450111889004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283790178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99280334,0.0002856903,0.0037117135,0.00029795134,0.0004744143,0.00018860995,0.00003212834,0.000024054785,0.002182081],"genre_scores_gemma":[0.9958265,0.0000073518954,0.0008526153,0.0015663599,0.0005616281,0.000032231976,0.0001594989,0.000009567065,0.0009842423],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911475,0.00013389211,0.00012566574,0.00029777907,0.000116511284,0.0002113942],"domain_scores_gemma":[0.9996498,0.000032406624,0.00003624357,0.00018388507,0.000014801709,0.00008285994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014775689,0.00009916808,0.0001336176,0.000015689257,0.0001580347,0.00001777607,0.00020567742,0.000039164956,0.00041134423],"category_scores_gemma":[0.00009538957,0.00008312447,0.00010142497,0.00007425504,0.000017374727,7.8417605e-7,0.0003175353,0.00009033505,0.000045065004],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015045736,0.00006108387,0.0018275016,0.0000013514026,0.000053368633,0.000014574721,0.00014146169,0.00057472545,0.9763208,0.00008069064,0.017338881,0.0020809793],"study_design_scores_gemma":[0.014296865,0.0011990048,0.0018506498,0.0000075892694,0.000040746072,0.000017890045,0.00079267594,0.0005148011,0.25563785,0.00085220207,0.724134,0.0006557177],"about_ca_topic_score_codex":0.00006381245,"about_ca_topic_score_gemma":0.0000049592304,"teacher_disagreement_score":0.720683,"about_ca_system_score_codex":0.000014711854,"about_ca_system_score_gemma":0.0000196125,"threshold_uncertainty_score":0.45039308},"labels":[],"label_agreement":null},{"id":"W4285153081","doi":"10.1007/978-3-031-07469-1_15","title":"Nondeterministic State Complexity of Site-Directed Deletion","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Nondeterministic algorithm; String (physics); Upper and lower bounds; Deterministic finite automaton; Prefix; Computer science; Nondeterministic finite automaton; Finite-state machine; Combinatorics; Suffix; Discrete mathematics; Regular language; Mathematics; Algorithm; Automaton; Data structure; Theoretical computer science; Automata theory","score_opus":0.026532722682505405,"score_gpt":0.25770493954687707,"score_spread":0.23117221686437167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285153081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14277984,0.0005239356,0.8503927,0.00012199956,0.0010091622,0.0004533043,0.00011064623,0.00006943657,0.004538969],"genre_scores_gemma":[0.97662055,0.000037704835,0.022456575,0.0003665854,0.00019451516,0.0000030090046,0.00014725505,0.0000177278,0.00015604365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982795,0.000044649198,0.00034021478,0.0007325903,0.00030794294,0.00029506435],"domain_scores_gemma":[0.99908835,0.00007289812,0.00023380133,0.0004188038,0.00012374485,0.00006240238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037194713,0.00025342853,0.0003094436,0.00014369024,0.00012612896,0.000031068736,0.0006009868,0.00016402095,0.0000718936],"category_scores_gemma":[0.00009187979,0.00022225305,0.00010559841,0.00014993497,0.0008044001,0.0000036835922,0.0008365777,0.00031250028,0.0000035907058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002438666,0.0001744512,0.0016050938,0.00018998249,0.000063601685,0.00010899621,0.0002366548,0.03166975,0.3305245,0.0018553183,0.00006932699,0.63325846],"study_design_scores_gemma":[0.0032642826,0.012237557,0.012625085,0.0009710185,0.00014111487,0.0004666131,0.0000014052328,0.38074094,0.30852973,0.2022939,0.07245563,0.006272716],"about_ca_topic_score_codex":0.00001996973,"about_ca_topic_score_gemma":0.000051063744,"teacher_disagreement_score":0.8338407,"about_ca_system_score_codex":0.00004899899,"about_ca_system_score_gemma":0.00015550843,"threshold_uncertainty_score":0.90632164},"labels":[],"label_agreement":null},{"id":"W4292639357","doi":"","title":"A Coq Library for Mechanised First-Order Logic","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Order (exchange); Programming language; Business","score_opus":0.017078492018951064,"score_gpt":0.23457236953228686,"score_spread":0.2174938775133358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292639357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27642426,0.0048175068,0.61348873,0.023893794,0.0009780615,0.0024806221,0.0007755963,0.0005269717,0.07661448],"genre_scores_gemma":[0.82487106,0.0009323589,0.14069456,0.0010276339,0.00014771296,0.0004494523,0.00895234,0.000097553355,0.022827307],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99669504,0.0016368995,0.0003425628,0.0008350731,0.00016513182,0.00032530344],"domain_scores_gemma":[0.99750096,0.0003913174,0.0003034432,0.0011842125,0.0005075774,0.00011250641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017015937,0.00028187243,0.00027105934,0.00005978319,0.00044616417,0.00017774716,0.0011354149,0.0003482718,0.0003427837],"category_scores_gemma":[0.0009687258,0.0002704976,0.000269014,0.00016166735,0.00009978811,0.0000054883817,0.0031325184,0.00035409202,0.0000066030325],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008383252,0.0053228377,0.008133412,0.0021937282,0.0013405659,0.000039431827,0.0043578986,0.0021527514,0.3743963,0.36718667,0.10078571,0.13325238],"study_design_scores_gemma":[0.0013293208,0.000011913647,0.00063252234,0.00044538997,0.00007690133,0.000011539235,0.00014357003,0.012421124,0.19695748,0.022561245,0.7642729,0.0011360807],"about_ca_topic_score_codex":0.00004685109,"about_ca_topic_score_gemma":0.00008136189,"teacher_disagreement_score":0.6634872,"about_ca_system_score_codex":0.000022870463,"about_ca_system_score_gemma":0.00019166178,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W4293874807","doi":"","title":"A Brief Note on Recombinant DNA","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Recombinant DNA; Computational biology; DNA; Computer science; Genetics; Biology; Gene","score_opus":0.012612741249834582,"score_gpt":0.23674368301857376,"score_spread":0.22413094176873918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293874807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8399197,0.00051986537,0.07520092,0.00562229,0.00061187486,0.0004229343,0.000036203524,0.00013309122,0.07753311],"genre_scores_gemma":[0.98244435,0.00027891636,0.0086664,0.00045864627,0.00009562495,0.00002793802,0.00095673377,0.000035313118,0.0070360713],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9953685,0.0028081064,0.00037317292,0.00090361387,0.00020363227,0.00034298748],"domain_scores_gemma":[0.99675673,0.0003859669,0.0003365451,0.0016693551,0.0007050797,0.00014632149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029087362,0.00031993256,0.00030550198,0.000060669277,0.00021903035,0.00016683746,0.0009654234,0.00049814576,0.00003893279],"category_scores_gemma":[0.0020098514,0.00028827004,0.00025486416,0.000097354925,0.00015589532,0.0000024256365,0.0015889377,0.00047835673,0.000042940133],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020238404,0.0022389998,0.002586285,0.00036265812,0.00029390721,0.00001837834,0.0013390074,0.000384367,0.42605388,0.051313292,0.019297333,0.4959095],"study_design_scores_gemma":[0.0011030417,0.000012039732,0.0046456642,0.0022227073,0.000054179316,0.000017860839,0.000020621186,0.00649976,0.66244835,0.0055212737,0.31625354,0.0012009712],"about_ca_topic_score_codex":0.00015125898,"about_ca_topic_score_gemma":0.00016903794,"teacher_disagreement_score":0.49470854,"about_ca_system_score_codex":0.000033947515,"about_ca_system_score_gemma":0.000119895805,"threshold_uncertainty_score":0.99995697},"labels":[],"label_agreement":null},{"id":"W4296339669","doi":"10.1109/newcas52662.2022.9893150","title":"DNA Storage Monitoring with a CMOS Capacitive Sensor","year":2022,"lang":"en","type":"article","venue":"2022 20th IEEE Interregional NEWCAS Conference (NEWCAS)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"CMOS; Capacitive sensing; DNA; Optoelectronics; Materials science; Nanotechnology; Computer science; Analytical Chemistry (journal); Embedded system; Electrical engineering; Chemistry; Engineering; Chromatography; Biochemistry","score_opus":0.045727257766763764,"score_gpt":0.2696722551932486,"score_spread":0.22394499742648485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296339669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909454,0.00023361904,0.003831053,0.00058056955,0.0009464551,0.0003274688,0.000104692765,0.00006592491,0.0029648205],"genre_scores_gemma":[0.9936903,0.00003941111,0.00051033596,0.0005878679,0.00075574976,0.0001224774,0.00015711054,0.00003981466,0.0040968955],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974504,0.00026690328,0.00034462818,0.0008709644,0.0004749901,0.0005921265],"domain_scores_gemma":[0.99889445,0.0000634599,0.00021614686,0.000422753,0.00020037322,0.00020279351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026628262,0.00039586597,0.0003337466,0.000096666656,0.00045089793,0.000078232246,0.0005917052,0.00013704991,0.0003993489],"category_scores_gemma":[0.00005649106,0.0003363777,0.00018911921,0.00023104019,0.00022633538,0.000013300573,0.0004698469,0.00056555157,0.000030325677],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021204134,0.0005211368,0.010430123,0.000047635298,0.00052242423,0.00066024845,0.0010433951,0.0016787591,0.9563659,0.0013266691,0.01083525,0.0144480625],"study_design_scores_gemma":[0.008805552,0.017520849,0.015282256,0.0005213329,0.00032141455,0.004582138,0.0242809,0.008609298,0.43433416,0.0012861337,0.47843972,0.006016256],"about_ca_topic_score_codex":0.00009123509,"about_ca_topic_score_gemma":0.00003560531,"teacher_disagreement_score":0.5220317,"about_ca_system_score_codex":0.000099795376,"about_ca_system_score_gemma":0.00023836472,"threshold_uncertainty_score":0.9999088},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019149735593029616,"score_gpt":0.2314581414857692,"score_spread":0.21230840589273958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297474248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99462396,0.0006135272,0.0020624918,0.00027172864,0.00015597837,0.00019982424,0.000023723547,0.000025575877,0.0020231907],"genre_scores_gemma":[0.9922282,0.000018533365,0.005647791,0.001286867,0.00025251103,0.00003643803,0.00008049581,0.000016589878,0.00043257535],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988415,0.00020892205,0.00015130179,0.0003564881,0.00016261483,0.00027917876],"domain_scores_gemma":[0.99949294,0.000023464974,0.000060516806,0.00033010152,0.000039709874,0.000053286956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020020688,0.00014164626,0.00010510828,0.0000313924,0.0003953484,0.000023937977,0.00032894377,0.0000706863,0.00005126926],"category_scores_gemma":[0.00003371363,0.00009674076,0.00014577016,0.00020063813,0.00011692148,4.9060685e-7,0.00021772478,0.00017550107,0.000009125092],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004381615,0.0025050975,0.021332614,0.000109001056,0.00061912165,0.00014864597,0.00042316556,0.23721689,0.43729648,0.00043978344,0.014246807,0.28522423],"study_design_scores_gemma":[0.002456671,0.0037012498,0.016388021,0.000014702299,0.00015275418,0.0002410074,0.0026908957,0.14272757,0.052019846,0.00045806137,0.7774496,0.0016995975],"about_ca_topic_score_codex":0.00001589096,"about_ca_topic_score_gemma":0.0000010791854,"teacher_disagreement_score":0.7632028,"about_ca_system_score_codex":0.0000082774395,"about_ca_system_score_gemma":0.000026229962,"threshold_uncertainty_score":0.3944974},"labels":[],"label_agreement":null},{"id":"W4297790849","doi":"","title":"Unravelling the macromolecular movement through plasmodesmata","year":2000,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministère des Transports","funders":"","keywords":"Plasmodesma; Movement (music); Computer science; Biology; Physics; Botany; Cell wall","score_opus":0.014942014218800401,"score_gpt":0.22721105122303317,"score_spread":0.21226903700423277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297790849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.558535,0.010419371,0.29182562,0.021304643,0.00048156964,0.00085032097,0.00014043481,0.000095535084,0.11634752],"genre_scores_gemma":[0.93440986,0.0060324795,0.036156245,0.0012053708,0.00014265935,0.00006201154,0.0014301528,0.00006705827,0.020494143],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99145013,0.005535034,0.0007161366,0.0012552879,0.0003722985,0.0006711246],"domain_scores_gemma":[0.9955665,0.0005184508,0.0004637459,0.0024422926,0.0008457016,0.0001632971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037406406,0.0005628539,0.00041693696,0.00003579518,0.0007415882,0.00038734,0.0020177742,0.00065160234,0.00030884324],"category_scores_gemma":[0.0005109628,0.00045937608,0.00044059032,0.000237648,0.00059054646,0.000010821726,0.0021719134,0.0007969563,0.000100794074],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019272474,0.0026161992,0.0022218588,0.00048257684,0.0012559552,0.000060629784,0.008462846,0.006971801,0.38240716,0.3267227,0.005402563,0.263203],"study_design_scores_gemma":[0.0007032005,0.0000044398234,0.00081677455,0.0014151069,0.000129273,0.000032522574,0.00017650014,0.01597721,0.6048985,0.012911041,0.36197045,0.000964993],"about_ca_topic_score_codex":0.0008841896,"about_ca_topic_score_gemma":0.0003339611,"teacher_disagreement_score":0.37587488,"about_ca_system_score_codex":0.000071705625,"about_ca_system_score_gemma":0.00022664719,"threshold_uncertainty_score":0.9997858},"labels":[],"label_agreement":null},{"id":"W4366742336","doi":"10.1186/s12859-023-05264-6","title":"In-vitro validated methods for encoding digital data in deoxyribonucleic acid (DNA)","year":2023,"lang":"en","type":"review","venue":"BMC Bioinformatics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Division of Electrical, Communications and Cyber Systems; Semiconductor Research Corporation; National Science Foundation","keywords":"DNA microarray; DNA; Computational biology; In vitro; Encoding (memory); Computer science; Digital polymerase chain reaction; Biology; Genetics; Gene; Polymerase chain reaction; Gene expression; Artificial intelligence","score_opus":0.2006860204091278,"score_gpt":0.43959385722058486,"score_spread":0.23890783681145705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366742336","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008552389,0.88356066,0.11147262,0.00001352196,0.000625546,0.0019523756,0.0013498925,0.000080508085,0.0008593319],"genre_scores_gemma":[0.000016067976,0.7263886,0.2592679,0.00008002659,0.00026801325,0.00007102644,0.013673585,0.00006466097,0.00017014137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997659,0.00012099066,0.0011471127,0.00045512817,0.00010001912,0.0005177157],"domain_scores_gemma":[0.99833846,0.00028820732,0.00040509936,0.00085290836,0.000036184716,0.0000791439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012783861,0.00040800648,0.0010157301,0.00020542252,0.000050121867,0.00014415526,0.0011431508,0.0006403484,0.0000023238338],"category_scores_gemma":[0.0014697404,0.00031263725,0.000274016,0.00045345858,0.000055231132,0.000026689484,0.0013796267,0.00026221178,0.000037649526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026813646,0.00004197008,0.000009898096,0.01061184,0.000067982626,0.0000032273022,0.000020733192,0.000004506391,0.00046141318,0.000019454628,0.00055038993,0.98818177],"study_design_scores_gemma":[0.00035465072,0.000092080496,0.0000018583297,0.00155634,0.000082697334,0.000022088161,0.00005596589,0.010226026,0.0005574826,0.00006631156,0.9864337,0.0005508091],"about_ca_topic_score_codex":0.000001940726,"about_ca_topic_score_gemma":0.0000066809853,"teacher_disagreement_score":0.98763096,"about_ca_system_score_codex":0.00004157584,"about_ca_system_score_gemma":0.00021867912,"threshold_uncertainty_score":0.9999326},"labels":[],"label_agreement":null},{"id":"W4379614944","doi":"10.1016/j.tcs.2023.113999","title":"The nondeterministic state complexity of the site-directed deletion language operation","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Nondeterministic algorithm; Upper and lower bounds; Deterministic finite automaton; String (physics); Combinatorics; Nondeterministic finite automaton; Finite-state machine; Mathematics; Regular language; Prefix; Discrete mathematics; Computer science; Automaton; Algorithm; Data structure; Theoretical computer science; Automata theory; Programming language","score_opus":0.014637803432919032,"score_gpt":0.2707185309608592,"score_spread":0.25608072752794014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379614944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825017,0.00001534914,0.016277134,0.00035759696,0.00021941669,0.000115739014,0.0000059878303,0.000037607642,0.0004694599],"genre_scores_gemma":[0.99882364,0.000005607863,0.0008658156,0.0001794383,0.00007864545,0.000002303104,0.000009287616,0.0000033959338,0.000031865453],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990418,0.00013935765,0.00015170359,0.00023604088,0.0001986518,0.00023246052],"domain_scores_gemma":[0.9994325,0.00007978784,0.000048729897,0.00030921728,0.0000866708,0.000043101223],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00081578654,0.00007472815,0.00007119767,0.000016290483,0.00043218982,0.00006410355,0.000506478,0.000030985928,0.0000053859044],"category_scores_gemma":[0.0001903129,0.00003681251,0.0000471087,0.00033259546,0.0027359456,0.0000025792265,0.00056706916,0.00007020466,0.000014277056],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005759552,0.00003568044,0.00079944293,0.000009458188,0.000007886626,0.0000025238742,0.00022936882,0.0005662663,0.8637069,0.10638185,0.00022584939,0.027977196],"study_design_scores_gemma":[0.00034650118,0.00063476356,0.074667655,0.000030165827,0.000010603541,0.000018396015,0.000044417688,0.5090282,0.39517805,0.019010572,0.0007472508,0.00028340577],"about_ca_topic_score_codex":0.000004402233,"about_ca_topic_score_gemma":0.0000057238353,"teacher_disagreement_score":0.50846195,"about_ca_system_score_codex":0.000006909464,"about_ca_system_score_gemma":0.000037984242,"threshold_uncertainty_score":0.99997807},"labels":[],"label_agreement":null},{"id":"W4381891960","doi":"10.1101/2023.06.20.545769","title":"A method for storing information in DNA with improved dropout tolerance","year":2023,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Division of Electrical, Communications and Cyber Systems; Semiconductor Research Corporation; National Science Foundation","keywords":"Fountain code; Computer science; Decoding methods; Robustness (evolution); Encoding (memory); Code (set theory); Algorithm; Data loss; Chemistry; Hamming code; Database; Programming language; Artificial intelligence","score_opus":0.015024015636297353,"score_gpt":0.24768184174367638,"score_spread":0.23265782610737903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381891960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8835648,0.0001865724,0.11436754,0.00011635499,0.0005126884,0.0009769558,0.000121983045,0.000147453,0.0000056599843],"genre_scores_gemma":[0.9410321,0.0000514656,0.057854593,0.00020011769,0.00044149812,0.00035082153,0.00000455833,0.000056626046,0.00000823203],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981921,0.000083107145,0.00044019177,0.0006709269,0.00013633077,0.00047736857],"domain_scores_gemma":[0.9986759,0.000043731736,0.00031319846,0.0005704869,0.00028988812,0.0001068329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007524364,0.00037517163,0.00038178448,0.00013368748,0.00009145454,0.000120179575,0.000387018,0.00052336673,0.0000014345374],"category_scores_gemma":[0.00023435705,0.0003327438,0.00011785832,0.00023528872,0.000042642703,0.000014637169,0.00041470022,0.00034291612,0.000006747174],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016785435,0.00003804793,0.0037629039,0.0003072782,0.000067966874,0.0000040257014,0.000007482668,0.0007676033,0.99470145,0.000058509493,0.00008124716,0.000035620626],"study_design_scores_gemma":[0.0017860496,0.00054593105,0.03374855,0.0004973922,0.0000623578,3.3546794e-8,0.000012236597,0.018705117,0.92265457,0.000006080391,0.020692613,0.0012890532],"about_ca_topic_score_codex":0.00004708341,"about_ca_topic_score_gemma":0.000011610619,"teacher_disagreement_score":0.07204687,"about_ca_system_score_codex":0.00008253196,"about_ca_system_score_gemma":0.00025623592,"threshold_uncertainty_score":0.99991244},"labels":[],"label_agreement":null},{"id":"W4383989339","doi":"10.48550/arxiv.2307.04441","title":"Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Staatssekretariat für Bildung, Forschung und Innovation; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Rank (graph theory); Sign (mathematics); Mathematics; Combinatorics; Computer science; Mathematical analysis","score_opus":0.08841031190310043,"score_gpt":0.23713391504981937,"score_spread":0.14872360314671895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383989339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9765397,0.00065758853,0.021885173,0.00006044995,0.000039312497,0.00052751286,0.00004622846,0.000020682064,0.00022339277],"genre_scores_gemma":[0.99478716,0.0035864024,0.0010704801,0.00002103524,0.000020215342,0.000004391155,0.00020824684,0.000009178513,0.00029288032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914265,0.00014802952,0.00017029823,0.00041260276,0.000016704129,0.00010969603],"domain_scores_gemma":[0.9990508,0.00027142325,0.00020898068,0.00032525748,0.00010060357,0.000042962085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034455402,0.00012579572,0.000286166,0.00006978391,0.000091272035,0.00001873307,0.00021857307,0.00020765381,0.0000011357748],"category_scores_gemma":[0.00014800449,0.00011743506,0.00014287411,0.00008882711,0.00021171488,0.000002443678,0.0007118846,0.00009375439,3.3119196e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.10087637,0.0008757717,0.12463481,0.0046056993,0.006245026,0.000049845956,0.0013352273,0.066558406,0.27709013,0.40328553,0.002339624,0.012103544],"study_design_scores_gemma":[0.1676755,0.0011265347,0.03194488,0.0006452426,0.0026008398,0.00001757907,0.0018059765,0.14031088,0.021129264,0.6287246,0.0014632227,0.0025555328],"about_ca_topic_score_codex":0.00014780233,"about_ca_topic_score_gemma":0.00004387117,"teacher_disagreement_score":0.25596088,"about_ca_system_score_codex":0.000004213226,"about_ca_system_score_gemma":0.000019106998,"threshold_uncertainty_score":0.4788863},"labels":[],"label_agreement":null},{"id":"W4387908704","doi":"10.5206/fpq/2022.3/4.14275","title":"Algorithmic Racial Discrimination","year":2022,"lang":"en","type":"article","venue":"Feminist Philosophy Quarterly","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Racism; Computer science; Psychology; Political science; Law","score_opus":0.014623699425717958,"score_gpt":0.2469927107744435,"score_spread":0.23236901134872556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387908704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96431845,0.0002849488,0.0011888241,0.00096174073,0.00082347234,0.00027906196,0.00011724368,0.000065086904,0.03196118],"genre_scores_gemma":[0.9971713,0.0000013602553,0.0003283953,0.00070892385,0.0010754676,0.000053424068,0.0003595484,0.000014335603,0.00028724378],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989633,0.00010278451,0.00019168817,0.00035733936,0.00017055756,0.00021431358],"domain_scores_gemma":[0.99960124,0.000010172848,0.000084351406,0.00022027233,0.00002460614,0.000059371956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016589592,0.00013504807,0.00011130469,0.00003528888,0.00037129532,0.000026825617,0.0002679595,0.000058887825,0.000080470774],"category_scores_gemma":[0.000012185046,0.00012834322,0.000108970286,0.00009382669,0.00006353829,0.0000023290986,0.00010845117,0.00013932236,0.000020363364],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001125752,0.0017255016,0.0043140813,0.00011479849,0.00022722509,0.00014576702,0.004575512,0.000109812136,0.68763494,0.035757586,0.010659683,0.25360933],"study_design_scores_gemma":[0.005062513,0.037424304,0.010514003,0.000043783843,0.0001329523,0.00041296793,0.0045260717,0.0013597752,0.026541421,0.08311639,0.8277898,0.0030760136],"about_ca_topic_score_codex":0.000003374836,"about_ca_topic_score_gemma":0.0000011120135,"teacher_disagreement_score":0.81713015,"about_ca_system_score_codex":0.000019314755,"about_ca_system_score_gemma":0.000028242772,"threshold_uncertainty_score":0.5233684},"labels":[],"label_agreement":null},{"id":"W4388365465","doi":"10.1016/j.ibneur.2023.08.647","title":"IDENTIFYING AND MANIPULATING A HIPPOCAMPAL ENGRAM SUPPORTING MEMORY INTEGRATION","year":2023,"lang":"en","type":"article","venue":"IBRO Neuroscience Reports","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hospital for Sick Children; University of Toronto","funders":"","keywords":"Engram; Hippocampal formation; Neuroscience; Computer science; Psychology; Cognitive science","score_opus":0.04485695961169526,"score_gpt":0.32277458410491827,"score_spread":0.277917624493223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388365465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9973437,0.000034238055,0.001282826,0.00006173323,0.00053960277,0.000113705195,5.7690755e-7,0.000083242536,0.0005403573],"genre_scores_gemma":[0.9989388,0.000018266255,0.0003647679,0.00017843062,0.0001291379,0.0000064245696,0.000020141437,0.000009210375,0.0003347936],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99864054,0.000045396922,0.00030067435,0.0005349463,0.00016219959,0.00031624647],"domain_scores_gemma":[0.9994998,0.0000150149845,0.00018293911,0.00018841216,0.000032853724,0.000081006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006300212,0.00011222219,0.000099222976,0.00005456507,0.00024952032,0.00010908835,0.00008761984,0.00006860439,0.0000022884535],"category_scores_gemma":[0.00077601295,0.00009320874,0.00004799298,0.0002654217,0.00008906133,0.000011133326,0.00025316878,0.000090153655,0.0000019938323],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025466663,0.0000065034183,0.016913097,0.000008479492,8.2569557e-7,0.00015799125,0.000031302498,0.00002761156,0.9642172,0.00001454581,0.00006368482,0.018556198],"study_design_scores_gemma":[0.00028352963,0.00063820014,0.30098706,0.00011428023,0.000021626904,0.002771692,0.0008825359,0.014380787,0.6733498,0.0023264526,0.003397375,0.00084669504],"about_ca_topic_score_codex":0.000007791307,"about_ca_topic_score_gemma":0.0000040001332,"teacher_disagreement_score":0.29086745,"about_ca_system_score_codex":0.000005080592,"about_ca_system_score_gemma":0.000028439059,"threshold_uncertainty_score":0.38009423},"labels":[],"label_agreement":null},{"id":"W4388667248","doi":"10.4204/eptcs.394.16","title":"A Biset-Enriched Categorical Model for Proto-Quipper with Dynamic Lifting","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Categorical variable; Computer science; Machine learning","score_opus":0.007691420931401275,"score_gpt":0.2635504460324845,"score_spread":0.2558590251010832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388667248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7188321,0.000033772267,0.27965382,0.00038384364,0.00004010217,0.0006235895,9.527462e-7,0.00008610255,0.00034573168],"genre_scores_gemma":[0.9912081,0.000011886233,0.008190194,0.00025576135,0.00010956648,0.00015859512,0.000009739188,0.00001893,0.000037242484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748397,0.000012320275,0.00023390214,0.0008535404,0.0002655961,0.0011506747],"domain_scores_gemma":[0.9994483,0.000040076764,0.00006362453,0.00014497562,0.00017905075,0.00012398911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013388084,0.00020711763,0.00019251877,0.00013717724,0.000248268,0.00011494479,0.00071917346,0.000120080156,0.0000015641432],"category_scores_gemma":[0.00021928188,0.00014586911,0.000058669197,0.0010875886,0.00081130816,0.000016562184,0.00043918806,0.00024389486,0.0000044800627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037899223,0.00012783174,0.0012536409,0.00006105925,0.000017737908,0.000003885687,0.00025123166,0.002284151,0.26466218,0.71972144,0.00009648765,0.011141327],"study_design_scores_gemma":[0.00047910013,0.0011864904,0.00034718015,0.000016938702,0.0000050481067,0.000023699178,0.000019202937,0.9376635,0.007172566,0.05269935,0.000113853705,0.0002730753],"about_ca_topic_score_codex":5.662673e-7,"about_ca_topic_score_gemma":0.0000016250932,"teacher_disagreement_score":0.9353793,"about_ca_system_score_codex":0.00008548005,"about_ca_system_score_gemma":0.00023750518,"threshold_uncertainty_score":0.59483695},"labels":[],"label_agreement":null},{"id":"W4390063511","doi":"10.2478/fcds-2023-0021","title":"A DNA Algorithm for Calculating the Maximum Flow of a Network","year":2023,"lang":"en","type":"article","venue":"Foundations of Computing and Decision Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Genetics","keywords":"DNA computing; Computer science; Maximum flow problem; Algorithm; Flow (mathematics); Flow network; Encoding (memory); Field (mathematics); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Computation","score_opus":0.043854915709931906,"score_gpt":0.3532504922015683,"score_spread":0.3093955764916364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390063511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60640436,0.00008223451,0.3931459,0.00005300243,0.0001153096,0.000073733114,0.000003699489,0.0000069801313,0.0001147686],"genre_scores_gemma":[0.83427835,0.000012062748,0.16552514,0.00003617848,0.00012342675,0.0000016095994,0.000011336927,0.0000021018639,0.000009791071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992718,0.000024910934,0.0002375541,0.00019026753,0.00012947433,0.0001459799],"domain_scores_gemma":[0.999088,0.0005526421,0.00012315344,0.00010782354,0.000107405736,0.000020964686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280953,0.00005641671,0.0001027476,0.00003740267,0.00043782982,0.0000353501,0.00019833316,0.0000374144,0.000001450021],"category_scores_gemma":[0.00037934544,0.000033838664,0.00006007388,0.00041686482,0.0002507415,0.0000030850695,0.00019600698,0.00002473591,7.3284684e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008187662,0.000011822972,0.0011670868,0.000005486499,0.000010536353,9.3431396e-8,0.000064621185,0.019101966,0.0049989535,0.000537243,0.0006068046,0.9734872],"study_design_scores_gemma":[0.00027463664,0.00042839366,0.00808967,0.00006508339,0.0000093151075,0.0000051624293,0.00035840398,0.96410364,0.0019379216,0.0212184,0.0034031302,0.00010625945],"about_ca_topic_score_codex":0.000004790797,"about_ca_topic_score_gemma":0.0000023482648,"teacher_disagreement_score":0.9733809,"about_ca_system_score_codex":0.0000012120853,"about_ca_system_score_gemma":0.000033915974,"threshold_uncertainty_score":0.3367477},"labels":[],"label_agreement":null},{"id":"W4390489172","doi":"10.1109/ssci52147.2023.10371888","title":"What Drives Evolution of Self-Driving Automata?","year":2023,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Automaton; Mutation; Computer science; Population; Sequence (biology); Matching (statistics); Variety (cybernetics); Diversity (politics); Operator (biology); Cellular automaton; Finite-state machine; State (computer science); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Statistics; Genetics","score_opus":0.009241392596740278,"score_gpt":0.24958662963117909,"score_spread":0.2403452370344388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390489172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968123,0.00014192985,0.0009888834,0.00009736545,0.00019853424,0.000049907027,6.7863823e-7,0.00011232054,0.0015981045],"genre_scores_gemma":[0.9981027,0.00018705222,0.00089843705,0.000035483543,0.00009313782,0.0000020110085,0.00002627415,0.0000045678275,0.0006503177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994943,0.000027377948,0.00011457196,0.0001646828,0.0000588219,0.00014025465],"domain_scores_gemma":[0.9997565,0.000013148487,0.00003722886,0.00013300114,0.000032575736,0.000027545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013184645,0.00006124127,0.00007157788,0.000027496331,0.00003671782,0.000015770309,0.00010403918,0.00007705593,0.000010861017],"category_scores_gemma":[0.000041821026,0.000045953548,0.00005403859,0.00012507242,0.000026485855,0.0000037145453,0.00015585187,0.000026051457,0.000025851616],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051457296,0.000032271597,0.014913872,0.000013386425,0.000024317982,0.0000011214877,0.000024927605,0.000060293267,0.97773236,0.0007383923,0.0013164902,0.005137399],"study_design_scores_gemma":[0.0007250284,0.0009232798,0.28014615,0.00009022705,0.000025429112,0.000013235704,0.0014080311,0.013104328,0.66817296,0.0012600422,0.033628773,0.00050254195],"about_ca_topic_score_codex":0.0000035887522,"about_ca_topic_score_gemma":0.000004662759,"teacher_disagreement_score":0.30955943,"about_ca_system_score_codex":0.000005710055,"about_ca_system_score_gemma":0.000016170703,"threshold_uncertainty_score":0.18739313},"labels":[],"label_agreement":null},{"id":"W4390928901","doi":"10.21203/rs.3.rs-3849497/v1","title":"On Duplication-Free Codes for Disjoint or Equal-Length Errors","year":2024,"lang":"en","type":"preprint","venue":"Research Square","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Ben-Gurion University of the Negev","keywords":"Disjoint sets; Gene duplication; Tandem exon duplication; Tandem; Construct (python library); Computer science; Mathematics; Algorithm; Combinatorics; Genetics; Biology; Engineering; Gene","score_opus":0.10030206655243726,"score_gpt":0.42947605331437194,"score_spread":0.32917398676193466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390928901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771537,0.002656055,0.003222745,0.0044808267,0.000677306,0.0033296912,0.0014962804,0.0001530982,0.0068302653],"genre_scores_gemma":[0.9924644,0.00025570518,0.00096831203,0.00012957507,0.0009295744,0.000592896,0.0012388261,0.000051587973,0.003369121],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735254,0.00023209876,0.00031055263,0.0010657676,0.00042822826,0.0006108214],"domain_scores_gemma":[0.99785495,0.00038645673,0.000070297334,0.0011369404,0.00038986115,0.00016149793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013394739,0.0002801299,0.00027851082,0.00013487096,0.00020835431,0.00015061862,0.00088280026,0.00057857134,0.000051241615],"category_scores_gemma":[0.0027389876,0.00018640052,0.00028094428,0.00016150721,0.00016895254,9.412433e-7,0.0035377133,0.0008893787,0.00007000201],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066508274,0.002009884,0.0010003184,0.014533121,0.0014604992,0.00013778379,0.00054791424,0.004678507,0.28442526,0.0856552,0.4918839,0.10701677],"study_design_scores_gemma":[0.0032012423,0.01751038,0.003049917,0.004860267,0.00015891063,0.000027535918,0.0010803319,0.015771408,0.20632887,0.41892815,0.32569706,0.0033859406],"about_ca_topic_score_codex":0.00003075068,"about_ca_topic_score_gemma":0.000055558634,"teacher_disagreement_score":0.33327293,"about_ca_system_score_codex":0.00007230651,"about_ca_system_score_gemma":0.00032472206,"threshold_uncertainty_score":0.76011926},"labels":[],"label_agreement":null},{"id":"W4392666034","doi":"10.5506/aphyspolbsupp.17.2-a22","title":"Recent Developments in Testable Leptogenesis","year":2024,"lang":"en","type":"article","venue":"Acta Physica Polonica B Proceedings Supplement","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Leptogenesis; Physics; Nuclear physics","score_opus":0.017358274834426354,"score_gpt":0.2722791258547536,"score_spread":0.25492085102032724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392666034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653437,0.0009128818,0.000002648641,0.028528383,0.00019349747,0.00033138337,0.000023355264,0.00006374413,0.004600419],"genre_scores_gemma":[0.99724483,0.0007705363,0.0009721896,0.0002835791,0.00025397082,0.000073273986,0.0001003989,0.00002441893,0.00027680455],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984261,0.0000113425995,0.0002815567,0.0005785625,0.00020767788,0.00049480714],"domain_scores_gemma":[0.9996528,0.000015276786,0.000046337875,0.00011166951,0.000093098104,0.00008081069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002871086,0.0002098463,0.00016762441,0.00006263092,0.00007623394,0.00009253972,0.00027730886,0.00009479158,0.000076637574],"category_scores_gemma":[0.00006512084,0.00017551592,0.00006981954,0.00031959102,0.000043075506,0.000010806333,0.00034041496,0.00012406151,0.000029559125],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051542673,0.00017699561,0.008592824,0.0000734014,0.000080289334,0.0000055993037,0.00012450361,0.0000023655766,0.6913802,0.0008975578,0.29493168,0.0036830285],"study_design_scores_gemma":[0.00020328737,0.00021335254,0.0029139481,0.000051761082,0.000009666486,0.000005019141,0.00006341361,0.00004716788,0.1408607,0.00003474442,0.8553761,0.00022079998],"about_ca_topic_score_codex":0.000015288415,"about_ca_topic_score_gemma":0.000012379807,"teacher_disagreement_score":0.5604445,"about_ca_system_score_codex":0.00009714465,"about_ca_system_score_gemma":0.00013238512,"threshold_uncertainty_score":0.7157332},"labels":[],"label_agreement":null},{"id":"W4392925731","doi":"10.1007/s11063-024-11576-2","title":"CLSTM-SNP: Convolutional Neural Network to Enhance Spiking Neural P Systems for Named Entity Recognition Based on Long Short-Term Memory Network","year":2024,"lang":"en","type":"article","venue":"Neural Processing Letters","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Computational intelligence; Computer science; Convolutional neural network; Term (time); Artificial neural network; Long short term memory; Artificial intelligence; Pattern recognition (psychology); Recurrent neural network","score_opus":0.03001720040054282,"score_gpt":0.2932218952943938,"score_spread":0.26320469489385095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392925731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691941,0.001561764,0.0243355,0.001603025,0.0024537032,0.00060728675,0.000020557616,0.0001495737,0.0000744925],"genre_scores_gemma":[0.9859506,0.000005640704,0.0006394708,0.008124144,0.004679836,0.00009897096,0.00039928357,0.000043338005,0.000058728543],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764127,0.0001373581,0.00039387005,0.0008470847,0.0002388259,0.0007415715],"domain_scores_gemma":[0.9993642,0.00010635345,0.00009556412,0.00019395753,0.000095649746,0.00014430285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039031942,0.00033005117,0.00026797713,0.000053257198,0.00039110088,0.00034893845,0.0002572602,0.00017748389,0.000005630297],"category_scores_gemma":[0.000089285495,0.00028595768,0.00019663657,0.00024947073,0.00008871748,0.000023779248,0.00009642909,0.0002966358,0.000006376873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008176692,0.00007191407,0.005837259,0.0009589029,0.00007040836,0.00009101691,0.000046814555,0.35773444,0.45121092,0.0000071871036,0.016045695,0.16710778],"study_design_scores_gemma":[0.00043228836,0.0009461064,0.005400742,0.0011289128,0.00009638735,0.00006654052,0.000022020655,0.97607064,0.011778508,0.000038679656,0.0029691393,0.0010500391],"about_ca_topic_score_codex":0.0000053875337,"about_ca_topic_score_gemma":0.000007170413,"teacher_disagreement_score":0.6183362,"about_ca_system_score_codex":0.00005233866,"about_ca_system_score_gemma":0.000050509836,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W4393534086","doi":"10.5281/zenodo.7884681","title":"Assemblies for \"Linear time complexity de novo long read genome assembly with GoldRush\"","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Sequence assembly; Computational biology; Genome; Biology; Computer science; Genetics; Gene","score_opus":0.05438444105774091,"score_gpt":0.28109549037343523,"score_spread":0.22671104931569433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393534086","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012526751,0.00012161335,0.0039862134,0.00027336483,0.00010215103,0.00096271845,0.9790106,0.00043865864,0.00257794],"genre_scores_gemma":[0.0012767639,0.00014328308,0.00064428226,0.0001944068,0.00061947206,2.44844e-7,0.9949209,0.00081383286,0.0013868175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978931,0.00027319576,0.00028300114,0.00071933505,0.0002498695,0.00058150996],"domain_scores_gemma":[0.99848866,0.000033956865,0.00018989973,0.0006095967,0.0004975707,0.00018031303],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000776771,0.0002933496,0.00028856847,0.00013295974,0.0011869478,0.00039912792,0.0012605236,0.0002927537,0.0007047095],"category_scores_gemma":[0.0006839589,0.00025709986,0.00010826846,0.00029707554,0.00021860238,0.000009180263,0.0015705475,0.00030903984,0.004159615],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020347236,0.000097595774,8.853225e-7,0.00014784887,0.00012672263,0.000025162968,0.00001194701,0.00004285397,0.021518713,0.000021501919,0.9757013,0.0021019983],"study_design_scores_gemma":[0.00045542445,0.0010466554,0.00019883034,0.00004396416,0.000042070806,0.00011894118,0.000021898804,0.00011090028,0.00061396934,0.000020332,0.99697214,0.00035489217],"about_ca_topic_score_codex":0.000026033838,"about_ca_topic_score_gemma":0.000004535784,"teacher_disagreement_score":0.021270823,"about_ca_system_score_codex":0.00007478988,"about_ca_system_score_gemma":0.000016228543,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W4393781301","doi":"10.5281/zenodo.7884680","title":"Assemblies for \"Linear time complexity de novo long read genome assembly with GoldRush\"","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Sequence assembly; Computational biology; Computer science; Genome; Biology; Genetics; Gene","score_opus":0.05438444105774091,"score_gpt":0.28109549037343523,"score_spread":0.22671104931569433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393781301","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012526751,0.00012161335,0.0039862134,0.00027336483,0.00010215103,0.00096271845,0.9790106,0.00043865864,0.00257794],"genre_scores_gemma":[0.0012767639,0.00014328308,0.00064428226,0.0001944068,0.00061947206,2.44844e-7,0.9949209,0.00081383286,0.0013868175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978931,0.00027319576,0.00028300114,0.00071933505,0.0002498695,0.00058150996],"domain_scores_gemma":[0.99848866,0.000033956865,0.00018989973,0.0006095967,0.0004975707,0.00018031303],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000776771,0.0002933496,0.00028856847,0.00013295974,0.0011869478,0.00039912792,0.0012605236,0.0002927537,0.0007047095],"category_scores_gemma":[0.0006839589,0.00025709986,0.00010826846,0.00029707554,0.00021860238,0.000009180263,0.0015705475,0.00030903984,0.004159615],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020347236,0.000097595774,8.853225e-7,0.00014784887,0.00012672263,0.000025162968,0.00001194701,0.00004285397,0.021518713,0.000021501919,0.9757013,0.0021019983],"study_design_scores_gemma":[0.00045542445,0.0010466554,0.00019883034,0.00004396416,0.000042070806,0.00011894118,0.000021898804,0.00011090028,0.00061396934,0.000020332,0.99697214,0.00035489217],"about_ca_topic_score_codex":0.000026033838,"about_ca_topic_score_gemma":0.000004535784,"teacher_disagreement_score":0.021270823,"about_ca_system_score_codex":0.00007478988,"about_ca_system_score_gemma":0.000016228543,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W4393900481","doi":"10.20944/preprints202404.0123.v1","title":"Secure Key Exchange in Tropical Cryptography: Leveraging Efficiency with Advanced Block Matrix Protocols","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key exchange; Key (lock); Cryptography; Computer science; Block (permutation group theory); Computer security; Public-key cryptography; Mathematics; Encryption","score_opus":0.05643504599004433,"score_gpt":0.34900044196110347,"score_spread":0.29256539597105913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393900481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98982084,0.00069888553,0.00037185077,0.00020088842,0.0001827844,0.0061414884,0.00001703483,0.00011181157,0.0024544306],"genre_scores_gemma":[0.99443877,0.00007395233,0.0012301235,0.000106910535,0.00033485758,0.0034782647,0.00006572475,0.000049666025,0.00022176275],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9969143,0.00016733176,0.00048520605,0.0015966081,0.0002617938,0.0005747621],"domain_scores_gemma":[0.9986972,0.000020398691,0.00018371013,0.0008672821,0.00009777961,0.00013359096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033191487,0.00049979356,0.0004685502,0.00015119798,0.0000725671,0.000046157686,0.0006835628,0.0005816999,0.00006759666],"category_scores_gemma":[0.00009849774,0.00039049375,0.0002541193,0.0002586315,0.0001298273,0.0000028959414,0.0031490058,0.0011434869,0.000080563645],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069912954,0.000507154,0.7298085,0.0015187709,0.00020489347,0.00016094274,0.0005447808,0.004197999,0.25982177,0.0002778285,0.000058318208,0.0021999285],"study_design_scores_gemma":[0.004179096,0.0017325452,0.55930185,0.004465909,0.00017260869,0.00013432371,0.0003140354,0.0014366827,0.35712337,0.00577294,0.061609656,0.0037569583],"about_ca_topic_score_codex":0.000023470304,"about_ca_topic_score_gemma":0.0000234343,"teacher_disagreement_score":0.17050661,"about_ca_system_score_codex":0.00004807255,"about_ca_system_score_gemma":0.00015045133,"threshold_uncertainty_score":0.9998547},"labels":[],"label_agreement":null},{"id":"W4394373508","doi":"10.6084/m9.figshare.12081978","title":"MiSeq_Run1_fastqfiles","year":2020,"lang":"en","type":"dataset","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.03741452958500913,"score_gpt":0.2631036118437034,"score_spread":0.22568908225869427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394373508","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005220967,0.00038966138,1.6121916e-7,0.00003227547,0.00006823423,0.00011070671,0.9991051,0.000017893894,0.0002707391],"genre_scores_gemma":[0.000049049235,0.000024424058,0.000023735802,0.0012421447,0.001243454,0.000037609374,0.99725807,0.0000124103035,0.00010908543],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990937,0.000035230823,0.00014343107,0.0004270476,0.000095409065,0.00020514535],"domain_scores_gemma":[0.9994366,0.000015270882,0.00010069262,0.00029902975,0.000044637098,0.00010373862],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00001540455,0.00021933856,0.0001752393,0.000015382782,0.000050163067,0.000038576483,0.0004580588,0.0004234597,0.04231261],"category_scores_gemma":[0.0008401667,0.00018095873,0.00014154505,0.00005339999,0.000006648569,5.5860244e-7,0.0005234795,0.00020501424,0.007413146],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008760827,0.000012577509,3.5742502e-7,0.00011072393,0.000022120656,0.000018029032,3.388926e-7,0.0000010471795,0.00072230346,4.3851433e-8,0.99867314,0.000430569],"study_design_scores_gemma":[0.00007762897,0.00015697593,0.00001790607,0.00021414389,0.00000808424,0.0000064086976,0.0000014344347,0.0000017148162,0.00127696,0.000001560342,0.9979853,0.00025189779],"about_ca_topic_score_codex":0.0000017582908,"about_ca_topic_score_gemma":0.00000380039,"teacher_disagreement_score":0.034899462,"about_ca_system_score_codex":0.000004566203,"about_ca_system_score_gemma":0.000058479825,"threshold_uncertainty_score":0.9933597},"labels":[],"label_agreement":null},{"id":"W4394433624","doi":"10.6084/m9.figshare.11746029","title":"cultivated_lentil_2","year":2020,"lang":"en","type":"dataset","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Biology; Horticulture; Agronomy","score_opus":0.03508864204335439,"score_gpt":0.26886948027533486,"score_spread":0.23378083823198048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394433624","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006546043,0.0002759123,1.7910158e-7,0.000023396306,0.00007076497,0.00011067318,0.9992737,0.000019081936,0.00021972616],"genre_scores_gemma":[0.00006611832,0.000022936305,0.000015754778,0.0010814726,0.0009470172,0.00003201125,0.997714,0.000011669636,0.000109057524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991198,0.000035967325,0.0001385239,0.0004154471,0.00009180938,0.00019844281],"domain_scores_gemma":[0.99947685,0.000010449752,0.000098263314,0.00027453364,0.00004925043,0.000090659596],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000014623033,0.0002069814,0.0001585317,0.000015080735,0.000046589696,0.000035633224,0.00041783025,0.00045736934,0.03344154],"category_scores_gemma":[0.0007914313,0.00016764262,0.0001322098,0.00006365479,0.0000054644343,5.937377e-7,0.00048759492,0.00024122013,0.007378887],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008474385,0.000014229926,5.670302e-7,0.00009487845,0.000027154625,0.00001700107,3.4092022e-7,9.615932e-7,0.0010351989,2.6067713e-8,0.9984216,0.0003795536],"study_design_scores_gemma":[0.00008546385,0.00013179265,0.000020333026,0.00022904303,0.000008060227,0.000004851029,0.0000013176025,0.0000014322404,0.0022800746,0.0000010250668,0.99699926,0.00023735159],"about_ca_topic_score_codex":0.0000020121404,"about_ca_topic_score_gemma":0.0000024109736,"teacher_disagreement_score":0.026062652,"about_ca_system_score_codex":0.0000050135304,"about_ca_system_score_gemma":0.000046085243,"threshold_uncertainty_score":0.99339396},"labels":[],"label_agreement":null},{"id":"W4394445814","doi":"10.6084/m9.figshare.19929887","title":"Pose Tracking Codes","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Toronto Rehabilitation Institute; University of Toronto; University Health Network","funders":"","keywords":"Computer science; Tracking (education); Artificial intelligence; Computer vision; Psychology","score_opus":0.04210087602819613,"score_gpt":0.2860973532802154,"score_spread":0.24399647725201928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394445814","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005367337,0.0009103314,9.912586e-8,0.000011107631,0.00013661964,0.00011590673,0.99851406,0.000016250424,0.00024193033],"genre_scores_gemma":[0.00019345117,0.000027578255,0.000009036213,0.00057263765,0.00064818317,0.00006551012,0.99829835,0.000013411664,0.00017186863],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990041,0.000068717,0.00015349954,0.00041290006,0.000124372,0.0002363844],"domain_scores_gemma":[0.99939334,0.000026600213,0.000120972705,0.00035929948,0.00004239604,0.000057380814],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000048638747,0.00020331233,0.00016976529,0.000027303628,0.00013276048,0.00004656333,0.0005043827,0.0002974653,0.5675061],"category_scores_gemma":[0.00064073375,0.00017749186,0.00014019999,0.000061522886,0.0000060839784,8.977618e-7,0.00074450736,0.0002909215,0.0003042319],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009238349,0.000026217222,0.0000011383207,0.000072850096,0.000023423052,0.000025535532,6.310062e-7,0.0000055103465,0.0006831373,7.423419e-8,0.9982294,0.00092286745],"study_design_scores_gemma":[0.00007840681,0.00017399881,0.0000315,0.00010749722,0.000009040288,0.000016984379,0.000004546291,0.0000011562257,0.00085798104,0.0000026156138,0.9984582,0.00025805112],"about_ca_topic_score_codex":0.000005861946,"about_ca_topic_score_gemma":0.000010874633,"teacher_disagreement_score":0.5672018,"about_ca_system_score_codex":0.000011996332,"about_ca_system_score_gemma":0.000056382607,"threshold_uncertainty_score":0.7237908},"labels":[],"label_agreement":null},{"id":"W4394482156","doi":"10.6084/m9.figshare.11749788","title":"cultivated_lentil_4","year":2020,"lang":"en","type":"dataset","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Biology; Horticulture","score_opus":0.03508864204335439,"score_gpt":0.26886948027533486,"score_spread":0.23378083823198048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394482156","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062582712,0.00027942023,1.8447429e-7,0.000026945032,0.00007073602,0.00011084523,0.99926376,0.000019104373,0.00022276111],"genre_scores_gemma":[0.000070343034,0.000023076378,0.00001601359,0.0010835053,0.00094534236,0.000032028038,0.99771017,0.000011670798,0.000107857995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911916,0.000036113543,0.00013857173,0.0004158416,0.00009184946,0.00019845691],"domain_scores_gemma":[0.9994765,0.00001060833,0.00009829524,0.00027456382,0.000049284772,0.00009072617],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000014682173,0.00020704305,0.00015861503,0.000015091282,0.00004819562,0.000035665955,0.000417991,0.0004628437,0.033533033],"category_scores_gemma":[0.0008128487,0.0001677002,0.00013222046,0.00006370615,0.00000557376,5.942278e-7,0.00048597515,0.0002441363,0.0075025344],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008475549,0.00001423244,4.6006716e-7,0.000094078205,0.000027154389,0.000017467242,3.4758537e-7,9.516032e-7,0.0010133234,3.3476528e-8,0.99845326,0.0003702199],"study_design_scores_gemma":[0.00008566616,0.00013167338,0.000016531803,0.00023170386,0.000008061118,0.000004846213,0.0000013340791,0.0000017000083,0.0022650254,0.0000010415674,0.997015,0.00023742963],"about_ca_topic_score_codex":0.0000018506107,"about_ca_topic_score_gemma":0.000002221094,"teacher_disagreement_score":0.0260305,"about_ca_system_score_codex":0.0000051128504,"about_ca_system_score_gemma":0.000046009092,"threshold_uncertainty_score":0.9932702},"labels":[],"label_agreement":null},{"id":"W4398183348","doi":"10.1007/s10623-024-01417-7","title":"On duplication-free codes for disjoint or equal-length errors","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Disjoint sets; Gene duplication; Computer science; Mathematics; Combinatorics; Genetics; Biology; Gene","score_opus":0.03477657022504555,"score_gpt":0.29394680708308035,"score_spread":0.2591702368580348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398183348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7175771,0.0026694313,0.2768869,0.0005696281,0.0002179723,0.0005721055,0.00018818073,0.00012218682,0.0011964561],"genre_scores_gemma":[0.99259084,0.00031126515,0.0061151674,0.00046387254,0.0001797465,0.00008279688,0.00013716605,0.000019301511,0.00009984019],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990022,0.000040117484,0.00017735468,0.00045730377,0.00007887505,0.00024411459],"domain_scores_gemma":[0.99941945,0.00015470858,0.000034700257,0.00026414404,0.000042696287,0.000084312625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022217623,0.00017941471,0.00015170744,0.00007241482,0.00015146538,0.000096290416,0.00017778431,0.0001335896,0.000016135757],"category_scores_gemma":[0.000101725345,0.00011683962,0.00016275622,0.00016326977,0.00010917493,0.0000034125835,0.00007712977,0.00007332436,0.0000029775183],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001339258,0.0003564371,0.0017572274,0.00041982174,0.0005667305,0.000018189281,0.0001887271,0.00016498727,0.62393916,0.23977518,0.038498655,0.09297563],"study_design_scores_gemma":[0.0042018015,0.018980905,0.0076306155,0.0006997182,0.00045990024,0.000100372825,0.0008259919,0.015681976,0.266316,0.18910974,0.49265814,0.0033348366],"about_ca_topic_score_codex":0.000004751382,"about_ca_topic_score_gemma":0.000010759981,"teacher_disagreement_score":0.4541595,"about_ca_system_score_codex":0.000003705983,"about_ca_system_score_gemma":0.000022180066,"threshold_uncertainty_score":0.47645813},"labels":[],"label_agreement":null},{"id":"W4399836757","doi":"10.48550/arxiv.2406.12022","title":"Constructing Ancestral Recombination Graphs through Reinforcement Learning","year":2024,"lang":"en","type":"preprint","venue":"Archipelago (University of Quebec in Montreal)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Recombination; Reinforcement; Genealogy; Computer science; Artificial intelligence; Evolutionary biology; Biology; History; Psychology; Genetics; Social psychology","score_opus":0.01608044009283437,"score_gpt":0.23205086684933832,"score_spread":0.21597042675650394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399836757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98739,0.00033888008,0.0014932322,0.00014599095,0.00022284247,0.00019490535,0.000009061473,0.000026381782,0.010178732],"genre_scores_gemma":[0.99621195,0.00028336688,0.0019990231,0.00001790606,0.00004665766,5.887823e-7,0.0003655194,0.000009364341,0.001065647],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879766,0.00013207359,0.00021539409,0.00048931385,0.00012340811,0.00024215743],"domain_scores_gemma":[0.99945134,0.000033010816,0.0002172414,0.00020594157,0.000051637046,0.0000408409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022602327,0.00019203716,0.00027253007,0.00010123405,0.00008345,0.000019700337,0.00030474353,0.00029385547,0.0000139114845],"category_scores_gemma":[0.000044191052,0.0002143943,0.0001927768,0.000111013906,0.00018663696,0.0000052887112,0.001111496,0.0005943887,0.0000046621444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006145911,0.00021573553,0.027144592,0.0011323764,0.00051612715,0.0002241921,0.011786358,0.039589647,0.017549474,0.023535047,0.0005232762,0.8771686],"study_design_scores_gemma":[0.0049996637,0.0022001027,0.09523182,0.003415281,0.0004396778,0.000063053536,0.0881351,0.038602192,0.010046979,0.751737,0.0018988464,0.0032302933],"about_ca_topic_score_codex":0.05220524,"about_ca_topic_score_gemma":0.18969996,"teacher_disagreement_score":0.87393826,"about_ca_system_score_codex":0.000048813774,"about_ca_system_score_gemma":0.00009301995,"threshold_uncertainty_score":0.9541062},"labels":[],"label_agreement":null},{"id":"W4400512536","doi":"10.61091/ars159-06","title":"Some Properties of Channel Detecting Codes on Specific Domains","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Channel (broadcasting); Code (set theory); Construct (python library); Algorithm; Computer science; Systematic code; Focus (optics); Channel code; Mathematics; Transmission (telecommunications); Theoretical computer science; Low-density parity-check code; Decoding methods; Programming language; Physics; Telecommunications","score_opus":0.021807081454215956,"score_gpt":0.2358875450683831,"score_spread":0.21408046361416716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99356353,0.0045056324,0.00001807272,0.000056178338,0.0010824911,0.0000915586,0.0000031491495,0.000038227157,0.00064114924],"genre_scores_gemma":[0.9995376,0.00012157616,0.000040247985,0.00007314456,0.00010163246,0.000005816529,0.000006579872,0.000013465265,0.00009995016],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999264,0.000043435775,0.00015699278,0.00026663096,0.00008935728,0.00017959149],"domain_scores_gemma":[0.99971455,0.000019922016,0.00003361827,0.00016611749,0.00003297885,0.00003278097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017427327,0.00011570684,0.00012442865,0.000034022767,0.000062679246,0.000029030176,0.00014165767,0.000100741294,0.0000023945565],"category_scores_gemma":[0.000050024715,0.00008349408,0.00008195403,0.00008568868,0.00006743255,0.0000029598052,0.000098980185,0.00009852962,0.000014325065],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003997367,0.000048282567,0.00008765653,0.000044830213,0.00003254353,0.0000058314345,0.000043618424,0.00001149757,0.9659744,0.03190084,0.00025471998,0.0015558074],"study_design_scores_gemma":[0.00019207704,0.00056896405,0.00015199832,0.00011947729,0.0000059673343,0.0000064217975,0.000058930356,0.00012884161,0.9733738,0.02045162,0.004792973,0.0001489805],"about_ca_topic_score_codex":0.0000035436992,"about_ca_topic_score_gemma":5.5048963e-7,"teacher_disagreement_score":0.0114492215,"about_ca_system_score_codex":0.000010368027,"about_ca_system_score_gemma":0.000018295148,"threshold_uncertainty_score":0.340479},"labels":[],"label_agreement":null},{"id":"W4401164143","doi":"10.1109/bmsb62888.2024.10608341","title":"Fine-Tuning Optimization of Small Language Models: A Novel Graph-Theoretical Approach for Efficient Prompt Engineering","year":2024,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Programming language","score_opus":0.01601698981547818,"score_gpt":0.22660702902888158,"score_spread":0.2105900392134034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401164143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1430345,0.00033132176,0.855423,0.000020538973,0.000038403425,0.00017353323,0.000009201246,0.00003624242,0.0009333045],"genre_scores_gemma":[0.79037493,0.0000025370105,0.20935279,0.00001381454,0.00006680908,0.00001572642,0.000113314265,0.000010521496,0.000049568225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941534,0.000007677634,0.00014088103,0.00024141965,0.000045148226,0.0001495625],"domain_scores_gemma":[0.99979687,0.000022807255,0.000017201412,0.00009559227,0.00003533162,0.000032191158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017125254,0.000093467956,0.000094254814,0.00003636665,0.000021327925,0.000018902334,0.00009029035,0.000093780516,0.000004863075],"category_scores_gemma":[0.00005310411,0.00006777602,0.000089042456,0.00008673509,0.000037216054,0.0000010437786,0.000068340014,0.000046850997,1.3877695e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015185932,0.000042102907,0.0000025555132,0.00008537456,0.000019758547,2.8069778e-7,0.00003114673,0.6854065,0.29157704,0.022280432,0.00001136251,0.0005282871],"study_design_scores_gemma":[0.00014096031,0.00012832375,0.000001867899,0.00002157493,0.000011908598,0.000003988852,0.000033289893,0.95280695,0.046662312,0.000049843882,0.000043481617,0.00009550407],"about_ca_topic_score_codex":0.0000013589622,"about_ca_topic_score_gemma":1.6606427e-7,"teacher_disagreement_score":0.6473404,"about_ca_system_score_codex":0.0000038288185,"about_ca_system_score_gemma":0.000013527811,"threshold_uncertainty_score":0.27638257},"labels":[],"label_agreement":null},{"id":"W4402427239","doi":"10.48550/arxiv.2408.06894","title":"Exploring the generalizability of the optimal 0.234 acceptance rate in random-walk Metropolis and parallel tempering algorithms","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Government of Canada; Canadian Institute for Advanced Research","keywords":"Generalizability theory; Random walk; Parallel tempering; Computer science; Algorithm; Mathematics; Artificial intelligence; Statistics; Markov chain Monte Carlo","score_opus":0.10721328753005835,"score_gpt":0.21107546006815275,"score_spread":0.1038621725380944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402427239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99585474,0.0006768331,0.0024520464,0.00008791537,0.00032576075,0.00027631104,0.000016716253,0.000014131055,0.0002955734],"genre_scores_gemma":[0.9984022,0.0009799857,0.00020764867,0.00004733978,0.000120514305,0.000003636172,0.000008568137,0.000012268308,0.00021787551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856865,0.00029020515,0.00020907728,0.0006561593,0.000043498418,0.00023241887],"domain_scores_gemma":[0.9992215,0.000053978452,0.00011616354,0.0005153213,0.00004878418,0.00004425123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049991976,0.00022145074,0.00026152813,0.000042274656,0.00009755173,0.000034178865,0.0005620332,0.00016022583,0.0000048355864],"category_scores_gemma":[0.000085690015,0.00013987074,0.0002081936,0.00022447426,0.00026727695,0.0000056421854,0.002521017,0.00040960894,9.4181604e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011394718,0.0002480511,0.095741965,0.00079728966,0.00078821136,0.00013200345,0.00072884216,0.76056683,0.12470309,0.008448527,0.00019022592,0.0065154885],"study_design_scores_gemma":[0.012024065,0.0010324954,0.28818658,0.0014679484,0.0011768513,0.000043653177,0.006181335,0.4376438,0.20624402,0.032516334,0.008614154,0.0048687775],"about_ca_topic_score_codex":0.00019494488,"about_ca_topic_score_gemma":0.000050194903,"teacher_disagreement_score":0.32292303,"about_ca_system_score_codex":0.000038335173,"about_ca_system_score_gemma":0.00006172237,"threshold_uncertainty_score":0.57037634},"labels":[],"label_agreement":null},{"id":"W4403023799","doi":"10.1109/bdai62182.2024.10692447","title":"Machine Learning for Polar Codes in Small IoT Devices","year":2024,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Internet of Things; Polar; Computer security; Physics","score_opus":0.020513839249989306,"score_gpt":0.2701058753806214,"score_spread":0.2495920361306321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403023799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844026,0.0050600995,0.007331859,0.00023017016,0.000085169755,0.00010339901,0.0000070383844,0.00003911377,0.0027405797],"genre_scores_gemma":[0.99567574,0.00004561521,0.0023036064,0.0002515683,0.0001389668,0.000005889672,0.00010342349,0.0000074396803,0.0014677765],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994961,0.000025750891,0.00009813669,0.00021181254,0.000018912018,0.00014926112],"domain_scores_gemma":[0.99986804,0.000033419492,0.000010785001,0.000050614468,0.000013332637,0.000023784856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017992436,0.0000731687,0.00007162971,0.0000229616,0.00003352169,0.00003211437,0.000078393015,0.00008001185,0.00001590894],"category_scores_gemma":[0.00006116115,0.000050542247,0.000052799063,0.00005218628,0.00001471811,5.55564e-7,0.00006105656,0.000071158196,0.000005653562],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006679194,0.000045984405,0.062334754,0.00013390563,0.000049720533,0.000009859679,0.000031178337,0.0003488146,0.87551135,0.0024148482,0.00034478438,0.058707993],"study_design_scores_gemma":[0.00048257035,0.0009744201,0.0064327535,0.00007827806,0.000017286508,0.000015592934,0.000097982236,0.0414521,0.14600539,0.0008286091,0.803186,0.00042899617],"about_ca_topic_score_codex":0.000063569954,"about_ca_topic_score_gemma":0.0003505353,"teacher_disagreement_score":0.80284125,"about_ca_system_score_codex":0.000003951262,"about_ca_system_score_gemma":0.000012834779,"threshold_uncertainty_score":0.2061053},"labels":[],"label_agreement":null},{"id":"W4403523031","doi":"10.1016/j.tcs.2024.114905","title":"On decision problems concerning contextual insertions and deletions","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Science and Engineering Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decision problem; Theoretical computer science; Mathematics; Algorithm","score_opus":0.013864027546685878,"score_gpt":0.27067985772327147,"score_spread":0.2568158301765856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403523031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6330283,0.00017077547,0.36529583,0.0001843699,0.0001740465,0.00006281645,0.0000020009816,0.00003421061,0.0010475859],"genre_scores_gemma":[0.99439895,0.000017522143,0.004928475,0.00048912375,0.000140432,0.0000035123487,0.000004220619,0.000004900299,0.000012868285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903005,0.000036722227,0.00012252413,0.00044297916,0.00014629289,0.00022141206],"domain_scores_gemma":[0.9995342,0.0001420701,0.000012012221,0.00015046686,0.00005156887,0.000109674715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044821072,0.0000943775,0.000074999654,0.00004774648,0.00025802202,0.00017531481,0.00022317513,0.000054412147,0.0000190686],"category_scores_gemma":[0.0001371043,0.000064078646,0.000033890563,0.00019932196,0.0013591675,0.0000061070937,0.00030372094,0.0001113045,0.000023382336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021170308,0.000025341282,0.00007153633,0.000006188973,0.000005240113,0.0000047161197,0.000053055875,0.00026067914,0.064269565,0.84778017,0.00014187374,0.08736044],"study_design_scores_gemma":[0.0010349669,0.0061156093,0.0046552937,0.00073967327,0.000034097393,0.00029304947,0.000047239955,0.5691972,0.052284863,0.34537083,0.01909837,0.0011288326],"about_ca_topic_score_codex":8.105115e-7,"about_ca_topic_score_gemma":5.6634076e-7,"teacher_disagreement_score":0.56893647,"about_ca_system_score_codex":0.000009204031,"about_ca_system_score_gemma":0.000038285674,"threshold_uncertainty_score":0.50079095},"labels":[],"label_agreement":null},{"id":"W4404010426","doi":"10.1101/2024.11.02.621633","title":"Self-Authenticating Genomic Materials with Advanced Genome Signatures","year":2024,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Genome; Computational biology; Biology; Computer science; Genetics; Gene","score_opus":0.0062914812782239446,"score_gpt":0.20617545989064018,"score_spread":0.19988397861241625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404010426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926887,0.0051217386,0.0003028949,0.000071214774,0.000667233,0.0006202704,0.0001853027,0.00031604717,0.00002657382],"genre_scores_gemma":[0.9843461,0.00026344214,0.013930091,0.00021134534,0.0009780164,0.00011521619,0.00000450481,0.00014147392,0.000009822111],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99728185,0.00011425746,0.0004555287,0.001354816,0.0001972901,0.00059625355],"domain_scores_gemma":[0.99835336,0.00001506857,0.00030716194,0.00096128526,0.00021130302,0.00015183889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040841015,0.000609577,0.00048535777,0.00010050787,0.00013908575,0.00027142547,0.00064585154,0.0006885907,0.000021004093],"category_scores_gemma":[0.000066081426,0.00049614406,0.00013911742,0.00017369022,0.000095096366,0.0000039219813,0.0015310069,0.00055820204,0.000060635353],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055629145,0.00005811552,0.00018429938,0.00047966893,0.0002652964,0.000038026657,0.0000050354497,0.000099009165,0.99863386,0.00014427376,0.000032960375,0.000003849053],"study_design_scores_gemma":[0.0003279245,0.00028140738,0.009156935,0.00026796747,0.00017413855,7.838082e-8,0.0000032353253,0.00009173566,0.97992826,0.000006923859,0.008744832,0.0010165529],"about_ca_topic_score_codex":0.0000044206813,"about_ca_topic_score_gemma":5.63716e-7,"teacher_disagreement_score":0.018705567,"about_ca_system_score_codex":0.00008037979,"about_ca_system_score_gemma":0.0002675035,"threshold_uncertainty_score":0.999749},"labels":[],"label_agreement":null},{"id":"W4405231726","doi":"10.1021/jacs.4c11380","title":"Random Sanitization in DNA Information Storage Using CRISPR-Cas12a","year":2024,"lang":"en","type":"article","venue":"Journal of the American Chemical Society","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Shanghai Municipal Education Commission; National Natural Science Foundation of China","keywords":"CRISPR; Chemistry; Metadata; DNA; Oligonucleotide; Computational biology; Computer science; Nanotechnology; Gene; Operating system; Biology","score_opus":0.009520981312947513,"score_gpt":0.26166689578776925,"score_spread":0.2521459144748217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99073774,0.0002289725,0.008444412,0.00032239436,0.00014631491,0.00004314897,0.0000024083201,0.00000441319,0.00007017231],"genre_scores_gemma":[0.99743974,0.00007232328,0.0014440133,0.0007336517,0.00029405262,4.029855e-7,0.0000043667674,0.0000045117026,0.0000069614985],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993871,0.000047332567,0.00026313798,0.00006937556,0.00011802942,0.00011501236],"domain_scores_gemma":[0.99961954,0.000029416886,0.00019444864,0.000069929156,0.000056090776,0.00003055896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000269352,0.00007192871,0.0001318246,0.0000128233505,0.000032967928,0.000040026942,0.00015779561,0.00005340102,0.000003504067],"category_scores_gemma":[0.00012997762,0.000043237767,0.00024759644,0.00020864564,0.00010243132,0.00001241827,0.00008596164,0.00018760198,7.9847837e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004977087,0.0000135464925,0.00071054656,0.000012065539,0.000028868633,9.265751e-7,0.00009195651,0.00040144665,0.9940779,0.0000044231174,0.0013626838,0.0032458194],"study_design_scores_gemma":[0.0012742885,0.000252288,0.0035326867,0.00019429816,0.000073854164,0.00017897575,0.00086122577,0.020725196,0.94729966,0.0002641595,0.025026808,0.00031658242],"about_ca_topic_score_codex":0.000008179608,"about_ca_topic_score_gemma":2.6093747e-7,"teacher_disagreement_score":0.04677831,"about_ca_system_score_codex":0.000055416825,"about_ca_system_score_gemma":0.00005517946,"threshold_uncertainty_score":0.1763185},"labels":[],"label_agreement":null},{"id":"W4405669686","doi":"10.22541/au.173484023.37399383/v1","title":"An Optimized Error-Correcting Decoding Based on Cyclic Codebook","year":2024,"lang":"en","type":"preprint","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Codebook; Decoding methods; Computer science; Algorithm","score_opus":0.028119874021438708,"score_gpt":0.3160555170224669,"score_spread":0.2879356430010282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405669686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92712975,0.00031197772,0.024592109,0.00022556211,0.001585375,0.00044055795,0.000024141505,0.00026665058,0.045423854],"genre_scores_gemma":[0.98258656,0.000012266021,0.013840449,0.0013488645,0.000714022,0.000033539236,0.00041863252,0.0000470013,0.000998675],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979153,0.00015574254,0.00033908867,0.0010759135,0.00014252443,0.00037137777],"domain_scores_gemma":[0.99900866,0.000056366902,0.00011603272,0.0006250416,0.000057348418,0.00013653726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043724637,0.00039357744,0.0003295093,0.00006262548,0.000109959234,0.0001562275,0.00044298603,0.00063528644,0.00008594561],"category_scores_gemma":[0.00013600553,0.00029984742,0.00029681166,0.00005644837,0.00004731678,8.0063984e-7,0.000841504,0.0006457053,0.000043563174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008625496,0.00051245926,0.0014220625,0.0004730898,0.0003318503,0.00010322027,0.00008749357,0.22284512,0.6545955,0.00026922658,0.005010067,0.11348738],"study_design_scores_gemma":[0.0009338076,0.0012275961,0.00017628499,0.0005352216,0.00011670761,0.000019197962,0.00011978497,0.6889571,0.3010567,0.0012972128,0.0040162476,0.0015441298],"about_ca_topic_score_codex":0.000026567212,"about_ca_topic_score_gemma":0.00001207087,"teacher_disagreement_score":0.466112,"about_ca_system_score_codex":0.000031879725,"about_ca_system_score_gemma":0.00011589591,"threshold_uncertainty_score":0.99994534},"labels":[],"label_agreement":null},{"id":"W4408114024","doi":"10.3390/app15052660","title":"Enhancing Security and Efficiency in IoT Assistive Technologies: A Novel Hybrid Systolic Array Multiplier for Cryptographic Algorithms","year":2025,"lang":"en","type":"article","venue":"Applied Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"King Salman Center for Disability Research","keywords":"Computer science; Cryptography; Multiplier (economics); Internet of Things; Algorithm; Embedded system","score_opus":0.011482603975568138,"score_gpt":0.265278128011945,"score_spread":0.25379552403637684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408114024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91506016,0.0005334734,0.08244508,0.0001162816,0.00007990306,0.0003649012,0.0000079786705,0.000038192506,0.0013540027],"genre_scores_gemma":[0.98925066,0.000022469625,0.010480004,0.00012795368,0.000025112035,0.00007707975,0.000004259314,0.0000028874776,0.000009602523],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988275,0.000012228878,0.00019087897,0.0005716248,0.00008128606,0.00031649074],"domain_scores_gemma":[0.99966633,0.000091442766,0.00006233811,0.000125045,0.000030903822,0.000023953522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544114,0.00013341325,0.00016428978,0.00012828069,0.0002525465,0.00004413832,0.00028927193,0.0001128722,4.4624954e-7],"category_scores_gemma":[0.00019069627,0.000100066376,0.00004235494,0.00043881475,0.0005149117,0.0000021129981,0.00015820508,0.00009215654,3.7913728e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019303827,0.000067339315,0.0019614773,0.000028366248,0.000008746479,3.190165e-7,0.00003801611,0.00003153061,0.9892403,0.002044624,0.000010735458,0.0065492284],"study_design_scores_gemma":[0.00083677494,0.0003078277,0.0036035879,0.00007567572,0.000011754614,0.000004725727,0.0017983712,0.002507717,0.984731,0.004126935,0.0016548306,0.00034075903],"about_ca_topic_score_codex":0.000010744204,"about_ca_topic_score_gemma":0.000025719628,"teacher_disagreement_score":0.07419044,"about_ca_system_score_codex":0.000009570565,"about_ca_system_score_gemma":0.00005564973,"threshold_uncertainty_score":0.40805882},"labels":[],"label_agreement":null},{"id":"W4408423021","doi":"10.3390/sym17030436","title":"Symmetry-Based Enumeration of Polyominoes on C-Coloured Checkerboards","year":2025,"lang":"en","type":"article","venue":"Symmetry","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"University of Guelph","keywords":"Enumeration; Polyomino; Symmetry (geometry); Combinatorics; Mathematics; Physics; Pure mathematics; Theoretical physics; Geometry","score_opus":0.008049359027466629,"score_gpt":0.2671356654257249,"score_spread":0.2590863063982583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408423021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841712,0.00031825725,0.0023872561,0.0002943383,0.000273606,0.0001236121,0.000011996758,0.00001857678,0.012401142],"genre_scores_gemma":[0.9968477,0.0000068958716,0.0011666155,0.0012308592,0.00010774405,0.000005814897,0.00007204329,0.000006459601,0.00055585033],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919236,0.000068739384,0.00020582158,0.0002693003,0.00009475555,0.00016903754],"domain_scores_gemma":[0.9995458,0.000035163946,0.00007705179,0.00024367486,0.00006479428,0.000033485518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019755319,0.00012388188,0.00015670902,0.00008834153,0.000058155845,0.00001238042,0.0001592011,0.00019169503,0.000011519069],"category_scores_gemma":[0.00023476362,0.00009929846,0.00011363181,0.00022072534,0.000058686102,0.0000011578521,0.000062194995,0.000087790504,0.000005916634],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019309313,0.0001642064,0.012952415,0.00004754132,0.00006108139,0.0000011647242,0.000004808056,0.000034161705,0.96493506,0.00644946,0.0017635927,0.013393421],"study_design_scores_gemma":[0.0005200981,0.00045309777,0.014129493,0.000038649363,0.000016834363,4.3085626e-7,0.000027574762,0.00022803438,0.97768015,0.00032136161,0.0064568506,0.00012740774],"about_ca_topic_score_codex":0.0000091660595,"about_ca_topic_score_gemma":0.0000027134452,"teacher_disagreement_score":0.013266013,"about_ca_system_score_codex":0.000012719645,"about_ca_system_score_gemma":0.00006669721,"threshold_uncertainty_score":0.40492734},"labels":[],"label_agreement":null},{"id":"W4408457615","doi":"10.1007/978-3-031-78701-0","title":"Restarting Automata","year":2025,"lang":"en","type":"book","venue":"Theory and applications of computability","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Universität Kassel; Deutsche Forschungsgemeinschaft; Univerzita Karlova v Praze","keywords":"Computer science; Automaton; Programming language; Theoretical computer science","score_opus":0.007007135263758607,"score_gpt":0.2624575927037357,"score_spread":0.2554504574399771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408457615","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09227963,0.0046332134,0.1495477,0.0001475418,0.000112221875,0.0017410357,0.00026446336,0.00014010022,0.7511341],"genre_scores_gemma":[0.83175915,0.00019532772,0.002722835,0.00028796116,0.0005704432,0.00008289834,0.00079805334,0.000024281906,0.16355903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990359,0.00012861956,0.0002917201,0.00037787127,0.000056259643,0.000109641085],"domain_scores_gemma":[0.9990145,0.00020762425,0.0001533502,0.0005018109,0.00008483117,0.00003787956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081474753,0.00014644691,0.0002303874,0.000027159156,0.000090541354,0.000009405765,0.00024321706,0.0002259637,0.000009655526],"category_scores_gemma":[0.0000943514,0.00012774678,0.00008491553,0.000044962075,0.00029492754,9.4250794e-7,0.0003750148,0.00012623765,0.0000018667965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030567762,0.0002905438,0.0004504483,0.0009729296,0.00017356525,4.1831353e-7,0.000033233107,0.000093837545,0.009929944,0.5564482,0.004692096,0.4266091],"study_design_scores_gemma":[0.0002613248,0.00018966242,0.0006852952,0.00010865587,0.00007036158,0.0000035168082,0.000019018189,0.0000907218,0.0042678723,0.5723245,0.421645,0.00033406084],"about_ca_topic_score_codex":9.413755e-7,"about_ca_topic_score_gemma":7.6951335e-7,"teacher_disagreement_score":0.73947954,"about_ca_system_score_codex":0.000008603147,"about_ca_system_score_gemma":0.000115327275,"threshold_uncertainty_score":0.5209363},"labels":[],"label_agreement":null},{"id":"W4408582142","doi":"10.1007/s10623-025-01612-0","title":"Sequences, codes, and Boolean functions: in memory of Kai-Uwe Schmidt","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Boolean function; Discrete mathematics; Cryptography; Arithmetic; Algorithm","score_opus":0.014378925083762921,"score_gpt":0.25192530533287666,"score_spread":0.23754638024911373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408582142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803815,0.007861736,0.008736621,0.00007660353,0.0000520668,0.00014684808,0.000017701592,0.000011405714,0.0027155022],"genre_scores_gemma":[0.9965729,0.000917312,0.0021122536,0.0002470839,0.00002711909,0.00001038806,0.000039901166,0.0000042562574,0.00006876781],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991983,0.00007380249,0.00020475463,0.0002980661,0.0000528531,0.00017219633],"domain_scores_gemma":[0.99969006,0.000034251174,0.000052458603,0.00013609821,0.00004272562,0.00004439836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023813015,0.00012714372,0.00018108323,0.0001282026,0.0000793762,0.000024419225,0.0000893017,0.00013365157,0.000006455409],"category_scores_gemma":[0.00003295651,0.0001034379,0.0000615343,0.0002724413,0.00023333776,0.000003605996,0.00008145388,0.00008299023,3.085303e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020282937,0.00012861095,0.15291804,0.00013042617,0.00012660012,0.0000061696574,0.00004666623,0.00003800582,0.798987,0.0054655033,0.0010491756,0.040901024],"study_design_scores_gemma":[0.0066201356,0.0048663137,0.37639633,0.0010781541,0.00033687567,0.00006268225,0.004222021,0.0014159376,0.4726448,0.03428716,0.09576464,0.002304962],"about_ca_topic_score_codex":0.0000686606,"about_ca_topic_score_gemma":0.00005433494,"teacher_disagreement_score":0.32634217,"about_ca_system_score_codex":0.0000027757008,"about_ca_system_score_gemma":0.000027585718,"threshold_uncertainty_score":0.42180753},"labels":[],"label_agreement":null},{"id":"W4409000114","doi":"10.21203/rs.3.rs-6247846/v1","title":"FullSynesth: Syntenic Reconciliation of a Set of Consistent Gene Trees","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Synteny; Set (abstract data type); Gene; Tree (set theory); Combinatorics; Biology; Genetics; Mathematics; Computational biology; Computer science; Genome; Programming language","score_opus":0.09989811910419988,"score_gpt":0.4004076278736275,"score_spread":0.3005095087694276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409000114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939731,0.0029411998,0.0002590795,0.0001879253,0.00012146073,0.0004814656,0.0004006419,0.000009069319,0.0016261043],"genre_scores_gemma":[0.99712795,0.0007803346,0.0005342957,0.000016298109,0.00014535994,0.000033770906,0.00065695425,0.0000073268234,0.0006976808],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798334,0.00045875213,0.00043685143,0.00048646147,0.0003477242,0.0002868597],"domain_scores_gemma":[0.99809736,0.0001476425,0.00018837939,0.00056905806,0.00093476556,0.00006281454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011643706,0.00015869815,0.00035613726,0.00014261677,0.000050041817,0.000013735758,0.00041136565,0.00046803636,0.000023967777],"category_scores_gemma":[0.0010183363,0.00013113573,0.0002601861,0.00017210173,0.00020993878,9.3205335e-7,0.001268079,0.0003750575,0.0000022201882],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045274923,0.00022092559,0.017449917,0.0025030398,0.0003476769,0.000008961456,0.000112528796,0.00071209145,0.95527387,0.0002696675,0.0019214159,0.020727182],"study_design_scores_gemma":[0.00073644205,0.0018731023,0.023654448,0.0015937068,0.000055934568,0.0000072451203,0.0004391077,0.0009052427,0.9598457,0.001085807,0.009375788,0.00042747232],"about_ca_topic_score_codex":0.00012151694,"about_ca_topic_score_gemma":0.000060860075,"teacher_disagreement_score":0.020299708,"about_ca_system_score_codex":0.000036027475,"about_ca_system_score_gemma":0.00044798595,"threshold_uncertainty_score":0.534756},"labels":[],"label_agreement":null},{"id":"W4409049934","doi":"10.1109/jiot.2025.3556909","title":"A Novel Lightweight Joint Source-Channel Coding Design in Semantic Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"Science and Technology Development Fund","keywords":"Computer science; Channel code; Joint (building); Coding (social sciences); Computer network; Decoding methods; Computer architecture; Telecommunications","score_opus":0.04330609092483039,"score_gpt":0.2808790238658866,"score_spread":0.2375729329410562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409049934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39275694,0.0005582108,0.6047589,0.000582536,0.00029367371,0.00008285553,6.2566346e-7,0.000007675446,0.00095855404],"genre_scores_gemma":[0.9890081,0.00012082477,0.009638343,0.0004963607,0.00007146801,0.0000023138464,0.0000027430108,0.000007073776,0.00065275526],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902374,0.00010824246,0.00043498722,0.00015856326,0.00008290423,0.00019157291],"domain_scores_gemma":[0.9993568,0.00005671749,0.00021022437,0.00023441922,0.000097427364,0.00004439524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007129,0.00011539356,0.00019245142,0.00012402982,0.000064618216,0.000047033576,0.00057456776,0.00012525571,0.00000583528],"category_scores_gemma":[0.00019072305,0.00009195854,0.00012204434,0.00010239961,0.00008670919,0.000007071387,0.0002645315,0.00032158298,0.0000020822517],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006596232,0.00014503233,0.00064541516,0.000020011415,0.00007619855,0.0000037682719,0.0003260949,0.00045806385,0.995021,0.00017082736,0.0014585834,0.0016090544],"study_design_scores_gemma":[0.001260993,0.00049589947,0.0011911581,0.0010436868,0.00004171486,0.00027075165,0.00025128864,0.046038058,0.9416295,0.001706853,0.005759426,0.00031062585],"about_ca_topic_score_codex":0.000040828938,"about_ca_topic_score_gemma":0.0000054872207,"teacher_disagreement_score":0.5962512,"about_ca_system_score_codex":0.000025411886,"about_ca_system_score_gemma":0.000048049693,"threshold_uncertainty_score":0.37499604},"labels":[],"label_agreement":null},{"id":"W4410258353","doi":"10.1007/s10623-025-01627-7","title":"On the coding capacity of reverse-complement and palindromic duplication-correcting codes","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Ben-Gurion University of the Negev; National Science Foundation","keywords":"Mathematics; Palindrome; Complement (music); Coding (social sciences); Combinatorics; Discrete mathematics; Arithmetic; Statistics; Genetics","score_opus":0.031171073131005093,"score_gpt":0.26220500117402756,"score_spread":0.23103392804302247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410258353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787259,0.00030821477,0.019785414,0.000204242,0.00003927122,0.0001638584,0.000011916685,0.000008185184,0.00075299654],"genre_scores_gemma":[0.99802023,0.00018719948,0.0012747674,0.00046158335,0.000019570765,0.000011348315,0.000011828676,0.0000033972933,0.000010056796],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993356,0.000096862605,0.00015986065,0.00022958628,0.00004955617,0.00012854337],"domain_scores_gemma":[0.99953055,0.00018127538,0.0000734783,0.00014682447,0.000041087067,0.000026776808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037729682,0.000103513,0.00012660827,0.00004452968,0.00023075879,0.00002590026,0.000094001894,0.00006193534,0.0000056415533],"category_scores_gemma":[0.000083555184,0.000068505025,0.000059756505,0.00012617122,0.00014805928,0.0000014814444,0.000068326975,0.00008031239,1.8619225e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096557225,0.00007015165,0.042465705,0.000063129075,0.0001481564,4.785672e-7,0.00011738469,0.000017802338,0.8798213,0.06672415,0.0012045415,0.009270615],"study_design_scores_gemma":[0.0014947216,0.0015055512,0.09067549,0.00045371856,0.00017189521,0.00002165873,0.0022553445,0.0017093446,0.86060625,0.030466998,0.009874951,0.0007640865],"about_ca_topic_score_codex":0.000029870282,"about_ca_topic_score_gemma":0.0000096901485,"teacher_disagreement_score":0.048209783,"about_ca_system_score_codex":0.000002420046,"about_ca_system_score_gemma":0.0000084557305,"threshold_uncertainty_score":0.2793554},"labels":[],"label_agreement":null},{"id":"W4411113401","doi":"10.18653/v1/2025.cmcl-1.11","title":"Unzipping the Causality of Zipf’s Law and Other Lexical Trade-offs","year":2025,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Zipf's law; Causality (physics); Computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.018749210923643414,"score_gpt":0.2815976880776964,"score_spread":0.262848477154053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411113401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9118623,0.00048689562,0.0018922222,0.001227311,0.000058867383,0.00008191354,0.0000035345863,0.000009598279,0.08437737],"genre_scores_gemma":[0.9951257,0.000009192258,0.00016974522,0.0042465054,0.000042760297,0.0000012654631,0.0000025328425,0.0000019395195,0.0004003435],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995829,0.000048540962,0.00010750812,0.00013885323,0.00003009282,0.000092139715],"domain_scores_gemma":[0.9998053,0.000025296991,0.000020958381,0.00012256308,0.000009417938,0.00001651982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016054093,0.000056748264,0.00007487773,0.000005120852,0.000057276793,0.00000873708,0.00008799396,0.00007781696,0.0000104195105],"category_scores_gemma":[0.000027496995,0.000030535914,0.000037074256,0.000038329217,0.0001573035,4.951623e-7,0.00010080115,0.000046577075,4.0867855e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057835012,0.00006178309,0.01756065,0.000031537533,0.00007610801,5.9060727e-7,0.000027303895,0.0000060968623,0.7958629,0.17831194,0.0013221734,0.006681058],"study_design_scores_gemma":[0.00051715766,0.00026386708,0.026886346,0.000030990097,0.000029951349,0.000006594171,0.0001819069,0.00021622636,0.61017656,0.00442692,0.35705417,0.00020931999],"about_ca_topic_score_codex":0.00006354276,"about_ca_topic_score_gemma":0.000051097944,"teacher_disagreement_score":0.355732,"about_ca_system_score_codex":0.0000015549878,"about_ca_system_score_gemma":0.000010464767,"threshold_uncertainty_score":0.12452184},"labels":[],"label_agreement":null},{"id":"W4411330187","doi":"10.1007/s11047-025-10024-x","title":"Inductive inference of Lindenmayer systems: algorithms and computational complexity","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Theory of computation; Computer science; Algorithm; Inference; Computational complexity theory; Theoretical computer science; Artificial intelligence","score_opus":0.02763257918964659,"score_gpt":0.3179028382026179,"score_spread":0.2902702590129713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411330187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9725614,0.0014261575,0.024709785,0.00006188647,0.00031822367,0.00012668347,0.0000056737235,0.00001661486,0.00077356084],"genre_scores_gemma":[0.9926212,0.0000055380583,0.007007459,0.00013597985,0.00011527048,7.950125e-7,0.00003982741,0.0000035618648,0.000070393],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913555,0.00008646806,0.0002454381,0.00027973007,0.00009445861,0.00015834488],"domain_scores_gemma":[0.9994481,0.000108312575,0.000112548725,0.00009440584,0.00020697976,0.000029615276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020432752,0.00011892924,0.0001847899,0.00004644238,0.000113247974,0.000026916829,0.0001378641,0.00011914542,9.97942e-7],"category_scores_gemma":[0.00016258872,0.00009708813,0.000043842687,0.00013863054,0.0001585765,0.000003144871,0.000319312,0.00017736138,5.9983836e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043641427,0.00042467963,0.24175179,0.00081169803,0.00090135,0.000014483763,0.00054640573,0.02728263,0.3727562,0.0761744,0.0014090572,0.27749088],"study_design_scores_gemma":[0.0025574018,0.000723726,0.42652318,0.00058483286,0.00006667987,0.000047034697,0.0007919646,0.5303654,0.02555134,0.008646535,0.0031618774,0.0009800062],"about_ca_topic_score_codex":0.000034197714,"about_ca_topic_score_gemma":0.0000023913985,"teacher_disagreement_score":0.5030828,"about_ca_system_score_codex":0.000010558141,"about_ca_system_score_gemma":0.000041993328,"threshold_uncertainty_score":0.3959139},"labels":[],"label_agreement":null},{"id":"W4412171603","doi":"10.1109/tc.2025.3587623","title":"A High-Efficiency Parallel Mechanism for Canonical Polyadic Decomposition on Heterogeneous Computing Platform","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Decomposition; Mechanism (biology); Supercomputer; Computational science; Theoretical computer science; Distributed computing; Chemistry; Physics","score_opus":0.013915366902260548,"score_gpt":0.2733420441649771,"score_spread":0.25942667726271657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412171603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3531983,0.000015625905,0.6453133,0.00016954559,0.00090981316,0.00026318748,0.000017016195,0.000048611128,0.000064604596],"genre_scores_gemma":[0.98540944,0.00001232144,0.012153876,0.002151757,0.00012503554,0.00002415175,0.000037656562,0.0000146409975,0.00007111535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986997,0.00004358998,0.00028448654,0.0005121974,0.000106146326,0.00035384644],"domain_scores_gemma":[0.99943185,0.00011727521,0.00006524263,0.00024059723,0.00006271385,0.00008230819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011614411,0.00022708456,0.00020746734,0.00010420425,0.00036768918,0.000045925164,0.00024542268,0.00019599451,0.0000037196723],"category_scores_gemma":[0.0000053551626,0.00020396685,0.00023263191,0.00012753304,0.000052819254,0.0000031896734,0.000007149291,0.00015896796,0.0000065158074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012983885,0.0011538037,0.000011699101,0.00006405034,0.00037139672,0.000014520973,0.000049297254,0.690864,0.1749675,0.007510837,0.00071213563,0.12298232],"study_design_scores_gemma":[0.004050322,0.0055951565,0.00010279735,0.00024930155,0.00010859498,0.000055386787,0.000031614047,0.2633213,0.722951,0.0015645832,0.0011060046,0.00086392567],"about_ca_topic_score_codex":0.000020965643,"about_ca_topic_score_gemma":0.000017447634,"teacher_disagreement_score":0.6331594,"about_ca_system_score_codex":0.000055416967,"about_ca_system_score_gemma":0.000057718746,"threshold_uncertainty_score":0.83175266},"labels":[],"label_agreement":null},{"id":"W4412302916","doi":"","title":"Rationalizing design of genosensors exploiting electric properties of DNA","year":2015,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"iNano Medical (Canada)","funders":"","keywords":"DNA; Computational biology; Computer science; Biology; Genetics","score_opus":0.10038099925832686,"score_gpt":0.2535026034557987,"score_spread":0.15312160419747187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412302916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821056,0.00058451545,0.016028594,0.000020413498,0.000021029351,0.00008219794,3.5535456e-7,0.000007060849,0.0011501928],"genre_scores_gemma":[0.9954685,0.000014791893,0.004271394,0.00005316881,0.000059870978,0.0000023391776,0.0000045544607,0.000004374532,0.00012098858],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945706,0.000064367276,0.00018027764,0.00011607535,0.00007923659,0.00010296552],"domain_scores_gemma":[0.9996577,0.000010129758,0.00007873355,0.000079404315,0.00014378177,0.000030265002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024428687,0.000059830927,0.0000960706,0.000021221202,0.000017615212,0.0000036505812,0.0000815353,0.000052935775,0.000003362918],"category_scores_gemma":[0.00022822616,0.000041014453,0.000033964374,0.0000694477,0.000029391178,0.0000015701545,0.00004814948,0.000022527092,0.0000011899891],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041968604,0.000021506929,0.0005911866,0.000008763839,0.0000126581745,2.1241473e-7,0.000029264957,0.00049714744,0.9978656,0.00013075297,0.00011965539,0.0006812597],"study_design_scores_gemma":[0.00014184306,0.00029662476,0.000100261495,0.0000091153,0.000004020808,0.0000027793062,0.000141454,0.0008565148,0.99807525,0.000075968186,0.00023370307,0.000062443214],"about_ca_topic_score_codex":0.000007403539,"about_ca_topic_score_gemma":3.8868154e-7,"teacher_disagreement_score":0.013362876,"about_ca_system_score_codex":0.0000037701948,"about_ca_system_score_gemma":0.000051635096,"threshold_uncertainty_score":0.1672521},"labels":[],"label_agreement":null},{"id":"W4413145102","doi":"10.1109/ipdpsw66978.2025.00026","title":"RAAP-CGRA: Placement for CGRAs with Restricted Routing Architectures","year":2025,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Routing (electronic design automation); Computer architecture; Embedded system","score_opus":0.008757699840040958,"score_gpt":0.25810582723664316,"score_spread":0.2493481273966022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413145102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9031083,0.00013860845,0.08589008,0.0003547555,0.00006991524,0.0003381167,0.0000062660506,0.000037791102,0.010056158],"genre_scores_gemma":[0.9907125,0.000004322218,0.006123173,0.000754097,0.000099041805,0.000025512336,0.00007374637,0.000005572094,0.0022020012],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993029,0.000024964122,0.00012774229,0.00027811446,0.000047362755,0.00021886517],"domain_scores_gemma":[0.9996982,0.000038689755,0.000035757694,0.00014662286,0.000049176215,0.00003151432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085736676,0.000111570465,0.00009911678,0.000028855393,0.00010849065,0.000022497321,0.0001236402,0.00008020307,0.0000053754557],"category_scores_gemma":[0.00009781692,0.000068632886,0.000054153403,0.000099169796,0.00003617899,3.623862e-7,0.00009374446,0.000052281666,6.9561423e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014287501,0.00016998187,0.028483653,0.00006713688,0.00029830998,0.0000035789453,0.000027568962,0.0017947438,0.91775626,0.0047761905,0.010593816,0.03459998],"study_design_scores_gemma":[0.0038884287,0.0030916543,0.031104974,0.00010345836,0.00008555058,0.000011442309,0.0002977213,0.0020556473,0.8051996,0.0012147377,0.15223694,0.00070981414],"about_ca_topic_score_codex":0.000009837228,"about_ca_topic_score_gemma":0.000038048514,"teacher_disagreement_score":0.14164314,"about_ca_system_score_codex":0.0000066093007,"about_ca_system_score_gemma":0.00003866532,"threshold_uncertainty_score":0.2798768},"labels":[],"label_agreement":null},{"id":"W4413822112","doi":"10.1109/jiot.2025.3603982","title":"An Efficient Paillier Homomorphic Encryption Circuit With Optional CRT Acceleration for IoT","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Beijing Municipal Natural Science Foundation; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Chongqing","keywords":"Homomorphic encryption; Computer science; Paillier cryptosystem; Acceleration; Encryption; Computer network; Public-key cryptography; Hybrid cryptosystem","score_opus":0.017882119829821956,"score_gpt":0.27369389926008425,"score_spread":0.2558117794302623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413822112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71385014,0.00007133592,0.28550416,0.00008928552,0.00023298239,0.000082129474,0.000001793686,0.000007199305,0.00016096911],"genre_scores_gemma":[0.99494183,0.000008169577,0.0042734994,0.00030556205,0.00025896658,0.0000051397474,0.000018481172,0.000007659561,0.0001807063],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992725,0.00004371111,0.00024325027,0.00018467745,0.00011320118,0.00014262019],"domain_scores_gemma":[0.99943817,0.000017628416,0.0001668127,0.000092199865,0.00023904403,0.000046136363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003891546,0.000099169825,0.000115077986,0.000057746016,0.000076501135,0.00006677686,0.00020462414,0.00010731415,0.00001491421],"category_scores_gemma":[0.000043461332,0.00007117705,0.00008647096,0.000047917558,0.00005424615,0.000006242996,0.000022602797,0.0001292099,0.000001038521],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032867873,0.00019437408,0.0023601078,0.000022401782,0.00008862786,0.0000020939653,0.000093625305,0.0067589856,0.9834368,0.00069155276,0.0006038171,0.005418929],"study_design_scores_gemma":[0.0023061528,0.0039516636,0.00811299,0.00032089924,0.00008157679,0.00023081925,0.0001036078,0.051458,0.92676985,0.0024113508,0.003863348,0.00038975384],"about_ca_topic_score_codex":0.000004141858,"about_ca_topic_score_gemma":0.000001528313,"teacher_disagreement_score":0.28123066,"about_ca_system_score_codex":0.000020824851,"about_ca_system_score_gemma":0.0000674446,"threshold_uncertainty_score":0.29025158},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.07353448083784425,"score_gpt":0.32041684093153705,"score_spread":0.2468823600936928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414008559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42060703,0.23720719,0.022538284,0.13568276,0.00062271627,0.0010319579,0.00010212068,0.00016740912,0.18204053],"genre_scores_gemma":[0.9821323,0.011725507,0.0011158688,0.002548933,0.000077719305,0.000028070985,0.00007243254,0.000006733228,0.0022924368],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993427,0.0001380661,0.00014624056,0.00017463404,0.000046287245,0.0001521044],"domain_scores_gemma":[0.99873036,0.00005843576,0.000034175595,0.001059768,0.000073097646,0.00004416488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003862409,0.000094005256,0.000092789225,0.00003655988,0.00025336872,0.000037948677,0.0006459272,0.00007020657,0.0000026629066],"category_scores_gemma":[0.000055327928,0.000065795844,0.000033531873,0.00006592144,0.00007908665,0.0000052013434,0.00082396663,0.00011482182,0.000008540768],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008484564,0.0005031265,0.00013642748,0.000084308296,0.00018928829,0.0000048906063,0.0029029294,0.00028544036,0.2066657,0.10107618,0.08423532,0.6038316],"study_design_scores_gemma":[0.00025482482,0.0001063467,0.0012723038,0.000053425105,0.00001807917,0.0000053752233,0.0010266784,0.0021291904,0.0012735528,0.0011074989,0.99259174,0.00016096208],"about_ca_topic_score_codex":0.0000056011986,"about_ca_topic_score_gemma":0.00019330654,"teacher_disagreement_score":0.9083564,"about_ca_system_score_codex":0.0000058849187,"about_ca_system_score_gemma":0.000023698261,"threshold_uncertainty_score":0.2683077},"labels":[],"label_agreement":null},{"id":"W4414106964","doi":"10.1016/j.csbj.2025.09.002","title":"Pantheon-DNA: Versatile encoding-decoding system with integrated adaptive NGS preprocessing algorithms for DNA data storage","year":2025,"lang":"en","type":"article","venue":"Computational and Structural Biotechnology Journal","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Lenovo Group; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Preprocessor; Pipeline (software); Decodes; Scalability; Cluster analysis; Robustness (evolution); Error detection and correction; Indel; DNA sequencing","score_opus":0.023379015716740427,"score_gpt":0.2755321386105961,"score_spread":0.25215312289385566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414106964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6479389,0.00054064963,0.35052016,0.00049720844,0.00018365198,0.0001484678,0.000053551114,0.00005584577,0.00006156253],"genre_scores_gemma":[0.96837753,0.000019370007,0.031192038,0.00009945402,0.0001223084,0.000003736857,0.00014476971,0.000008976459,0.00003179574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890625,0.00004546339,0.00026307668,0.00045833839,0.00008733842,0.00023952487],"domain_scores_gemma":[0.9993543,0.000069018184,0.00017992358,0.00015969979,0.00018604416,0.00005102811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023946015,0.00018357097,0.000211418,0.000101678444,0.00052027183,0.00008978701,0.00037239154,0.0002549541,0.0000024495303],"category_scores_gemma":[0.000107580825,0.00012260216,0.000040466322,0.00015129382,0.0002441868,0.000017598662,0.00027469927,0.00025453258,4.080328e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035457069,0.000116561845,0.010108801,0.0005485811,0.0022470462,0.0001382766,0.00032486737,0.023627099,0.32638484,0.035230864,0.0032927084,0.5944347],"study_design_scores_gemma":[0.003426964,0.00174962,0.0069811433,0.00062222115,0.00016009368,0.00187465,0.0029673667,0.92609215,0.04325092,0.008782611,0.003285985,0.0008062974],"about_ca_topic_score_codex":0.0000027049525,"about_ca_topic_score_gemma":0.0000026821808,"teacher_disagreement_score":0.90246505,"about_ca_system_score_codex":0.000036688998,"about_ca_system_score_gemma":0.00013189783,"threshold_uncertainty_score":0.49995708},"labels":[],"label_agreement":null},{"id":"W4414231326","doi":"10.1109/istc65386.2025.11154509","title":"Automorphism Ensemble Decoding of Polar Codes with Reduced Number of Routes","year":2025,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Automorphism; Equivalence (formal languages); List decoding; Quadratic equation; Polar; Reduction (mathematics)","score_opus":0.009991168734048783,"score_gpt":0.267928091836198,"score_spread":0.2579369231021492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414231326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9706203,0.00012394709,0.0043746587,0.00006443866,0.0000306366,0.000054475062,0.000003875908,0.000009471627,0.024718223],"genre_scores_gemma":[0.9911984,0.000015676405,0.007526449,0.00010843349,0.00001793173,0.0000013103373,0.000016583812,0.0000033950773,0.0011118177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950415,0.000025504518,0.00015951434,0.00015435691,0.000046057114,0.00011042405],"domain_scores_gemma":[0.9996774,0.000021916014,0.00006482349,0.00013797986,0.00007850357,0.000019329338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009796304,0.00007462879,0.00014452734,0.000016907405,0.000025717054,0.000004343453,0.00010541517,0.000079040095,0.000022332544],"category_scores_gemma":[0.000047776826,0.000049495855,0.000047218215,0.00008746035,0.00006788804,0.0000010491925,0.00008075487,0.000033415203,9.721945e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052793108,0.000037095924,0.039665394,0.000021110773,0.000048794856,5.4259436e-7,0.000006417681,0.000009767335,0.9560457,0.0021250853,0.00030184325,0.0016854684],"study_design_scores_gemma":[0.0002460884,0.00013996032,0.0052862135,0.00003397727,0.000012384044,0.000004130698,0.00004554238,0.00009224076,0.9929544,0.00023731124,0.00087465864,0.00007311689],"about_ca_topic_score_codex":0.000040504387,"about_ca_topic_score_gemma":0.000010384583,"teacher_disagreement_score":0.03690869,"about_ca_system_score_codex":0.0000030033261,"about_ca_system_score_gemma":0.000038824906,"threshold_uncertainty_score":0.20183824},"labels":[],"label_agreement":null},{"id":"W4414234929","doi":"10.1145/3767145.3767151","title":"SIGACT News Complexity Theory Column 126 <b>Locally Decodable Codes for Insertions and Deletions</b>","year":2025,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Hamming distance; Synchronization (alternating current); Hamming code; List decoding; Key (lock); Hamming weight","score_opus":0.03030504865872188,"score_gpt":0.3013024295391453,"score_spread":0.27099738088042347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414234929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94792205,0.00095691666,0.045425583,0.0017112994,0.00017551039,0.0005595532,0.000060884253,0.00005689834,0.0031312774],"genre_scores_gemma":[0.9860619,0.00021282831,0.008141644,0.0038082364,0.00015548259,0.00006257172,0.00021713048,0.000014523736,0.0013257032],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871504,0.00013481414,0.00029144334,0.00045626226,0.00006382035,0.0003386365],"domain_scores_gemma":[0.99894327,0.00029580266,0.000083861996,0.0004660973,0.00010990603,0.00010105647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002976882,0.00019776977,0.00024388643,0.000043769953,0.00036837245,0.00008017814,0.00035886635,0.00021318423,0.000024942325],"category_scores_gemma":[0.0010601006,0.00016660949,0.00013367027,0.00013643528,0.00019916824,0.0000068696354,0.00034706647,0.00011718808,0.0000060448624],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009930336,0.00045819214,0.035700258,0.00012751334,0.0003007415,0.0000039986494,0.0000665634,0.000090994894,0.8184454,0.019846786,0.032833748,0.0911328],"study_design_scores_gemma":[0.003655486,0.0021619708,0.050035916,0.00014474826,0.00021973377,0.000024614921,0.00071179157,0.0011100951,0.1593337,0.1241583,0.6572345,0.0012091682],"about_ca_topic_score_codex":0.00012139821,"about_ca_topic_score_gemma":0.0006405098,"teacher_disagreement_score":0.6591117,"about_ca_system_score_codex":0.000018201885,"about_ca_system_score_gemma":0.00010624156,"threshold_uncertainty_score":0.6794138},"labels":[],"label_agreement":null},{"id":"W4414684356","doi":"10.46298/theoretics.25.20","title":"Randomized Communication and Implicit Graph Representations","year":2025,"lang":"en","type":"article","venue":"TheoretiCS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Waterloo","keywords":"Adjacency list; Cartesian product; Graph; Probabilistic logic; Randomized algorithm; Adjacency matrix; Perspective (graphical)","score_opus":0.007706268266125669,"score_gpt":0.2894070737007912,"score_spread":0.2817008054346655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414684356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933493,0.0016291627,0.017974485,0.0006838997,0.00004313936,0.000206268,0.0000031375569,0.000018793819,0.04594807],"genre_scores_gemma":[0.9972296,0.00064728374,0.0012799448,0.0003798582,0.000017786642,0.000010082945,0.00004571854,0.0000027640817,0.00038695626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995024,0.00015801903,0.00011903678,0.000119968696,0.000024349583,0.0000761801],"domain_scores_gemma":[0.9995784,0.000099721234,0.00003299732,0.00023340531,0.000037357633,0.000018081484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032144765,0.000055444965,0.00010621286,0.000020363283,0.00008650336,0.000017970777,0.00010629596,0.000060518087,0.0000058966416],"category_scores_gemma":[0.00022444571,0.000041405165,0.00004546392,0.000060379658,0.00030722254,7.1504e-7,0.0001514987,0.000044827466,9.835762e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028495966,0.00003031772,0.0012118444,0.000010728273,0.00007545652,2.5524457e-7,0.000059269874,0.000018991259,0.08237702,0.9081301,0.00075958966,0.004476839],"study_design_scores_gemma":[0.04782649,0.000117604985,0.002505345,0.000049063125,0.00012843937,0.00000844928,0.00029872463,0.0009747921,0.09395612,0.84718007,0.006644854,0.00031004244],"about_ca_topic_score_codex":0.00000496171,"about_ca_topic_score_gemma":0.0000013992274,"teacher_disagreement_score":0.06373656,"about_ca_system_score_codex":0.0000015407262,"about_ca_system_score_gemma":0.0000078665735,"threshold_uncertainty_score":0.16884536},"labels":[],"label_agreement":null},{"id":"W4415257998","doi":"10.61091/jcmcc127-22","title":"Diffie-Hellman key exchange on the Heisenberg group","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key exchange; Cryptography; Fibonacci number; Sequence (biology); Parameterized complexity; Simple (philosophy); Key (lock)","score_opus":0.01352453096487629,"score_gpt":0.251274929445359,"score_spread":0.2377503984804827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415257998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94292915,0.006116588,0.0029439847,0.002007648,0.03406196,0.000770768,0.000007884685,0.000024830371,0.011137171],"genre_scores_gemma":[0.99335814,0.0008543578,0.00057826797,0.0005108924,0.0045335,0.0000035610792,0.000005477527,0.000047580597,0.00010824398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953463,0.0005916136,0.001959133,0.00059879106,0.000734559,0.0007695708],"domain_scores_gemma":[0.99517554,0.001431945,0.0017625792,0.000661499,0.00069099426,0.00027744175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003425848,0.0007493342,0.0012562663,0.00022649937,0.0009260994,0.00050275197,0.0012203152,0.00068364874,0.000019280145],"category_scores_gemma":[0.001570233,0.0005133574,0.0006370563,0.0005414358,0.00038347297,0.000019589435,0.0011724088,0.0012374385,0.0000052739824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084145606,0.0024413231,0.00037395925,0.0006868655,0.00095630484,0.000049596012,0.00064063084,0.000036480236,0.010382154,0.96390396,0.004870476,0.014816802],"study_design_scores_gemma":[0.018524002,0.014428108,0.00070268824,0.005317506,0.0011631371,0.00021832802,0.0022254584,0.0065545165,0.016208936,0.7460632,0.18627824,0.0023158866],"about_ca_topic_score_codex":0.0000055906935,"about_ca_topic_score_gemma":7.9716597e-7,"teacher_disagreement_score":0.21784076,"about_ca_system_score_codex":0.000105508494,"about_ca_system_score_gemma":0.00024199004,"threshold_uncertainty_score":0.9997318},"labels":[],"label_agreement":null},{"id":"W4415368361","doi":"10.1109/tit.2025.3623202","title":"A Combinatorial Perspective on Random Access Efficiency for DNA Storage","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Technion-Israel Institute of Technology; Università degli Studi di Trento; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Technische Universität München; Technische Universiteit Eindhoven; The Research Council; University College Dublin; Nanyang Technological University; European Commission; California Institute of Technology; University of Toronto; Division of Mathematical Sciences; Villum Fonden; National Science Foundation","keywords":"Generator matrix; Intersection (aeronautics); Random access; Generator (circuit theory); Matrix (chemical analysis); Construct (python library); Perspective (graphical); Code (set theory); Decoding methods","score_opus":0.008284200055821738,"score_gpt":0.2803560336089018,"score_spread":0.27207183355308007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415368361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0770505,0.000020057785,0.9077438,0.00012497918,0.0012726531,0.00045339836,0.000042640557,0.000038446447,0.013253536],"genre_scores_gemma":[0.998619,0.000011921808,0.00004751802,0.0009157856,0.00006147842,0.000075339616,0.000022751181,0.0000038489443,0.00024234672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993792,0.00007126666,0.0001935187,0.00013901744,0.00007559198,0.00014141518],"domain_scores_gemma":[0.999486,0.00012725279,0.000063841944,0.00015507496,0.00013795849,0.000029841998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032463195,0.00011362316,0.000105668674,0.0001058629,0.00025199592,0.00006031547,0.00018594183,0.00012441303,0.000017754504],"category_scores_gemma":[0.00006581227,0.00009182805,0.00012967136,0.0001278082,0.00005545737,0.000020141677,0.0000030274155,0.000102365884,0.000012706329],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.034732886,0.0019054202,0.0000160346,0.00025775563,0.0007386239,0.0000011683076,0.0021850776,0.08892106,0.05419199,0.6173951,0.004838563,0.19481629],"study_design_scores_gemma":[0.015737565,0.0031757925,0.0001590862,0.00013423189,0.00012243648,0.0000036301828,0.002292805,0.005534505,0.88482827,0.050155353,0.037097394,0.00075893104],"about_ca_topic_score_codex":0.0000022739562,"about_ca_topic_score_gemma":7.7567046e-7,"teacher_disagreement_score":0.9215685,"about_ca_system_score_codex":0.00004635668,"about_ca_system_score_gemma":0.000056831268,"threshold_uncertainty_score":0.37446392},"labels":[],"label_agreement":null},{"id":"W4416033842","doi":"10.18653/v1/2025.mathnlp-main.11","title":"Logically Constrained Decoding","year":2025,"lang":"","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Resolution (logic); Implementation; Encoding (memory); Propositional variable; Constraint (computer-aided design); Propositional calculus","score_opus":0.01116208968923412,"score_gpt":0.27538501560236595,"score_spread":0.26422292591313185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416033842","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30848128,0.0026947393,0.06490101,0.0020738235,0.00082558626,0.00030502432,0.00000997126,0.000048646303,0.62065995],"genre_scores_gemma":[0.9796948,0.0003772952,0.0037952864,0.004217569,0.0002283799,0.0000045979614,0.000038314807,0.0000069902458,0.0116367685],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981049,0.00012201988,0.00046578635,0.00070014107,0.00008511463,0.0005220965],"domain_scores_gemma":[0.99926716,0.00006971347,0.000086460095,0.00033089216,0.00012698484,0.00011878647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034491022,0.0002946985,0.00029347496,0.00005320823,0.00022719208,0.00010044967,0.00038766212,0.00050791,0.00043000188],"category_scores_gemma":[0.00037061414,0.00022675868,0.00024498487,0.00023164779,0.00030054175,0.0000016556066,0.00053751055,0.00019207623,0.00004220387],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020328231,0.00028688772,0.010042099,0.00008269004,0.00031288888,0.000022554203,0.000009399584,0.00004156003,0.6546087,0.039282776,0.006283631,0.28882352],"study_design_scores_gemma":[0.0034762304,0.0019183942,0.0058101746,0.0003199691,0.00021059137,0.00004590117,0.00049414026,0.005055173,0.30424225,0.0064858967,0.6701937,0.0017475949],"about_ca_topic_score_codex":0.0000046093196,"about_ca_topic_score_gemma":0.000006626973,"teacher_disagreement_score":0.6712135,"about_ca_system_score_codex":0.000019258383,"about_ca_system_score_gemma":0.00018963704,"threshold_uncertainty_score":0.9246951},"labels":[],"label_agreement":null},{"id":"W4416521651","doi":"10.1021/mc-2025-vol60.ch15","title":"RECENT ADVANCES, NEW DEVELOPMENTS, AND EMERGING OPPORTUNITIES IN DNA-ENCODED LIBRARY TECHNOLOGY","year":2025,"lang":"en","type":"book-chapter","venue":"Medicinal chemistry reviews","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Centre","funders":"","keywords":"Emerging technologies; Information technology; Government (linguistics); Work (physics)","score_opus":0.03996105355206318,"score_gpt":0.27122351792389043,"score_spread":0.23126246437182724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416521651","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006353279,0.6095642,0.000055199365,0.0018390145,0.00013877603,0.00032372508,0.000011410234,0.000035675817,0.38739672],"genre_scores_gemma":[0.00010302497,0.63309216,0.0010306027,0.0007960591,0.0004272537,0.000017528728,0.00049503625,0.000022629796,0.36401567],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826413,0.00002235873,0.0006764685,0.0006317927,0.00011673544,0.00028850397],"domain_scores_gemma":[0.9992098,0.00001619113,0.00028207153,0.00032149372,0.000031785832,0.0001386283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023016229,0.0004215233,0.00068753684,0.000073952026,0.00005295036,0.000014874974,0.00033953422,0.00058712007,0.00031290684],"category_scores_gemma":[0.00016558431,0.0003397235,0.0000832926,0.000073875046,0.00016057405,0.0000054742127,0.00045812488,0.00042806586,0.0000042881766],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033444525,0.000010956309,0.00016812916,0.0007033053,0.00003255158,0.0000463259,0.0000077635605,1.2625138e-7,0.012811722,0.0002234819,0.022066291,0.9638959],"study_design_scores_gemma":[0.0002578319,0.000055907294,0.000005811744,0.0017764871,0.00003197553,0.0000406719,0.00002497844,0.0000010697324,0.008893482,0.0009245678,0.9876498,0.00033739462],"about_ca_topic_score_codex":6.68471e-7,"about_ca_topic_score_gemma":0.0000018800969,"teacher_disagreement_score":0.9655835,"about_ca_system_score_codex":0.000027145183,"about_ca_system_score_gemma":0.00032091694,"threshold_uncertainty_score":0.99990547},"labels":[],"label_agreement":null},{"id":"W4416600592","doi":"10.1149/ma2025-02361751mtgabs","title":"<i>(Invited)</i> P-Bits and Application of P-Bit-Based Ising Models to Protein Folding and Molecular Docking Problems","year":2025,"lang":"","type":"article","venue":"ECS Meeting Abstracts","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation, Science and Economic Development Canada","funders":"","keywords":"Probabilistic logic; Scalability; Protein folding; ENCODE; Computational complexity theory; Robustness (evolution); Ising model; Computation","score_opus":0.01195101476322859,"score_gpt":0.24278195820662057,"score_spread":0.23083094344339197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416600592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764006,0.004548275,0.011637997,0.0012655214,0.00007604264,0.001122647,0.000011127348,0.000030163868,0.0049076257],"genre_scores_gemma":[0.9916505,0.000050475923,0.007003296,0.0011042387,0.00007738395,0.000042883035,0.000027111475,0.000029947378,0.000014152097],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99727297,0.00013626726,0.00083061185,0.0010043842,0.00020567395,0.0005500883],"domain_scores_gemma":[0.99866253,0.00009912002,0.0004650338,0.0003721046,0.00021107687,0.00019011887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010652798,0.00040623956,0.00043948562,0.00015436331,0.00028300224,0.00013762969,0.00023459489,0.00041898896,3.4015915e-7],"category_scores_gemma":[0.0003593015,0.00040991273,0.00009809316,0.00035763584,0.0001472134,0.000013499219,0.000423256,0.00026259283,5.42156e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060839782,0.00007797913,0.00068141357,0.000537576,0.00004598948,0.0000034001378,0.00006924802,0.16923194,0.8185722,0.000048463888,0.000017172111,0.01065374],"study_design_scores_gemma":[0.00063310575,0.00031491142,0.00038805432,0.0018804274,0.000068789115,0.000004475566,0.00007842826,0.06310864,0.9304352,0.0008856493,0.0017660551,0.00043631],"about_ca_topic_score_codex":0.00014583004,"about_ca_topic_score_gemma":0.000011831359,"teacher_disagreement_score":0.11186292,"about_ca_system_score_codex":0.000029912551,"about_ca_system_score_gemma":0.00006863477,"threshold_uncertainty_score":0.99983525},"labels":[],"label_agreement":null},{"id":"W52186638","doi":"10.1007/978-3-642-23638-9_11","title":"Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Closure (psychology); Constraint (computer-aided design); Computer science; Regular language; Set (abstract data type); Property (philosophy); Kleene algebra; Discrete mathematics; Polynomial; DNA computing; Time complexity; Algorithm; Theoretical computer science; Mathematics; Programming language; Automaton","score_opus":0.02026896284138437,"score_gpt":0.24696026080827513,"score_spread":0.22669129796689075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52186638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28521326,0.0026232207,0.6968529,0.0002593157,0.0010660623,0.00069414644,0.00003831201,0.00009257558,0.013160182],"genre_scores_gemma":[0.98093444,0.000028297201,0.017549807,0.0007295392,0.00047623197,0.0000020915948,0.000039731545,0.000025779345,0.00021410952],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976004,0.00005039438,0.00036303105,0.0010970106,0.00027540556,0.00061378506],"domain_scores_gemma":[0.9989817,0.00009012693,0.00025905282,0.00048329806,0.00008019113,0.00010562028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005823411,0.00042792983,0.00046304776,0.00022202756,0.00011750589,0.00009334583,0.00090719474,0.0004890497,0.0000333943],"category_scores_gemma":[0.000099783174,0.00035477025,0.00013349816,0.00015430496,0.00065056514,0.000008432895,0.0008738823,0.00050441414,0.000009447283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025272527,0.00025650233,0.024644788,0.0002544436,0.00010695325,0.0011032751,0.0017002182,0.011236919,0.1178212,0.0011972706,0.0001241836,0.8413015],"study_design_scores_gemma":[0.009659263,0.0074709654,0.056682043,0.008365588,0.00017688534,0.0016503885,0.00007406408,0.12679207,0.6561796,0.09903701,0.019957023,0.013955099],"about_ca_topic_score_codex":0.000044447243,"about_ca_topic_score_gemma":0.00019564248,"teacher_disagreement_score":0.82734644,"about_ca_system_score_codex":0.000053181207,"about_ca_system_score_gemma":0.00015473823,"threshold_uncertainty_score":0.99989045},"labels":[],"label_agreement":null},{"id":"W54673772","doi":"10.1007/978-94-015-9634-3_36","title":"On Membrane Computing Based on Splicing","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Recursively enumerable language; RNA splicing; Membrane; Membrane computing; Recursively enumerable set; Context (archaeology); Computer science; Alternative splicing; Theoretical computer science; Mathematics; Algorithm; Biology; Gene; Genetics; RNA","score_opus":0.01685022345607474,"score_gpt":0.23809642877495715,"score_spread":0.22124620531888242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54673772","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007762046,0.000056601286,0.0021492338,0.00010798814,0.00018473719,0.00016363348,0.0000071232944,0.00005737529,0.98951125],"genre_scores_gemma":[0.70380276,0.000040296574,0.0005125586,0.0064884443,0.0009857083,9.566805e-7,0.00042513228,0.000072192626,0.28767195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986512,0.000019891853,0.0002520922,0.000632227,0.00016749025,0.00027706902],"domain_scores_gemma":[0.99927783,0.000065075255,0.00013028004,0.00039591696,0.00004405935,0.00008685403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015211244,0.00036921064,0.00028577802,0.00006209558,0.00011273481,0.000028032053,0.00023339178,0.0005263237,0.00038569103],"category_scores_gemma":[0.000039867224,0.0002790526,0.0002213867,0.000016937174,0.000051041327,3.9270768e-7,0.000120660625,0.0002913378,0.00013155625],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019456529,0.0006348238,0.00020649878,0.00035632643,0.00064715766,0.00050469936,0.000020078003,0.029443862,0.27154255,0.3686828,0.03680285,0.2892127],"study_design_scores_gemma":[0.0016947844,0.0050503775,0.00007861006,0.00090397,0.00008127658,0.000039902305,0.000007284892,0.009906158,0.05714205,0.0031712158,0.91967136,0.0022529995],"about_ca_topic_score_codex":0.0000042872266,"about_ca_topic_score_gemma":0.0000031660127,"teacher_disagreement_score":0.8828685,"about_ca_system_score_codex":0.000019721896,"about_ca_system_score_gemma":0.000024131496,"threshold_uncertainty_score":0.99996614},"labels":[],"label_agreement":null},{"id":"W640515313","doi":"","title":"Algorithmic probability and combinatorics : AMS Special Sessions on Algorithmic Probability and Combinatorics, October 5-6, 2007, DePaul University, Chicago, Illinois, October 4-5, 2008, University of British Columbia, Vancouver, BC, Canada","year":2010,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Probability and statistics; Algebraic combinatorics; Permutation (music); Mathematics; Random walk; Applied probability; Extremal combinatorics; Saddle point; Discrete mathematics; Statistics; Geometry","score_opus":0.0053023328189835,"score_gpt":0.17800546200008138,"score_spread":0.17270312918109787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W640515313","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9010215,0.00027677708,0.0011492986,0.00012134073,0.0010180128,0.0028347983,0.0016873482,0.0001149144,0.091776006],"genre_scores_gemma":[0.23128608,0.0015156363,0.031180514,0.0010207553,0.0022894705,0.0000184611,0.0009324505,0.00032415744,0.7314325],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717736,0.00019062533,0.0004673073,0.0011132408,0.00046923678,0.00058221567],"domain_scores_gemma":[0.9978665,0.00024366356,0.0005274168,0.00058734894,0.00033421643,0.0004408576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003920914,0.0004602815,0.0010114128,0.000018000519,0.00042236754,0.000056129295,0.00049842085,0.00077293324,0.000095880314],"category_scores_gemma":[0.00011480562,0.00058478414,0.00034384785,0.00010254162,0.0022738744,0.0000078092735,0.00082796224,0.0010336594,0.00000206696],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040116828,0.0040671425,0.008216209,0.0038678292,0.0025041895,0.00086153863,0.00058495265,0.000009752263,0.0017242224,0.0064263614,0.8697347,0.10160195],"study_design_scores_gemma":[0.004953878,0.0030984462,0.007925188,0.0008381047,0.0009333964,0.00025496242,0.0019868864,0.0005981395,0.00020061132,0.16354267,0.81162614,0.00404159],"about_ca_topic_score_codex":0.08185976,"about_ca_topic_score_gemma":0.25234976,"teacher_disagreement_score":0.66973543,"about_ca_system_score_codex":0.00034744048,"about_ca_system_score_gemma":0.0011291879,"threshold_uncertainty_score":0.9996604},"labels":[],"label_agreement":null},{"id":"W658016334","doi":"10.1049/iet-com.2015.0026","title":"Joint channel coding‐cryptography based on random insertions and deletions in quasi‐cyclic‐low‐density parity check codes","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Low-density parity-check code; Cryptography; Computer science; Coding (social sciences); Channel code; Joint (building); Mathematics; Algorithm; Theoretical computer science; Decoding methods; Statistics; Engineering","score_opus":0.05815915651934499,"score_gpt":0.28777912874917444,"score_spread":0.22961997222982944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W658016334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9836712,0.00046366834,0.008256655,0.00441047,0.000060624374,0.00030733712,0.00003697138,0.000045407116,0.0027476775],"genre_scores_gemma":[0.9958793,0.00032558735,0.0023576277,0.0010276336,0.000035980527,0.00005402813,0.00029728436,0.000008510129,0.000014048317],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9989034,0.00031372719,0.00025356744,0.00024842986,0.00008682258,0.00019407395],"domain_scores_gemma":[0.99870056,0.00012458589,0.00007913763,0.0008496846,0.00011923933,0.00012680223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051772274,0.00013623592,0.00018484954,0.00008477853,0.00026448222,0.000036796366,0.00033164944,0.00014703635,0.0000023889086],"category_scores_gemma":[0.00045611899,0.00012188164,0.00008704445,0.00021782808,0.00024212376,0.000004833863,0.00029163854,0.0002258572,0.0000055954397],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023655873,0.01555027,0.31883815,0.00018770254,0.00047430332,0.000016470061,0.003110079,0.0056166225,0.5844674,0.031038262,0.024232535,0.014102604],"study_design_scores_gemma":[0.025734946,0.0045309733,0.56723833,0.0007491337,0.00024096765,0.00005774647,0.0031139334,0.21099336,0.08090267,0.021890111,0.0810665,0.0034813064],"about_ca_topic_score_codex":0.00014304116,"about_ca_topic_score_gemma":0.0006563162,"teacher_disagreement_score":0.5035647,"about_ca_system_score_codex":0.000017555212,"about_ca_system_score_gemma":0.00005355809,"threshold_uncertainty_score":0.4970189},"labels":[],"label_agreement":null},{"id":"W6902704362","doi":"10.7298/kq9b-cj12","title":"EVOLUTION OF REPETITIVE DNA: METHODOLOGIES, EXPANSIONS, AND CONSTRAINTS","year":2021,"lang":"en","type":"article","venue":"eCommons (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Human Genome Research Institute; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Set (abstract data type); Constraint (computer-aided design); Sequence (biology); Term (time); Feature (linguistics)","score_opus":0.047638187199776194,"score_gpt":0.23480578148141842,"score_spread":0.18716759428164223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6902704362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9786616,0.0003205336,0.012741308,0.000031238687,0.000062295956,0.000043735137,0.000020987989,0.000012197268,0.008106122],"genre_scores_gemma":[0.9962013,0.00014500764,0.0030030662,0.000029396959,0.000026148333,1.0901943e-7,0.000031000924,0.0000032478997,0.0005607407],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992839,0.00020052952,0.00009187845,0.0002772037,0.000024601202,0.000121866506],"domain_scores_gemma":[0.9995591,0.00006895952,0.00006139505,0.00017601762,0.00008610681,0.000048428676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013914998,0.00007820515,0.00012663685,0.00003404877,0.0000635709,0.0000046487944,0.00009177772,0.00011454378,0.0000331641],"category_scores_gemma":[0.00022094467,0.000077460034,0.000059819595,0.00013779601,0.00023350643,0.000003184994,0.00026529835,0.00006626393,0.0000016605547],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012585238,0.00011209679,0.07450381,0.000026725962,0.000104489984,0.00012970903,0.000038266247,0.0002070062,0.90074885,0.018416723,0.0003658456,0.005220602],"study_design_scores_gemma":[0.0022159026,0.00096487283,0.24366221,0.00010486905,0.00015548692,0.00019659693,0.006370864,0.00038448078,0.7183105,0.007217489,0.01959158,0.0008251763],"about_ca_topic_score_codex":0.000011440859,"about_ca_topic_score_gemma":0.000036023554,"teacher_disagreement_score":0.1824384,"about_ca_system_score_codex":0.000016044014,"about_ca_system_score_gemma":0.000058798985,"threshold_uncertainty_score":0.31587285},"labels":[],"label_agreement":null},{"id":"W6907319667","doi":"10.22029/jlupub-11696","title":"The bovine placenta as a source and target of steroid hormones : aspects on the role of androgens and sulfonated steroids","year":2011,"lang":"en","type":"dissertation","venue":"University writing server of the Justus Liebig University Giessen (Justus-Liebig-Universität Gießen)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Placenta; Estrone; Estrone sulfate; Estrogen; Hormone; Steroid; Sulfotransferase; Endocrine system","score_opus":0.005664452240685059,"score_gpt":0.17265834987837955,"score_spread":0.16699389763769448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907319667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981187,0.001151637,0.0000137058405,0.00020468127,0.00016713946,0.0005284133,0.00015364884,0.000033436507,0.01656038],"genre_scores_gemma":[0.9871546,0.001580242,0.00009108169,0.00003806462,0.000054991502,1.5029364e-7,0.000151772,0.000034784505,0.0108943],"study_design_codex":"bench_or_experimental","study_design_gemma":"qualitative","domain_scores_codex":[0.99732226,0.0005253611,0.00037552448,0.00075923366,0.00047983156,0.00053776224],"domain_scores_gemma":[0.99727273,0.00020975721,0.0009946866,0.00082187215,0.0005414068,0.00015956664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045209678,0.00057146046,0.00067788886,0.00022132367,0.0011288117,0.000037146085,0.0016523725,0.00059291394,0.000025013855],"category_scores_gemma":[0.00012862943,0.0004404473,0.0003845733,0.0004972692,0.00089232944,0.000076142736,0.0016512952,0.00056348444,0.0000022446538],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04401271,0.0030810044,0.049499642,0.0041813664,0.012872921,0.0004952193,0.02780511,0.00077906257,0.749747,0.062661424,0.0027333323,0.04213124],"study_design_scores_gemma":[0.00873635,0.0049514626,0.08727534,0.0020366157,0.0038579225,0.000093969866,0.4916018,0.00050068327,0.3414694,0.0009932203,0.05564322,0.002840004],"about_ca_topic_score_codex":0.0016772043,"about_ca_topic_score_gemma":0.00089327304,"teacher_disagreement_score":0.46379668,"about_ca_system_score_codex":0.000115346375,"about_ca_system_score_gemma":0.00034398658,"threshold_uncertainty_score":0.99980474},"labels":[],"label_agreement":null},{"id":"W6911197252","doi":"10.5281/zenodo.10202661","title":"Dataset for \"Computational design of synthetic optical barcodes in microdroplets\"","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Code (set theory); Raw data; Source code; Key (lock); Data format; Barcode","score_opus":0.0534415506894785,"score_gpt":0.27817281962234824,"score_spread":0.22473126893286974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6911197252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68409425,0.00015588444,0.30514774,0.0011807571,0.0001249389,0.0014152286,0.0045732944,0.00024850378,0.0030594163],"genre_scores_gemma":[0.97956604,0.000027060507,0.0028892069,0.0000626635,0.000055816497,8.408464e-8,0.017152313,0.00018597083,0.000060851755],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991092,0.00014361218,0.00017433795,0.00026803647,0.000096702825,0.00020809853],"domain_scores_gemma":[0.99957055,0.00004417636,0.00004208335,0.00016144832,0.00013229443,0.00004947039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079149,0.00007172192,0.00008911497,0.00008608656,0.00026230275,0.000061670966,0.00037539983,0.00005522631,0.00019544912],"category_scores_gemma":[0.00066658494,0.00006771434,0.000030477777,0.00021934218,0.00010087387,0.0000046701543,0.000503984,0.000060027436,0.00023156097],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032348072,0.00020616273,0.00002666583,0.000110901965,0.000045437002,0.000009464932,0.00009931121,0.018079737,0.7943196,0.001670334,0.137519,0.04758985],"study_design_scores_gemma":[0.0013976533,0.0014157316,0.0022894165,0.00005699422,0.000016218282,0.00007013355,0.00019513816,0.02069962,0.048021294,0.0015876858,0.9238787,0.00037136732],"about_ca_topic_score_codex":0.0000012824153,"about_ca_topic_score_gemma":6.274474e-8,"teacher_disagreement_score":0.7863597,"about_ca_system_score_codex":0.000012341939,"about_ca_system_score_gemma":0.0000036892263,"threshold_uncertainty_score":0.29763252},"labels":[],"label_agreement":null},{"id":"W6911366938","doi":"10.5281/zenodo.10202660","title":"Dataset for \"Computational design of synthetic optical barcodes in microdroplets\"","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Code (set theory); Raw data; Source code; Key (lock); Data format; Barcode","score_opus":0.0534415506894785,"score_gpt":0.27817281962234824,"score_spread":0.22473126893286974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6911366938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68409425,0.00015588444,0.30514774,0.0011807571,0.0001249389,0.0014152286,0.0045732944,0.00024850378,0.0030594163],"genre_scores_gemma":[0.97956604,0.000027060507,0.0028892069,0.0000626635,0.000055816497,8.408464e-8,0.017152313,0.00018597083,0.000060851755],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991092,0.00014361218,0.00017433795,0.00026803647,0.000096702825,0.00020809853],"domain_scores_gemma":[0.99957055,0.00004417636,0.00004208335,0.00016144832,0.00013229443,0.00004947039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079149,0.00007172192,0.00008911497,0.00008608656,0.00026230275,0.000061670966,0.00037539983,0.00005522631,0.00019544912],"category_scores_gemma":[0.00066658494,0.00006771434,0.000030477777,0.00021934218,0.00010087387,0.0000046701543,0.000503984,0.000060027436,0.00023156097],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032348072,0.00020616273,0.00002666583,0.000110901965,0.000045437002,0.000009464932,0.00009931121,0.018079737,0.7943196,0.001670334,0.137519,0.04758985],"study_design_scores_gemma":[0.0013976533,0.0014157316,0.0022894165,0.00005699422,0.000016218282,0.00007013355,0.00019513816,0.02069962,0.048021294,0.0015876858,0.9238787,0.00037136732],"about_ca_topic_score_codex":0.0000012824153,"about_ca_topic_score_gemma":6.274474e-8,"teacher_disagreement_score":0.7863597,"about_ca_system_score_codex":0.000012341939,"about_ca_system_score_gemma":0.0000036892263,"threshold_uncertainty_score":0.29763252},"labels":[],"label_agreement":null},{"id":"W6912258363","doi":"10.5281/zenodo.14963469","title":"Quasinary Computing - WHIRL ASI Technical Report Vol. 1 & 2.","year":2025,"lang":"en","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Quantum computer; Computation; ENCODE; Binary number; Superposition principle; Natural computing; Model of computation; Gestalt psychology","score_opus":0.024301126910449358,"score_gpt":0.260787821534773,"score_spread":0.23648669462432362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912258363","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094897643,0.00048584014,0.006660158,0.00023905921,0.00031140057,0.00047121732,0.00014570703,0.0005199511,0.9902177],"genre_scores_gemma":[0.06985222,0.00032947818,0.002057915,0.00087829743,0.0031974893,8.603384e-8,0.048553396,0.0025810057,0.87255013],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977227,0.00024372086,0.00045929904,0.0008788081,0.000281212,0.00041425542],"domain_scores_gemma":[0.99805576,0.00002256097,0.00024880507,0.00071784284,0.0008130363,0.00014201413],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00081157417,0.00028551172,0.00029057963,0.00013930618,0.0013297866,0.00033472327,0.0011724636,0.00046709788,0.0011229882],"category_scores_gemma":[0.0014376964,0.0002804442,0.00016818677,0.0001865466,0.00023523843,0.0000057322113,0.0035654663,0.0005647439,0.0007543518],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063442545,0.00009166487,0.0000022617064,0.00010713115,0.00007684928,0.00011792651,0.000018576236,0.000014849307,0.011466423,0.0012259042,0.92625463,0.060560368],"study_design_scores_gemma":[0.00020441774,0.00043593283,0.00008088183,0.00012653523,0.00002667127,0.0004912559,0.000014973107,0.000041458406,0.00041789302,0.00026295512,0.99758655,0.00031046936],"about_ca_topic_score_codex":0.0000023181415,"about_ca_topic_score_gemma":1.7962276e-7,"teacher_disagreement_score":0.11766758,"about_ca_system_score_codex":0.0001258914,"about_ca_system_score_gemma":0.000030117975,"threshold_uncertainty_score":0.9999703},"labels":[],"label_agreement":null},{"id":"W6930788985","doi":"10.5281/zenodo.14510774","title":"Code Management Guidelines: R and GitHub Starter Kit for New Team Members","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Code (set theory); Set (abstract data type); Source code; Starter; Key (lock)","score_opus":0.040426170346789844,"score_gpt":0.280541235884003,"score_spread":0.24011506553721312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930788985","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014603653,0.0007380156,0.021918157,0.00061874365,0.00014369616,0.00082442845,0.00047396682,0.00029480294,0.97484213],"genre_scores_gemma":[0.0019744602,0.0011957383,0.0079017375,0.0011346949,0.0009704609,1.6525982e-7,0.0062789996,0.0027660895,0.97777766],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886525,0.000072181625,0.00019344766,0.0005052858,0.00011432245,0.00024951782],"domain_scores_gemma":[0.9993166,0.000005417597,0.00009055294,0.00031048877,0.00016976288,0.00010717868],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024035278,0.00017506852,0.00015111694,0.0001075626,0.00035469152,0.00020573814,0.00049144967,0.00016307617,0.0027596627],"category_scores_gemma":[0.00020139237,0.0001576609,0.000058953385,0.000100482015,0.0000724089,0.0000026105863,0.0010507905,0.00009144946,0.0002148655],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037652764,0.000020525036,8.311592e-7,0.00009996473,0.0000971144,0.0000013708404,0.000011704898,0.000004336659,0.0012997033,0.00044887993,0.91359824,0.08437966],"study_design_scores_gemma":[0.0004726653,0.00021839386,0.000010922239,0.00007567172,0.000028902556,0.00000678991,0.00005476724,0.000057384972,0.00022359843,0.00007454903,0.99859315,0.00018320084],"about_ca_topic_score_codex":0.000014962055,"about_ca_topic_score_gemma":0.0000016417882,"teacher_disagreement_score":0.0849949,"about_ca_system_score_codex":0.00001897327,"about_ca_system_score_gemma":0.000004723285,"threshold_uncertainty_score":0.99815196},"labels":[],"label_agreement":null},{"id":"W6930798008","doi":"10.5281/zenodo.16785093","title":"Nosferatu Merch","year":2025,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage","funders":"","keywords":"Symphony; Studio; German; Vampire; Subject (documents)","score_opus":0.024596232813168015,"score_gpt":0.2639082806090704,"score_spread":0.23931204779590237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930798008","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057768944,0.00032047086,0.00036868607,0.00023438213,0.00025528163,0.000336449,0.97191894,0.00015791741,0.02583021],"genre_scores_gemma":[0.0015543284,0.0003711932,0.00006360031,0.00039802067,0.00041736005,2.8333446e-8,0.9955401,0.0002381391,0.0014172626],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835354,0.0003091784,0.0002261004,0.0005882239,0.00018674774,0.0003362214],"domain_scores_gemma":[0.9988015,0.000011054015,0.0000888116,0.0006438216,0.0003461776,0.00010862637],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039976125,0.00020544305,0.00017986703,0.00011661129,0.0011356773,0.00040362112,0.0013344451,0.00030170812,0.002570001],"category_scores_gemma":[0.00075719843,0.00019167922,0.00009361923,0.00024884532,0.00011757563,0.0000036149784,0.0026260228,0.00036645477,0.0008949469],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004009174,0.000069794856,1.5535069e-7,0.00006762611,0.000051209146,0.000007091553,0.0000050978897,0.000004669055,0.006249312,0.000043024847,0.9803867,0.013075256],"study_design_scores_gemma":[0.00020232184,0.00031239362,0.000012587883,0.000035184996,0.000020052748,0.00003088166,0.000013822722,0.000006154873,0.0008575423,0.000016094025,0.9982768,0.00021615911],"about_ca_topic_score_codex":0.000011505916,"about_ca_topic_score_gemma":4.456404e-7,"teacher_disagreement_score":0.024412947,"about_ca_system_score_codex":0.000035917787,"about_ca_system_score_gemma":0.000007564798,"threshold_uncertainty_score":0.999883},"labels":[],"label_agreement":null},{"id":"W6931286354","doi":"10.5281/zenodo.5345147","title":"Himacerus (Anaptus) major","year":2010,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Marsh; Predator; Salt marsh; Distribution (mathematics); Life history","score_opus":0.019079888604901903,"score_gpt":0.2403270770503244,"score_spread":0.22124718844542252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931286354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8540882,0.00007064344,0.0019946634,0.00050343195,0.00020757543,0.00021118167,0.00005913604,0.00027493175,0.14259028],"genre_scores_gemma":[0.99674654,0.000019630374,0.0005192927,0.00024005071,0.00036212633,1.4372817e-8,0.0009140431,0.00034722371,0.0008510509],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990783,0.00009642524,0.00012587222,0.00032413195,0.000117295065,0.0002579866],"domain_scores_gemma":[0.99930984,0.0000052275086,0.00004771772,0.00031615212,0.00020188151,0.000119154334],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033519045,0.00009610646,0.000073750365,0.00004448077,0.0008967892,0.00022153406,0.0005995291,0.000099282486,0.0033811717],"category_scores_gemma":[0.00042047037,0.00008668874,0.000048782353,0.00013583388,0.0001224518,0.000005559928,0.0008612629,0.00020935325,0.0017475425],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041099647,0.000059813727,0.00001951757,0.000009022769,0.000020264788,0.0000043571627,0.000036289293,0.0000042133006,0.8655946,0.00140796,0.052016094,0.08078671],"study_design_scores_gemma":[0.00025322894,0.00021513403,0.00086158025,0.0000028919997,0.0000045239976,0.00006876235,0.000034062858,0.00005631489,0.020955037,0.000091214315,0.97733057,0.00012666115],"about_ca_topic_score_codex":0.000005096731,"about_ca_topic_score_gemma":6.1744134e-7,"teacher_disagreement_score":0.9253145,"about_ca_system_score_codex":0.000009411972,"about_ca_system_score_gemma":0.000002026472,"threshold_uncertainty_score":0.9990297},"labels":[],"label_agreement":null},{"id":"W6931934692","doi":"10.5281/zenodo.8164725","title":"A guided light system for agile individual addressing of Ba+ qubits with 10−4 level intensity crosstalk","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Agile software development; Crosstalk; Raw data; Coding (social sciences); Bitwise operation","score_opus":0.11983497424167268,"score_gpt":0.28837423015797836,"score_spread":0.1685392559163057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931934692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812151,0.0000600019,0.004403934,0.00025915937,0.000080438906,0.00048826012,0.0005183589,0.0003162608,0.012658442],"genre_scores_gemma":[0.9956203,0.000005661105,0.0004128781,0.000044308144,0.0001255393,8.180007e-8,0.0023614303,0.00027863568,0.0011511343],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988919,0.00010684033,0.0002076986,0.00033780516,0.000174252,0.00028149516],"domain_scores_gemma":[0.99888134,0.000012581062,0.00011745193,0.00024539666,0.0006616941,0.00008151857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005661926,0.00011244984,0.00014911212,0.00007878039,0.0007875958,0.0001819782,0.00047126238,0.000085653344,0.00018851428],"category_scores_gemma":[0.0004602025,0.00009186129,0.00005463403,0.0003005278,0.000110156834,0.000008365841,0.00089351396,0.00007803297,0.00021848989],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047690183,0.00009185663,0.000060426988,0.00029344767,0.00013943875,0.000013062547,0.00033316374,0.000119969256,0.7927383,0.00033640742,0.18360786,0.02178917],"study_design_scores_gemma":[0.0011163666,0.0012443266,0.00273065,0.00014353175,0.000029341436,0.00011350748,0.0006672584,0.00041567645,0.18967402,0.000022411934,0.8035676,0.0002752905],"about_ca_topic_score_codex":0.0000043863483,"about_ca_topic_score_gemma":4.2943827e-7,"teacher_disagreement_score":0.6199598,"about_ca_system_score_codex":0.000022014246,"about_ca_system_score_gemma":0.0000061004516,"threshold_uncertainty_score":0.605763},"labels":[],"label_agreement":null},{"id":"W6936051224","doi":"10.57907/mirri/fjnxfo","title":"MIRRI0058863","year":2022,"lang":"en","type":"dataset","venue":"Entrepôt pour orphelin","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Organism; Taxon; Key (lock); Identification (biology)","score_opus":0.011930715159624444,"score_gpt":0.25156048886342264,"score_spread":0.2396297737037982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6936051224","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004277162,0.0015419179,0.000029963187,0.000236599,0.0007558905,0.00018175584,0.99290717,0.00002754601,0.00004198899],"genre_scores_gemma":[0.00040280973,0.00047343268,0.00015376582,0.0012805795,0.0010379797,0.000026661764,0.994271,0.000021961429,0.0023318417],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824584,0.00018242357,0.00031405358,0.00066521805,0.00020831895,0.00038415214],"domain_scores_gemma":[0.99900776,0.000033614615,0.00018673303,0.00061878056,0.000041595038,0.00011149201],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026108688,0.00032130783,0.00025869755,0.00004883014,0.000148048,0.000037240465,0.00060747843,0.00038395321,0.6655107],"category_scores_gemma":[0.0002009568,0.00027691448,0.00024148395,0.000075576136,0.000049614486,8.6281574e-7,0.00082762784,0.00040881708,0.017917834],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039019444,0.00010793686,0.00004219709,0.000021469868,0.00006142567,0.000042425883,0.0000016092304,0.000017169654,0.007921816,0.0000025730922,0.99072045,0.0010219112],"study_design_scores_gemma":[0.00029854669,0.00020777917,0.000025546256,0.0000101158275,0.000036187266,0.000029495464,0.000018615718,0.0000025499107,0.0020763876,0.00003093381,0.9968957,0.00036818656],"about_ca_topic_score_codex":0.00006259691,"about_ca_topic_score_gemma":0.000029231618,"teacher_disagreement_score":0.6475929,"about_ca_system_score_codex":0.000026155563,"about_ca_system_score_gemma":0.0001210113,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null},{"id":"W6936453381","doi":"10.58066/2762-rq36","title":"Troopships anchored","year":2023,"lang":"en","type":"other","venue":"UVic’s Research and Learning Repository (University of Victoria)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Newspaper; Photography; Period (music); Photojournalism","score_opus":0.029581322479648973,"score_gpt":0.27232781705199954,"score_spread":0.24274649457235056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6936453381","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32255563,0.0057477863,0.00027054746,0.00017165994,0.001304407,0.00064705394,0.00003110259,0.0005294658,0.66874236],"genre_scores_gemma":[0.25554433,0.0011757212,0.00024127365,0.000003586646,0.0010844948,5.587252e-7,0.000060453734,0.00016559481,0.74172395],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846435,0.0003545754,0.00009147304,0.00047821342,0.00028078211,0.0003305875],"domain_scores_gemma":[0.9992961,0.00007986653,0.00011308997,0.00024147535,0.00012508691,0.00014435408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004894757,0.00014695755,0.00023160904,0.00015069854,0.0003479121,0.000028939443,0.00029821994,0.00046464792,0.0000801173],"category_scores_gemma":[0.00018014487,0.00015533259,0.00008469176,0.00019092357,0.00033309226,0.0000027395051,0.0003717481,0.00060331,0.000033212706],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075747096,0.00025313973,0.046784546,0.00056868646,0.00082782534,0.00040235042,0.00065096247,0.000026803194,0.26279846,0.0002276617,0.66958684,0.017115248],"study_design_scores_gemma":[0.00035960026,0.00089092576,0.00372706,0.00013775213,0.000013310006,0.0000067152405,0.00054266973,0.000029797387,0.00049937743,0.000022177084,0.9935662,0.00020441004],"about_ca_topic_score_codex":0.00054623885,"about_ca_topic_score_gemma":0.00022731899,"teacher_disagreement_score":0.32397935,"about_ca_system_score_codex":0.000020434802,"about_ca_system_score_gemma":0.00006861711,"threshold_uncertainty_score":0.63342786},"labels":[],"label_agreement":null},{"id":"W6958082739","doi":"10.60692/s8v6m-0rv44","title":"Altered coupling of resting-state cerebral blood flow and functional connectivity in Meige syndrome","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Cerebral blood flow; Neurovascular bundle; Precentral gyrus; Middle frontal gyrus; Perfusion; Blood flow; Perfusion scanning; Voxel; Blood-oxygen-level dependent","score_opus":0.03121140211437461,"score_gpt":0.2114199113453486,"score_spread":0.18020850923097398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958082739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979484,0.000004487561,0.0015623657,0.000008875399,0.0001266734,0.00012887936,0.00004591928,0.000038640483,0.00013573637],"genre_scores_gemma":[0.99974996,2.708046e-7,0.000088106266,0.000019363782,0.00003444008,0.00000923709,0.00006976609,0.0000037663224,0.000025102107],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992837,0.000022732193,0.00031956498,0.00013059181,0.00008974818,0.00015371355],"domain_scores_gemma":[0.99965626,0.000008567376,0.00013240139,0.00010969163,0.000057651996,0.000035414127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036935302,0.00009091791,0.00014093192,0.00009251224,0.000050942734,0.000025386842,0.00004979689,0.000079553574,0.0000019672477],"category_scores_gemma":[0.00004028958,0.00007374313,0.000032917684,0.00014570176,0.000026484176,0.00001280977,0.00009607445,0.000050430932,0.00001469124],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012397223,0.000004487514,0.9861734,0.00034081965,0.000053044696,0.000007207239,0.0019654834,0.007523639,0.003443389,0.00002818288,0.000022116259,0.00031425545],"study_design_scores_gemma":[0.0013411553,0.00021019262,0.94253004,0.0001238897,0.00001130765,0.00010659881,0.0011942845,0.04340993,0.010861821,0.0000046403825,0.000023349345,0.00018278645],"about_ca_topic_score_codex":0.0000056872923,"about_ca_topic_score_gemma":6.534193e-7,"teacher_disagreement_score":0.04364336,"about_ca_system_score_codex":0.000007574649,"about_ca_system_score_gemma":0.0000152717,"threshold_uncertainty_score":0.30071574},"labels":[],"label_agreement":null},{"id":"W6958113551","doi":"10.60692/sxf2a-vtz25","title":"The ALPHA antihydrogen trapping apparatus","year":2014,"lang":"en","type":"article","venue":"Greater South Information System","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary; Simon Fraser University; York University","funders":"","keywords":"Antihydrogen; Trapping; Trap (plumbing); Alpha (finance); Atom (system on chip)","score_opus":0.018668688703219343,"score_gpt":0.20242573961379856,"score_spread":0.18375705091057923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958113551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95885974,0.000015483065,0.029268162,0.00004323172,0.00023840234,0.00014051722,0.0000058125725,0.000049345632,0.011379302],"genre_scores_gemma":[0.99938655,3.4493414e-7,0.000067429566,0.00020067938,0.0001900391,0.000011409487,0.000021140964,0.0000036198157,0.0001188092],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928343,0.00006475766,0.00026413533,0.00010433138,0.0000905319,0.00019282353],"domain_scores_gemma":[0.9995421,0.0000043256505,0.00012262445,0.00022950224,0.000056945395,0.000044482415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003829699,0.000097771146,0.00008566991,0.000020562804,0.00023879856,0.00011219989,0.0001729589,0.000091104914,0.0000011790485],"category_scores_gemma":[0.000022478815,0.000056058598,0.00006311229,0.000059452723,0.000030251385,0.0000071215077,0.000065772794,0.00004312834,0.00013494804],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012920966,0.000027856433,0.6868771,0.0012945214,0.0011800403,0.000007824907,0.036734216,0.003333045,0.03989394,0.0128118815,0.013204734,0.20334275],"study_design_scores_gemma":[0.0037979612,0.0010199005,0.090959854,0.00021425095,0.000072802606,0.00022805382,0.011062215,0.03665598,0.18423645,0.000018914872,0.6701307,0.001602895],"about_ca_topic_score_codex":7.373852e-7,"about_ca_topic_score_gemma":6.765843e-8,"teacher_disagreement_score":0.656926,"about_ca_system_score_codex":0.0000073803185,"about_ca_system_score_gemma":0.000008796596,"threshold_uncertainty_score":0.22860032},"labels":[],"label_agreement":null},{"id":"W6958575749","doi":"10.6084/m9.figshare.22807514.v1","title":"Additional file 1 of Chemotherapy-induced weight gain in early-stage breast cancer: a prospective matched cohort study reveals associations with inflammation and gut dysbiosis","year":2023,"lang":"en","type":"article","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dysbiosis; Weight gain; Inflammation; Prospective cohort study; Cohort study; Cohort; Gut flora","score_opus":0.01403611609885816,"score_gpt":0.24950320174186408,"score_spread":0.23546708564300592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958575749","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45688137,0.0000027967544,6.2589486e-8,0.000026872929,0.0000023107757,0.00028796375,0.5426008,0.000011223431,0.00018656322],"genre_scores_gemma":[0.6809644,0.0000015621779,0.000026677519,0.00001732881,0.000060011305,0.0006826009,0.3180284,0.0000068957675,0.00021214357],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.999346,0.00004517015,0.0001440085,0.00023175254,0.00010366346,0.0001294154],"domain_scores_gemma":[0.9995325,0.000101454876,0.00013357936,0.00009033431,0.00011460448,0.000027477803],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000052467374,0.00009355254,0.00013838155,0.00003738976,0.00004763982,0.000014956256,0.00006736926,0.00008709749,0.16815563],"category_scores_gemma":[0.00029177108,0.000075381926,0.000025108,0.00022438933,0.0000068722056,0.000005387759,0.000061919636,0.00006272768,0.000022617593],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000905255,0.0001454693,0.3263285,0.00005272407,0.00019070311,0.000007591048,0.00025043383,0.000018905655,0.021993535,0.0000014163342,0.6494717,0.0014484936],"study_design_scores_gemma":[0.0003203514,0.00016191644,0.9946466,0.00023031162,0.0000039653455,9.667698e-7,0.0000749348,0.00005198939,0.0021640204,0.000007747319,0.0022291748,0.00010799661],"about_ca_topic_score_codex":0.000025125635,"about_ca_topic_score_gemma":0.00011522839,"teacher_disagreement_score":0.66831815,"about_ca_system_score_codex":0.00002452811,"about_ca_system_score_gemma":0.000044149314,"threshold_uncertainty_score":0.8326048},"labels":[],"label_agreement":null},{"id":"W6959103694","doi":"10.7939/dvn/swde5d","title":"Replication Data for: Predation risk and space use of a declining Dall sheep (Ovis dalli dalli) population","year":2019,"lang":"en","type":"dataset","venue":"Borealis","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Predation; Population; Replication (statistics); Space (punctuation); Population density","score_opus":0.08767101758406524,"score_gpt":0.33695943488867713,"score_spread":0.24928841730461188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6959103694","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020915026,0.00020368987,0.002800998,0.000045958954,0.00006592348,0.00051493646,0.9754345,0.000009394791,0.000009613856],"genre_scores_gemma":[0.0073205135,0.0011981924,0.003226676,0.00007468515,0.0002564034,0.000014778469,0.98786443,0.000016069693,0.000028244032],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998327,0.00010950142,0.0004000689,0.0008697395,0.00012264184,0.00017103343],"domain_scores_gemma":[0.99687415,0.000110953064,0.0006261658,0.002220448,0.00011803479,0.000050258728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056174764,0.00020617906,0.00027642824,0.0000463088,0.000070455804,0.00005482162,0.00044429363,0.00045677435,0.000002404381],"category_scores_gemma":[0.0017370338,0.00017931363,0.00006219062,0.000051504754,0.000041134863,0.000014361076,0.0005223471,0.00011924558,5.149157e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012360208,0.00003923554,0.00379731,0.00012548249,0.00006714964,2.2109428e-7,0.000003830598,0.000086035434,0.0021389485,0.0000145972635,0.98765177,0.0059518307],"study_design_scores_gemma":[0.00027834793,0.00028378292,0.013635074,0.000053605716,0.0001500963,0.0000024296255,0.0000047188914,0.001551641,0.00031416334,0.000056239827,0.9834429,0.00022701519],"about_ca_topic_score_codex":0.0052531334,"about_ca_topic_score_gemma":0.0021061327,"teacher_disagreement_score":0.013594512,"about_ca_system_score_codex":0.000010878815,"about_ca_system_score_gemma":0.000034621055,"threshold_uncertainty_score":0.79412013},"labels":[],"label_agreement":null},{"id":"W6960536005","doi":"10.13362/j.jpmed.202540012","title":"Correlation of soluble triggering receptor expressed on myeloid cells-1 in cerebrospinal fluid with Alzheimer’s disease biomarkers and cognitive function in non-dementia individuals","year":2025,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cerebrospinal fluid; Cognition; Correlation; Cohort; Neuroinflammation; Mediation; Biomarker; Disease; Receptor","score_opus":0.07430328260183512,"score_gpt":0.42615944705654296,"score_spread":0.35185616445470785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6960536005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913937,0.0065760687,0.0007320118,0.000029446233,0.0001889568,0.00045128108,0.000027475235,0.0000042702036,0.0005967917],"genre_scores_gemma":[0.9986772,0.0009655716,0.000099178826,0.00009546087,0.0000290431,0.00002606365,0.000065907654,0.000011597684,0.000029961591],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9985881,0.00016677563,0.00047687793,0.00038619168,0.00017568939,0.00020637264],"domain_scores_gemma":[0.9992335,0.00008968096,0.00034837058,0.00013696439,0.00010596637,0.000085512256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058302714,0.00018764465,0.0003255749,0.00036054902,0.000077508405,0.00012744637,0.00035351666,0.0001093768,0.00014964397],"category_scores_gemma":[0.00010456238,0.00015679897,0.00005777829,0.00044077518,0.00009731933,0.000057138626,0.00035000357,0.00014932716,6.651365e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018481361,0.00016519516,0.47760752,0.00003937868,0.00020128419,0.0000021594667,0.000015237819,0.00026837667,0.5099641,0.0000033977897,0.0005260228,0.009359186],"study_design_scores_gemma":[0.0012443906,0.0000966397,0.7517786,0.00067286816,0.00011789888,2.8744208e-7,0.000058461017,0.00016599231,0.24536656,0.00010895003,0.00021646002,0.00017291302],"about_ca_topic_score_codex":0.000114934744,"about_ca_topic_score_gemma":0.000020341044,"teacher_disagreement_score":0.27417105,"about_ca_system_score_codex":0.000014149282,"about_ca_system_score_gemma":0.0000805945,"threshold_uncertainty_score":0.63940763},"labels":[],"label_agreement":null},{"id":"W6961026040","doi":"10.14288/1.0006150","title":"Eulachon fishing in British Columbia","year":2002,"lang":"en","type":"other","venue":"Open Collections","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Fishing; Fish <Actinopterygii>; Netting; Government (linguistics); Population","score_opus":0.014675310769494491,"score_gpt":0.23848863937410655,"score_spread":0.22381332860461206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961026040","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048023293,0.0004000894,0.00005486544,0.00002245433,0.00026478295,0.00044192353,0.0001363863,0.00002743614,0.9981718],"genre_scores_gemma":[0.0015585159,0.00029415492,0.0006093143,0.00015935648,0.00033106306,0.00005612525,0.00014037595,0.00009817068,0.9967529],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991205,0.000068409536,0.00014662548,0.00040696727,0.000054944416,0.00020256265],"domain_scores_gemma":[0.99965817,0.000007612294,0.00007396741,0.00019717687,0.000016957603,0.000046120687],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008842483,0.00009718132,0.00018672945,0.000022314638,0.00036445647,0.0012135475,0.00035880206,0.0003494046,0.005316296],"category_scores_gemma":[0.00006821672,0.00015017713,0.0000607475,0.0003076327,0.00003270719,0.000001698776,0.00032548094,0.00015977929,0.000013146721],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015925424,0.00006402639,0.00035008334,0.0000054393136,0.000017256478,0.000010059307,0.0000013031279,0.0000041087824,0.00015009055,9.1758224e-8,0.9973292,0.0020667913],"study_design_scores_gemma":[0.0003177076,0.00009195538,0.00027097628,0.00009530917,0.000006927687,0.000023283505,0.000015331187,0.00002405156,0.000017796068,0.000026299314,0.9988965,0.00021391203],"about_ca_topic_score_codex":0.19518207,"about_ca_topic_score_gemma":0.6883026,"teacher_disagreement_score":0.49312052,"about_ca_system_score_codex":0.000021393796,"about_ca_system_score_gemma":0.00003623259,"threshold_uncertainty_score":0.9998233},"labels":[],"label_agreement":null},{"id":"W6961051920","doi":"10.14288/1.0178580","title":"The Ladysmith Daily Ledger","year":2017,"lang":"en","type":"article","venue":"Open Collections","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ledger; Distributed ledger; Population; Publishing; Project commissioning","score_opus":0.02472008646365593,"score_gpt":0.2973531182417727,"score_spread":0.27263303177811676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961051920","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021231998,0.00010950026,0.0005544579,0.00089192245,0.00045896988,0.00025312358,0.0000077227505,0.000009274801,0.97648305],"genre_scores_gemma":[0.5850945,0.000053839565,0.00022955821,0.00015530501,0.00021468308,0.000028920787,0.000005723241,0.000005062255,0.4142124],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995642,0.000030652176,0.00007260131,0.00016395176,0.000034741508,0.00013385364],"domain_scores_gemma":[0.99941933,0.00001592154,0.000056023517,0.00042654254,0.00004833239,0.00003385458],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016884426,0.000056959874,0.000052503274,0.0000031488619,0.008596101,0.0017587801,0.0006896802,0.00005163012,0.000037780763],"category_scores_gemma":[0.00019471347,0.00003430341,0.00004083617,0.00004082859,0.00009911495,0.0000032668786,0.0005736527,0.000055923436,0.000010994294],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007121615,0.00005471655,0.001259076,8.8939083e-7,0.000059500868,0.0000018749635,0.000007559471,0.000006567259,0.020675901,0.00024750293,0.9640443,0.013570942],"study_design_scores_gemma":[0.00025218888,0.00013944045,0.0037273301,0.0000030321312,0.000005893314,0.000007860092,0.000034274948,0.00004792859,0.010209242,0.0005028209,0.98497933,0.00009064268],"about_ca_topic_score_codex":0.00038330184,"about_ca_topic_score_gemma":0.0009546408,"teacher_disagreement_score":0.5638625,"about_ca_system_score_codex":0.0000053588096,"about_ca_system_score_gemma":0.000045429708,"threshold_uncertainty_score":0.9992775},"labels":[],"label_agreement":null},{"id":"W6961094266","doi":"10.14288/1.0169750","title":"The University of British Columbia Calendar 2003/04","year":2016,"lang":"en","type":"article","venue":"Open Collections","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics); Period (music); Agency (philosophy)","score_opus":0.008524447011201352,"score_gpt":0.2043801184873251,"score_spread":0.19585567147612373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961094266","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5696904,0.00066967256,0.007803545,0.00087778486,0.00094090425,0.0012745898,0.0017084453,0.000042473093,0.41699222],"genre_scores_gemma":[0.27673602,0.0002623381,0.0003108909,0.00003232139,0.00004257157,0.0000016000365,0.0000052441615,0.0000032957332,0.7226057],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964046,0.000044452914,0.000059206253,0.00012862412,0.000030535983,0.00009669445],"domain_scores_gemma":[0.99969107,0.000018036819,0.00003318043,0.000120690536,0.00010867295,0.000028379336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010062971,0.000026040332,0.000051558138,0.0000018588992,0.0010951388,0.00009220874,0.0002462658,0.000047706082,0.0001991174],"category_scores_gemma":[0.00007646337,0.000023935674,0.000029455327,0.00017872154,0.000114104536,0.0000019896095,0.0002148761,0.000023080282,0.000003014367],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016748882,0.000024889177,0.0006792881,6.862891e-7,0.000020127683,0.0000012864682,0.0000015703914,5.5766475e-7,0.015519523,0.0000033624062,0.9711636,0.012568365],"study_design_scores_gemma":[0.0003206491,0.00015498583,0.0042975824,0.000010903407,0.0000059127487,0.000010512668,0.00006637598,0.000003957307,0.0009921025,0.0001150971,0.99396247,0.000059449016],"about_ca_topic_score_codex":0.019162275,"about_ca_topic_score_gemma":0.109224714,"teacher_disagreement_score":0.30561352,"about_ca_system_score_codex":0.000009016211,"about_ca_system_score_gemma":0.00007567332,"threshold_uncertainty_score":0.9873692},"labels":[],"label_agreement":null},{"id":"W6961111493","doi":"10.14288/1.0424556","title":"Health Worker Training Materials ~ Smart Discharges","year":2023,"lang":"en","type":"dataset","venue":"Open Collections","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Training (meteorology); Health worker; Context (archaeology); General partnership; Christian ministry; Public health; Vulnerability (computing); Health assessment; Occupational safety and health","score_opus":0.05175841339041692,"score_gpt":0.32766004242078595,"score_spread":0.275901629030369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961111493","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010352411,0.00010260541,0.000027247297,0.0004723049,0.0013541862,0.0005679284,0.99508905,0.000027200385,0.0022559585],"genre_scores_gemma":[0.000051714815,0.00041186166,0.00018227457,0.00052245887,0.0006244019,0.00014291858,0.92039746,0.000022873845,0.077644065],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852,0.00018208825,0.00031924795,0.0005222628,0.0000886944,0.00036770233],"domain_scores_gemma":[0.9992722,0.000029746505,0.00017748625,0.00037642717,0.000038752514,0.0001053704],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00043600402,0.00022482235,0.00038482735,0.000041269457,0.0014999451,0.0008144356,0.0005708601,0.00029010136,0.00025531132],"category_scores_gemma":[0.00014782822,0.00018690816,0.00008750634,0.00038125677,0.00004599411,0.0000025831862,0.00076139346,0.00017167817,0.00014061973],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025780764,0.000038823782,0.0000010368126,0.000015074113,0.00007113941,0.0000024536791,0.0000037727277,0.000002510207,0.0007247912,8.5385136e-7,0.998719,0.000394799],"study_design_scores_gemma":[0.0001790704,0.00026902213,0.000035026704,0.000069709466,0.000015549193,0.000012827192,0.000053888416,6.28844e-7,0.00031431598,0.0000520991,0.9987702,0.00022766781],"about_ca_topic_score_codex":0.0055212947,"about_ca_topic_score_gemma":0.0046119085,"teacher_disagreement_score":0.0753881,"about_ca_system_score_codex":0.000026550937,"about_ca_system_score_gemma":0.00030200987,"threshold_uncertainty_score":0.99979997},"labels":[],"label_agreement":null},{"id":"W6961147526","doi":"10.14473/csda/qjwlgn/60cspl","title":"D05_CHPS301.pdf","year":2024,"lang":"cs","type":"dataset","venue":"Czech Social Science Data Archive","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"","keywords":"Process (computing); Identification (biology); Product (mathematics)","score_opus":0.03605023138704542,"score_gpt":0.3443455764376257,"score_spread":0.30829534505058026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961147526","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002527468,0.00061549724,0.00014688801,0.00039914824,0.0020310131,0.00040557995,0.9865904,0.00003490186,0.0072491267],"genre_scores_gemma":[0.008142141,0.0008276884,0.00047068956,0.001144648,0.0044164294,0.000012346728,0.9844219,0.000026338266,0.00053781667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943116,0.00021672611,0.0005630604,0.0028241393,0.00078082783,0.0013037033],"domain_scores_gemma":[0.9972165,0.000095029565,0.00027463568,0.0019092578,0.00012391218,0.00038066768],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":["sts","open_science"],"category_scores_codex":[0.001740133,0.00061501487,0.0005199979,0.00017319866,0.0013811535,0.00066393043,0.0073953755,0.000575872,0.00029005585],"category_scores_gemma":[0.0009740085,0.0005079011,0.00021953872,0.00087560096,0.0036551477,0.00003848909,0.014346417,0.001013579,0.007631513],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003578054,0.000105001,0.000018443136,0.00011391581,0.00007089668,0.00005318086,0.00008314631,3.326147e-7,0.058495555,0.00020845367,0.9284594,0.012355881],"study_design_scores_gemma":[0.00016245908,0.00032651,0.0001496898,0.0000936444,0.00012989985,0.00002217955,0.0002708994,0.00019523104,0.0012901011,0.0008912523,0.9957498,0.00071833446],"about_ca_topic_score_codex":0.00010387611,"about_ca_topic_score_gemma":0.00009926251,"teacher_disagreement_score":0.06729039,"about_ca_system_score_codex":0.00007469931,"about_ca_system_score_gemma":0.0012297569,"threshold_uncertainty_score":0.99991894},"labels":[],"label_agreement":null},{"id":"W6961171335","doi":"10.14457/tu.the.2015.1162","title":"Les citations et les références dans Rien que la terre de Paul Morand","year":2015,"lang":"fr","type":"dataset","venue":"NRCT Data Center","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Quarter (Canadian coin); Domain (mathematical analysis)","score_opus":0.0724457729140902,"score_gpt":0.34668406095637294,"score_spread":0.27423828804228273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961171335","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018895414,0.00234068,0.0015359292,0.0012299158,0.0004551199,0.00022376988,0.9726463,0.000018642371,0.0026542128],"genre_scores_gemma":[0.09592035,0.0012199554,0.0013017447,0.0005277918,0.0005856554,0.000012434525,0.89984363,0.000020872172,0.0005675776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972682,0.00072096416,0.00039906794,0.00090434385,0.00020756185,0.0004998725],"domain_scores_gemma":[0.9981704,0.00011831327,0.00021396912,0.0011709224,0.000120541474,0.00020584899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008774719,0.00042339053,0.00034509908,0.000046095844,0.00020681349,0.00019421936,0.0016125717,0.00084963266,0.00012453311],"category_scores_gemma":[0.000506305,0.0003023673,0.00011001149,0.000088786415,0.0003953267,0.000019196326,0.0015876825,0.0005368898,0.00006418064],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059872287,0.00030574398,0.00903244,0.00010419376,0.00016200238,0.00005659671,0.00007972042,0.000010748141,0.0022895816,0.0000735396,0.9794062,0.00841936],"study_design_scores_gemma":[0.00052018644,0.00024121464,0.0021379783,0.00016526094,0.00009764144,0.00007933261,0.0002907756,0.00009701568,0.00025117418,0.000060021306,0.9956363,0.00042310086],"about_ca_topic_score_codex":0.0011239812,"about_ca_topic_score_gemma":0.0031202645,"teacher_disagreement_score":0.07702493,"about_ca_system_score_codex":0.000031597,"about_ca_system_score_gemma":0.00022683965,"threshold_uncertainty_score":0.99994284},"labels":[],"label_agreement":null},{"id":"W6961190507","doi":"10.14288/1.0384032","title":"General correspondence","year":2019,"lang":"en","type":"article","venue":"Open Collections","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Severance; Settlement (finance); Collective bargaining; Administration (probate law); Democracy; Labour law; Government (linguistics)","score_opus":0.01429233027562781,"score_gpt":0.27029721595791634,"score_spread":0.2560048856822885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961190507","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45878765,0.000037555787,0.00054933777,0.00005804608,0.00038076928,0.00027578487,0.0000071184872,0.000010736805,0.539893],"genre_scores_gemma":[0.4007177,0.000008186957,0.0009390533,0.00032830428,0.00010268097,0.000013629861,0.000019474226,0.0000044522753,0.59786654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953145,0.000034994377,0.00007283976,0.00020460454,0.000037953425,0.000118177486],"domain_scores_gemma":[0.99973583,0.000008756684,0.000023214681,0.0001631456,0.00003465438,0.000034421086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000872609,0.000056107365,0.00006312405,0.00000900012,0.00038005775,0.00023147918,0.00024645572,0.000057801855,0.00068953034],"category_scores_gemma":[0.00003127668,0.000046621215,0.000035152785,0.0001876196,0.000016516287,0.000002327516,0.00026445897,0.000045598135,0.00007038436],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014095262,0.00008623027,0.0031935205,0.0000026982686,0.000031395877,0.0000018412704,0.000007866852,0.0002951219,0.481116,0.00019367022,0.5133614,0.0015693529],"study_design_scores_gemma":[0.0005090143,0.0005880237,0.002008649,0.000006368982,0.0000054642505,0.000028671278,0.000039531038,0.00059181673,0.038666256,0.0003103762,0.95703906,0.00020679142],"about_ca_topic_score_codex":0.0002356045,"about_ca_topic_score_gemma":0.00007571207,"teacher_disagreement_score":0.44367766,"about_ca_system_score_codex":0.000007072292,"about_ca_system_score_gemma":0.000048259688,"threshold_uncertainty_score":0.75498736},"labels":[],"label_agreement":null},{"id":"W6961538340","doi":"10.15468/dl.dsffdr","title":"Occurrence Download","year":2025,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Rockfish; Data set","score_opus":0.010691817758408578,"score_gpt":0.22534634722604394,"score_spread":0.21465452946763536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961538340","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021764622,0.00005310023,0.000016749913,0.00006618156,0.00040434487,0.0001785267,0.99681634,0.000024355453,0.00026396083],"genre_scores_gemma":[0.0001037936,0.00009238066,0.0000025019838,0.0009380749,0.0000038235057,0.0000018768975,0.99885696,4.8529145e-9,5.7531844e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990209,0.000057926503,0.0002650563,0.0002559438,0.00016701546,0.00023316125],"domain_scores_gemma":[0.9991701,0.000006774307,0.00016098436,0.00040329056,0.00017475679,0.000084092535],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016522752,0.00022453055,0.00018575841,0.0000336678,0.00018165477,0.00006971966,0.00047375448,0.00048403267,0.00015940538],"category_scores_gemma":[0.00020887947,0.00020374561,0.00015392581,0.0001491454,0.000113970375,0.000012445126,0.0006462258,0.0001637666,0.0044405423],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005562327,0.000024157904,0.0007665781,0.00007872469,0.000030533603,6.410727e-7,0.0000017131424,0.0000058500996,0.0000039383453,4.614302e-8,0.9971193,0.0019128802],"study_design_scores_gemma":[0.00020965103,0.00007985163,0.0000554404,0.000002539241,0.000025268368,0.0000019938611,0.000020423873,7.0063585e-8,0.000067994995,3.8722416e-7,0.9993172,0.00021915634],"about_ca_topic_score_codex":0.00007656566,"about_ca_topic_score_gemma":0.0000056776553,"teacher_disagreement_score":0.004281137,"about_ca_system_score_codex":0.00005288648,"about_ca_system_score_gemma":0.00012721434,"threshold_uncertainty_score":0.9963346},"labels":[],"label_agreement":null},{"id":"W6962028131","doi":"10.15468/dl.kzpfgg","title":"Occurrence Download","year":2021,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Listing (finance); Range (aeronautics); Order (exchange)","score_opus":0.013802143345502216,"score_gpt":0.22274230264107647,"score_spread":0.20894015929557425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6962028131","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00631868,0.00009355947,0.000011483341,0.000053040716,0.00038211388,0.00012736565,0.9928893,0.000019906765,0.000104574014],"genre_scores_gemma":[0.00013188967,0.00012396733,0.0000034110524,0.00078583043,0.000005939503,0.0000014885112,0.99894726,1.0631421e-8,2.179133e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894214,0.000072441886,0.00026417468,0.0002761289,0.00020144074,0.00024367348],"domain_scores_gemma":[0.99907833,0.000005420914,0.00017414175,0.0004099715,0.00022195713,0.00011017566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016477928,0.0002246473,0.00019516573,0.000021325837,0.00017212373,0.00009113664,0.0003770691,0.000475691,0.00038537942],"category_scores_gemma":[0.00020765369,0.00020733383,0.0001710145,0.00013556014,0.00011256167,0.000013801861,0.0006193152,0.00016967113,0.016536167],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034503366,0.000028802182,0.0008066117,0.000056015593,0.00003021668,0.0000022038573,0.0000021755855,0.000005594893,0.0000124052785,1.700314e-8,0.9976522,0.0013693017],"study_design_scores_gemma":[0.00019489416,0.00007513219,0.000085389634,0.000001987455,0.000022082997,0.000007696041,0.000041245716,5.3181132e-8,0.00013429912,2.1319477e-7,0.9991885,0.00024853594],"about_ca_topic_score_codex":0.000058658497,"about_ca_topic_score_gemma":0.000007396219,"teacher_disagreement_score":0.016150787,"about_ca_system_score_codex":0.00004887136,"about_ca_system_score_gemma":0.000121008416,"threshold_uncertainty_score":0.98422956},"labels":[],"label_agreement":null},{"id":"W6962402645","doi":"10.17605/osf.io/vnd5s","title":"TP3: Opération Jarnigoine: La revanche","year":2022,"lang":"fr","type":"other","venue":"Open Science Framework","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Gens; Session (web analytics); Identity (music)","score_opus":0.016125792777032348,"score_gpt":0.31536869589404415,"score_spread":0.2992429031170118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6962402645","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015898176,0.0028594295,0.004306216,0.00139916,0.0018801461,0.0008143506,0.00003163563,0.000021351463,0.9727895],"genre_scores_gemma":[0.2644763,0.0010137517,0.066866264,0.0041976986,0.0022846472,0.000126783,0.0002504885,0.00015420449,0.66062987],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99688727,0.0003679217,0.00033875703,0.0013531676,0.00043015552,0.00062271336],"domain_scores_gemma":[0.99820006,0.0001316534,0.00031357098,0.0010380275,0.00010547614,0.00021118626],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021788396,0.00035163126,0.00035098745,0.000082364066,0.00077383075,0.0007473905,0.00412825,0.0006866119,0.027529169],"category_scores_gemma":[0.0023223879,0.0003001759,0.0001281243,0.0008696172,0.0010584819,0.00001680642,0.0048610345,0.00079013495,0.00033753642],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021995694,0.0006397902,0.008557153,0.0001344875,0.00013409987,0.00008927134,0.00038023698,0.00050340564,0.17719787,0.11706967,0.06682981,0.6282442],"study_design_scores_gemma":[0.0001463496,0.0003885806,0.0010520827,0.00013297882,0.000019316247,0.0000250002,0.00011715558,0.00011810291,0.002484613,0.0016861908,0.9933574,0.00047221666],"about_ca_topic_score_codex":0.000028416784,"about_ca_topic_score_gemma":0.000016926668,"teacher_disagreement_score":0.9265276,"about_ca_system_score_codex":0.00010187949,"about_ca_system_score_gemma":0.00062949717,"threshold_uncertainty_score":0.99994504},"labels":[],"label_agreement":null},{"id":"W6967494378","doi":"10.5281/zenodo.11859446","title":"how to convert a pdf to kindle book","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Cover (algebra); File format; Quality (philosophy); Front cover; File size","score_opus":0.022019089754106505,"score_gpt":0.24188433766280557,"score_spread":0.21986524790869905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967494378","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025366712,0.00074664154,0.003453812,0.0021163614,0.00024838807,0.00061285344,0.00023502877,0.00047174311,0.9918615],"genre_scores_gemma":[0.006212942,0.00008405772,0.0003994717,0.0019776814,0.0009155968,9.516494e-8,0.0016134321,0.0039169807,0.98487973],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986636,0.000111393616,0.00011748206,0.0006176164,0.00016955487,0.00032034473],"domain_scores_gemma":[0.99920154,0.0000025881614,0.000045977038,0.00039806907,0.00012371138,0.00022813812],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019261197,0.00018997806,0.00015389042,0.00016314436,0.00024017265,0.00055281015,0.0007366265,0.00018744466,0.013742875],"category_scores_gemma":[0.00030100663,0.00017210559,0.000069685404,0.00023133033,0.000053034848,0.0000026872897,0.0018160411,0.00016796187,0.045945104],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022162665,0.000023880779,1.8219076e-7,0.00004979472,0.00004584998,0.0000095987325,0.00003438625,0.0000012061877,0.029588029,0.0001291994,0.9545737,0.015522004],"study_design_scores_gemma":[0.00010810424,0.00048115812,0.0000048515285,0.00007076581,0.000010423131,0.000024843053,0.000033243585,0.0000044671838,0.0019295757,0.000013500582,0.9970871,0.00023193618],"about_ca_topic_score_codex":0.0000066722514,"about_ca_topic_score_gemma":6.495628e-7,"teacher_disagreement_score":0.042513426,"about_ca_system_score_codex":0.000031149568,"about_ca_system_score_gemma":0.0000031405114,"threshold_uncertainty_score":0.9871587},"labels":[],"label_agreement":null},{"id":"W6967590354","doi":"10.5281/zenodo.11759433","title":"Honda shadow 750 handbuch pdf deutsch","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Shadow (psychology); Stall (fluid mechanics); Shadow mapping; Camber (aerodynamics)","score_opus":0.024465212663705452,"score_gpt":0.24693336152961323,"score_spread":0.22246814886590777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967590354","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023596701,0.0071280287,0.0022935695,0.00064975396,0.0008609522,0.00072531065,0.000592023,0.0005550124,0.9848357],"genre_scores_gemma":[0.23175855,0.0035216725,0.0006880665,0.0009353483,0.005132153,1.6420941e-7,0.022095185,0.0118391905,0.72402966],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967279,0.00047202333,0.00042472186,0.0012777386,0.00036195447,0.00073564815],"domain_scores_gemma":[0.9983454,0.000012429173,0.00019416265,0.0007564438,0.00038581467,0.0003057891],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006574324,0.00047230232,0.00036409486,0.00023048054,0.0011226266,0.0012667143,0.0015606767,0.0006196496,0.08154039],"category_scores_gemma":[0.0005136562,0.00043209206,0.00023546655,0.00046167645,0.0003322772,0.00000832206,0.0033057209,0.00069451594,0.21055],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008426932,0.0001476229,0.0000022352197,0.0002826985,0.0003075746,0.000054777054,0.00010695094,0.000006782877,0.042986374,0.0005559426,0.88683367,0.06863112],"study_design_scores_gemma":[0.00040555032,0.0007268928,0.000025121502,0.00021671629,0.00008042674,0.000105826475,0.00008619678,0.00008864875,0.0021042165,0.00014570136,0.9954842,0.00053054467],"about_ca_topic_score_codex":0.00001267631,"about_ca_topic_score_gemma":8.070575e-7,"teacher_disagreement_score":0.260806,"about_ca_system_score_codex":0.00008502577,"about_ca_system_score_gemma":0.000011320601,"threshold_uncertainty_score":0.9998131},"labels":[],"label_agreement":null},{"id":"W6967677459","doi":"10.5281/zenodo.10437041","title":"Toward Adaptive Tracing: Efficient System Behavior Analysis using Language Models","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Source code; Kernel (algebra); Data source; Key (lock); Code (set theory); Web server","score_opus":0.07713998688621512,"score_gpt":0.2785133182458111,"score_spread":0.20137333135959598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967677459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9391576,0.00007151502,0.053040788,0.00002028525,0.00004175134,0.00020435294,0.00010577418,0.00035184424,0.0070060603],"genre_scores_gemma":[0.99807966,0.000006945905,0.00029113263,0.000019200561,0.000095665615,4.1640146e-8,0.0011777972,0.0002318579,0.000097687895],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883956,0.00018703002,0.0001625619,0.00036644793,0.00016974316,0.00027467342],"domain_scores_gemma":[0.99940515,0.000005810489,0.00006397722,0.00024531016,0.00018559281,0.00009417651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041887836,0.00010340626,0.00012583127,0.00016282982,0.0007022398,0.00016147697,0.00038271604,0.000074695854,0.00016939633],"category_scores_gemma":[0.00007979287,0.0000944089,0.00010190324,0.00076717354,0.00005696063,0.0000049847645,0.00070357305,0.000092514274,0.00034587513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021089881,0.0002889095,0.0000466311,0.00011728251,0.0006138048,0.00015450097,0.0023842948,0.20207271,0.7368215,0.0019065964,0.0032997339,0.05208315],"study_design_scores_gemma":[0.001274191,0.0011689182,0.0024001356,0.00008124609,0.0006508424,0.00023837568,0.009794764,0.9043594,0.03989759,0.000033408814,0.039069034,0.0010320923],"about_ca_topic_score_codex":0.000010564233,"about_ca_topic_score_gemma":1.4177337e-7,"teacher_disagreement_score":0.7022867,"about_ca_system_score_codex":0.00004816113,"about_ca_system_score_gemma":0.0000023066184,"threshold_uncertainty_score":0.54011315},"labels":[],"label_agreement":null},{"id":"W6967692168","doi":"10.5281/zenodo.12294168","title":"guide sommeil polyphasique pdf","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sleep (system call); Rapid eye movement sleep; Autonomic dysreflexia","score_opus":0.020838176525248497,"score_gpt":0.2518279384019124,"score_spread":0.23098976187666392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967692168","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014660804,0.003363111,0.0030102879,0.0013398081,0.0005228492,0.0004168776,0.00025867345,0.00030418552,0.98931813],"genre_scores_gemma":[0.037104778,0.0008490222,0.0005457067,0.0007092007,0.00199754,5.306188e-8,0.004166457,0.00438505,0.9502422],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99737114,0.00046388517,0.00038889574,0.0009426653,0.00023060729,0.0006027928],"domain_scores_gemma":[0.99867666,0.000011797424,0.00015038339,0.00059422746,0.00031296498,0.00025399885],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005767401,0.00036633408,0.00027241246,0.00015825155,0.00083301106,0.0007635379,0.0012428215,0.0005085198,0.12421105],"category_scores_gemma":[0.00060770346,0.00034812788,0.00019443623,0.00030414393,0.00033480424,0.0000071634827,0.0026386618,0.0005110598,0.14842163],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034030978,0.00015956064,0.000001047364,0.00019657149,0.00016467502,0.000042860447,0.00008479156,0.000007655397,0.050470043,0.003046855,0.75133944,0.19445245],"study_design_scores_gemma":[0.000383288,0.0005829376,0.000024138291,0.00016839545,0.000045610417,0.0002155849,0.00008717959,0.00007975987,0.002603285,0.00019273798,0.99520415,0.00041291505],"about_ca_topic_score_codex":0.000027892138,"about_ca_topic_score_gemma":0.0000014374547,"teacher_disagreement_score":0.24386472,"about_ca_system_score_codex":0.00011622567,"about_ca_system_score_gemma":0.000011051814,"threshold_uncertainty_score":0.99989706},"labels":[],"label_agreement":null},{"id":"W6967736221","doi":"10.5281/zenodo.11745843","title":"Wiener lieder noten pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wiener index; Piano; Wiener filter; Index (typography)","score_opus":0.023732289015266743,"score_gpt":0.24219694571357994,"score_spread":0.2184646566983132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967736221","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014740357,0.0034381384,0.0014867949,0.0006350634,0.0006480663,0.00047487236,0.00030868867,0.0003562568,0.9911781],"genre_scores_gemma":[0.13795127,0.0015898496,0.00048820366,0.0009862139,0.0045875064,8.362742e-8,0.013525115,0.009054781,0.831817],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972589,0.0003701528,0.0003532642,0.0010995422,0.00030315196,0.0006150021],"domain_scores_gemma":[0.99861354,0.0000088451925,0.0001591327,0.0006663507,0.00030757734,0.00024454767],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005322319,0.00039071817,0.0002914681,0.00018683072,0.00090403366,0.0009680168,0.0012752166,0.000529509,0.097660564],"category_scores_gemma":[0.0004199898,0.00034957528,0.00019468833,0.00034339764,0.00029143045,0.000006556495,0.0029955734,0.00053260865,0.27515006],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060449773,0.00012349548,8.73707e-7,0.00018610727,0.0002642409,0.00003956026,0.00009218563,0.000010684026,0.03803949,0.00058882014,0.9024341,0.058159996],"study_design_scores_gemma":[0.00029481124,0.00053287734,0.000020356614,0.00013841636,0.000067013294,0.00007071543,0.0000648119,0.00007856389,0.0012842773,0.000117758296,0.99687725,0.00045316687],"about_ca_topic_score_codex":0.0000068254685,"about_ca_topic_score_gemma":3.147021e-7,"teacher_disagreement_score":0.17748949,"about_ca_system_score_codex":0.00006825559,"about_ca_system_score_gemma":0.0000072924195,"threshold_uncertainty_score":0.99989563},"labels":[],"label_agreement":null},{"id":"W6968259752","doi":"10.5281/zenodo.4156597","title":"Watch Ain't No Time For Women (2020) Full Movie Online Free Download Streaming HD 123Movies TV jdg","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Prime time; Download; Action (physics); Order (exchange); Online video; Online and offline","score_opus":0.020296304232543298,"score_gpt":0.22881519422434915,"score_spread":0.20851888999180584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968259752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9613138,0.0002601086,0.0032712533,0.0045705824,0.00012271684,0.0008801949,0.0020910997,0.00058677624,0.02690347],"genre_scores_gemma":[0.9779279,0.00022684051,0.0022640596,0.0018588407,0.0015621786,3.384328e-7,0.010918861,0.0008000132,0.0044409675],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984156,0.00015469409,0.0002576131,0.0005387835,0.00017458152,0.00045874203],"domain_scores_gemma":[0.99890137,0.000019785328,0.00009694852,0.00035060197,0.00039877396,0.0002325082],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034213078,0.00017942903,0.0001874486,0.000027578168,0.0007505057,0.00023797089,0.0009334977,0.000116191746,0.0033414585],"category_scores_gemma":[0.0014508824,0.0001618109,0.00008332188,0.0001965049,0.000105443076,0.0000120421055,0.0016007667,0.00016148105,0.0018548265],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037717717,0.00013925518,0.000009651655,0.000101097474,0.00007461754,0.000008581905,0.00029167364,0.000054101456,0.660262,0.000079384976,0.28457138,0.054031108],"study_design_scores_gemma":[0.0007073868,0.0015605221,0.000093254894,0.000011737463,0.000009448246,0.000017853727,0.00017166046,0.0007550462,0.005948622,0.000067914756,0.9904199,0.00023660516],"about_ca_topic_score_codex":0.0000030047872,"about_ca_topic_score_gemma":2.2804232e-7,"teacher_disagreement_score":0.7058486,"about_ca_system_score_codex":0.000039497765,"about_ca_system_score_gemma":0.000005849252,"threshold_uncertainty_score":0.99892235},"labels":[],"label_agreement":null},{"id":"W6976566832","doi":"10.6068/dp14ba876cd0f87","title":"Trend 2000 - 2006. Statistics Canada. CANSIM: Income, Pensions, Spending and Wealth - Household, Family and Personal Income | Country: Canada | Table: Seniors' characteristics, by age group and source of income | Variable: 75 years and over, Workers' Compensation, Amount of income | Units: , 2000-2006. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-119.","year":2015,"lang":"en","type":"other","venue":"Data Planet","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Personal income; Economic statistics; Socioeconomic status; Total personal income; Census; Official statistics; Population; Summary statistics; Household income; Transfer payment","score_opus":0.015164612389443458,"score_gpt":0.22703277205988323,"score_spread":0.21186815967043976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976566832","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037498355,0.0051736846,0.0000123490845,0.0000010023342,0.00023070673,0.00033599086,0.9903286,0.000015373016,0.00015244386],"genre_scores_gemma":[0.010493292,0.0024574061,0.0002480269,0.00013675544,0.00013269001,0.0000026604505,0.9858665,0.00009183075,0.00057086884],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969455,0.00030680915,0.0008097973,0.0009352868,0.0004921993,0.00051041483],"domain_scores_gemma":[0.9975901,0.00034401697,0.0007503461,0.00083218,0.00004168767,0.00044166128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005715853,0.0005399633,0.00096884725,0.00008676648,0.00013274385,0.00011627923,0.00057904946,0.0004589929,0.00011044511],"category_scores_gemma":[0.00008505863,0.0005020154,3.912632e-7,0.0001719003,0.00048867473,0.000027137114,0.001053778,0.00045248715,3.8245744e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012213229,0.000036624002,0.008716609,0.0005323742,0.00016698564,0.00009112569,0.0000036345384,0.0000014419837,0.00022301901,0.00004078502,0.9898358,0.00022945847],"study_design_scores_gemma":[0.0009015859,0.00018661887,0.0031307233,0.00011373679,0.00016914419,0.000111411595,0.00015028223,0.00047384293,1.4951331e-7,2.4127328e-7,0.9941949,0.0005673519],"about_ca_topic_score_codex":0.99237067,"about_ca_topic_score_gemma":0.9277782,"teacher_disagreement_score":0.06459247,"about_ca_system_score_codex":0.00008473758,"about_ca_system_score_gemma":0.002015474,"threshold_uncertainty_score":0.99974316},"labels":[],"label_agreement":null},{"id":"W6976637055","doi":"10.60692/bqyj6-tsz98","title":"International economic policy uncertainty and stock market returns of Bangladesh: evidence from linear and nonlinear model","year":2020,"lang":"en","type":"article","venue":"Greater South Information System","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Volatility (finance); Stock (firearms); Stock market; Stock market volatility; Stock market bubble; Capital market; Stock market index","score_opus":0.0403923543582188,"score_gpt":0.24528204281018087,"score_spread":0.20488968845196207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976637055","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925393,0.000014485761,0.006234086,0.00024779927,0.000042052063,0.00009591004,0.0002540303,0.000013527319,0.0005588462],"genre_scores_gemma":[0.99785876,0.0000050333274,0.0015896835,0.00023866812,0.00022472108,0.000002889457,0.000059398702,0.0000030710175,0.00001774519],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943954,0.000024783743,0.0002678716,0.00013234127,0.00005629816,0.000079196085],"domain_scores_gemma":[0.99965644,0.000006047136,0.00014407364,0.000090852,0.000039042214,0.00006353614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010001907,0.00008677754,0.00011540733,0.000028300501,0.000027385813,0.000032478434,0.00010324889,0.000086073014,0.000004968004],"category_scores_gemma":[0.00004590432,0.00006779444,0.000029488754,0.00002349351,0.00003185067,0.000019657424,0.0001481329,0.00004008305,0.0000050722506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002998917,0.000010748141,0.89039904,0.0010895616,0.00058970595,0.0000040980426,0.05036674,0.024490515,0.015564999,0.00019249221,0.0012604034,0.013032774],"study_design_scores_gemma":[0.00060888886,0.00013826758,0.011601125,0.00007871518,0.000013183451,0.0000071776826,0.0010696418,0.981833,0.0037994236,0.0000017796478,0.00069137925,0.0001574173],"about_ca_topic_score_codex":0.000017092516,"about_ca_topic_score_gemma":2.9174504e-7,"teacher_disagreement_score":0.9573425,"about_ca_system_score_codex":0.0000137691995,"about_ca_system_score_gemma":0.000029471053,"threshold_uncertainty_score":0.2764577},"labels":[],"label_agreement":null},{"id":"W6976806600","doi":"10.60692/1jv69-vw072","title":"Dynamic versus static neural network model for rainfall forecasting at Klang River Basin, Malaysia","year":2012,"lang":"en","type":"article","venue":"Greater South Information System","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Artificial neural network; Perceptron; Radial basis function; Multilayer perceptron; Basis (linear algebra); Flooding (psychology); Time series","score_opus":0.052324862400928256,"score_gpt":0.23348416737815045,"score_spread":0.18115930497722219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976806600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89503217,0.000012700456,0.103622966,0.000012564524,0.00041247785,0.0003011801,0.000062934094,0.00004219905,0.0005008179],"genre_scores_gemma":[0.99509674,1.3423727e-7,0.00401344,0.00021282856,0.00020838506,0.00003898411,0.000258745,0.000010804648,0.00015992644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895966,0.000037214122,0.00034351408,0.00012984221,0.00009517265,0.00043459187],"domain_scores_gemma":[0.9994333,0.000011502971,0.00020606423,0.00017459622,0.00008232686,0.00009220193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030494697,0.00016203223,0.00015392088,0.00003111594,0.00017006106,0.000042164644,0.0001193576,0.00012944074,0.0000027891792],"category_scores_gemma":[0.000028054403,0.00012510308,0.00010383723,0.000056004632,0.000025884705,0.000028377157,0.00013410808,0.00004576861,0.00003584449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036466504,0.00001785305,0.39862263,0.0013529013,0.0004433791,0.0000026000534,0.032818347,0.5505745,0.0007080441,0.00032329676,0.0032622977,0.008227489],"study_design_scores_gemma":[0.0011238765,0.000120782526,0.004031902,0.000028026921,0.000028206858,0.000017222008,0.0005588916,0.99318016,0.00017430016,0.0000012470175,0.00052198465,0.00021342355],"about_ca_topic_score_codex":9.1135155e-7,"about_ca_topic_score_gemma":2.1318958e-7,"teacher_disagreement_score":0.44260564,"about_ca_system_score_codex":0.000054980555,"about_ca_system_score_gemma":0.000011233457,"threshold_uncertainty_score":0.51015556},"labels":[],"label_agreement":null},{"id":"W6976859316","doi":"10.6084/m9.figshare.12380150.v1","title":"Introduction: Forest Health Monitoring 2008 National Technical Report","year":2020,"lang":"en","type":"other","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Forest health; Sustainable forest management; Forest management; Forest ecology; Context (archaeology); Baseline (sea); Ecosystem health; Temperate rainforest","score_opus":0.040056684373984935,"score_gpt":0.3047570603377883,"score_spread":0.26470037596380336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976859316","genre_codex":"other","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022264063,0.014024494,0.00014871579,0.009590514,0.0020172505,0.00142095,0.13910569,0.00087752676,0.8327926],"genre_scores_gemma":[0.002968974,0.0000752731,0.0035912588,0.0009848638,0.053565826,0.00014370515,0.6743445,0.0003055313,0.2640201],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989807,0.000024765097,0.00018596028,0.00046960224,0.00016492065,0.0001740593],"domain_scores_gemma":[0.99946624,0.0000058681703,0.00020083724,0.00018788555,0.00005093989,0.000088213346],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000046726294,0.00016186533,0.00016748832,0.000027673199,0.000046632416,0.000019270736,0.0001812107,0.00031277054,0.027297726],"category_scores_gemma":[0.00080169766,0.00014187813,0.00008828091,0.000058830996,0.000008384654,7.6136104e-7,0.00020564623,0.00017865714,0.00035052927],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032905457,0.000011191236,0.000049016977,0.00005749445,0.00001651653,0.000017068314,6.4235087e-7,0.000002794283,0.00045566517,0.0000028214527,0.9986348,0.0007486842],"study_design_scores_gemma":[0.000057328067,0.00009512557,0.00030618833,0.00023060336,0.0000016217513,0.000104516475,0.0000013022931,0.0000019587692,0.00034517897,0.000008777372,0.99869156,0.00015583649],"about_ca_topic_score_codex":0.0000046979576,"about_ca_topic_score_gemma":0.000009210333,"teacher_disagreement_score":0.5687725,"about_ca_system_score_codex":0.000022643775,"about_ca_system_score_gemma":0.00015047645,"threshold_uncertainty_score":0.97359145},"labels":[],"label_agreement":null},{"id":"W6977452474","doi":"10.6084/m9.figshare.c.7455980","title":"A systematic review and meta-analysis of the association of all types of beverages high in fructose with asthma in children and adolescents","year":2024,"lang":"en","type":"other","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Asthma; Odds ratio; Observational study; Odds; Cohort study; Association (psychology); Confidence interval","score_opus":0.012760573827483898,"score_gpt":0.24128775912947265,"score_spread":0.22852718530198873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977452474","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050672546,0.77376515,5.5780066e-7,0.00012775602,0.000018136787,0.0034595348,0.16960052,0.000013101496,0.0023427187],"genre_scores_gemma":[0.9857904,0.0008495445,0.000024746209,0.00012360947,0.000010514613,0.00003299272,0.00786265,0.00003523943,0.005270313],"study_design_codex":"systematic_review","study_design_gemma":"meta_analysis","domain_scores_codex":[0.99942386,0.00009799736,0.00020893275,0.00014898404,0.00007048672,0.00004972207],"domain_scores_gemma":[0.9994794,0.000010297883,0.00035168263,0.0001259004,0.000024838379,0.000007861505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008848812,0.000090200025,0.0007099593,0.00005491971,0.0000018905188,0.0000029854898,0.00008341156,0.00011949904,0.00048225714],"category_scores_gemma":[0.00018649736,0.000045986322,0.00011612422,0.00015319104,0.000005578152,5.394822e-7,0.000093407,0.000051988314,6.9251183e-7],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029564813,0.00024766958,0.03737054,0.68096125,0.2058792,0.000004221789,0.000103198916,0.000033128115,0.0012639514,0.000012374521,0.07402491,0.00006997193],"study_design_scores_gemma":[0.0011048949,0.0005395908,0.3391686,0.292275,0.36126247,0.000010054612,0.000024270206,0.000031091375,0.002773443,0.000030196903,0.0017434251,0.0010369293],"about_ca_topic_score_codex":0.00003557901,"about_ca_topic_score_gemma":0.00016606848,"teacher_disagreement_score":0.93511784,"about_ca_system_score_codex":0.000003638388,"about_ca_system_score_gemma":0.0000074770355,"threshold_uncertainty_score":0.5280377},"labels":[],"label_agreement":null},{"id":"W6977553122","doi":"10.6084/m9.figshare.c.7248780","title":"Testing the generalizability and effectiveness of deep learning models among clinics: sperm detection as a pilot study","year":2024,"lang":"en","type":"other","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CReATe Fertility Centre; University of Toronto","funders":"","keywords":"Deep learning; Generalizability theory; Preprocessor; Sample (material); Intraclass correlation; Object detection; Pattern recognition (psychology)","score_opus":0.062362784087293316,"score_gpt":0.2965040417806014,"score_spread":0.2341412576933081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977553122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8905047,0.010478702,0.000117741045,0.000002976429,0.00027377967,0.0027971817,0.0073094293,0.00024074627,0.08827473],"genre_scores_gemma":[0.9954035,0.000006982412,0.000025424493,0.0000111537065,0.00026405154,0.000081719925,0.002154131,0.00010238952,0.0019506472],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9987482,0.00037413798,0.00017453032,0.0004743719,0.000086563094,0.00014223154],"domain_scores_gemma":[0.9994085,0.00013104522,0.00014998528,0.0002174137,0.00005977107,0.000033301756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002977324,0.00019568049,0.00021816138,0.000029545086,0.000054375734,0.00003393507,0.00015352911,0.0001783856,0.0008717308],"category_scores_gemma":[0.0010377459,0.00012805144,0.000060541977,0.00009324412,0.000026661894,0.0000015056528,0.0003540155,0.00024141948,0.00002988033],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022414753,0.0035322953,0.09310941,0.026629766,0.00467091,0.00020926092,0.0009779881,0.00957851,0.43073684,0.000034322096,0.044227663,0.38405156],"study_design_scores_gemma":[0.009259302,0.13394421,0.44797766,0.04152507,0.0019619172,0.0002690827,0.003028239,0.077802174,0.05364637,0.005081096,0.21558386,0.00992101],"about_ca_topic_score_codex":0.00007429255,"about_ca_topic_score_gemma":0.000051951283,"teacher_disagreement_score":0.37709045,"about_ca_system_score_codex":0.000007682252,"about_ca_system_score_gemma":0.000016866921,"threshold_uncertainty_score":0.95448405},"labels":[],"label_agreement":null},{"id":"W6977638893","doi":"10.6084/m9.figshare.c.6567103.v1","title":"Responses of mouse visual cortical pyramid cell somata and apical dendrites over multiple days","year":2023,"lang":"en","type":"other","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Canadian Institute for Advanced Research","funders":"","keywords":"Stimulus (psychology); Visual cortex; Sample (material); Pyramid (geometry); Visual system; Cell","score_opus":0.026498306286799223,"score_gpt":0.28057222116541075,"score_spread":0.25407391487861153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977638893","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39809412,0.009191209,0.000020983984,0.0000474783,0.0003333239,0.0012635898,0.55809635,0.0007591015,0.032193832],"genre_scores_gemma":[0.60598725,0.00025615896,0.00046649372,0.00027229972,0.0012134856,0.00007721968,0.1305134,0.00084473967,0.26036897],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990575,0.00006566058,0.00017268867,0.0003853414,0.000104247665,0.00021461329],"domain_scores_gemma":[0.99943393,0.00014504518,0.00010772183,0.00020532116,0.000026493695,0.000081459744],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000035043828,0.00019732707,0.00023114291,0.000044562334,0.00003061369,0.000019138177,0.00016909676,0.00048973743,0.007904325],"category_scores_gemma":[0.001301613,0.00015972486,0.00008641701,0.000048600145,0.000039063438,0.0000010522257,0.00044437798,0.00014117573,0.00014713906],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084069405,0.00008522872,0.0013775366,0.00022856609,0.000044193035,0.000020632331,0.0000046020778,6.977419e-7,0.1567687,0.0000018756225,0.8409055,0.0004784396],"study_design_scores_gemma":[0.0008647918,0.00064375676,0.007861206,0.0009667756,0.000030793755,0.000010006821,0.000026812168,0.00030913434,0.16124617,0.0000042327392,0.82736623,0.00067012076],"about_ca_topic_score_codex":0.0000103277835,"about_ca_topic_score_gemma":0.000036565092,"teacher_disagreement_score":0.42758298,"about_ca_system_score_codex":0.000003887043,"about_ca_system_score_gemma":0.000030524272,"threshold_uncertainty_score":0.9930026},"labels":[],"label_agreement":null},{"id":"W6977659822","doi":"10.6084/m9.figshare.7603271.v1","title":"White Matter Tractography Guides","year":2019,"lang":"en","type":"dataset","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Splenium; Tractography; White matter; Corpus callosum; Neuroimaging; Inferior longitudinal fasciculus","score_opus":0.03250291576219064,"score_gpt":0.27346632863443165,"score_spread":0.24096341287224102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977659822","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056194327,0.00048400578,2.9938397e-7,0.000026836946,0.00012743867,0.00016096755,0.99803567,0.000009241331,0.0010993748],"genre_scores_gemma":[0.00022917084,0.000016099555,0.000029945686,0.0016056409,0.0006048068,0.00003543393,0.9967709,0.000016426486,0.0006915869],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891007,0.000040604966,0.0001929788,0.0004771714,0.0001051374,0.00027405427],"domain_scores_gemma":[0.99917,0.000016238622,0.00014242457,0.0005423362,0.000066040055,0.00006295822],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000032899246,0.0002661536,0.00021085312,0.000046193112,0.00004290333,0.000058791265,0.00050234457,0.00058776,0.1349075],"category_scores_gemma":[0.00013424164,0.00020838637,0.00023201594,0.00006829717,0.000007933876,0.0000013685345,0.0003669978,0.0002215269,0.009384581],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007605963,0.00002067675,0.00021200482,0.00014870217,0.00003147197,0.000005270678,3.949657e-7,0.000002303129,0.00015898363,1.0739426e-8,0.9993179,0.00009467287],"study_design_scores_gemma":[0.00008672023,0.00009965642,0.0028862143,0.0003019111,0.0000114418435,0.00000899958,0.0000015514821,6.856118e-7,0.000246046,0.000001313928,0.99603826,0.00031717587],"about_ca_topic_score_codex":0.0000023525006,"about_ca_topic_score_gemma":0.000003516987,"teacher_disagreement_score":0.12552293,"about_ca_system_score_codex":0.0000040854743,"about_ca_system_score_gemma":0.000031619355,"threshold_uncertainty_score":0.9913867},"labels":[],"label_agreement":null},{"id":"W6992611041","doi":"","title":"L’expérience d’apprendre en ligne en pandémie : l’autorégulation des comportements multitâches de jeunes adultes de facultés d’éducation au regard de leur bien-être numérique","year":2024,"lang":"fr","type":"dissertation","venue":"Knowledge UdeS (Institutional Deposit of the University of Sherbrooke)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Population; Ligne; Context (archaeology); Work (physics)","score_opus":0.013883988102115887,"score_gpt":0.24752838805355853,"score_spread":0.23364439995144265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992611041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9754995,0.0060539437,0.01573366,0.000082226594,0.0004907734,0.00032375022,0.00004268795,0.000027762662,0.0017456746],"genre_scores_gemma":[0.9890201,0.001042344,0.0065388754,0.0000125460165,0.00022573421,0.0000027069343,0.0004860248,0.000017742774,0.0026539187],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981244,0.00036071916,0.00039043766,0.00051192316,0.00021801764,0.0003944555],"domain_scores_gemma":[0.9989827,0.000090619316,0.00023669499,0.0002525823,0.0003012946,0.00013610949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042129817,0.00035831047,0.0003382714,0.00010168818,0.0005635189,0.000031140225,0.00071621896,0.00065143144,0.000012667384],"category_scores_gemma":[0.00024641523,0.00032927885,0.0003868704,0.00021429223,0.000593731,0.000037352464,0.00030442615,0.00030321014,0.000009760549],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022387244,0.0004589962,0.16028051,0.003966767,0.00033566987,0.00001336314,0.056301698,0.015380808,0.7594145,0.0007787431,0.00017738633,0.0026677076],"study_design_scores_gemma":[0.00074050267,0.00031942158,0.37253857,0.0071295267,0.00035283397,0.000073067764,0.011001984,0.020218324,0.58058864,0.0004693868,0.006014606,0.0005531072],"about_ca_topic_score_codex":0.0038130924,"about_ca_topic_score_gemma":0.022524485,"teacher_disagreement_score":0.21225806,"about_ca_system_score_codex":0.0017661013,"about_ca_system_score_gemma":0.00096114184,"threshold_uncertainty_score":0.9999159},"labels":[],"label_agreement":null},{"id":"W6993003142","doi":"","title":"Modifiability of residual force depression in single muscle fibres following uphill and downhill training in rats","year":2020,"lang":"en","type":"dissertation","venue":"The Atrium (University of Guelph)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isometric exercise; Muscle contraction; Muscle fatigue; Contraction (grammar); Depression (economics); Work (physics); Muscle stiffness; Residual","score_opus":0.020690566616372988,"score_gpt":0.23024520075385188,"score_spread":0.20955463413747888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6993003142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981598,0.00057834113,0.000030004336,0.00009061533,0.00005048654,0.00015529223,0.000011516279,0.0000048532,0.00091909413],"genre_scores_gemma":[0.9993911,0.00005072215,0.00020696402,0.000012302326,0.000029081992,1.6065023e-7,0.00020809968,0.00000623931,0.00009536171],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9991971,0.00012069776,0.00015993675,0.00029013818,0.000093210685,0.00013891753],"domain_scores_gemma":[0.9995676,0.00005696057,0.00015904698,0.00015480469,0.000030741256,0.000030797873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000258977,0.000118892895,0.0002624609,0.000050803603,0.000058559715,0.0000044077237,0.00023617022,0.00023011465,0.0000034610705],"category_scores_gemma":[0.0001109978,0.00010571324,0.00010758973,0.00012496821,0.00006386174,0.0000063413486,0.00014979116,0.00014949296,2.0643478e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033030857,0.000024288938,0.0036303217,0.00008161678,0.00001728529,0.000006110919,0.002068895,0.000096639,0.9898366,0.0000073763763,0.000013360339,0.0038872163],"study_design_scores_gemma":[0.001658155,0.0006678157,0.861699,0.0004033108,0.00009808429,0.0000018278798,0.027246952,0.00049333286,0.106161594,0.0007179238,0.00040311718,0.00044888366],"about_ca_topic_score_codex":0.0002037564,"about_ca_topic_score_gemma":0.00061013864,"teacher_disagreement_score":0.883675,"about_ca_system_score_codex":0.000011167407,"about_ca_system_score_gemma":0.000045594126,"threshold_uncertainty_score":0.4310861},"labels":[],"label_agreement":null},{"id":"W6999477321","doi":"","title":"Data-Informed Participatory Leadership: Cultivating Collective Decision-Making in K–12 Schools Through Global Research and Local Practice","year":2025,"lang":"en","type":"article","venue":"Pepperdine Digital Commons (Pepperdine University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Participatory action research; Citizen journalism; Participatory GIS; Presentation (obstetrics); Work (physics); Collective action; Corporate governance; Action research; Sustainability","score_opus":0.15395078230097256,"score_gpt":0.391916781536213,"score_spread":0.23796599923524045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999477321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8006279,0.00059818156,0.013792781,0.0017041912,0.0001195053,0.000535483,0.00029204888,0.00006610451,0.1822638],"genre_scores_gemma":[0.99690366,0.000034381654,0.0012742943,0.00030607867,0.00006394289,0.0000026982202,0.00017800886,0.00001163183,0.0012252796],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769706,0.00021067586,0.00033829076,0.0008164633,0.00023705888,0.00070046453],"domain_scores_gemma":[0.99795645,0.00091973663,0.00009797514,0.0006034112,0.00030122136,0.00012119257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058529264,0.00026950878,0.00032361946,0.00023987716,0.00047142943,0.00021679686,0.00080279185,0.0002469304,0.000005516733],"category_scores_gemma":[0.004320241,0.0002607929,0.00007297389,0.0015011398,0.0004900458,0.00018756538,0.0028222643,0.00050655135,0.0000078765715],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0124042155,0.0028772738,0.660203,0.00035893664,0.0012895918,0.00093775435,0.0010988186,0.001296899,0.0065861098,0.039265107,0.0658348,0.20784755],"study_design_scores_gemma":[0.010224023,0.0035308932,0.043510623,0.0024305435,0.00019341656,0.00022118168,0.1136796,0.0058177593,0.002284366,0.007074031,0.8085152,0.0025183465],"about_ca_topic_score_codex":0.000047986592,"about_ca_topic_score_gemma":0.00049045106,"teacher_disagreement_score":0.74268043,"about_ca_system_score_codex":0.0003521847,"about_ca_system_score_gemma":0.00045630548,"threshold_uncertainty_score":0.99998444},"labels":[],"label_agreement":null},{"id":"W6999773081","doi":"","title":"De Staat van het Klimaat 2009 - Actueel onderzoek en beleid nader verklaard:","year":2010,"lang":"nl","type":"book-chapter","venue":"TNO Repository","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer","keywords":"Action (physics); Government (linguistics); Work (physics)","score_opus":0.007924104319338933,"score_gpt":0.2248373711552254,"score_spread":0.21691326683588646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999773081","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35742715,0.009884113,0.00070519897,0.0003364158,0.004409614,0.00091455184,0.0001839655,0.00016962363,0.62596935],"genre_scores_gemma":[0.7777711,0.0009616885,0.0013115457,0.0011800361,0.00590074,0.000016069192,0.0005015356,0.00015295512,0.21220434],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99608696,0.0002038423,0.0008196361,0.0014537452,0.00040821402,0.001027594],"domain_scores_gemma":[0.9974872,0.00011410307,0.00053264,0.0011592346,0.00022017061,0.000486683],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00045774286,0.0009855388,0.0007886041,0.00010119784,0.00054764765,0.00018343,0.00087842194,0.0029397898,0.0006755461],"category_scores_gemma":[0.00009878303,0.0008790874,0.0006778113,0.00003894172,0.0004905097,0.000009790688,0.00073167135,0.001634312,0.00028694922],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024010484,0.00014766441,0.0006396814,0.00014005807,0.0004735548,0.0004574927,0.000087812536,0.000017572605,0.9836575,0.00076431123,0.0034059815,0.009968314],"study_design_scores_gemma":[0.0006297503,0.0010608515,0.0011306067,0.00017882313,0.00025176586,0.00051417644,0.00005678345,0.000029236035,0.24031235,0.0005864689,0.7539515,0.0012977181],"about_ca_topic_score_codex":0.000070622475,"about_ca_topic_score_gemma":0.000017617916,"teacher_disagreement_score":0.7505455,"about_ca_system_score_codex":0.00013198907,"about_ca_system_score_gemma":0.00038427828,"threshold_uncertainty_score":0.999366},"labels":[],"label_agreement":null},{"id":"W7000081205","doi":"","title":"Electro-Microfluidic Sensor for Quantitative Detection of Microplastics in Saline Freshwater","year":2024,"lang":"en","type":"other","venue":"York University Digital Library (York University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Microplastics; Salinity; Seawater; Detection limit; Saline; Particulates","score_opus":0.009904994390829282,"score_gpt":0.18422703606591506,"score_spread":0.17432204167508578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000081205","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25690582,0.010991288,0.02649385,0.00026654647,0.0014589184,0.0026564184,0.022505432,0.0009331044,0.6777886],"genre_scores_gemma":[0.12463156,0.0006036872,0.0023633328,0.00004715631,0.00023077452,1.7884666e-7,0.0022503482,0.00022420926,0.86964875],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989336,0.000052654363,0.000138382,0.00052197604,0.00006919534,0.00028416835],"domain_scores_gemma":[0.99953014,0.000039172406,0.0001430946,0.00018838632,0.000023611963,0.00007562191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000022576902,0.00027329085,0.00030236816,0.00050239643,0.000041094314,0.00004235654,0.00034914532,0.00046337317,0.000041401203],"category_scores_gemma":[0.000017169677,0.00028907217,0.00022867907,0.00046925506,0.00016658138,0.000021239439,0.0003088958,0.00017467151,0.000030983865],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031369906,0.00039555875,0.0017700159,0.0007012577,0.0008395564,0.0003344046,0.000081437494,0.0000199521,0.36172614,0.0031429569,0.62617755,0.001674208],"study_design_scores_gemma":[0.0005730925,0.00055069657,0.000011121826,0.00014925831,0.000060554627,0.0000043700293,0.0004445433,0.000016404247,0.033992052,0.00004629942,0.96381855,0.00033308164],"about_ca_topic_score_codex":0.000023166764,"about_ca_topic_score_gemma":0.000055834582,"teacher_disagreement_score":0.337641,"about_ca_system_score_codex":0.000034204528,"about_ca_system_score_gemma":0.00008653854,"threshold_uncertainty_score":0.99995613},"labels":[],"label_agreement":null},{"id":"W7000296829","doi":"","title":"Evaluating the benefits of home-based peritoneal dialysis","year":2014,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Peritoneal dialysis; Hemodialysis; Dialysis; Renal replacement therapy; Kidney disease; Chronic renal failure; Quality of life (healthcare)","score_opus":0.2656434185489463,"score_gpt":0.5451079321616307,"score_spread":0.2794645136126844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000296829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916542,0.005906894,0.0007164257,0.00012834535,0.00021639923,0.00020028168,0.000016960117,0.000007801875,0.0011526542],"genre_scores_gemma":[0.99803436,0.00060922536,0.00052468915,0.00035408814,0.0003435454,0.000013513611,0.000028797736,0.000019666066,0.00007209948],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99787045,0.00048277562,0.00060083484,0.00036906495,0.0003968892,0.00028001837],"domain_scores_gemma":[0.9981996,0.0002530267,0.0006560446,0.00046990675,0.00031496043,0.0001065048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002194661,0.00021132834,0.00046560148,0.00012539107,0.00022555272,0.0002598269,0.0018995303,0.00013214364,0.00057139137],"category_scores_gemma":[0.0007832405,0.00013737705,0.000262661,0.00037698756,0.00016680737,0.000023633072,0.00080936105,0.00018296824,0.0000024776214],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017093169,0.00010032045,0.15234177,0.00002865541,0.00009663877,5.300193e-7,0.000016569238,0.0030622932,0.7841053,0.00003024412,0.0007160503,0.059330687],"study_design_scores_gemma":[0.0007069249,0.00018088189,0.4768563,0.0001511954,0.00012267467,0.0000041046337,0.00003088041,0.002323933,0.51558554,0.0007203301,0.0029332072,0.0003840206],"about_ca_topic_score_codex":0.00012666074,"about_ca_topic_score_gemma":0.000015912281,"teacher_disagreement_score":0.3245145,"about_ca_system_score_codex":0.000012200774,"about_ca_system_score_gemma":0.00007467396,"threshold_uncertainty_score":0.6256335},"labels":[],"label_agreement":null},{"id":"W7000312987","doi":"","title":"Episode 27: \"Brand New Bitch\"","year":2018,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics)","score_opus":0.0129275778674701,"score_gpt":0.245774923018652,"score_spread":0.2328473451511819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000312987","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004565592,0.00090046285,0.031478994,0.00010617423,0.0015417683,0.0005524519,0.0002607378,0.0001983189,0.9603955],"genre_scores_gemma":[0.013466074,0.00023406584,0.004481497,0.0007036618,0.004484622,0.000017655902,0.001634307,0.00044786662,0.9745302],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966193,0.00027930635,0.0005670281,0.0014427706,0.00026663806,0.000824948],"domain_scores_gemma":[0.998246,0.00008091996,0.00039908563,0.0008109698,0.000032573793,0.00043042438],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016495831,0.0008379674,0.00067814736,0.00027112573,0.000032065138,0.000113514136,0.0014307122,0.00046228775,0.007978136],"category_scores_gemma":[0.00013760195,0.0006859175,0.00054559606,0.00007964363,0.00053928356,0.0000037412074,0.001529672,0.00046736898,0.0037953497],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028622305,0.00008817709,0.0013662404,0.000056793207,0.0004211487,0.000041025633,0.00010477388,0.0000012250007,0.013523161,0.00028929906,0.98254746,0.0012744754],"study_design_scores_gemma":[0.0008110546,0.0010917668,0.00024511694,0.0005023844,0.000059760125,0.000066786735,0.00000973143,0.00021158825,0.0070823906,0.0009695115,0.9881046,0.00084535213],"about_ca_topic_score_codex":0.005325826,"about_ca_topic_score_gemma":0.012102942,"teacher_disagreement_score":0.026997497,"about_ca_system_score_codex":0.000015529711,"about_ca_system_score_gemma":0.00009742902,"threshold_uncertainty_score":0.9995592},"labels":[],"label_agreement":null},{"id":"W7001406340","doi":"","title":"La dynamique et la croissance de jeunes peuplements d'épinettes noires (Picea mariana (Mil.) B.S.P.), entre les 51ième et 52ième degrés de latitude nord au Québec","year":2007,"lang":"fr","type":"other","venue":"Constellation (Université du Québec à Chicoutimi)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Repartition; Wildlife refuge; Latitude","score_opus":0.009847238459595056,"score_gpt":0.23100045199711017,"score_spread":0.2211532135375151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001406340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5986366,0.003604272,0.021039892,0.0052670757,0.00020074972,0.00048170434,0.00012652474,0.000117298856,0.37052587],"genre_scores_gemma":[0.9526597,0.00079221226,0.0022511191,0.0010536897,0.00043027484,0.0000026525825,0.00040290205,0.00011909437,0.04228834],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967304,0.00093870854,0.0004688367,0.00086752285,0.00023363909,0.0007609118],"domain_scores_gemma":[0.9979397,0.00063192676,0.00055052555,0.00041740012,0.00016546974,0.00029499724],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00085266586,0.00069974473,0.00054823165,0.00024137624,0.00046648268,0.00012316977,0.000593922,0.0012965123,0.009548927],"category_scores_gemma":[0.00021556574,0.00072586746,0.00034827366,0.00022510631,0.0007499252,0.000024925028,0.00046792952,0.0006476057,0.000037952403],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027216878,0.00034603878,0.8948144,0.00032940853,0.0008717345,0.000235485,0.0020873998,0.0033011178,0.020931736,0.004804204,0.013496722,0.05850959],"study_design_scores_gemma":[0.0017468448,0.00027081903,0.24109009,0.00047774284,0.00034389,0.00017307163,0.0013531329,0.0038695973,0.0009834782,0.000045753484,0.74839026,0.0012553412],"about_ca_topic_score_codex":0.089196235,"about_ca_topic_score_gemma":0.46166292,"teacher_disagreement_score":0.7348935,"about_ca_system_score_codex":0.0007196788,"about_ca_system_score_gemma":0.0030440795,"threshold_uncertainty_score":0.99998903},"labels":[],"label_agreement":null},{"id":"W7001622450","doi":"","title":"Knowledge of Oral Cancer among the Fourth and Fifth Year Dental Students","year":2018,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cancer; Quarter (Canadian coin); Knowledge level; Leukoplakia; Oral leukoplakia; Risk factor; Oral Cancers; Cancer prevention","score_opus":0.17155636534033072,"score_gpt":0.5514799831352497,"score_spread":0.379923617794919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001622450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911176,0.006945386,0.000069191534,0.000021035685,0.0002628141,0.00018606245,0.000016966686,0.0000040647496,0.0013768687],"genre_scores_gemma":[0.9967564,0.0025174082,0.00006812185,0.00009974325,0.00025142392,0.0000073631913,0.0000057185707,0.000013126345,0.0002806958],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99889976,0.00014645157,0.0003150809,0.00025885896,0.00017775643,0.0002021233],"domain_scores_gemma":[0.99918133,0.00003778522,0.0002967045,0.00021244821,0.00017859311,0.00009313305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058394653,0.00014888796,0.00027186234,0.00006590553,0.00015053825,0.00021848794,0.001370239,0.000091190464,0.00060512364],"category_scores_gemma":[0.00009243392,0.00009410728,0.000087458895,0.00018821534,0.00035109048,0.000028344919,0.0015056082,0.00012485066,0.000002583608],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008489381,0.00008674086,0.8066375,0.000012532824,0.000110205976,0.0000014308865,0.00007018285,0.000003413906,0.18351114,0.0000051015027,0.0027541823,0.006722636],"study_design_scores_gemma":[0.0003631837,0.000053276606,0.9118347,0.000087524924,0.000036748632,0.000003885096,0.000072249204,0.00002667163,0.078987494,0.00013341302,0.008249434,0.00015142474],"about_ca_topic_score_codex":0.0003502378,"about_ca_topic_score_gemma":0.0002738506,"teacher_disagreement_score":0.105197154,"about_ca_system_score_codex":0.000010919436,"about_ca_system_score_gemma":0.000042466345,"threshold_uncertainty_score":0.662568},"labels":[],"label_agreement":null},{"id":"W7003467688","doi":"","title":"","year":2021,"lang":"fr","type":"other","venue":"Directory of Open access Books (OAPEN Foundation)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cultural exchange; Cold war; Western europe","score_opus":0.08382146082012949,"score_gpt":0.400716190858431,"score_spread":0.31689473003830154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7003467688","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2801378,0.0048100487,0.0017709702,0.00075520674,0.0025057844,0.0027452116,0.000015402326,0.00004211293,0.70721745],"genre_scores_gemma":[0.5123188,0.0017220487,0.0035887114,0.0017846213,0.0015370692,0.00024641512,0.00551252,0.00036526858,0.47292453],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99222356,0.0013747896,0.0019475693,0.0027408397,0.00061085215,0.0011024055],"domain_scores_gemma":[0.9940292,0.00028958774,0.0023974446,0.0018629287,0.0009530711,0.0004677418],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0012688054,0.0013557943,0.0020804189,0.00027512753,0.00061902223,0.0036103637,0.008811518,0.0008632318,0.04955097],"category_scores_gemma":[0.0010591758,0.0013344765,0.00077039603,0.00054970407,0.0011046968,0.00014929991,0.013358648,0.00062538165,0.00017237762],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006102963,0.0011116548,0.069207095,0.0009319609,0.0018964869,0.00007415245,0.00007642902,0.00014661618,0.33584467,0.018908216,0.0012035209,0.5699889],"study_design_scores_gemma":[0.0016697278,0.00041449105,0.06697561,0.0011402158,0.0001953831,0.00002927305,0.000084944055,0.00006777331,0.08809549,0.00045476877,0.83930814,0.0015641878],"about_ca_topic_score_codex":0.0020015289,"about_ca_topic_score_gemma":0.0029000405,"teacher_disagreement_score":0.8381046,"about_ca_system_score_codex":0.0001808262,"about_ca_system_score_gemma":0.0014155653,"threshold_uncertainty_score":0.9999193},"labels":[],"label_agreement":null},{"id":"W7005418586","doi":"","title":"Problèmes de routages dans les réseaux optiques","year":2002,"lang":"fr","type":"other","venue":"Open MIND","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Feature (linguistics); Perspective (graphical); Measure (data warehouse); Context (archaeology)","score_opus":0.038419382003502776,"score_gpt":0.30373566733508933,"score_spread":0.2653162853315866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7005418586","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17084844,0.004337629,0.0021367834,0.00053219096,0.00016647876,0.0005726347,0.000081053884,0.000003228713,0.82132155],"genre_scores_gemma":[0.2566747,0.00085733493,0.042323116,0.00012046782,0.0008688077,0.000022444941,0.00020750929,0.00009363404,0.698832],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815387,0.0002245171,0.00028853235,0.00074585,0.00008968753,0.0004975395],"domain_scores_gemma":[0.9992044,0.000026259584,0.00020136379,0.00037481508,0.00004940914,0.00014378098],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025186653,0.0003995172,0.00037393,0.000030842853,0.00014604222,0.00024539715,0.00097486435,0.0008873249,0.016433718],"category_scores_gemma":[0.00010079883,0.00032207146,0.0001647251,0.00006334687,0.000227954,0.000004044304,0.00079885096,0.00024536776,0.00046809847],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005415715,0.00040045756,0.0076800655,0.000075305245,0.00028524507,0.00012428532,0.000573996,0.00017787747,0.20021005,0.00017405226,0.010481203,0.7797633],"study_design_scores_gemma":[0.00026272415,0.00045601593,0.0007144737,0.00018974888,0.000059982423,0.00004740809,0.00018964581,0.00028812172,0.07443162,0.000043791384,0.92280954,0.0005069521],"about_ca_topic_score_codex":0.00017443401,"about_ca_topic_score_gemma":0.00035255737,"teacher_disagreement_score":0.9123283,"about_ca_system_score_codex":0.000048030288,"about_ca_system_score_gemma":0.00010890593,"threshold_uncertainty_score":0.9999231},"labels":[],"label_agreement":null},{"id":"W7005602679","doi":"","title":"REVITALIZING HISTORIC QUARTER IN CHINA: A CASE STUDY OF SANFANG QIXIANG PROJECT IN FUZHOU","year":2013,"lang":"en","type":"dissertation","venue":"National University of Singapore","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Work (physics); Government (linguistics); Period (music)","score_opus":0.018126626983643545,"score_gpt":0.266224766400927,"score_spread":0.24809813941728348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7005602679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964082,0.00024957862,0.0000037024565,0.0000070050633,0.00005893353,0.00030068736,0.000009610275,0.0000031333266,0.0029591073],"genre_scores_gemma":[0.9989014,0.000015682252,0.00017331382,0.0000043398704,0.00003214381,6.225365e-7,0.00039698763,0.000005673209,0.00046981845],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.999215,0.0000715865,0.00020539602,0.0002493674,0.00016163435,0.000097009724],"domain_scores_gemma":[0.99948335,0.000015782487,0.00023949622,0.00007857712,0.00016729881,0.000015494674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018446265,0.00011301544,0.00021330816,0.00022981207,0.000041397117,0.0000035595158,0.00012405391,0.00020910853,0.0000091385455],"category_scores_gemma":[0.000058303773,0.000119915385,0.00006348332,0.00020277416,0.000022835315,0.000006371773,0.000037305872,0.00013820009,4.4395523e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028746608,0.011273325,0.35061714,0.0035044434,0.0008967429,0.0053667487,0.071439594,0.0011156881,0.49911174,0.0007242239,0.012808715,0.040266972],"study_design_scores_gemma":[0.0118551925,0.005972324,0.6196407,0.0021413483,0.00026837186,0.00036883116,0.34334236,0.0011300164,0.0056308727,0.00036380842,0.006814394,0.0024717448],"about_ca_topic_score_codex":0.0026027295,"about_ca_topic_score_gemma":0.0036342663,"teacher_disagreement_score":0.49348086,"about_ca_system_score_codex":0.000082704806,"about_ca_system_score_gemma":0.00012493876,"threshold_uncertainty_score":0.48900074},"labels":[],"label_agreement":null},{"id":"W7005778413","doi":"","title":"The role of the cystic fibrosis transmembrane conductance regulator in host protection against «Citrobacter rodentium» intestinal infection","year":2016,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cystic fibrosis; Cystic fibrosis transmembrane conductance regulator; Immune system; Myeloid; Intestinal epithelium; Transmembrane protein; ΔF508; Pancreatic disease; Cell; Epithelium","score_opus":0.007964887703147532,"score_gpt":0.2123907037676253,"score_spread":0.20442581606447777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7005778413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933981,0.00037755846,0.0000016539205,0.000017495831,0.00070110004,0.00073389953,0.0001342316,0.000030183899,0.0046058036],"genre_scores_gemma":[0.99806637,0.00018742486,0.0000696053,0.00004148323,0.000094774405,0.000109810346,0.00018210994,0.00005274878,0.0011956556],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99751246,0.0004474545,0.00065128924,0.0006770419,0.00028921093,0.00042251503],"domain_scores_gemma":[0.998495,0.000078808014,0.0005480408,0.00053057563,0.0002741557,0.000073425465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059901207,0.00041236068,0.0003357527,0.00007564193,0.00064379605,0.00004460723,0.00048933114,0.0006193777,0.000009992477],"category_scores_gemma":[0.00076195016,0.00024582815,0.0003224464,0.00030217704,0.0001253434,0.000023187018,0.000106369764,0.0006590947,0.000009225446],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035797615,0.000058517573,0.0003685365,0.00008689207,0.00004703872,9.941288e-7,0.0000018847303,0.000012147322,0.94291645,0.0004782776,4.977997e-7,0.05567078],"study_design_scores_gemma":[0.00048494834,0.00024923464,0.02030204,0.00058669486,0.00004644232,0.000013360718,0.000035095225,0.000019017292,0.96630484,0.001660697,0.009918232,0.00037938097],"about_ca_topic_score_codex":0.00010263169,"about_ca_topic_score_gemma":0.0012255649,"teacher_disagreement_score":0.0552914,"about_ca_system_score_codex":0.00012715357,"about_ca_system_score_gemma":0.000046919602,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W7007075082","doi":"","title":"Проблема десульфурації чорнового феронікелю, отриманого за технологією низького відновлення на Побузькому феронікелевому комбінаті","year":2024,"lang":"en","type":"other","venue":"The Scientific Issues of Ternopil Volodymyr Hnatiuk National Pedagogical University Series pedagogy","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ferroalloy; Flue-gas desulfurization; Ladle; Pyrometallurgy; Silicon","score_opus":0.05060384426873146,"score_gpt":0.33358250946827117,"score_spread":0.28297866519953974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007075082","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06858236,0.013905274,0.00057775393,0.0076794676,0.006677249,0.00201394,0.0028511789,0.00079775683,0.896915],"genre_scores_gemma":[0.07748505,0.00053693383,0.0007517685,0.00021751305,0.0016331667,0.0000061190267,0.0012899269,0.00021292284,0.9178666],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99471664,0.00043772408,0.000697963,0.0018235807,0.0014521651,0.0008719131],"domain_scores_gemma":[0.9972436,0.000118816046,0.0006373259,0.0010492033,0.0006909454,0.00026015428],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011612019,0.00085192436,0.0008707741,0.0006089971,0.00052880816,0.0002662797,0.0024299144,0.0010450337,0.0026750925],"category_scores_gemma":[0.0004538916,0.00065012753,0.00066998595,0.00077575067,0.0025424396,0.00003975349,0.0019408689,0.0007346615,0.0007813212],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045676017,0.00044467728,0.00025277052,0.00044070894,0.0007582725,0.000110148365,0.00056217826,0.00007073974,0.02405272,0.029073125,0.94173706,0.0020408595],"study_design_scores_gemma":[0.00053626654,0.0005275384,0.00021617464,0.00018663677,0.0001542341,0.000051056526,0.0013799868,0.000054786102,0.0020650348,0.0018759414,0.992146,0.0008063172],"about_ca_topic_score_codex":0.00036558116,"about_ca_topic_score_gemma":0.000609419,"teacher_disagreement_score":0.05040899,"about_ca_system_score_codex":0.0001322277,"about_ca_system_score_gemma":0.000573862,"threshold_uncertainty_score":0.99999666},"labels":[],"label_agreement":null},{"id":"W7008573018","doi":"","title":"Chlorophyll Along U.S. West Coast: Natural Hazards","year":2004,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Upwelling; SeaWiFS; Phytoplankton; Chlorophyll a; Ocean color; Shore; Deep ocean water; Chlorophyll; Surface water","score_opus":0.004180007548073774,"score_gpt":0.1856245733919427,"score_spread":0.18144456584386892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008573018","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021770208,0.0011206927,0.0000011486657,0.00006318724,0.0004295367,0.00026339028,0.000092830116,0.000076666816,0.9957755],"genre_scores_gemma":[0.07132419,0.000223978,0.00071486697,0.00038155846,0.00047975054,0.0000060773605,0.0007167494,0.00008215936,0.9260707],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986813,0.000043957218,0.0004511674,0.0002756256,0.00023352468,0.00031443904],"domain_scores_gemma":[0.9990712,0.000016039177,0.0003867196,0.00032211095,0.00010878606,0.00009515757],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012929935,0.00034484247,0.00033333455,0.000036465804,0.0000587433,0.00003742831,0.0003562128,0.00055418693,0.043198813],"category_scores_gemma":[0.0001017448,0.00029557667,0.00020891688,0.000006231727,0.00014736416,1.3703194e-8,0.00020202086,0.00023808167,0.0024933447],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006813582,0.000033744433,0.000007976069,0.00016907249,0.00006164546,0.0000128571655,0.000011463945,0.00010784751,0.000059349975,0.000009043386,0.99567026,0.0037886193],"study_design_scores_gemma":[0.00048516775,0.00028509935,0.000043514592,0.000138669,0.000026056958,0.00006699016,0.000021449781,0.000004904618,0.00034255706,0.000004067908,0.99821687,0.00036466942],"about_ca_topic_score_codex":0.002100789,"about_ca_topic_score_gemma":0.0015392052,"teacher_disagreement_score":0.06970485,"about_ca_system_score_codex":0.00002200198,"about_ca_system_score_gemma":0.00005216776,"threshold_uncertainty_score":0.99994963},"labels":[],"label_agreement":null},{"id":"W7015428351","doi":"","title":"Surface modification of aluminum alloy by electrolytic plasma processing","year":2009,"lang":"en","type":"other","venue":"NPARC","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Surface modification; Alloy; Aluminium; Electrolyte; Plasma; Nickel alloy","score_opus":0.011562831386873466,"score_gpt":0.2474341374083503,"score_spread":0.23587130602147682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015428351","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11447188,0.0032531957,0.0015571326,0.00018286792,0.0000963591,0.00042456045,0.00007314349,0.00009985957,0.879841],"genre_scores_gemma":[0.77830964,0.00025227712,0.002877351,0.00011685826,0.00023211597,0.0000033678675,0.00064912584,0.000105167645,0.21745409],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991821,0.00003525485,0.00016288276,0.00032218118,0.00009910668,0.00019848142],"domain_scores_gemma":[0.9995405,0.0000043513687,0.00019455975,0.00019127449,0.000030863037,0.00003846093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008364531,0.00016821384,0.00019422977,0.000021186313,0.000021820342,0.000010591991,0.00019814233,0.00036022448,0.00007242269],"category_scores_gemma":[0.00002362962,0.00014122213,0.00006215933,0.00005722223,0.000050705778,6.6066303e-7,0.00003502248,0.00009304775,0.000007899609],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001532395,0.000038984745,0.000027376347,0.000030674426,0.000016238197,3.1439436e-7,0.0000022434006,0.000005177728,0.8038809,0.000015733198,0.18544485,0.010522248],"study_design_scores_gemma":[0.00034977018,0.00044837763,0.000032982236,0.00010079547,0.000032247506,0.0000050018807,0.0000067995256,0.0006311562,0.45017016,0.00016014854,0.5476953,0.00036726613],"about_ca_topic_score_codex":0.0000049823143,"about_ca_topic_score_gemma":0.0000032402845,"teacher_disagreement_score":0.6638378,"about_ca_system_score_codex":0.0000073077476,"about_ca_system_score_gemma":0.000042061074,"threshold_uncertainty_score":0.57588714},"labels":[],"label_agreement":null},{"id":"W7015906080","doi":"","title":"Unmaking: Exploring Agency Through Unmaking","year":2018,"lang":"en","type":"dissertation","venue":"Arca (British Columbia Electronic Library Network)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Work (physics); Frame (networking); Staring; Action (physics); Field (mathematics)","score_opus":0.0166810409179995,"score_gpt":0.2285239022028642,"score_spread":0.2118428612848647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015906080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5719754,0.021281527,0.000032588454,0.000040500643,0.0027261642,0.00083770533,0.00003292962,0.0003761093,0.4026971],"genre_scores_gemma":[0.9479665,0.007192915,0.0013846789,0.0007184507,0.0065112286,0.00017710251,0.0060558277,0.00020856723,0.029784715],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995644,0.00020949163,0.0006824585,0.0014046902,0.00029779892,0.0017615792],"domain_scores_gemma":[0.9987156,0.000041244904,0.00041358022,0.0006010401,0.00008233953,0.00014623812],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021832947,0.00046128317,0.0005768178,0.000027971704,0.0006579933,0.0008807739,0.00091060664,0.0007943763,0.012983551],"category_scores_gemma":[0.00005900346,0.00074139296,0.00041000525,0.00047309982,0.0001041042,0.00006992892,0.00037196663,0.0008033705,0.000034714056],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072420464,0.00074135,0.009684516,0.0006997382,0.0018014418,0.00043423937,0.00042018504,0.00019817274,0.0022617406,0.023251206,0.56990683,0.3898764],"study_design_scores_gemma":[0.00074842083,0.0018492803,0.0013757922,0.0010625623,0.0001344239,0.00012561947,0.0001024351,0.00011155482,0.0021068645,0.17266682,0.81791204,0.0018041836],"about_ca_topic_score_codex":0.00043663874,"about_ca_topic_score_gemma":0.0109040765,"teacher_disagreement_score":0.38807222,"about_ca_system_score_codex":0.000048591075,"about_ca_system_score_gemma":0.0005156675,"threshold_uncertainty_score":0.99950373},"labels":[],"label_agreement":null},{"id":"W7016262283","doi":"","title":"Volume 9 - 1978: GEOSCIENCE INFORMATION: PUBLICATION - PROCESSING - MANAGEMENT - Proceedings of the 13th Meeting of the Geoscience Information Society","year":2016,"lang":"en","type":"other","venue":"OakTrust (Texas A&M University Libraries)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Volume (thermodynamics); Information system; Information society; Information management; Scientific society","score_opus":0.004337287909381067,"score_gpt":0.16881400113984255,"score_spread":0.16447671323046148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7016262283","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017384887,0.00007251327,0.004246317,0.0010094303,0.00028438738,0.00079286477,0.00014427493,0.000068699825,0.9759966],"genre_scores_gemma":[0.28803843,0.00033517528,0.010570891,0.0015628092,0.0003554606,0.0000052184137,0.00027992853,0.00006286379,0.69878924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989887,0.000029008464,0.00024742787,0.0002041231,0.0003143085,0.00021644762],"domain_scores_gemma":[0.9986397,0.0000061833234,0.00088723894,0.00024508653,0.00018116787,0.000040639898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029726696,0.00016566906,0.00014410069,0.000070980765,0.00028484745,0.00011501155,0.0011771086,0.00023128586,0.00007927744],"category_scores_gemma":[0.00006236944,0.00010006979,0.000138278,0.0005059774,0.00059297535,0.0002062028,0.0011447404,0.0001127063,0.000008914578],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013867488,0.00021985928,0.06572898,0.0033669227,0.00033522176,3.8533116e-7,0.0016253422,0.000034849927,0.00930138,0.06562481,0.67649746,0.1771261],"study_design_scores_gemma":[0.00022627386,0.00003384131,0.009941148,0.00023234474,0.00002857949,0.0000012033901,0.0004579329,0.00017817768,0.0018305402,0.00004226782,0.986856,0.00017168964],"about_ca_topic_score_codex":0.000044022938,"about_ca_topic_score_gemma":0.0000021079718,"teacher_disagreement_score":0.31035852,"about_ca_system_score_codex":0.000030152685,"about_ca_system_score_gemma":0.00015700515,"threshold_uncertainty_score":0.40807277},"labels":[],"label_agreement":null},{"id":"W7016525596","doi":"","title":"الإصدار المرئي : موكب النور 2 ISLAMIC STATE VIDEO اصدار الدولة الإسلامية","year":2020,"lang":"ar","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Islam; Brother; State (computer science); Hinduism; Supporter","score_opus":0.00535829320163445,"score_gpt":0.1819148212844901,"score_spread":0.17655652808285566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7016525596","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064493325,0.0014817995,0.0000051178476,0.0005195473,0.0006150425,0.0007228981,0.00041630713,0.000110022374,0.98967993],"genre_scores_gemma":[0.07658956,0.0015656279,0.0010463892,0.0016788618,0.0007479565,0.000016223328,0.0010537007,0.00014155498,0.91716015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99598855,0.0002974274,0.0015066476,0.0008154427,0.0005330999,0.0008588578],"domain_scores_gemma":[0.9973605,0.00011716979,0.0012131692,0.000724401,0.00029197696,0.00029273852],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00041204327,0.00093858055,0.0009676138,0.000071458555,0.00019959058,0.00013926838,0.0009494833,0.0011277134,0.16368848],"category_scores_gemma":[0.00040112552,0.0008615344,0.0005944428,0.000024294168,0.00039059023,8.451519e-8,0.0006592327,0.00068525004,0.031522404],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040665455,0.000090366986,0.000019054702,0.00068514317,0.00029232673,0.000060702452,0.00014147194,0.00048222096,0.0004422475,0.000023212131,0.99087465,0.0064819213],"study_design_scores_gemma":[0.0010338011,0.001095643,0.000040513103,0.0002981696,0.00011943658,0.00009177937,0.000139123,0.000121921934,0.0011439996,0.00004072614,0.9948803,0.0009945856],"about_ca_topic_score_codex":0.0009595775,"about_ca_topic_score_gemma":0.0004252205,"teacher_disagreement_score":0.13216607,"about_ca_system_score_codex":0.00005714274,"about_ca_system_score_gemma":0.000116653166,"threshold_uncertainty_score":0.99938357},"labels":[],"label_agreement":null},{"id":"W7017682528","doi":"","title":"The byzantine churches of Constantinople : an introduction","year":2019,"lang":"en","type":"other","venue":"Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Swine Health Board","keywords":"Byzantine architecture; Christianity; Period (music); Action (physics); Diplomacy","score_opus":0.007898155393619525,"score_gpt":0.1976927681561835,"score_spread":0.18979461276256399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017682528","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23524693,0.0021247598,0.015875235,0.015584979,0.0024988998,0.004149723,0.0019631677,0.00063656253,0.7219197],"genre_scores_gemma":[0.28924167,0.0016366764,0.0021495426,0.00019141674,0.00084614963,7.1300485e-7,0.0017193006,0.00020477473,0.7040098],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997317,0.0005948244,0.00037338032,0.00084667787,0.00042411298,0.00044398662],"domain_scores_gemma":[0.99673027,0.00013219411,0.0009967905,0.0014398018,0.0005483437,0.000152587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009662983,0.0004175045,0.00059284695,0.00036027163,0.00030057924,0.000032296943,0.0016929305,0.00077760627,0.00040981],"category_scores_gemma":[0.00020844386,0.00037491263,0.0003599202,0.0006496876,0.0009516267,0.000039038718,0.0006149819,0.0003919173,0.00003210169],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022854027,0.0012308524,0.008069854,0.0006345496,0.00232209,0.000016831298,0.00085586245,0.00013625434,0.07870102,0.08854104,0.8047165,0.012489722],"study_design_scores_gemma":[0.0012362351,0.00030560384,0.0012005158,0.000044388486,0.00016696396,0.000006071408,0.001766795,0.00009091038,0.0030829567,0.000038361024,0.9916324,0.00042881534],"about_ca_topic_score_codex":0.00051289523,"about_ca_topic_score_gemma":0.00024832078,"teacher_disagreement_score":0.18691586,"about_ca_system_score_codex":0.00006112115,"about_ca_system_score_gemma":0.00027459007,"threshold_uncertainty_score":0.9998703},"labels":[],"label_agreement":null},{"id":"W7017703925","doi":"","title":"The biogeochemical cycle of dissolved aluminium in the Atlantic Ocean","year":2018,"lang":"en","type":"dissertation","venue":"Helmholtz Centre for Ocean Research Kiel (GEOMAR)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; Deutsche Forschungsgemeinschaft; Eusko Jaurlaritza; Agence Nationale de la Recherche; Institut Français de Recherche pour l'Exploitation de la Mer","keywords":"Biogeochemical cycle; Seawater; Water column; Geotraces; Deposition (geology); Surface water; Phytoplankton; Aluminium; North Atlantic Deep Water","score_opus":0.02803278345846136,"score_gpt":0.3415685860137345,"score_spread":0.31353580255527314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017703925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941717,0.00095131464,0.0000058482624,0.00056011224,0.0003056344,0.001080814,0.00013805552,0.000011878966,0.00277467],"genre_scores_gemma":[0.9904992,0.0004820924,0.000107331405,0.00007331355,0.00074542407,0.000014620711,0.005527462,0.000043928787,0.0025066198],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99667895,0.00041155683,0.0005701911,0.00070044945,0.0006101183,0.001028755],"domain_scores_gemma":[0.99783766,0.0005564138,0.00021092517,0.0007286903,0.0005440135,0.00012230918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022515377,0.00032727318,0.00034072105,0.00009819042,0.00043357624,0.00010761445,0.0013532734,0.000571542,0.000022780367],"category_scores_gemma":[0.0014619706,0.00018777976,0.00033504836,0.00034624105,0.00045482646,0.0000040450645,0.0002482889,0.00056571746,0.000010558992],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008599069,0.0021338658,0.08297023,0.0019777892,0.0008086317,0.0000797312,0.0024653957,0.000008502293,0.3584615,0.002647591,0.52109396,0.01875372],"study_design_scores_gemma":[0.0031773385,0.0030370117,0.016427003,0.0008649947,0.00014047489,0.000026169111,0.01269355,0.00075179455,0.38547257,0.0077782576,0.56817293,0.0014579264],"about_ca_topic_score_codex":0.000097185606,"about_ca_topic_score_gemma":0.0004021843,"teacher_disagreement_score":0.06654323,"about_ca_system_score_codex":0.000029774334,"about_ca_system_score_gemma":0.00019046965,"threshold_uncertainty_score":0.7657436},"labels":[],"label_agreement":null},{"id":"W7017797551","doi":"","title":"Canada acute coronary syndrome score was a&amp;amp;nbsp;stronger baseline predictor than age &amp;amp;ge;75&amp;amp;nbsp;years of in-hospital mortality in acute coronary syndrome patients in western Romania","year":2016,"lang":"en","type":"other","venue":"Dove Medical Press (Taylor and Francis Group)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Acute coronary syndrome; Killip class; Myocardial infarction; Confidence interval; Framingham Risk Score; Blood pressure; Subgroup analysis; Mortality rate","score_opus":0.01365823392571828,"score_gpt":0.24999267399598538,"score_spread":0.2363344400702671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017797551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886841,0.002181544,0.0026045628,0.000067585665,0.0012380432,0.0012091731,0.0033443735,0.000052916563,0.0006176931],"genre_scores_gemma":[0.9881357,0.00023620266,0.0003881796,0.00038540873,0.00028875537,0.00012278248,0.0077075125,0.00024526828,0.002490181],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9937443,0.00047396263,0.001528806,0.0017348236,0.0012417869,0.0012763358],"domain_scores_gemma":[0.9972237,0.00018757765,0.0006163894,0.0011811143,0.00008567884,0.00070554344],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00074356067,0.0010496748,0.0017557287,0.00024316649,0.000068768204,0.0000456887,0.0011703378,0.0016305385,0.00094949297],"category_scores_gemma":[0.00036461916,0.00085275416,0.00030270248,0.0002546503,0.00072129536,0.000032426196,0.0010946788,0.0010783984,0.00004907778],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007097716,0.0015991171,0.9705239,0.00055433845,0.0010065364,0.0017991656,0.00016931527,0.000005041843,0.0018749996,0.0000084582225,0.005151126,0.016598253],"study_design_scores_gemma":[0.005611441,0.00061037584,0.9178937,0.0004056385,0.0002594782,0.00026692665,0.000016853146,0.00008650251,0.000019808342,0.0000630007,0.07302694,0.001739355],"about_ca_topic_score_codex":0.04849747,"about_ca_topic_score_gemma":0.4097334,"teacher_disagreement_score":0.36123595,"about_ca_system_score_codex":0.00015533694,"about_ca_system_score_gemma":0.00006722073,"threshold_uncertainty_score":0.99996376},"labels":[],"label_agreement":null},{"id":"W7017889742","doi":"","title":"2000 Census County Subdivison Block Map: Henrietta CCD, Texas, Inset B01","year":2000,"lang":"en","type":"other","venue":"The Portal to Texas History (University of North Texas)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Census; Block (permutation group theory); Scale (ratio); Quarter (Canadian coin)","score_opus":0.013415048200556341,"score_gpt":0.19426890179206704,"score_spread":0.1808538535915107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017889742","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31370118,0.008048478,0.000106972206,0.00039532845,0.0013982139,0.0012564796,0.0028900197,0.00026842408,0.6719349],"genre_scores_gemma":[0.15694457,0.0005355303,0.0003355268,0.0007770782,0.00061819516,5.404607e-7,0.0017640309,0.00020226394,0.83882225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796057,0.00013876539,0.0002649278,0.0007880946,0.00033072455,0.00051690603],"domain_scores_gemma":[0.99838275,0.000020089521,0.00040346707,0.0008934889,0.000062655396,0.00023757145],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016604745,0.000492886,0.0005523674,0.00015692478,0.00014809253,0.000009800581,0.0011907406,0.00050959794,0.0022734085],"category_scores_gemma":[0.000016108517,0.00045275345,0.0003294292,0.00016971759,0.0005032262,0.0000051129164,0.00041138608,0.00037044878,0.000389239],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020721686,0.00016051564,0.014020356,0.00006203431,0.0001655352,0.000092135444,0.000032888092,0.000026980268,0.0001139122,0.000014449226,0.98263144,0.002472541],"study_design_scores_gemma":[0.000403097,0.00032901604,0.034925174,0.000057111112,0.00011736341,0.000014675851,0.000013036354,0.000006243145,0.000026410738,0.0000038006494,0.9635447,0.00055935566],"about_ca_topic_score_codex":0.0012115908,"about_ca_topic_score_gemma":0.0042533656,"teacher_disagreement_score":0.16688736,"about_ca_system_score_codex":0.00012353147,"about_ca_system_score_gemma":0.00024849206,"threshold_uncertainty_score":0.9997924},"labels":[],"label_agreement":null},{"id":"W7020826928","doi":"","title":"Measurement of the top quark mass at CDF using the \"neutrino phi weighting\" template method on a lepton plus isolated track sample","year":2009,"lang":"en","type":"article","venue":"Purdue e-Pubs (Purdue University System)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fermilab; Science and Technology Facilities Council; Alfred P. Sloan Foundation; National Science Council; Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Fisica Nucleare; Centre National de la Recherche Scientifique; U.S. Department of Energy; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Russian Foundation for Basic Research; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Top quark; Tevatron; Muon; Fermilab; Lepton; Bar (unit); Neutrino; Luminosity; Mass distribution; Quark","score_opus":0.025023430172215613,"score_gpt":0.23576592598306156,"score_spread":0.21074249581084595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020826928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9776047,0.00028356325,0.017866818,0.0004317864,0.00033044297,0.00068952556,0.000050249695,0.000048152353,0.0026947833],"genre_scores_gemma":[0.9981892,0.000009085096,0.0012248574,0.00010918964,0.00015041538,6.860401e-7,0.00002078787,0.000012799139,0.00028297317],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99767894,0.00064894103,0.0003259472,0.00052676996,0.0003898435,0.0004295566],"domain_scores_gemma":[0.99859613,0.00008853083,0.00034835847,0.00063297467,0.00023198458,0.00010201832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010773638,0.00028178372,0.000355094,0.00006384818,0.000551942,0.000033247514,0.00069050514,0.0002610719,0.000010855499],"category_scores_gemma":[0.0000741233,0.00018111993,0.00031498136,0.00031816968,0.00008589198,0.000009746151,0.00022972953,0.00022919393,0.000005654486],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001263961,0.00014870091,0.0038628785,0.00016336437,0.0002755746,0.000022135751,0.00029641666,0.004039841,0.9862242,0.0013675522,0.00032767537,0.0020077506],"study_design_scores_gemma":[0.0068448265,0.0027917468,0.02287593,0.0013156394,0.0008509828,0.00018670618,0.0037292675,0.019991301,0.8344169,0.00014385523,0.1049057,0.001947146],"about_ca_topic_score_codex":0.00017783987,"about_ca_topic_score_gemma":0.00003451583,"teacher_disagreement_score":0.15180725,"about_ca_system_score_codex":0.00034790652,"about_ca_system_score_gemma":0.00009953092,"threshold_uncertainty_score":0.73858565},"labels":[],"label_agreement":null},{"id":"W7023516606","doi":"","title":"Optimization of DNA chip hybridization using mixing with chaotic advection","year":2008,"lang":"fr","type":"other","venue":"OpenGrey (Institut de l'Information Scientifique et Technique)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Chaotic; Mixing (physics); Control volume; Agrégation","score_opus":0.01719696021576404,"score_gpt":0.24941739654677064,"score_spread":0.2322204363310066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023516606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025833657,0.0001524523,0.900824,0.0000865653,0.0004600696,0.003770304,0.00005064128,0.00008560311,0.0687367],"genre_scores_gemma":[0.6208371,0.0012711582,0.35850546,0.00070305215,0.00046134766,0.00035414897,0.003245571,0.0001743804,0.014447818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99762654,0.00026864596,0.0008070282,0.00049337617,0.00037026266,0.00043411803],"domain_scores_gemma":[0.99769676,0.000023066836,0.001066845,0.0004703517,0.0006078752,0.0001351106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001182758,0.0004429854,0.0004158935,0.0004204496,0.00035510576,0.00018478085,0.00040777033,0.0006773543,0.0002606114],"category_scores_gemma":[0.00035583854,0.00039857443,0.0001506638,0.0006810519,0.00038298176,0.00017620625,0.00021076741,0.00030826184,0.000018664967],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002666068,0.00031053167,0.0014033593,0.0018699326,0.00020361262,0.000017048202,0.00082044123,0.59301114,0.3442029,0.0030442197,0.0024079583,0.05244223],"study_design_scores_gemma":[0.0010734628,0.00048421568,0.00037519014,0.0032022607,0.00012855533,0.0004044262,0.00010830095,0.117893286,0.6253055,0.00004257834,0.24972454,0.0012576805],"about_ca_topic_score_codex":0.0000954184,"about_ca_topic_score_gemma":0.000056345125,"teacher_disagreement_score":0.5950034,"about_ca_system_score_codex":0.00020273891,"about_ca_system_score_gemma":0.00066885946,"threshold_uncertainty_score":0.99984664},"labels":[],"label_agreement":null},{"id":"W7025220454","doi":"","title":"Using the Emergencies Act goes too far?; Canadians not impressed with Trudeau; Canada eases travel testing requirements","year":2022,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Emperipolesis; Triacetin; Hyporeflexia","score_opus":0.035025511846517456,"score_gpt":0.25182296536627263,"score_spread":0.21679745351975518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025220454","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17265874,0.0011382739,0.00712878,0.00035534895,0.002047891,0.0017627873,0.004120501,0.00015006206,0.8106376],"genre_scores_gemma":[0.39804173,0.000055571163,0.0018901681,0.0018144906,0.0010976881,0.000074717675,0.0014483003,0.00037594032,0.5952014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996925,0.00034782485,0.0004914216,0.0010297232,0.0003809617,0.0008250699],"domain_scores_gemma":[0.9984444,0.00016508887,0.0004685411,0.00063346024,0.000043961332,0.0002445985],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015459006,0.0006904153,0.0005074606,0.00013617659,0.00015008778,0.00009014837,0.001430149,0.00012466573,0.0017902687],"category_scores_gemma":[0.00017860997,0.00047795416,0.00020684046,0.000121670164,0.0003485976,0.0000049432624,0.0010205734,0.00054937135,0.0000069354683],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028545505,0.00007177697,0.005265883,0.00009306315,0.0007924172,0.00020019022,0.00038183117,0.00021937248,0.06638989,0.000093411974,0.9254822,0.0007245202],"study_design_scores_gemma":[0.000583916,0.0009322292,0.0020142351,0.00029149008,0.00015576096,0.00015137372,0.0004972239,0.003042045,0.005498393,0.00003202771,0.9857376,0.0010636927],"about_ca_topic_score_codex":0.8948006,"about_ca_topic_score_gemma":0.95395225,"teacher_disagreement_score":0.22538297,"about_ca_system_score_codex":0.00010021972,"about_ca_system_score_gemma":0.0006699679,"threshold_uncertainty_score":0.99976724},"labels":[],"label_agreement":null},{"id":"W7029057362","doi":"","title":"Harrison Cleary Named CoSIDA Academic All-District","year":2020,"lang":"en","type":"other","venue":"University of Minnesota Digital Conservancy (University of Minnesota)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athletic Edge Sports Medicine","funders":"","keywords":"","score_opus":0.016366401064669255,"score_gpt":0.19997192575872064,"score_spread":0.1836055246940514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029057362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61782783,0.0057590143,0.0027202538,0.0034396572,0.00055424613,0.0015169671,0.005598815,0.00041005856,0.36217314],"genre_scores_gemma":[0.6648427,0.005683828,0.004457501,0.0004096804,0.00043569115,1.7396385e-7,0.0042207786,0.00037203197,0.31957757],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980899,0.00010182644,0.00024123605,0.0008377606,0.00030574872,0.00042354225],"domain_scores_gemma":[0.9983491,0.000062023006,0.0006843455,0.0004938772,0.00013080872,0.0002798728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000095307885,0.00045760212,0.0007640384,0.00019256897,0.00012538623,0.000013688948,0.0012404737,0.00095054624,0.00055894227],"category_scores_gemma":[0.00009284449,0.00058508746,0.0004839843,0.00030146114,0.0007290602,0.000033380406,0.0009577549,0.00040341206,0.000088478744],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000887433,0.00024363592,0.0070789405,0.000436604,0.00075054774,0.00031259193,0.00024927867,0.000005363036,0.019648168,0.000118859876,0.96149725,0.008771334],"study_design_scores_gemma":[0.0014574361,0.00055767916,0.0013027126,0.00025354535,0.00019402393,0.000019715939,0.0018951726,0.000051854237,0.00053583115,0.000014095281,0.9930678,0.0006501157],"about_ca_topic_score_codex":0.0003458497,"about_ca_topic_score_gemma":0.00034182702,"teacher_disagreement_score":0.047014896,"about_ca_system_score_codex":0.000036899226,"about_ca_system_score_gemma":0.00016821621,"threshold_uncertainty_score":0.9996601},"labels":[],"label_agreement":null},{"id":"W7029946384","doi":"","title":"Methodology to deconstruct environmental inquiries using the Hall Commission as a case study","year":2000,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Commission; Government (linguistics); Context (archaeology); Legislation","score_opus":0.01432119791692473,"score_gpt":0.212117677993277,"score_spread":0.19779648007635225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029946384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71983224,0.00080918893,0.00017096648,0.0002958606,0.00018041926,0.0004431086,0.00019096158,0.000006944951,0.27807033],"genre_scores_gemma":[0.9382632,0.000075125616,0.0020179157,0.0009936504,0.00015051475,0.0000047001813,0.000014549545,0.00005792256,0.058422424],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986818,0.0002468515,0.00019045788,0.00031254842,0.00035773875,0.00021062593],"domain_scores_gemma":[0.99941254,0.000081207014,0.00011747495,0.00023479607,9.4584365e-8,0.00015387704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001587011,0.00021707329,0.0002402837,0.000015383459,0.00014889396,0.000012851554,0.00021750572,0.00006952067,0.00013074695],"category_scores_gemma":[0.000003368628,0.00015217665,0.00003075163,0.00002616475,0.00018290716,0.0000031748177,0.00033671997,0.0001079881,3.985182e-9],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023528915,0.0004822315,0.12583129,0.00028800184,0.0018088911,0.0075694732,0.0007963532,0.00029602894,0.6637444,0.0025029283,0.056393836,0.13793367],"study_design_scores_gemma":[0.00086493354,0.0013119045,0.0022713973,0.00015349976,0.00014068135,0.0016224163,0.028124744,0.00017931408,0.0836708,0.00016056048,0.880501,0.0009987567],"about_ca_topic_score_codex":0.006584814,"about_ca_topic_score_gemma":0.027541285,"teacher_disagreement_score":0.82410717,"about_ca_system_score_codex":0.0000022391562,"about_ca_system_score_gemma":0.00034388725,"threshold_uncertainty_score":0.9954313},"labels":[],"label_agreement":null},{"id":"W7030282591","doi":"","title":"Medicine that walks: disease, medicine, and the Canadian plains native people, 1880–1940","year":2003,"lang":"en","type":"article","venue":"PubMed Central","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"MEDLINE; Introduced species","score_opus":0.017490581907881612,"score_gpt":0.2237535595196668,"score_spread":0.2062629776117852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030282591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94517094,0.0061335173,0.00021108879,0.013067017,0.0009605832,0.00075532746,0.00002704942,0.000021900089,0.03365256],"genre_scores_gemma":[0.99583,0.00029723486,0.000022713739,0.0027537283,0.00053930166,0.000040852367,0.00007839705,0.0000092891905,0.0004284788],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99834174,0.0001767641,0.00014880825,0.00030814396,0.00015167193,0.0008728857],"domain_scores_gemma":[0.99892217,0.00007277161,0.000056364857,0.00018127215,0.0000366142,0.0007307912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006026083,0.0001663088,0.00018649678,0.00003340398,0.00029091374,0.000020139205,0.00016589381,0.00009440983,0.00004567982],"category_scores_gemma":[0.0011358078,0.00008788747,0.00004836374,0.00010736601,0.0006066341,0.0000029389432,0.00004187188,0.00012981432,0.0000011834381],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009185015,0.00011337637,0.822918,0.00008923588,0.00047990787,0.00008890052,0.0031777392,0.000057081674,0.001554646,0.10539455,0.03582433,0.029383728],"study_design_scores_gemma":[0.0029185507,0.00012399998,0.79276997,0.00002365424,0.00007042802,0.00002373195,0.0005381573,0.00006452074,0.0004767901,0.0016905657,0.20102705,0.00027257882],"about_ca_topic_score_codex":0.0056401594,"about_ca_topic_score_gemma":0.057021577,"teacher_disagreement_score":0.16520272,"about_ca_system_score_codex":0.000048455186,"about_ca_system_score_gemma":0.00013865315,"threshold_uncertainty_score":0.96018535},"labels":[],"label_agreement":null},{"id":"W7030467670","doi":"","title":"Mutiny Echoes: India, Britons, And Charles Dickens's A 'tale Of Two Cities'","year":2007,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mutiny; Disenchantment; Chose; Identity (music); National identity; Ridiculous; Wish; Thatcherism","score_opus":0.009001617518392627,"score_gpt":0.2263845986883295,"score_spread":0.21738298116993687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030467670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920174,0.0007138594,0.005015417,0.000032804124,0.000071258524,0.00010509885,0.000036153924,0.000015790418,0.0019922252],"genre_scores_gemma":[0.998085,0.00009526145,0.0011789333,0.00007154404,0.000092982824,7.718936e-8,0.00005701494,0.0000072589164,0.00041191102],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991538,0.000043071843,0.00014907632,0.0002797912,0.00012129917,0.0002529761],"domain_scores_gemma":[0.99942094,0.000044396606,0.00015907426,0.00019052456,0.000088934416,0.000096108866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003391774,0.00012807993,0.00021499158,0.0000726638,0.00015765861,0.000011821531,0.00021236757,0.00015617954,0.000027726266],"category_scores_gemma":[0.00005266387,0.00013880152,0.00011597729,0.00011094488,0.00046102854,0.000009079877,0.00026933424,0.0000961524,0.0000033653164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007660376,0.00051094877,0.6404665,0.0003836327,0.0006221762,0.000112853595,0.0031962271,0.000028376626,0.2266032,0.12075947,0.0013616075,0.005188951],"study_design_scores_gemma":[0.0030119068,0.0011640384,0.18281853,0.00008752911,0.00012886601,0.00007542366,0.013228444,0.00005708315,0.0042893677,0.79042435,0.003946534,0.00076795043],"about_ca_topic_score_codex":0.00021183853,"about_ca_topic_score_gemma":0.00017405556,"teacher_disagreement_score":0.66966486,"about_ca_system_score_codex":0.00001271332,"about_ca_system_score_gemma":0.00003061332,"threshold_uncertainty_score":0.5660162},"labels":[],"label_agreement":null},{"id":"W7034323515","doi":"","title":"Vaccine calculations among diaspora populations: evidence from South Sudanese communities in Canada","year":2022,"lang":"en","type":"other","venue":"London School of Economics and Political Science Theses Online (London School of Economics and Political Science)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"London School of Economics and Political Science","keywords":"Diaspora; Misinformation; Context (archaeology); Health care; Public health","score_opus":0.03563991643376465,"score_gpt":0.2831439221409478,"score_spread":0.24750400570718314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034323515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99242294,0.0009454798,0.0000076129554,0.00086966594,0.00023290633,0.000332524,0.0013506539,0.000008362047,0.0038298748],"genre_scores_gemma":[0.99628055,0.0013254608,0.0006848465,0.0006772172,0.00025979106,0.000011047598,0.00017982653,0.000050471528,0.000530765],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9963645,0.00012660485,0.0010677169,0.00087967707,0.00018286638,0.0013786872],"domain_scores_gemma":[0.99678665,0.0003629794,0.00048199086,0.0007224689,0.00012595516,0.0015199382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012874674,0.00041384675,0.0008346749,0.0004129277,0.00026401397,0.00015348743,0.0011560735,0.00021987551,0.00066433987],"category_scores_gemma":[0.0014266477,0.00036859303,0.00012331459,0.00032265173,0.0022447673,0.000084380306,0.0012086885,0.00042897716,0.0000028588852],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011561182,0.00016660607,0.8556115,0.00006410909,0.00005264958,0.0000039689976,0.00006397908,0.0008941615,0.0005280592,0.14167555,0.00031412859,0.00050965516],"study_design_scores_gemma":[0.001723252,0.00081935077,0.9388141,0.00044870854,0.00013158095,0.000024783392,0.0059299553,0.016955068,0.0011632093,0.02209168,0.010108634,0.001789649],"about_ca_topic_score_codex":0.73634994,"about_ca_topic_score_gemma":0.5591227,"teacher_disagreement_score":0.1772273,"about_ca_system_score_codex":0.0005426795,"about_ca_system_score_gemma":0.003480291,"threshold_uncertainty_score":0.9998766},"labels":[],"label_agreement":null},{"id":"W7037766426","doi":"","title":"The Extension Newsletter, Issue 39, Summer Quarter 2003","year":2003,"lang":"en","type":"article","venue":"Journal of Bioresource Management","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Wright; Extension (predicate logic); State (computer science)","score_opus":0.010645963286429382,"score_gpt":0.23780517896947057,"score_spread":0.22715921568304118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037766426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97237015,0.003912767,0.00805794,0.0027904443,0.0011510957,0.0002750506,0.0000011238113,0.000009584236,0.011431822],"genre_scores_gemma":[0.99007404,0.00045757738,0.00277706,0.0028090724,0.0008349131,0.000002377136,0.0000025830218,0.000015004547,0.0030273583],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893796,0.00014290796,0.00032700424,0.00016568325,0.00018290083,0.00024351994],"domain_scores_gemma":[0.99933565,0.000014823258,0.00021503365,0.00023909786,0.00012211704,0.000073259034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006874739,0.00012472576,0.00012234086,0.000036594505,0.00015519137,0.000056855548,0.00024527902,0.0000677512,0.000026363488],"category_scores_gemma":[0.000066603905,0.00006913706,0.000117899246,0.000120424294,0.000061486695,0.00000222455,0.00008786055,0.00011582175,0.000021379683],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034432492,0.00029279036,0.0048283194,0.000035464855,0.0004633061,0.00017373527,0.00006767068,0.0002944271,0.13064273,0.0011806189,0.7378819,0.12379471],"study_design_scores_gemma":[0.00040043663,0.0004369656,0.0030284608,0.000017268347,0.000029685321,0.00003981833,0.00019821661,0.000024393841,0.006592764,0.000047321322,0.98907614,0.00010852245],"about_ca_topic_score_codex":0.000001249783,"about_ca_topic_score_gemma":8.273822e-7,"teacher_disagreement_score":0.25119424,"about_ca_system_score_codex":0.000010955563,"about_ca_system_score_gemma":0.00000904386,"threshold_uncertainty_score":0.28193274},"labels":[],"label_agreement":null},{"id":"W7042944618","doi":"","title":"‘Remember the peasantry’: A study of genocide, famine, and the Stalinist Holodomor in Soviet Ukraine, 1932-33, as it was remembered by post-war immigrants in Western Australia who experienced it","year":2010,"lang":"en","type":"article","venue":"ResearchOnline - ND (The University of Notre Dame Australia)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wetenschappelijk Onderzoek- en Documentatiecentrum; Connaught Fund; Murdoch University","keywords":"Famine; Communism; Immigration; Ukrainian; State (computer science); Genocide; Refugee; Emigration","score_opus":0.03883260736889441,"score_gpt":0.3300636949546812,"score_spread":0.29123108758578675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042944618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953038,0.000054712906,0.0000038870808,0.0035311873,0.00004084935,0.0007698686,0.00016600857,0.0000045387246,0.00012513419],"genre_scores_gemma":[0.9958007,0.00015983975,0.00009067274,0.00013297872,0.000057943023,0.00000271981,0.000099690726,0.000010782291,0.003644715],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99769294,0.00054562755,0.00039456098,0.0004936513,0.00040385503,0.00046937578],"domain_scores_gemma":[0.998692,0.00021301121,0.00020069291,0.00061913225,0.00016953738,0.00010566927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011662333,0.00023433943,0.00039981926,0.000070919305,0.00021776075,0.000029731065,0.0010029956,0.00020861153,0.00015969311],"category_scores_gemma":[0.00038597384,0.00014123261,0.00012339336,0.00032368695,0.0013490948,0.000016897719,0.0005932769,0.0006243292,0.00000606612],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005482343,0.0013398039,0.08609651,0.00009989071,0.00027897133,0.00022036355,0.018697554,0.000096955046,0.8724845,0.0000276197,0.013418925,0.001756547],"study_design_scores_gemma":[0.0308443,0.006513091,0.56418884,0.0003214137,0.00025071957,0.00014502244,0.29956862,0.0009556023,0.03387304,0.00012926637,0.061621446,0.0015886202],"about_ca_topic_score_codex":0.0122424895,"about_ca_topic_score_gemma":0.024139078,"teacher_disagreement_score":0.8386115,"about_ca_system_score_codex":0.000011476346,"about_ca_system_score_gemma":0.000072297866,"threshold_uncertainty_score":0.99433506},"labels":[],"label_agreement":null},{"id":"W7043841152","doi":"","title":"Ãtude d'association entre l'asthme et les gènes associés à ce phénotype et à la pollution de l'air, dans un échantillon d'asthme provenant d'un environnement régional caractérisé par différentes industries","year":2012,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Environmental policy; Wood industry; Climate extremes; Emergy; Microinsurance","score_opus":0.0027231101858612213,"score_gpt":0.1509071112745914,"score_spread":0.14818400108873017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043841152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8689331,0.0051019513,0.00076160586,0.013158032,0.0005960957,0.0006372269,0.002146489,0.000021480588,0.108644046],"genre_scores_gemma":[0.9552352,0.0017473135,0.0008335935,0.0012171918,0.00036208786,0.000017508914,0.0003930953,0.0000696864,0.040124353],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9965609,0.0006416543,0.00048201604,0.000550045,0.0010326799,0.0007327442],"domain_scores_gemma":[0.9984898,0.00023520878,0.00072473014,0.00022109685,0.0000032282915,0.0003259628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000101940335,0.0005457383,0.0004836694,0.000029157754,0.0002972055,0.000046966572,0.00031686245,0.0004361641,0.00022928482],"category_scores_gemma":[0.000038809572,0.00048042243,0.00011838201,0.00006951279,0.0001766915,0.00003928008,0.00042546602,0.00048382732,4.032404e-8],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000495575,0.0005187255,0.503766,0.00030468087,0.0011716584,0.00008610085,0.00032119674,0.00016622084,0.37745118,0.0314518,0.0016935134,0.082573354],"study_design_scores_gemma":[0.0007143649,0.0003087539,0.47181866,0.00031701766,0.00014866648,0.000021591966,0.0011860731,0.0001890564,0.21431358,0.00021355035,0.31006065,0.00070806174],"about_ca_topic_score_codex":0.0022077567,"about_ca_topic_score_gemma":0.00793962,"teacher_disagreement_score":0.30836713,"about_ca_system_score_codex":0.000059515336,"about_ca_system_score_gemma":0.0012370885,"threshold_uncertainty_score":0.99976474},"labels":[],"label_agreement":null},{"id":"W7067002485","doi":"","title":"La rationalité d'un point de vue logique : entre dialogique et inférentialisme, étude comparative de Lorenzen et Brandom","year":2008,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intentionality; Context (archaeology); ESPACE","score_opus":0.004372587303255066,"score_gpt":0.17792953196974928,"score_spread":0.1735569446664942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067002485","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1510191,0.0023242696,0.004654532,0.0061041284,0.00022511272,0.00046341846,0.0008381555,0.000014260561,0.834357],"genre_scores_gemma":[0.959482,0.0029694976,0.004148967,0.007884133,0.00024410935,0.000017936543,0.00032180385,0.000049948398,0.024881566],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99691147,0.0011891533,0.0004157735,0.00046903416,0.0005489744,0.00046556944],"domain_scores_gemma":[0.9986355,0.0004997709,0.0003290332,0.00020713564,0.0000020332402,0.00032652883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000070764356,0.00042580883,0.0005046979,0.000021882717,0.00012477742,0.000040246865,0.0003343714,0.00027740933,0.0003773226],"category_scores_gemma":[0.000024910918,0.0003811168,0.00010479825,0.000046563935,0.00026033027,0.000020135423,0.00033702404,0.00041628996,1.4528652e-8],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037327867,0.00061637774,0.054971285,0.0007928683,0.0024236147,0.0010874462,0.002572377,0.002088247,0.45077053,0.423913,0.04214678,0.0148847075],"study_design_scores_gemma":[0.0019294125,0.00045364213,0.04814268,0.00036448753,0.000096232856,0.000158693,0.0014696629,0.00076906546,0.23894243,0.0035317033,0.7031358,0.0010061779],"about_ca_topic_score_codex":0.0027309414,"about_ca_topic_score_gemma":0.04360994,"teacher_disagreement_score":0.8094755,"about_ca_system_score_codex":0.000018432345,"about_ca_system_score_gemma":0.003291127,"threshold_uncertainty_score":0.9998641},"labels":[],"label_agreement":null},{"id":"W7084119682","doi":"10.6084/m9.figshare.30118672.v1","title":"Additional file 4 of Support preferences among women with and without postpartum depression and anxiety disorder","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Postpartum depression; Anxiety; Depression (economics); Postpartum period; Anxiety disorder; Panic disorder","score_opus":0.007746462789381702,"score_gpt":0.21853771853941323,"score_spread":0.21079125575003152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084119682","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28901887,0.000064534266,7.1894846e-7,0.00000506794,0.0000025361157,0.000059751357,0.70848334,0.000005346626,0.002359799],"genre_scores_gemma":[0.6290961,0.000004742329,0.00010669699,0.00004729005,0.00001395977,0.000102499536,0.3701593,0.000002146178,0.00046730114],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996182,0.000013263343,0.00006201843,0.00017603589,0.000037741214,0.00009278904],"domain_scores_gemma":[0.999784,0.000039026567,0.000041490384,0.00006287078,0.000040570405,0.0000320533],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000010876638,0.00006622464,0.00007180256,0.000010601098,0.00004089277,0.00001158891,0.000049125672,0.000066411005,0.40647143],"category_scores_gemma":[0.00021830104,0.000043781165,0.000009525505,0.000032489363,0.000024879897,0.0000028672516,0.00013363393,0.000036924263,0.0000027816425],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051952593,0.000016877826,0.029919004,0.00005963618,0.000018501381,2.6928876e-7,0.000010445808,6.2177406e-7,0.00059014314,3.4096794e-7,0.96218044,0.0071517574],"study_design_scores_gemma":[0.0001732984,0.0002692658,0.48697484,0.00059969525,0.0000029483497,0.000003729404,0.000055891393,0.00003193856,0.0015390139,0.000020319732,0.5102262,0.000102869235],"about_ca_topic_score_codex":0.0000010218238,"about_ca_topic_score_gemma":0.000008128938,"teacher_disagreement_score":0.45705584,"about_ca_system_score_codex":0.000001484838,"about_ca_system_score_gemma":0.00002918129,"threshold_uncertainty_score":0.59407115},"labels":[],"label_agreement":null},{"id":"W7098360622","doi":"","title":"Acknowledgements","year":2009,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phone; Nice; Minor (academic); Work (physics); Sister; Power (physics); George (robot)","score_opus":0.012568551127263834,"score_gpt":0.2662510260961945,"score_spread":0.25368247496893065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098360622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8490731,0.00010272697,0.0018026727,0.00013084106,0.00009742874,0.000036441725,2.8288878e-7,0.000017539314,0.14873894],"genre_scores_gemma":[0.9899808,0.000007959324,0.0009411562,0.001286382,0.00022006627,3.7814158e-7,0.000012303895,0.0000012315379,0.007549723],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972427,0.000007929095,0.00004709476,0.00010773279,0.000023326455,0.000089661626],"domain_scores_gemma":[0.999854,0.0000010302174,0.000008625136,0.00007859134,0.000032898944,0.000024800189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003994553,0.000039504775,0.000030230465,0.000005335809,0.000023950706,0.0000067327383,0.00006993145,0.000036281122,0.00026088543],"category_scores_gemma":[0.000038184837,0.000027436448,0.000025535093,0.000023127397,0.0000078129815,3.1737443e-7,0.000027673224,0.00001629287,0.00025143026],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012571392,0.00006975596,0.0018843511,6.9394474e-7,0.0000062512468,7.25613e-7,0.0000022613453,0.0000024502003,0.86650866,0.00018846047,0.05944269,0.0718811],"study_design_scores_gemma":[0.00039621018,0.0011871856,0.06044479,0.000003577627,0.0000040948526,0.0000031626123,0.000013501584,0.00005282111,0.32592675,0.0011313139,0.6106123,0.00022432783],"about_ca_topic_score_codex":6.6126645e-8,"about_ca_topic_score_gemma":6.809896e-7,"teacher_disagreement_score":0.5511696,"about_ca_system_score_codex":0.0000012283892,"about_ca_system_score_gemma":0.000003717492,"threshold_uncertainty_score":0.32317114},"labels":[],"label_agreement":null},{"id":"W7098363637","doi":"","title":"Goldman","year":2013,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Futures contract; Jurisdiction; Distribution (mathematics); Action (physics); Bond","score_opus":0.0067536398450306,"score_gpt":0.20951187218665468,"score_spread":0.20275823234162407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098363637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93091625,0.00004547723,0.00087458687,0.00016708639,0.0000378032,0.000047639016,1.7307407e-7,0.000013765286,0.0678972],"genre_scores_gemma":[0.99281096,0.000004730118,0.0011477824,0.0008824747,0.00012098104,0.0000040972204,0.000010381658,0.0000024711055,0.0050161406],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972093,0.000008906787,0.00004765319,0.00010562306,0.000021386022,0.00009552132],"domain_scores_gemma":[0.99985236,0.0000022282313,0.000008749611,0.000086268636,0.000019089786,0.00003130576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026257769,0.000039137896,0.000029863691,0.000004315826,0.000020869415,0.00001259092,0.00006851103,0.000042651944,0.0002916848],"category_scores_gemma":[0.000015198158,0.000025392568,0.000025678111,0.000017540857,0.00001599886,4.9353537e-7,0.000060408922,0.000018127945,0.00024117844],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014620227,0.000012988784,0.0051637357,9.860499e-7,0.0000051680086,2.2040219e-7,0.0000013286287,0.0000015767507,0.9609926,0.00039010844,0.017175084,0.016254773],"study_design_scores_gemma":[0.0003637767,0.0005566054,0.08310428,0.000003575733,0.00000381744,0.0000137267825,0.000064827174,0.00028711164,0.5556508,0.001519704,0.3580602,0.00037160702],"about_ca_topic_score_codex":0.000014644099,"about_ca_topic_score_gemma":0.0000016896824,"teacher_disagreement_score":0.40534183,"about_ca_system_score_codex":8.8899725e-7,"about_ca_system_score_gemma":0.0000031602933,"threshold_uncertainty_score":0.3193744},"labels":[],"label_agreement":null},{"id":"W7098750473","doi":"","title":"University of Manitoba Retirees Association Minutes of the Annual General Meeting","year":2007,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Honour; Logo (programming language); Silence; Chapel; Association (psychology)","score_opus":0.00729654110299916,"score_gpt":0.19997836095439048,"score_spread":0.19268181985139132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098750473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99107,0.00005175565,0.00029531546,0.000057523986,0.000047248403,0.00003173936,0.0000057798343,0.0000031379507,0.008437537],"genre_scores_gemma":[0.99758685,0.000007851896,0.0011357443,0.00003949838,0.00006697043,1.5020568e-8,0.000005490632,0.0000014174748,0.0011561941],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965316,0.000031536274,0.000084325824,0.00008183231,0.0000629944,0.00008616226],"domain_scores_gemma":[0.9996944,0.000020872181,0.000106985375,0.0000751704,0.00009044334,0.0000121371595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002945353,0.000035997582,0.000054944652,0.0000064556766,0.000036164598,0.0000013525049,0.00011506749,0.000079464975,0.0000042867805],"category_scores_gemma":[0.00008786762,0.000024517398,0.00005821649,0.000045819183,0.00003214402,8.784887e-7,0.00010952936,0.000026767664,3.4798254e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000211609,0.00001828007,0.2702069,0.000004186796,0.000018104089,2.7276596e-7,0.000022359009,0.000012553206,0.72683483,0.00012475689,0.000988415,0.0017481855],"study_design_scores_gemma":[0.00015681419,0.00010529853,0.2764612,0.000008037839,0.000010438849,6.5036966e-7,0.00075130875,0.000027054539,0.7152359,0.00003669562,0.0071456926,0.000060880313],"about_ca_topic_score_codex":0.00013120772,"about_ca_topic_score_gemma":0.00050340034,"teacher_disagreement_score":0.011598926,"about_ca_system_score_codex":0.000008717538,"about_ca_system_score_gemma":0.000009413799,"threshold_uncertainty_score":0.09997905},"labels":[],"label_agreement":null},{"id":"W7099084053","doi":"","title":"SUBMITTED BY:","year":2006,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Legislation; Documentation; Government (linguistics); Scale (ratio); Focus group; Quality (philosophy)","score_opus":0.0030920051160311735,"score_gpt":0.1931956337451202,"score_spread":0.19010362862908903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099084053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.943642,0.00020215317,0.0033421633,0.000113213384,0.00003422917,0.000028353592,0.0000020658465,0.000019878802,0.052615937],"genre_scores_gemma":[0.9912918,0.0000038028659,0.00035511717,0.00041241146,0.00015445064,0.0000012068105,0.00011446793,0.0000031873058,0.007663545],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996631,0.000011075942,0.000061596,0.00012761641,0.000028402721,0.00010820824],"domain_scores_gemma":[0.9998784,0.000002613224,0.000013276863,0.00007482809,0.000013774871,0.000017117189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000037668386,0.00004762752,0.00003630779,0.000004322434,0.000026818605,0.000008695478,0.00006141585,0.000057172907,0.000039581042],"category_scores_gemma":[0.000008546124,0.000033642136,0.000028323102,0.000026925261,0.000019088313,2.7851468e-7,0.000037739203,0.000019573386,0.000019145415],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047022286,0.000021077876,0.006830926,5.949125e-7,0.0000025072352,4.3590282e-7,1.7234879e-7,0.0000029372447,0.9234624,0.00026912225,0.06759995,0.0018051995],"study_design_scores_gemma":[0.00018484273,0.00011655013,0.009133774,7.964827e-7,0.000001976948,0.0000035222006,0.0000042524907,0.000054731925,0.5901917,0.00027964203,0.39989623,0.00013193717],"about_ca_topic_score_codex":0.0000306451,"about_ca_topic_score_gemma":0.000005927127,"teacher_disagreement_score":0.33327064,"about_ca_system_score_codex":0.0000013488351,"about_ca_system_score_gemma":0.0000036403621,"threshold_uncertainty_score":0.13718866},"labels":[],"label_agreement":null},{"id":"W7099345632","doi":"","title":"PLAYING IN TWO MODES: COMBINING FORMAL AND INFORMAL GOVERNANCE IN IT OUTSOURCING DEALS","year":2005,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Outsourcing; Corporate governance; Transaction cost; Knowledge process outsourcing; Conceptual model; Complement (music); Database transaction; Relational view","score_opus":0.013611130321100265,"score_gpt":0.2703916626676662,"score_spread":0.2567805323465659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099345632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813092,0.00018732426,0.0010071638,0.00012863273,0.000015252428,0.00007137017,0.0000011010095,0.000008119432,0.017271878],"genre_scores_gemma":[0.9963553,0.00005240927,0.0025348205,0.0008747466,0.0000683615,0.000003747163,0.00000859658,0.0000048290053,0.00009721377],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991884,0.00001906852,0.00024170574,0.00018211172,0.000055993063,0.0003127083],"domain_scores_gemma":[0.999804,0.00001872689,0.000049576753,0.00007777333,0.000010263749,0.000039633716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002831043,0.000102545775,0.000120190285,0.0000233135,0.00005531598,0.000023529266,0.00009535586,0.0000706482,0.000009066794],"category_scores_gemma":[0.0000466453,0.00008468297,0.000024032879,0.00005860323,0.000025676049,0.000015043846,0.0002036908,0.00011108163,0.0000023887244],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018986683,0.000086255444,0.6223025,0.000029225594,0.00001385998,0.000010857727,0.0005699255,0.019196484,0.19085602,0.0018707423,0.00006775895,0.16480656],"study_design_scores_gemma":[0.0091522,0.00070786267,0.5314631,0.00029041676,0.000009148755,0.000089445,0.0020660763,0.33352977,0.10996989,0.00012909301,0.011220235,0.0013727972],"about_ca_topic_score_codex":0.000086048814,"about_ca_topic_score_gemma":0.00071078923,"teacher_disagreement_score":0.3143333,"about_ca_system_score_codex":0.000011592898,"about_ca_system_score_gemma":0.00001399352,"threshold_uncertainty_score":0.34532714},"labels":[],"label_agreement":null},{"id":"W7099829066","doi":"","title":"and","year":2016,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Continental shelf; Demersal zone; Bottom trawling; Bathyal zone; Trawling; Demersal fish; Range (aeronautics)","score_opus":0.007042725026483431,"score_gpt":0.21466634907487117,"score_spread":0.20762362404838774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099829066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865046,0.00007309952,0.0031605177,0.00030603568,0.000016168693,0.000011923318,3.7420935e-7,0.000005715481,0.009921558],"genre_scores_gemma":[0.99692166,0.000030036073,0.00044764404,0.00025901114,0.000055794702,4.147409e-7,6.208093e-7,0.0000010884295,0.0022837508],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998371,0.000005165067,0.000023515242,0.00007583948,0.00001021289,0.000048188715],"domain_scores_gemma":[0.99992895,0.000003698784,0.0000043883983,0.000039531096,0.0000056240656,0.000017804876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000027247519,0.000021623127,0.000017547472,0.0000023503621,0.000011558688,0.0000024302274,0.000021362543,0.000023510358,0.000020270101],"category_scores_gemma":[0.000019880938,0.000009493712,0.000007877128,0.0000055784312,0.00002070079,1.9995595e-7,0.000043485372,0.0000042776046,0.0000070103533],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034467903,0.000002167003,0.009001774,2.9951718e-7,0.0000017104173,1.7185965e-7,3.2208706e-7,8.031741e-9,0.93674093,0.00048574954,0.0005511267,0.05321229],"study_design_scores_gemma":[0.00037633302,0.00031717977,0.04430557,0.000005011285,0.0000018286851,0.00001379755,0.000007254341,0.0000036197193,0.69850373,0.00090504193,0.25542596,0.00013470156],"about_ca_topic_score_codex":4.972393e-7,"about_ca_topic_score_gemma":7.760819e-7,"teacher_disagreement_score":0.25487483,"about_ca_system_score_codex":3.8346508e-7,"about_ca_system_score_gemma":0.0000016251123,"threshold_uncertainty_score":0.038714234},"labels":[],"label_agreement":null},{"id":"W7100319348","doi":"","title":"GLOBAL STATUS OF EPIDEMIOLOGY Burden of disease, health indicators and challenges for epidemiology in North America","year":2012,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Epidemiology; Life expectancy; Health indicator; Public health; Inequality; Global health; Health care; Social determinants of health","score_opus":0.06829642168740745,"score_gpt":0.3518130997195528,"score_spread":0.28351667803214536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100319348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94263613,0.053245094,0.0024494037,0.0010535673,0.000056767432,0.00022404868,0.00010534323,0.0000053290883,0.00022432079],"genre_scores_gemma":[0.9811687,0.013768803,0.0042349515,0.00055044034,0.00010338047,0.00001250996,0.00015080828,0.0000045434117,0.000005861523],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99813837,0.00040997873,0.00053456216,0.0002753985,0.000027666589,0.0006140153],"domain_scores_gemma":[0.9988274,0.0003761543,0.00032207687,0.00016920427,0.000025504574,0.00027964648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087207207,0.000117719785,0.00050413696,0.000041115167,0.000020822092,3.5788153e-7,0.00010531182,0.00011674003,0.0000043863024],"category_scores_gemma":[0.0018046475,0.000087786764,0.00007793356,0.000096055206,0.00024823452,0.000002088973,0.00013565787,0.000040875875,2.6408694e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015035822,0.000069864014,0.9037373,0.00011716148,0.00002593332,5.3757386e-8,0.000041802676,0.00006007558,0.00011622861,0.0024314527,0.00010690968,0.09314284],"study_design_scores_gemma":[0.0003502797,0.0008763253,0.9634669,0.000009960099,0.000007531947,9.1525936e-7,0.000173945,0.00008495702,0.000058081223,0.0006429499,0.034215868,0.00011231473],"about_ca_topic_score_codex":0.00024915952,"about_ca_topic_score_gemma":0.00010973158,"teacher_disagreement_score":0.09303053,"about_ca_system_score_codex":0.000014617513,"about_ca_system_score_gemma":0.0000613381,"threshold_uncertainty_score":0.35798404},"labels":[],"label_agreement":null},{"id":"W7100365573","doi":"","title":"Research letter Failure to prevent perinatal HIV infection","year":2014,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pregnancy; Human immunodeficiency virus (HIV); Sick child; Transmission (telecommunications); Prenatal care; Sida","score_opus":0.019051972337803088,"score_gpt":0.3085401496446985,"score_spread":0.2894881773068954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100365573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837618,0.000008369827,0.005998481,0.0019505747,0.000061493425,0.00009779902,7.231274e-7,0.000015593681,0.00810517],"genre_scores_gemma":[0.9940662,0.000001920926,0.0009723288,0.0012006527,0.000582925,0.000009854319,0.000017327582,0.0000051381508,0.003143668],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992828,0.00010835672,0.0000747827,0.00023748059,0.00008976421,0.00020683523],"domain_scores_gemma":[0.9997004,0.000011903727,0.000009271668,0.00015523734,0.000060383798,0.000062748426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003987846,0.00006179741,0.000051626113,0.000027446933,0.00008200689,0.000025337535,0.00009571625,0.000086868975,0.000062187835],"category_scores_gemma":[0.000100212885,0.000044144166,0.000037884576,0.00007259351,0.00002670606,0.0000010635628,0.00022002212,0.000092777016,0.00013404284],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023188635,0.000058026035,0.004858602,0.000010106826,0.000010563465,8.7041656e-7,0.000011942014,0.000052792107,0.90905,0.0004610265,0.070602745,0.01486016],"study_design_scores_gemma":[0.000079895086,0.0004510275,0.0061979615,0.0000045624583,9.525176e-7,0.0000042443307,0.000007026791,0.00005696635,0.26035622,0.000058997524,0.73268974,0.00009241408],"about_ca_topic_score_codex":0.000015247582,"about_ca_topic_score_gemma":0.000029266772,"teacher_disagreement_score":0.66208696,"about_ca_system_score_codex":0.000006884911,"about_ca_system_score_gemma":0.0000068040854,"threshold_uncertainty_score":0.18001468},"labels":[],"label_agreement":null},{"id":"W7100376359","doi":"","title":"Université de Montréal The Latin American Network of Women Transforming the Economy: Building Bridges Between Economic Justice and Gender Equity","year":2014,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Latin Americans; Equity (law); Economic Justice; Gender equity; Context (archaeology)","score_opus":0.01516042291431172,"score_gpt":0.23711132387276496,"score_spread":0.22195090095845324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100376359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894249,0.00013115062,0.0061025405,0.00035029335,0.000016489608,0.00006159368,0.000002264551,0.0000057766724,0.0039050342],"genre_scores_gemma":[0.99893737,0.0000654769,0.00031659045,0.00035215786,0.00025801949,0.0000014425392,0.0000034389914,0.000004351621,0.00006116181],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994,0.0000718875,0.000110530025,0.00014636629,0.000019385025,0.0002518091],"domain_scores_gemma":[0.9996381,0.000116690186,0.000069854366,0.00011654299,0.000009551988,0.00004930167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051814015,0.00007668835,0.00011603478,0.000004433815,0.00019553078,0.000013419563,0.00016901105,0.00003932809,0.000005482094],"category_scores_gemma":[0.000017687518,0.000043432774,0.000039166647,0.000021222637,0.00014085352,0.0000018176328,0.0001849556,0.000051540115,5.5812774e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030910515,0.00003395405,0.4671431,0.00013451334,0.000570399,0.0000013794283,0.0022485573,0.026008323,0.09561043,0.023294443,0.0014598753,0.38318595],"study_design_scores_gemma":[0.00153952,0.0015063612,0.70744115,0.000020459578,0.00043705583,0.000022889444,0.0045945905,0.02229518,0.09535537,0.0069485214,0.15890382,0.0009350541],"about_ca_topic_score_codex":0.00026089433,"about_ca_topic_score_gemma":0.000102739126,"teacher_disagreement_score":0.38225088,"about_ca_system_score_codex":0.000057201523,"about_ca_system_score_gemma":0.000019261084,"threshold_uncertainty_score":0.17711371},"labels":[],"label_agreement":null},{"id":"W7100423155","doi":"","title":"Comments welcome. Alcohol Availability and Alcohol Consumption: New Evidence from Sunday Sales Restrictions in Canada","year":2007,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Repeal; Consumption (sociology); Population; Alcohol consumption; Retail sales; Liberalization; Affect (linguistics)","score_opus":0.06494252997510233,"score_gpt":0.30428056414947385,"score_spread":0.23933803417437152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100423155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969847,0.0011085679,0.00065546436,0.0005373791,0.00016160299,0.0001390814,0.000011591146,0.000010658263,0.00039095],"genre_scores_gemma":[0.99746174,0.00028275765,0.0011381876,0.000669478,0.00012758432,0.0000020041023,0.000054932138,0.00000452312,0.00025881827],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989541,0.00006364943,0.00026997892,0.0003649059,0.00010087821,0.00024647344],"domain_scores_gemma":[0.99937874,0.00017498528,0.000052630447,0.00021832887,0.000029781626,0.00014551172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027852875,0.00012241055,0.00012984937,0.00002163329,0.00007738333,0.000021039996,0.00013868547,0.000097238386,0.000080608144],"category_scores_gemma":[0.00017433666,0.00010081158,0.000025154603,0.00008184982,0.00006230475,0.000004722818,0.00015965672,0.000108672175,0.0000075994294],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045945504,0.000020164074,0.94941276,0.000004080756,0.000013062924,0.0000066922053,0.000008016869,0.000006676429,0.042952944,0.000009722663,0.0036829365,0.003837003],"study_design_scores_gemma":[0.0004244786,0.0000636186,0.9732083,0.000026845,0.00000681671,0.0000049186433,0.000054962533,0.000039291408,0.014829097,0.00005614607,0.011127287,0.00015824419],"about_ca_topic_score_codex":0.64777416,"about_ca_topic_score_gemma":0.88309956,"teacher_disagreement_score":0.23532544,"about_ca_system_score_codex":0.000081494516,"about_ca_system_score_gemma":0.00022463167,"threshold_uncertainty_score":0.4110977},"labels":[],"label_agreement":null},{"id":"W7100438985","doi":"","title":"RESEARCH ARTICLE Genetic Characterization of H1N1 and H1N2 Influenza A Viruses Circulating in Ontario Pigs in 2012","year":2016,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Neuraminidase; H5N1 genetic structure; Hemagglutinin (influenza); Nucleoprotein; Virus; Influenza A virus; Gene; Antigenic drift; Antigenic shift","score_opus":0.06820712018161126,"score_gpt":0.32233908720331084,"score_spread":0.2541319670216996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100438985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9991456,0.00006256223,0.0002485819,0.000033792126,0.000012801155,0.00010306836,0.0000013425108,0.0000032716996,0.00038897086],"genre_scores_gemma":[0.99948645,0.000014181952,0.00023651519,0.00012861309,0.000022977778,0.0000050751332,0.0000021850017,0.0000043065834,0.0000997161],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99920833,0.00009299196,0.0002203109,0.00020411843,0.0000727709,0.00020147755],"domain_scores_gemma":[0.99974644,0.00003320026,0.000036538695,0.00010697162,0.000043960514,0.000032910146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035021067,0.00006036018,0.00009103961,0.000061439845,0.00002045115,0.000009177637,0.00006662018,0.000089273926,0.000046604404],"category_scores_gemma":[0.00009187482,0.000039922114,0.000014957971,0.000102224665,0.00006515637,0.000006198494,0.00012655043,0.00006555491,0.0000029818411],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020040618,0.000019059544,0.43207967,0.0000028337784,0.0000015140178,9.4164955e-7,0.000029835239,0.0000020619698,0.56412196,0.000022982682,9.673616e-7,0.0036981434],"study_design_scores_gemma":[0.00037044793,0.0001118709,0.8602072,0.000031998556,7.151105e-7,0.0000019073561,0.000019445688,0.00003877618,0.13868459,0.00010264985,0.0003695085,0.000060868424],"about_ca_topic_score_codex":0.0019272887,"about_ca_topic_score_gemma":0.014540964,"teacher_disagreement_score":0.42812753,"about_ca_system_score_codex":0.000020297033,"about_ca_system_score_gemma":0.000039248203,"threshold_uncertainty_score":0.8114199},"labels":[],"label_agreement":null},{"id":"W7100451592","doi":"","title":"NOTICE","year":2016,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Notice; Context (archaeology); Limiting","score_opus":0.009351213387915988,"score_gpt":0.2267893863874962,"score_spread":0.21743817299958024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100451592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94547886,0.00004138061,0.014356012,0.00053377147,0.00007161549,0.000023956962,8.6861e-7,0.000015912532,0.03947764],"genre_scores_gemma":[0.99259824,0.000009996026,0.000840431,0.00055719324,0.00015145562,7.7585366e-7,0.0000017249413,0.0000022172585,0.0058379564],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997266,0.000010651558,0.000042852826,0.0001101702,0.000022544753,0.00008721545],"domain_scores_gemma":[0.9998576,0.0000075527546,0.000009042975,0.00008579094,0.000014971329,0.000025020454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047292946,0.000034642402,0.00002665376,0.0000037718214,0.000017047765,0.0000033441995,0.000063445244,0.000041028932,0.00008221303],"category_scores_gemma":[0.000052634412,0.000015764757,0.00002376175,0.000013697825,0.000020470148,3.4267552e-7,0.0000551604,0.000008585566,0.00007842047],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007124508,0.000006854322,0.002766914,4.040809e-7,0.0000033044846,4.2855677e-7,4.105496e-7,1.4888528e-7,0.9677849,0.0005476127,0.001964869,0.026917052],"study_design_scores_gemma":[0.00025027953,0.00020189276,0.0071466113,0.0000038163917,0.0000019594925,0.000005330565,0.0000048915726,0.00000388219,0.69146025,0.00025299314,0.30055565,0.00011247968],"about_ca_topic_score_codex":9.0300256e-7,"about_ca_topic_score_gemma":0.0000013786047,"teacher_disagreement_score":0.29859078,"about_ca_system_score_codex":0.0000012533834,"about_ca_system_score_gemma":0.0000044325393,"threshold_uncertainty_score":0.10079626},"labels":[],"label_agreement":null},{"id":"W7100480971","doi":"","title":"Canadian Cataloguing in Publication Data","year":2013,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"General partnership; Resource (disambiguation); Government (linguistics); Data archive","score_opus":0.026143854832442526,"score_gpt":0.25035301693816137,"score_spread":0.22420916210571884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100480971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661957,0.00008002224,0.00023897516,0.0021060752,0.00004366406,0.00011848971,0.00000980155,0.000008790758,0.031198462],"genre_scores_gemma":[0.9958314,0.0000050229623,0.0007034726,0.001063492,0.00006003763,0.000004469798,0.001503057,0.0000025374604,0.00082655874],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953955,0.000014145088,0.00007906208,0.00019418306,0.000021982796,0.0001510871],"domain_scores_gemma":[0.99958163,0.0000032854148,0.000012268662,0.0003022884,0.000031467804,0.00006904698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010667878,0.00004009039,0.000033514098,0.000026802223,0.000023187566,0.000031873864,0.00027456938,0.000060326016,0.000114763076],"category_scores_gemma":[0.00011527748,0.000030938976,0.0000070739898,0.00005850822,0.000010073207,0.000004066742,0.00014629487,0.00003166309,0.000099889],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004507687,0.000059987688,0.26907265,0.000008757379,0.000018559645,0.0000032350008,0.000023785846,0.0000138556425,0.41066575,0.0010214947,0.1797897,0.1393177],"study_design_scores_gemma":[0.00048210658,0.00014554107,0.34117988,0.000010539218,0.0000037964803,0.000016052023,0.00016928083,0.005765589,0.020843036,0.00052884093,0.63031024,0.0005450917],"about_ca_topic_score_codex":0.10284447,"about_ca_topic_score_gemma":0.1677509,"teacher_disagreement_score":0.45052055,"about_ca_system_score_codex":0.000010542086,"about_ca_system_score_gemma":0.00004850352,"threshold_uncertainty_score":0.90312976},"labels":[],"label_agreement":null},{"id":"W7100605821","doi":"","title":"Saskatoon By","year":2016,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Copying; Permission; Work (physics); Head (geology); Order (exchange); Certificate","score_opus":0.005115558237273562,"score_gpt":0.20975106031395474,"score_spread":0.20463550207668119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100605821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614797,0.00013849382,0.007898585,0.00059207936,0.000049145172,0.000028621487,0.0000037344198,0.00001801232,0.02979163],"genre_scores_gemma":[0.9833163,0.000016593589,0.00026553567,0.0005671858,0.00008038632,0.0000011881228,0.0000079147385,0.0000028620034,0.015742047],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996776,0.0000120953955,0.000049826525,0.0001330456,0.000025621437,0.000101796504],"domain_scores_gemma":[0.99985373,0.0000052547175,0.000010983023,0.00008849852,0.000011171069,0.000030354517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044642984,0.000043176184,0.00003259162,0.0000032566024,0.000018477112,0.000004620573,0.00006804734,0.00005103583,0.00009062815],"category_scores_gemma":[0.000019755082,0.000020304125,0.00002605963,0.000013324221,0.000026702168,4.648695e-7,0.00005177163,0.000009604461,0.000051492163],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005770981,0.000009060675,0.0019511915,3.4267208e-7,0.000003185966,1.7154267e-7,3.3428708e-7,2.007007e-8,0.9288484,0.00009393329,0.04446998,0.024617614],"study_design_scores_gemma":[0.00013936908,0.00015862235,0.0006905994,0.0000018302819,7.4899083e-7,0.0000017540091,0.0000025995805,8.4823995e-7,0.5848209,0.00008513597,0.41403398,0.000063607054],"about_ca_topic_score_codex":0.0000014715916,"about_ca_topic_score_gemma":0.0000018430303,"teacher_disagreement_score":0.369564,"about_ca_system_score_codex":0.0000016456503,"about_ca_system_score_gemma":0.0000041679314,"threshold_uncertainty_score":0.09923147},"labels":[],"label_agreement":null},{"id":"W7100691330","doi":"","title":"southeastern Canadian bogs","year":2015,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.03174871756877686,"score_gpt":0.24189292220302702,"score_spread":0.21014420463425015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100691330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88447154,0.00010121127,0.0005385915,0.00034772512,0.00010780777,0.000036675734,0.000002848245,0.000011240921,0.11438235],"genre_scores_gemma":[0.99488485,0.0000010704034,0.00038803183,0.0011103792,0.00017331849,9.551087e-7,0.000025536216,0.0000036210536,0.003412217],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996176,0.000015046817,0.00005233912,0.00012268373,0.00003431847,0.00015803895],"domain_scores_gemma":[0.99963206,0.0000012823715,0.000008940096,0.00009934071,0.000033329434,0.00022505785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008901278,0.000049558017,0.00003868243,0.0000118148855,0.000023910125,0.000012337341,0.000088825946,0.0000633582,0.000022972075],"category_scores_gemma":[0.000037064012,0.000035287612,0.000023159451,0.000024419749,0.000017121616,4.103362e-7,0.000041230614,0.00002475361,0.000101543934],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014818058,0.00012766058,0.49148878,0.00001241344,0.00011929471,0.000057805453,0.000287185,0.00013865418,0.32856473,0.0042523704,0.11101112,0.06379183],"study_design_scores_gemma":[0.0005213578,0.0004830961,0.0065189824,0.000003742406,0.000005312769,0.00002802353,0.00037140265,0.00023600589,0.02600965,0.00053307886,0.9649624,0.00032690165],"about_ca_topic_score_codex":0.0063386946,"about_ca_topic_score_gemma":0.020167373,"teacher_disagreement_score":0.85395133,"about_ca_system_score_codex":0.0000041133335,"about_ca_system_score_gemma":0.00007793565,"threshold_uncertainty_score":0.997712},"labels":[],"label_agreement":null},{"id":"W7100734174","doi":"","title":"Teaching FSL with AIM? An elementary school case study. Studies by Undergraduate Researchers at Guelph","year":2011,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Gesture; Popularity; Set (abstract data type); Stern; Test (biology); Proposition; Core (optical fiber)","score_opus":0.11077116494356769,"score_gpt":0.3601058838605638,"score_spread":0.2493347189169961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100734174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961593,0.00036509155,0.00015464317,0.00015341946,0.000030433455,0.00028951696,0.0000043851846,0.000035010078,0.0028081785],"genre_scores_gemma":[0.99515855,0.00003830832,0.0015933381,0.000509196,0.00008302108,0.000017673796,0.000040908697,0.000016092847,0.002542936],"study_design_codex":"bench_or_experimental","study_design_gemma":"qualitative","domain_scores_codex":[0.99852264,0.0002931579,0.00018651382,0.0004966138,0.00014353787,0.0003575204],"domain_scores_gemma":[0.99935913,0.000018681223,0.000052809723,0.0003173378,0.00006895954,0.00018308987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005438626,0.00018579188,0.00015316687,0.000025707692,0.00034889288,0.00002172193,0.00020077168,0.00006495292,0.000047721387],"category_scores_gemma":[0.000060846858,0.00011532311,0.00003921567,0.00005450485,0.00011563508,0.000007281312,0.00043439504,0.00018143133,0.000010557581],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010959634,0.0022627872,0.39773563,0.000053661246,0.0016553706,0.0028202052,0.0022147296,0.000012136165,0.5486743,0.00010337679,0.023491949,0.019879919],"study_design_scores_gemma":[0.0141263185,0.08399818,0.02024789,0.00013362238,0.0005692867,0.0038848426,0.42667228,0.00048357763,0.39642295,0.001428626,0.047031805,0.0050006285],"about_ca_topic_score_codex":0.0013899533,"about_ca_topic_score_gemma":0.0017889414,"teacher_disagreement_score":0.42445755,"about_ca_system_score_codex":0.000034698136,"about_ca_system_score_gemma":0.000022783097,"threshold_uncertainty_score":0.470274},"labels":[],"label_agreement":null},{"id":"W7100765719","doi":"","title":"Re: OAG Docket No. 121--Comments on Proposed Guidelines to Interpret and Implement the Sex Offender Registration and Notification Act (SORNA)","year":2007,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sex offender; Law enforcement; Sex offense; Mental health; Sexual violence; Association (psychology); Multidisciplinary approach; Recidivism","score_opus":0.050063543823310394,"score_gpt":0.3482339773267755,"score_spread":0.2981704335034651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100765719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98303705,0.00005559645,0.006517971,0.0057139895,0.00009557434,0.00038502467,0.000004708914,0.000014453696,0.0041756313],"genre_scores_gemma":[0.9931181,0.00003512901,0.0015574337,0.004344357,0.00018176323,0.0000042436172,0.00006329877,0.000005337393,0.00069030054],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919814,0.000040813677,0.00022982994,0.00028770458,0.00008765115,0.00015584141],"domain_scores_gemma":[0.99957126,0.000034489425,0.000050600414,0.00019555658,0.000091252376,0.000056857516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006152142,0.00010867752,0.000073829884,0.000016463724,0.00010058496,0.00004612372,0.00009595849,0.000070988805,0.000011007536],"category_scores_gemma":[0.0002098186,0.00006203011,0.000021648159,0.000036236732,0.000027482147,0.000002541281,0.000111510584,0.000050551866,0.000003960247],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002658636,0.00006127744,0.0068755792,0.000011862367,0.000037614063,0.000001118224,0.000112052345,0.0000044097847,0.86061245,0.00025823226,0.032469153,0.09929036],"study_design_scores_gemma":[0.0007400442,0.0019292824,0.032477915,0.000034819102,0.000019368807,0.00000877681,0.0006884693,0.00047222112,0.7279821,0.0002060221,0.23506646,0.0003745424],"about_ca_topic_score_codex":0.000020795516,"about_ca_topic_score_gemma":0.00007316588,"teacher_disagreement_score":0.2025973,"about_ca_system_score_codex":0.000008490134,"about_ca_system_score_gemma":0.000009318653,"threshold_uncertainty_score":0.25295144},"labels":[],"label_agreement":null},{"id":"W7100899029","doi":"","title":"General Terms","year":2008,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sketch; Abstraction; Focus (optics); Metis; Domain (mathematical analysis); Abstraction layer; Scheme (mathematics); Similitude; Access method; Feature (linguistics)","score_opus":0.018233770218398417,"score_gpt":0.2370365078300861,"score_spread":0.21880273761168767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100899029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95610654,0.00005110688,0.0012397458,0.00005257657,0.00005455123,0.000023969227,5.5017347e-7,0.000014676246,0.042456288],"genre_scores_gemma":[0.989008,0.000027650993,0.0021407013,0.0007775932,0.00028363828,0.0000012439491,0.000019757254,0.0000030758672,0.0077383514],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996646,0.000010649715,0.000057042613,0.00012985292,0.000030325766,0.00010755206],"domain_scores_gemma":[0.9998518,0.0000016626682,0.0000106001535,0.000092960225,0.0000108865215,0.00003207646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000027367483,0.000048337824,0.000040643306,0.0000055534615,0.000053861688,0.000003140755,0.00007266003,0.00005110759,0.0000447451],"category_scores_gemma":[0.000012683235,0.00003220058,0.000038146005,0.00002075391,0.000035648805,3.5515723e-7,0.00006123728,0.000022670798,0.000027121963],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010237966,0.000022995207,0.028730867,8.499659e-7,0.000007866974,0.000007946165,0.000004031986,0.000009304626,0.95894825,0.00026660843,0.008694525,0.0032965303],"study_design_scores_gemma":[0.00040431798,0.00044349322,0.07642315,0.0000016803646,0.000002867806,0.00017397998,0.000006793538,0.00019696806,0.6283927,0.00018147833,0.2934833,0.000289286],"about_ca_topic_score_codex":0.00000384695,"about_ca_topic_score_gemma":0.0000011174757,"teacher_disagreement_score":0.33055556,"about_ca_system_score_codex":0.0000012563299,"about_ca_system_score_gemma":0.0000064633487,"threshold_uncertainty_score":0.13131015},"labels":[],"label_agreement":null},{"id":"W7100928601","doi":"","title":"The...","year":2015,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Identification (biology); Work (physics); Point (geometry); Term (time); Focus (optics)","score_opus":0.029273532889840054,"score_gpt":0.26326772572676055,"score_spread":0.2339941928369205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100928601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86019117,0.0005426549,0.0017659402,0.0006007761,0.00017413298,0.00003754568,2.377584e-7,0.000015259066,0.1366723],"genre_scores_gemma":[0.9942599,0.0000105664985,0.00029882148,0.00034290165,0.00014877282,0.0000010467973,0.0000035255437,0.0000015237239,0.004932957],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997776,0.000014487628,0.000037286693,0.00006484947,0.000028911012,0.0000768528],"domain_scores_gemma":[0.9998417,0.000005037626,0.000007857136,0.0000839,0.000024708579,0.000036825728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001301247,0.000026267238,0.000017644663,0.000001459261,0.00004169218,0.000012755447,0.00008237603,0.000025377856,0.0000021098435],"category_scores_gemma":[0.000074729825,0.000012591397,0.000016382884,0.000015328429,0.000025312223,1.7583898e-7,0.00006401189,0.000015687516,0.00002564902],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016958542,0.000065066866,0.022861827,0.000001936812,0.000051460513,0.000004356232,0.000027710545,0.00005109773,0.46569288,0.018168446,0.30788258,0.18502305],"study_design_scores_gemma":[0.000108020504,0.00015379628,0.0006959468,3.120157e-7,7.5820213e-7,0.0000042541337,0.000052373154,0.000044320477,0.034059986,0.0007034017,0.96412855,0.000048266797],"about_ca_topic_score_codex":0.0000021603232,"about_ca_topic_score_gemma":0.0000046169844,"teacher_disagreement_score":0.65624595,"about_ca_system_score_codex":0.0000012042651,"about_ca_system_score_gemma":0.000011168084,"threshold_uncertainty_score":0.051346224},"labels":[],"label_agreement":null},{"id":"W7100931317","doi":"","title":"EXPENDITURES General Fund Expenditures-2.83 % Page 12","year":2012,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Revenue; Variance (accounting); Excise; Fund accounting","score_opus":0.03557287422339673,"score_gpt":0.2878226426596149,"score_spread":0.25224976843621816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100931317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9508412,0.001709138,0.0011900759,0.00007025128,0.0005581314,0.00010906254,0.0000063870625,0.00004368519,0.045472067],"genre_scores_gemma":[0.9894647,0.00004121403,0.0014992283,0.0011784451,0.0025295478,0.000009879225,0.0001595802,0.000014414999,0.0051029986],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.998883,0.00006748024,0.00016609447,0.00028355836,0.000106383566,0.00049349386],"domain_scores_gemma":[0.99949145,0.000012970682,0.000048551923,0.0002655772,0.00001074769,0.0001707257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017814954,0.00018280158,0.00013303742,0.000021407956,0.00010829191,0.000030613835,0.00021410902,0.00020117617,0.0003841731],"category_scores_gemma":[0.000020960657,0.00012544448,0.000121397126,0.000016163607,0.00005355672,0.000004895555,0.00021379758,0.00009606878,0.000070920665],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040039085,0.00014162368,0.0146246925,0.000005448561,0.0000392873,0.0000035179692,0.0000270379,0.000007873261,0.9425738,0.0009883989,0.0378804,0.0036679248],"study_design_scores_gemma":[0.00040582268,0.00019491486,0.013832053,0.0000032975381,0.000010190588,0.000031043295,0.00007647161,0.000025003656,0.44943926,0.000069114525,0.53555816,0.0003546575],"about_ca_topic_score_codex":0.000017801345,"about_ca_topic_score_gemma":0.000010106562,"teacher_disagreement_score":0.49767777,"about_ca_system_score_codex":0.0000072532603,"about_ca_system_score_gemma":0.000010286418,"threshold_uncertainty_score":0.51154774},"labels":[],"label_agreement":null},{"id":"W7101091265","doi":"","title":"MARIE-ODILE BENOIT-BIANCAMANO ETUDE DE LA PHARMACOCINETIQUE ET DE LA PHARMACOGÉNÉTIQUE D&amp;apos;UN IMMUNOSUPPRESSEUR","year":2014,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Human physiology; Set (abstract data type); Process (computing)","score_opus":0.019614967735940257,"score_gpt":0.361627119923787,"score_spread":0.34201215218784675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101091265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91819036,0.0004874146,0.023158295,0.00033537866,0.000091768794,0.00014992326,0.00001227073,0.000090382746,0.057484195],"genre_scores_gemma":[0.9838834,0.0006434025,0.007898006,0.0053233383,0.00043648088,0.000027969298,0.00012271777,0.00003515482,0.0016295761],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974325,0.0012782115,0.00025609805,0.00044146038,0.00010249539,0.0004892579],"domain_scores_gemma":[0.9990425,0.0003522305,0.0000886069,0.0002843194,0.000059860668,0.00017249449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015026412,0.0002697163,0.00020898474,0.000031207903,0.00012140138,0.000101614074,0.000432648,0.0003926855,0.0003543955],"category_scores_gemma":[0.00032922908,0.00022428553,0.00015383972,0.000076775,0.00016272822,0.0000057414445,0.00033586458,0.0003919623,0.000028361497],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009143461,0.00014745301,0.0039465367,0.000020647856,0.00007296682,0.000008334184,0.000062498744,0.00016554147,0.98143274,0.0009394587,0.0059003793,0.0072120093],"study_design_scores_gemma":[0.00081759755,0.0001297945,0.003594404,0.000010693314,0.00002633494,0.00006138319,0.000012820749,0.0003855395,0.583342,0.0005724172,0.41076463,0.0002823507],"about_ca_topic_score_codex":0.00008566532,"about_ca_topic_score_gemma":0.000007497189,"teacher_disagreement_score":0.40486425,"about_ca_system_score_codex":0.000020644466,"about_ca_system_score_gemma":0.0000918472,"threshold_uncertainty_score":0.91460985},"labels":[],"label_agreement":null},{"id":"W7101105207","doi":"","title":"The Role of Lawyers in Corporate Promotion and Management: A Canadian Case Study and Theoretical Speculations","year":2013,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Consolidation (business); Boom; Big business; Latin Americans; Promotion (chess); Business history; World War II","score_opus":0.010518722870165217,"score_gpt":0.2206291240848587,"score_spread":0.2101104012146935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101105207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958828,0.00006280084,0.000015113866,0.00018799695,0.0000061990936,0.00030517185,7.5561934e-7,0.0000015931417,0.0035375592],"genre_scores_gemma":[0.9997727,0.000021208405,0.0001184957,0.00002178107,0.0000070615056,0.000009522406,0.000002858886,0.0000017695321,0.00004459006],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996698,0.000039755843,0.00007835489,0.00010441673,0.000021020023,0.00008668627],"domain_scores_gemma":[0.99984545,0.00000771916,0.000020533384,0.00006552778,0.000017000995,0.0000437903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117180076,0.000039863524,0.000037705424,0.000015830426,0.000062394785,0.000019579182,0.000028722701,0.000027075273,0.0000078053345],"category_scores_gemma":[0.000009910416,0.000023609653,0.0000067807787,0.000037086127,0.00009746986,0.0000012603602,0.00004884665,0.000022109665,5.2163597e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022611988,0.00021900913,0.6887734,0.00001658183,0.000081299586,0.00015369659,0.0002706917,0.000012528211,0.026890604,0.18796724,0.00004797703,0.09554437],"study_design_scores_gemma":[0.0019273827,0.002227413,0.8996142,0.000025406232,0.00005821541,0.0005409825,0.021188973,0.0120130405,0.0073095313,0.052675065,0.0018929252,0.00052682747],"about_ca_topic_score_codex":0.00592394,"about_ca_topic_score_gemma":0.029036833,"teacher_disagreement_score":0.21084085,"about_ca_system_score_codex":0.0000025641189,"about_ca_system_score_gemma":0.000006202666,"threshold_uncertainty_score":0.9886807},"labels":[],"label_agreement":null},{"id":"W7101416275","doi":"10.5281/zenodo.17456272","title":"A wave-only, Two-Scale, Exponential Law","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Fractal; Exponential function; Compounding; Calculus (dental); Work (physics)","score_opus":0.02357524521499585,"score_gpt":0.2553525071656663,"score_spread":0.23177726195067047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101416275","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16726418,0.0011965958,0.016092898,0.0014967835,0.00071460573,0.00081900595,0.00030015712,0.0003938651,0.8117219],"genre_scores_gemma":[0.99152523,0.00024942373,0.00031560648,0.00090058916,0.0005431256,3.5798358e-8,0.0022949893,0.00062427536,0.003546722],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99689937,0.00066446175,0.00048640434,0.0009654124,0.00027191872,0.0007124108],"domain_scores_gemma":[0.99830276,0.000018873083,0.00014907672,0.00070462486,0.0005922487,0.0002324099],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007705822,0.0003157176,0.00027635045,0.00013801677,0.0030795103,0.0009822272,0.0012007816,0.00027008136,0.004267749],"category_scores_gemma":[0.00029215316,0.00031873558,0.00019625103,0.0005347766,0.000536966,0.00001854718,0.0040228344,0.00041672483,0.0017187282],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059393304,0.00068954134,0.000018478686,0.00020230524,0.00031241123,0.000037100985,0.00021422027,0.000047101097,0.3815021,0.02946037,0.095140316,0.49178213],"study_design_scores_gemma":[0.001140365,0.0005571004,0.00015939903,0.000075333344,0.00004838372,0.00010544843,0.0001575905,0.0005290017,0.016019832,0.00031249173,0.98055035,0.00034472372],"about_ca_topic_score_codex":0.000030250407,"about_ca_topic_score_gemma":0.0000019638371,"teacher_disagreement_score":0.88541,"about_ca_system_score_codex":0.00008611625,"about_ca_system_score_gemma":0.000018876824,"threshold_uncertainty_score":0.99992645},"labels":[],"label_agreement":null},{"id":"W7110929149","doi":"10.1109/tvlsi.2025.3639548","title":"A RISC-V Accelerator for Sequence Decoding in Mobile DNA Sequencers","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Decoding methods; Bottleneck; Speedup; Throughput; Viterbi decoder; DNA sequencer; Hardware acceleration; Key (lock)","score_opus":0.026130747513166748,"score_gpt":0.30570581006235964,"score_spread":0.2795750625491929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110929149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3758857,0.0010023854,0.61571276,0.00013810243,0.0038373687,0.0019953144,0.00056894927,0.000057797202,0.0008016008],"genre_scores_gemma":[0.99409056,0.0005038151,0.00052311475,0.0003552661,0.00026799727,0.0010292347,0.00013162236,0.000037437214,0.0030609295],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959875,0.00042900193,0.0012483967,0.0012353156,0.00026117844,0.00083860836],"domain_scores_gemma":[0.9983681,0.00019905392,0.00029342645,0.00058595743,0.00038295222,0.00017050676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096828106,0.0005970104,0.00067423965,0.00037310593,0.00060651026,0.0002495035,0.0005018163,0.0008940312,0.000053045675],"category_scores_gemma":[0.00005601076,0.0004948871,0.00050488504,0.0007481192,0.00016265926,0.000053128177,0.0000103286175,0.0005827967,0.00003126813],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010051226,0.0011041183,0.00051628274,0.0005948892,0.0003376521,0.000013884228,0.0005166156,0.0322752,0.91537684,0.00024160162,0.00091951434,0.047098253],"study_design_scores_gemma":[0.0033299245,0.0018206756,0.0000661918,0.0019896433,0.00018600938,0.00003087346,0.0055981805,0.16046108,0.7804001,0.00009942969,0.04474443,0.0012734627],"about_ca_topic_score_codex":0.00010686517,"about_ca_topic_score_gemma":0.0007148091,"teacher_disagreement_score":0.6182049,"about_ca_system_score_codex":0.00048981764,"about_ca_system_score_gemma":0.00046482444,"threshold_uncertainty_score":0.99975026},"labels":[],"label_agreement":null},{"id":"W7126245635","doi":"10.1109/iscmi67495.2025.11358604","title":"Creating Optimal Edit Metric Codes using a Genetic Algorithm","year":2025,"lang":"","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Metric (unit); Code word; Crossover; Set (abstract data type); Binary number; Code (set theory); Binary code; Value (mathematics)","score_opus":0.014624390469835052,"score_gpt":0.2838750588782584,"score_spread":0.2692506684084234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126245635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39769712,0.011103953,0.5690801,0.00009222323,0.0009994293,0.000340894,0.000024340712,0.00003789043,0.020624043],"genre_scores_gemma":[0.75679713,0.00043360543,0.23806459,0.0005757443,0.0010913438,0.0000060522216,0.00003921134,0.000020196429,0.0029720985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970321,0.00021761765,0.0007149459,0.0010232008,0.0001985749,0.0008135254],"domain_scores_gemma":[0.99882275,0.00011224777,0.00019582172,0.00045535844,0.00024530911,0.00016851175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041473642,0.0004759596,0.00049571774,0.00021649551,0.0004925212,0.00019936246,0.00049039756,0.0006106172,0.00015304684],"category_scores_gemma":[0.00037708855,0.000406769,0.00033037044,0.00093360065,0.00022488093,0.0000046601754,0.00092121615,0.00027944482,0.000013533918],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011313581,0.00049057195,0.0067467242,0.00017613957,0.0008374097,0.00005202148,0.000040750358,0.009214314,0.27449065,0.00026808807,0.001267994,0.7063022],"study_design_scores_gemma":[0.002138666,0.0015481693,0.004092583,0.00035891644,0.00065236026,0.0000976795,0.0007448384,0.67618984,0.26431674,0.0002463282,0.047870155,0.0017437424],"about_ca_topic_score_codex":0.0001098106,"about_ca_topic_score_gemma":0.0000026132893,"teacher_disagreement_score":0.70455843,"about_ca_system_score_codex":0.0000670479,"about_ca_system_score_gemma":0.00030608536,"threshold_uncertainty_score":0.9998384},"labels":[],"label_agreement":null},{"id":"W7511636","doi":"","title":"Algorithms For The Optimal Hamiltonian Path In Halin Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path; Hamiltonian path problem; Path (computing); Combinatorics; Discrete mathematics; Graph; Computer science","score_opus":0.020960532347010345,"score_gpt":0.2545780518503076,"score_spread":0.23361751950329723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7511636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99772555,0.0007242995,0.00030237477,0.00018643458,0.0005445128,0.00023153906,0.0000066398516,0.000013687326,0.00026498156],"genre_scores_gemma":[0.9982858,0.00014245992,0.001038625,0.0002662914,0.000032238688,0.00003545827,0.000035010973,0.00001076464,0.00015338731],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9992019,0.00004115444,0.00016261969,0.00026037128,0.00007315487,0.00026081226],"domain_scores_gemma":[0.9995962,0.00005349665,0.00004431223,0.00021740426,0.00004563125,0.000042970627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022683201,0.00011844107,0.00011711523,0.000019308416,0.0001659531,0.000012084385,0.00025020706,0.00012356455,0.0000033752995],"category_scores_gemma":[0.0000818802,0.00007933916,0.00010051197,0.000103093545,0.00009940518,0.0000019508939,0.000099114055,0.00009526093,0.0000034582886],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011638183,0.0022134006,0.26229504,0.00009337838,0.00054250826,0.00023172362,0.0011242823,0.001294823,0.41487095,0.20985782,0.041656904,0.06465538],"study_design_scores_gemma":[0.014904604,0.006445397,0.39145654,0.00010034032,0.00009328708,0.00027184462,0.00060382835,0.015094869,0.18738686,0.11458423,0.2663992,0.002658998],"about_ca_topic_score_codex":0.000023933057,"about_ca_topic_score_gemma":0.000005836463,"teacher_disagreement_score":0.22748408,"about_ca_system_score_codex":0.00000803152,"about_ca_system_score_gemma":0.00003093399,"threshold_uncertainty_score":0.3235357},"labels":[],"label_agreement":null},{"id":"W76213468","doi":"","title":"Broadcasting in Odd Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Broadcasting (networking); Computer science; Computer network","score_opus":0.009874596601576854,"score_gpt":0.23397914135811693,"score_spread":0.22410454475654007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76213468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98645896,0.0003053173,0.0000022261088,0.000045695375,0.00020608745,0.00006554676,9.574388e-7,0.000017816552,0.0128973685],"genre_scores_gemma":[0.9991348,0.00005640075,0.00012801267,0.00022065586,0.000015567959,0.000004319952,0.00002055473,0.000008092333,0.00041159068],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99923617,0.000049517726,0.00016468266,0.00025127822,0.00006203228,0.00023631699],"domain_scores_gemma":[0.9997349,0.000013251893,0.000026924752,0.00015957672,0.000017757158,0.000047582624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016254079,0.0001002161,0.0001005021,0.000023096734,0.000050413295,0.000015704503,0.00015569426,0.000108705375,0.00008386758],"category_scores_gemma":[0.000047679285,0.00008860005,0.000052843487,0.00013690666,0.00003674103,0.0000019454003,0.00005472062,0.00009346695,0.000034024197],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027226322,0.0006328972,0.26783243,0.000033313812,0.00006441766,0.000085030944,0.0001352139,0.00022135752,0.4142468,0.04609915,0.0042571616,0.26612],"study_design_scores_gemma":[0.007471786,0.0026611858,0.32162902,0.00017709051,0.00003161834,0.000103945014,0.00016246115,0.0010500395,0.15588984,0.311939,0.19667944,0.002204581],"about_ca_topic_score_codex":0.000019489691,"about_ca_topic_score_gemma":0.000005280344,"teacher_disagreement_score":0.26583984,"about_ca_system_score_codex":0.0000065141194,"about_ca_system_score_gemma":0.000012757825,"threshold_uncertainty_score":0.3613005},"labels":[],"label_agreement":null},{"id":"W77757448","doi":"10.1007/11779148_17","title":"Characterizing DNA Bond Shapes Using Trajectories","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":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Decidability; Set (abstract data type); Computer science; DNA computing; Extension (predicate logic); Bond; Rotation (mathematics); Algorithm; Theoretical computer science; Artificial intelligence; Programming language; Computation","score_opus":0.019624642936291087,"score_gpt":0.24656503449636066,"score_spread":0.22694039156006957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77757448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1561801,0.0009600755,0.8371603,0.000100493016,0.0009957942,0.0002607209,0.000018017034,0.000048350972,0.0042761452],"genre_scores_gemma":[0.96977925,0.000022536951,0.027271532,0.0007981194,0.0018178053,0.0000015710822,0.00005142842,0.000031004798,0.00022675739],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801785,0.000016003627,0.000316593,0.0009308848,0.0002598257,0.00045882713],"domain_scores_gemma":[0.99930644,0.000046976867,0.00017418174,0.0003075249,0.0000939803,0.00007090947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028901125,0.0003735365,0.0003216719,0.00014264794,0.00019194004,0.00014869678,0.00062694354,0.0003984232,0.000009297565],"category_scores_gemma":[0.000047782065,0.00030962768,0.0001242449,0.00012196056,0.00048044728,0.000008872803,0.0005183284,0.0003077324,0.0000037226464],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022261009,0.00002592345,0.000492505,0.000038739676,0.000017590986,0.0000394565,0.000052960495,0.0055242246,0.8615574,0.00020542773,0.000027294982,0.1319962],"study_design_scores_gemma":[0.0011251412,0.0017400695,0.0049354592,0.0012963173,0.000084914194,0.0004023055,0.0000012935316,0.08481629,0.8290419,0.023660798,0.048169658,0.004725836],"about_ca_topic_score_codex":0.000016559317,"about_ca_topic_score_gemma":0.000025614174,"teacher_disagreement_score":0.81359917,"about_ca_system_score_codex":0.000055440967,"about_ca_system_score_gemma":0.0001559058,"threshold_uncertainty_score":0.99993557},"labels":[],"label_agreement":null},{"id":"W87144123","doi":"","title":"Asymptotic density of brick and word codes.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Word (group theory); Brick; Geometry; Composite material; Materials science","score_opus":0.008523496338954441,"score_gpt":0.23582183955557454,"score_spread":0.2272983432166201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87144123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99796146,0.00028820153,0.00014741695,0.000020605155,0.0002407562,0.00005703363,9.29681e-7,0.000008884613,0.0012747266],"genre_scores_gemma":[0.99948347,0.00002675211,0.0002873193,0.000094979805,0.000014058583,3.8378926e-7,0.000009817955,0.000005020006,0.0000782312],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994281,0.000022829174,0.00014273004,0.00017982529,0.0000626635,0.00016387885],"domain_scores_gemma":[0.99965996,0.000030886255,0.000056757282,0.00013592765,0.0000569697,0.000059491947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029706556,0.000079356796,0.0001171913,0.000016511805,0.000040704046,0.0000065285,0.00008827092,0.00010383884,0.0000031814209],"category_scores_gemma":[0.0000888866,0.00006780821,0.000037182475,0.000065707834,0.000080941034,0.0000011723566,0.00012665501,0.000054659016,0.0000020656375],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001100777,0.0001339394,0.28746727,0.000024994344,0.00005147932,0.000010835823,0.000030680127,0.000001687286,0.6748743,0.02341751,0.0005457596,0.0133314505],"study_design_scores_gemma":[0.00094165915,0.00059221085,0.48017433,0.000020827192,0.000021544747,0.000024886234,0.00004784343,0.000026808792,0.49174464,0.023012787,0.0031220396,0.00027040308],"about_ca_topic_score_codex":0.000012312108,"about_ca_topic_score_gemma":0.000006530482,"teacher_disagreement_score":0.19270706,"about_ca_system_score_codex":0.000004777764,"about_ca_system_score_gemma":0.000011286023,"threshold_uncertainty_score":0.27651384},"labels":[],"label_agreement":null},{"id":"W90253895","doi":"10.1007/978-1-84882-409-6_2","title":"Introduction to Parallel Computation","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Analysis of parallel algorithms; Parallel computing; Computation; Parallel algorithm; Impossibility; Embarrassingly parallel; Divide and conquer algorithms; Parallel processing; Interconnection; Theoretical computer science; Algorithm","score_opus":0.014154131078638834,"score_gpt":0.2444496896327316,"score_spread":0.23029555855409276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90253895","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011121609,0.00023466116,0.031001005,0.002523437,0.00035171045,0.00030334623,0.0000054530296,0.000057033063,0.9644112],"genre_scores_gemma":[0.0125986785,0.00006513983,0.009217502,0.0020253034,0.0050731637,0.0000022737395,0.00072520494,0.000021371312,0.97027135],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920267,0.000008568706,0.00016690853,0.00041721037,0.00007693071,0.00012769763],"domain_scores_gemma":[0.99964905,0.0000033903007,0.000059525355,0.00015612724,0.00006830013,0.000063622996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073800475,0.00017346365,0.00014266929,0.00003364915,0.000040855786,0.00001845149,0.00009433523,0.00028472996,0.00011469842],"category_scores_gemma":[0.00001773954,0.00014139341,0.00008656252,0.000011330889,0.000018515644,5.907763e-7,0.0000742505,0.000091798975,0.00018548146],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016435579,0.000039660088,0.0000084205285,0.0000163022,0.000092704795,0.000006311766,0.000008123154,0.0016713432,0.06724993,0.028663928,0.41208264,0.48999628],"study_design_scores_gemma":[0.000088561734,0.0005504458,0.00006133323,0.000008047406,0.00001016581,0.000008475249,0.0000012091526,0.00002778763,0.0012073908,0.003216368,0.9945765,0.00024372886],"about_ca_topic_score_codex":0.0000011410773,"about_ca_topic_score_gemma":0.0000036858057,"teacher_disagreement_score":0.58249384,"about_ca_system_score_codex":0.000010948878,"about_ca_system_score_gemma":0.000014261763,"threshold_uncertainty_score":0.5765856},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Algorithm; Computer science; Graph theory; Identification (biology); Artificial intelligence; Mathematics","score_opus":0.017328397380424954,"score_gpt":0.22975224994033636,"score_spread":0.2124238525599114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95475432","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014292132,0.014466274,0.04228864,0.00009526391,0.0010338665,0.0019040224,0.0000785927,0.0001838562,0.92565733],"genre_scores_gemma":[0.023272779,0.0023997028,0.0856568,0.00030755118,0.0015655324,0.0000463296,0.0011911982,0.00013896136,0.88542116],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988026,0.000008774878,0.00027736643,0.0005272717,0.0001481754,0.00023578233],"domain_scores_gemma":[0.9994288,0.000030068377,0.00013795675,0.00023631981,0.00008200963,0.000084848274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018579359,0.00023265164,0.00028070266,0.000052864074,0.000078971876,0.000036395453,0.00010729208,0.0004327988,0.000017063698],"category_scores_gemma":[0.00005818405,0.00018329061,0.00008459435,0.000030815667,0.0002482826,0.0000015433841,0.00030058823,0.00018970267,0.00000556909],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063327134,0.00013319307,0.00003275268,0.0004762948,0.00026821342,0.000025766125,0.00008002976,0.0001166203,0.90950304,0.0037057737,0.07637017,0.009224837],"study_design_scores_gemma":[0.00039267374,0.00036036927,0.000018244715,0.00018228336,0.000042529577,0.00009907976,0.000006932006,0.001143792,0.077136286,0.0002915673,0.9197758,0.0005504494],"about_ca_topic_score_codex":0.0000011505822,"about_ca_topic_score_gemma":0.0000014807756,"teacher_disagreement_score":0.8434056,"about_ca_system_score_codex":0.000011065663,"about_ca_system_score_gemma":0.00018258923,"threshold_uncertainty_score":0.7474374},"labels":[],"label_agreement":null},{"id":"W99194335","doi":"","title":"Covering designs with minimum overlap.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012091090598232719,"score_gpt":0.226835706924934,"score_spread":0.21474461632670128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99194335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875004,0.00014838969,0.00004461748,0.000040056755,0.00014759848,0.00008523408,0.000001899014,0.000026705322,0.012005087],"genre_scores_gemma":[0.99813944,0.000034366512,0.0003141228,0.00026344493,0.000026988551,0.0000052403193,0.00002348958,0.00001276111,0.0011801623],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992667,0.000035752313,0.000107883345,0.00026763385,0.00008690642,0.0002351277],"domain_scores_gemma":[0.9996521,0.000013688856,0.000029318755,0.00020791506,0.000028302122,0.000068710346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008598177,0.0001251991,0.0001079034,0.0000106031985,0.000083300154,0.000025285353,0.00015714085,0.00009684066,0.000094009745],"category_scores_gemma":[0.000016324457,0.00009505164,0.000045333236,0.0000767322,0.000050562998,0.0000027014923,0.000045148303,0.00007002613,0.00004202266],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009289377,0.00047872082,0.062620796,0.00003368031,0.00020865545,0.0000806847,0.000088799396,0.00034511558,0.87499106,0.016608534,0.006768965,0.036846027],"study_design_scores_gemma":[0.008117373,0.009201767,0.05601771,0.00015162406,0.000103354265,0.0001985107,0.0001938209,0.0006190592,0.55830795,0.03232255,0.3322588,0.0025074778],"about_ca_topic_score_codex":0.0000070226233,"about_ca_topic_score_gemma":0.0000017260702,"teacher_disagreement_score":0.32548985,"about_ca_system_score_codex":0.000008101157,"about_ca_system_score_gemma":0.000024158066,"threshold_uncertainty_score":0.38760933},"labels":[],"label_agreement":null}]}