{"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005981654,0.30122817,0.012707573,0.3703554,0.011239796,0.000028786966,0.00082282035,0.00049263635,0.29714316],"genre_scores_gemma":[0.31385842,0.2863701,0.01927216,0.1532255,0.024352003,0.00025645303,0.0011401336,0.0007277223,0.20079757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979055,0.0007376026,0.00006731847,0.000496014,0.000558279,0.00023533593],"domain_scores_gemma":[0.9969778,0.0013968042,0.00009374593,0.00056791963,0.00060903665,0.00035469208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026977551,0.0008155983,0.00066740444,0.0016011427,0.0031974474,0.007638959,0.0015321801,0.006373377,0.0243271],"category_scores_gemma":[0.007221326,0.0004050184,0.00042095588,0.0013484675,0.011166226,0.02342469,0.0032228502,0.008288497,0.007869049],"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.000086566346,0.00001940311,0.00024905312,0.00020333056,0.000012498926,0.000107272106,0.0011120604,0.0003364753,0.00053060084,0.82676756,0.114680246,0.05589494],"study_design_scores_gemma":[0.000010587569,0.000021623948,0.00020659342,0.00032072084,0.0000064539176,0.00014863971,0.00042617662,0.0003065317,0.00022595895,0.18631813,0.8119898,0.000018795043],"about_ca_topic_score_codex":0.0064998185,"about_ca_topic_score_gemma":0.0043119127,"teacher_disagreement_score":0.0243271,"about_ca_system_score_codex":0.0052741296,"about_ca_system_score_gemma":0.002180961,"threshold_uncertainty_score":0.081382275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44405487,0.0014704759,0.5300524,0.005631599,0.00026348006,0.00011074063,0.00017078394,0.0015765384,0.016669117],"genre_scores_gemma":[0.85312706,0.00060203584,0.13876155,0.00058399915,0.00018461295,0.0002740487,0.00017851338,0.00092160463,0.0053665573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820054,0.0004787219,0.00008243926,0.0005353062,0.00037406015,0.0003288758],"domain_scores_gemma":[0.9905889,0.005549507,0.00070539775,0.002402978,0.0003391374,0.00041402777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002496153,0.00074428954,0.0011822426,0.00042576744,0.0010938935,0.0018269592,0.0029130215,0.0017267048,0.004409052],"category_scores_gemma":[0.012033654,0.00091767794,0.0014744168,0.00064296124,0.0031747841,0.008815507,0.0016969402,0.0029328344,0.0006597963],"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.0009712156,0.0005411308,0.005059867,0.00042156834,0.000113771144,0.00029452296,0.00078323996,0.41878226,0.04434326,0.4751262,0.0041663465,0.049396574],"study_design_scores_gemma":[0.00011419363,0.00021381973,0.00074850273,0.000027220254,0.000026761594,0.00009035028,0.00007240392,0.57967633,0.012715152,0.40385327,0.0024189588,0.000043026925],"about_ca_topic_score_codex":0.0013316186,"about_ca_topic_score_gemma":0.0012351555,"teacher_disagreement_score":0.004409052,"about_ca_system_score_codex":0.001611223,"about_ca_system_score_gemma":0.00091313216,"threshold_uncertainty_score":0.014749706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54427105,0.002421387,0.36487386,0.0031572888,0.00025734905,0.0001623875,0.00025133076,0.0006410174,0.083964385],"genre_scores_gemma":[0.9748975,0.0006828,0.018231727,0.00016414227,0.00018519294,0.000091134425,0.000081366816,0.00008631693,0.0055796453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978777,0.00058502995,0.00015269834,0.00045589387,0.0005687224,0.0003599453],"domain_scores_gemma":[0.9964876,0.0018385121,0.0003647155,0.00041624383,0.00050703896,0.00038597023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015736477,0.00064835907,0.00087225705,0.0019524456,0.0013363819,0.003034768,0.0009614071,0.0015132776,0.0035784182],"category_scores_gemma":[0.0074954685,0.0005655837,0.0012889047,0.0009713596,0.00674746,0.0070802863,0.004525806,0.0023276783,0.00046298033],"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.0000045735887,0.0000059035724,0.000118871365,0.000021417925,0.00000469424,0.000052757405,0.00022212861,0.0017179524,0.0003803844,0.9958301,0.0001543057,0.0014868879],"study_design_scores_gemma":[0.0000055322653,0.00000747745,0.000062939216,0.000007833057,0.000002817602,0.00008102314,0.000045748307,0.012337869,0.00023542868,0.986482,0.00072262395,0.000008703334],"about_ca_topic_score_codex":0.0010300904,"about_ca_topic_score_gemma":0.00050840795,"teacher_disagreement_score":0.0035784182,"about_ca_system_score_codex":0.0020325757,"about_ca_system_score_gemma":0.00078873965,"threshold_uncertainty_score":0.014747441},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14416246,0.01291905,0.44915137,0.0073348586,0.00285005,0.00012803747,0.0007765276,0.0010197908,0.38165787],"genre_scores_gemma":[0.8453508,0.008055104,0.07780854,0.001651237,0.003415584,0.00023121721,0.0005599512,0.000743416,0.06218411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862456,0.00023338325,0.0001343131,0.00040884365,0.00038064906,0.0002182711],"domain_scores_gemma":[0.9901991,0.0066873212,0.00066431053,0.0015887211,0.00064653804,0.00021399578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015422837,0.000695966,0.00096004416,0.0019324688,0.0028925887,0.0037816686,0.00189161,0.0021442254,0.0069507463],"category_scores_gemma":[0.011616689,0.00084674725,0.0013766952,0.0031457236,0.009184916,0.012873172,0.0025162867,0.0060977847,0.0012657745],"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.000019508798,0.0000060767234,0.000059187187,0.000018227138,0.0000019308811,0.000042028394,0.00009689342,0.00061712647,0.0002923345,0.9927884,0.0006202832,0.005438127],"study_design_scores_gemma":[0.000006276369,0.0000068823715,0.00004736281,0.000009417032,0.0000040411674,0.00010141291,0.000024386214,0.0014922043,0.0003837595,0.9946726,0.003241373,0.000010331496],"about_ca_topic_score_codex":0.00234676,"about_ca_topic_score_gemma":0.0013110752,"teacher_disagreement_score":0.0069507463,"about_ca_system_score_codex":0.0015149747,"about_ca_system_score_gemma":0.0014442235,"threshold_uncertainty_score":0.023252547},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25809777,0.0007536139,0.71908534,0.00049730286,0.00031679953,0.0005908975,0.001934245,0.0023954094,0.016328635],"genre_scores_gemma":[0.4784554,0.00035574616,0.5101034,0.00019196702,0.00007289326,0.0006145077,0.0029810416,0.00055933744,0.006665643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989718,0.0002710312,0.000098484874,0.00023542457,0.00031508063,0.0001081688],"domain_scores_gemma":[0.9977271,0.0012479386,0.00011548938,0.00036036453,0.0004276334,0.000121525234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052199,0.0007712521,0.00071738614,0.001834522,0.000944243,0.00086263777,0.00070370146,0.00044345323,0.0069489167],"category_scores_gemma":[0.0041983845,0.00038271272,0.00114177,0.0010799828,0.00050903106,0.00091754814,0.001314339,0.0006684214,0.0017797524],"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.0012915359,0.0003155691,0.014641313,0.0009628814,0.00040509328,0.0022775277,0.001066128,0.056207947,0.14711824,0.05978825,0.010367703,0.70555776],"study_design_scores_gemma":[0.00044501343,0.0013141688,0.01430338,0.00044670404,0.0006025432,0.004731556,0.0013241628,0.43156156,0.21084058,0.24934952,0.084766135,0.00031472175],"about_ca_topic_score_codex":0.00029705674,"about_ca_topic_score_gemma":0.0005929105,"teacher_disagreement_score":0.0069489167,"about_ca_system_score_codex":0.00035509976,"about_ca_system_score_gemma":0.0007012736,"threshold_uncertainty_score":0.023246467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018833842,0.0048568896,0.27176294,0.0020954898,0.0020290234,0.00006373281,0.00052481657,0.0011044072,0.6987289],"genre_scores_gemma":[0.43865147,0.0064470125,0.08337394,0.0011735219,0.0015745169,0.00024668113,0.0011133306,0.0014184383,0.4660011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995883,0.00006677719,0.000014143912,0.00006061317,0.0002211052,0.00004899727],"domain_scores_gemma":[0.99960834,0.00012655742,0.000021896576,0.00011193511,0.000099867335,0.000031378328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000291252,0.000570041,0.00052887347,0.0013404086,0.0010192081,0.002097561,0.0005478598,0.00065959763,0.01802831],"category_scores_gemma":[0.0014314178,0.00025588198,0.00036995855,0.0013910122,0.0019572936,0.0018743603,0.0013668499,0.0022594957,0.005588353],"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.000004845382,0.0000044287335,0.000017253436,0.000013897785,0.0000013742757,0.000009741612,0.00003350205,0.00060492475,0.0002864182,0.9725644,0.0059891324,0.020470127],"study_design_scores_gemma":[0.0000027904161,0.0000056321105,0.000030250667,0.000018162755,0.0000020156815,0.000045287594,0.000012476283,0.0032009038,0.0008106261,0.936299,0.05956648,0.0000063585308],"about_ca_topic_score_codex":0.00078714447,"about_ca_topic_score_gemma":0.0008392964,"teacher_disagreement_score":0.01802831,"about_ca_system_score_codex":0.0011857564,"about_ca_system_score_gemma":0.0007784001,"threshold_uncertainty_score":0.06031072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023420767,0.25688124,0.060420208,0.017625963,0.053344775,0.00053043343,0.008140401,0.0046294467,0.59608537],"genre_scores_gemma":[0.003425943,0.050135665,0.010041228,0.0007974943,0.0015763532,0.0000537943,0.002421702,0.0009024944,0.9306452],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992318,0.000045660894,0.000030699688,0.00012427103,0.00046397047,0.000103602644],"domain_scores_gemma":[0.99858224,0.00013346356,0.000026840353,0.00008558301,0.0009271746,0.000244758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011634041,0.0018594982,0.0014071407,0.0022355267,0.001463866,0.005094201,0.0017218736,0.0011741868,0.08391659],"category_scores_gemma":[0.0017440096,0.00082446844,0.0005925046,0.005011756,0.0012963304,0.0027497318,0.001125965,0.0023263255,0.05040907],"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.00003187666,0.000012917393,0.00006490298,0.00030784463,0.000005967052,0.000023177518,0.000081277336,0.00040937995,0.0006089227,0.0062268195,0.8843819,0.10784497],"study_design_scores_gemma":[0.00000370604,0.0000075164385,0.0001529478,0.00011215167,0.0000036936165,0.000048551236,0.00003133367,0.00021417027,0.0004667813,0.0015357331,0.997417,0.0000064194705],"about_ca_topic_score_codex":0.06978959,"about_ca_topic_score_gemma":0.18982041,"teacher_disagreement_score":0.9302104,"about_ca_system_score_codex":0.0056582503,"about_ca_system_score_gemma":0.009311244,"threshold_uncertainty_score":0.28072894},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01000126,0.18979159,0.06901803,0.004247038,0.004357899,0.00009852844,0.00057215226,0.00051702023,0.7213964],"genre_scores_gemma":[0.18252626,0.091422774,0.06464069,0.0027220317,0.005236426,0.0004462503,0.001249568,0.0003548413,0.6514011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972457,0.000060982096,0.000023607889,0.000067410634,0.00009542421,0.000028013279],"domain_scores_gemma":[0.9998086,0.00010067106,0.000011694849,0.000028330063,0.00003249768,0.000018237268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003511968,0.0008483649,0.0003767034,0.0014916486,0.0011157602,0.002596001,0.00048159005,0.00058769423,0.011953459],"category_scores_gemma":[0.00086083263,0.00029328698,0.0004022447,0.0016017336,0.0037721435,0.004929277,0.0008982547,0.0011367189,0.003881804],"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.0000070862457,0.0000049480727,0.000033981978,0.00007737963,0.0000025361132,0.000040183357,0.00031457987,0.00027959762,0.00038481498,0.9511779,0.01740371,0.030273307],"study_design_scores_gemma":[0.0000038543917,0.000013571225,0.00011175226,0.0000562729,0.0000023385628,0.0001770492,0.00012129217,0.00051099574,0.0001512207,0.6613991,0.33744815,0.000004320442],"about_ca_topic_score_codex":0.0010442596,"about_ca_topic_score_gemma":0.001169728,"teacher_disagreement_score":0.011953459,"about_ca_system_score_codex":0.0013550203,"about_ca_system_score_gemma":0.00067415,"threshold_uncertainty_score":0.03998834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04682565,0.000524661,0.944005,0.00032945926,0.00006835886,0.00009228548,0.00019594532,0.0021600523,0.005798503],"genre_scores_gemma":[0.23550229,0.0004223279,0.7535487,0.00013288452,0.00007435501,0.00019634116,0.0012835021,0.0007358922,0.008103786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974936,0.00004739585,0.000016890826,0.00005880799,0.00007806255,0.000049388385],"domain_scores_gemma":[0.9992607,0.0003890425,0.00004782184,0.00010910654,0.00014555594,0.00004784145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388083,0.00069451757,0.001109019,0.00092694105,0.0012757836,0.0010625422,0.0017567221,0.0014714011,0.0050300723],"category_scores_gemma":[0.0025175188,0.0007406507,0.0013845849,0.0009797823,0.0006906396,0.0012162565,0.0017183446,0.0011537727,0.0015378593],"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.00022946707,0.000084199135,0.0021087336,0.00017135032,0.000077868346,0.00014102677,0.00033071617,0.55949503,0.0058713127,0.045118585,0.010698379,0.37567332],"study_design_scores_gemma":[0.000033441785,0.000021606635,0.00025204275,0.000017211287,0.000013171217,0.000032148597,0.00004050962,0.9602104,0.0012362009,0.03651131,0.0016255144,0.000006527785],"about_ca_topic_score_codex":0.005870774,"about_ca_topic_score_gemma":0.007175275,"teacher_disagreement_score":0.005870774,"about_ca_system_score_codex":0.000984513,"about_ca_system_score_gemma":0.0010319808,"threshold_uncertainty_score":0.016827226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016369174,0.00017207697,0.9964923,0.00007678097,0.000028520424,0.00002351413,0.000050134207,0.00022948987,0.0012901939],"genre_scores_gemma":[0.14207731,0.0009682572,0.8494762,0.00021366542,0.00022457296,0.00030839778,0.00044987322,0.00018481503,0.006096925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914813,0.00033102714,0.0000406414,0.00013090747,0.00028209083,0.000067243265],"domain_scores_gemma":[0.9975497,0.001600066,0.00014757553,0.00035629037,0.00030527718,0.000041112908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085829885,0.00070413685,0.00059554126,0.0006921979,0.00039313102,0.00067537697,0.0006202772,0.00096021104,0.0069620186],"category_scores_gemma":[0.006410703,0.0004007698,0.00044926192,0.0013184092,0.0006087965,0.0013467291,0.0009129816,0.0010796984,0.0020887572],"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.0003620293,0.000072080424,0.0006240258,0.00029716836,0.00007515091,0.00014654106,0.0000802544,0.37548065,0.026422406,0.16085367,0.005906062,0.42967993],"study_design_scores_gemma":[0.000020836975,0.000092811286,0.00023387335,0.000035542846,0.000014501494,0.00015553893,0.000013175497,0.9203654,0.007909499,0.06258164,0.008555716,0.000021432637],"about_ca_topic_score_codex":0.001934529,"about_ca_topic_score_gemma":0.0021677972,"teacher_disagreement_score":0.0069620186,"about_ca_system_score_codex":0.0004523193,"about_ca_system_score_gemma":0.000948788,"threshold_uncertainty_score":0.023290336},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10345074,0.00042685878,0.8544309,0.0007651953,0.00014660007,0.00017785326,0.000988793,0.00055593805,0.039056983],"genre_scores_gemma":[0.7876622,0.0007942343,0.180231,0.00027288438,0.00020261802,0.00032715444,0.0016685781,0.00035181956,0.02848942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831474,0.0003585485,0.00015446427,0.0004944703,0.0004039478,0.000273868],"domain_scores_gemma":[0.99553645,0.0016866698,0.0006130075,0.000973073,0.00076577766,0.00042502733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172134,0.000717446,0.0005632159,0.0015164713,0.001002832,0.0025315075,0.0010042527,0.00089546037,0.012922758],"category_scores_gemma":[0.004949836,0.0003477719,0.0009990842,0.0016205157,0.0023352792,0.008055233,0.002236965,0.0020386404,0.0017648813],"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.000048863232,0.000034852506,0.00035010828,0.000051881867,0.000010406381,0.00010003163,0.00014005914,0.013436961,0.0018060872,0.9646684,0.0009075344,0.018444749],"study_design_scores_gemma":[0.000017139471,0.00009548113,0.0003927616,0.000029597351,0.000019742958,0.00022598627,0.000120888144,0.08181773,0.0048914296,0.8993642,0.012988393,0.00003663408],"about_ca_topic_score_codex":0.0015850608,"about_ca_topic_score_gemma":0.0018573622,"teacher_disagreement_score":0.012922758,"about_ca_system_score_codex":0.0014304223,"about_ca_system_score_gemma":0.0008438995,"threshold_uncertainty_score":0.04323095},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16220711,0.0095744375,0.2670743,0.0029855499,0.0024351063,0.00019611699,0.000583006,0.0011001024,0.5538444],"genre_scores_gemma":[0.7962689,0.0031586597,0.06568372,0.000850102,0.0010100013,0.00023250584,0.0007508874,0.00045781347,0.13158748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997658,0.00006565652,0.000013846042,0.000047379683,0.000070193455,0.000037082315],"domain_scores_gemma":[0.99964166,0.0001652983,0.000040229017,0.00005208763,0.00006335453,0.00003724147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018628704,0.00035511923,0.0004026777,0.0009705737,0.001119101,0.0018667103,0.0004938841,0.0008418362,0.012137852],"category_scores_gemma":[0.0011921613,0.00034580877,0.00031483962,0.0012236072,0.0014055403,0.0026763245,0.00082684006,0.0010790516,0.0028768524],"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.000014782629,0.000008297128,0.00004209725,0.000031299,0.0000016207438,0.00005405946,0.00024418905,0.0005346892,0.001401161,0.9834484,0.0022834488,0.011936015],"study_design_scores_gemma":[0.0000060220596,0.000024743644,0.000081317026,0.000025998443,0.000003229684,0.00011476785,0.000152461,0.002610732,0.0015729765,0.9650581,0.03034149,0.000008088248],"about_ca_topic_score_codex":0.00024523545,"about_ca_topic_score_gemma":0.00035171327,"teacher_disagreement_score":0.012137852,"about_ca_system_score_codex":0.00054321927,"about_ca_system_score_gemma":0.00029227344,"threshold_uncertainty_score":0.040605187},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050981894,0.00092393206,0.9365433,0.0013683034,0.00010087457,0.00011170089,0.00048956217,0.0006320042,0.008848432],"genre_scores_gemma":[0.6316996,0.0008173653,0.35817468,0.0004733998,0.0002709411,0.00020867078,0.0012098559,0.00019897496,0.006946505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981616,0.0004460579,0.0001425177,0.00045887934,0.0005519591,0.00023896103],"domain_scores_gemma":[0.9956995,0.002816155,0.00032855273,0.00040754332,0.00061312784,0.00013506878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013715161,0.00051499734,0.00049014133,0.0019562533,0.0012218329,0.0024891566,0.0012816669,0.0006562912,0.0043022265],"category_scores_gemma":[0.0054273913,0.0004213282,0.0020722332,0.0016094361,0.0028957715,0.0047241054,0.0016660652,0.0017587519,0.00057669444],"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.00005984749,0.000058806134,0.00054633274,0.00018898588,0.00002427681,0.00021430248,0.00067043875,0.012740353,0.0063477503,0.9434101,0.0015742929,0.03416456],"study_design_scores_gemma":[0.000020583324,0.00005506671,0.0002363968,0.000056651643,0.000031087155,0.0002778092,0.00021821156,0.065384164,0.005486469,0.9166525,0.011548606,0.00003246192],"about_ca_topic_score_codex":0.0015620623,"about_ca_topic_score_gemma":0.00097261526,"teacher_disagreement_score":0.0043022265,"about_ca_system_score_codex":0.0018453168,"about_ca_system_score_gemma":0.001399671,"threshold_uncertainty_score":0.014392376},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25703573,0.00026394636,0.7332842,0.0006843663,0.000032874337,0.00008993401,0.00026222022,0.00035512686,0.007991639],"genre_scores_gemma":[0.8478471,0.00047407005,0.1468505,0.00006932541,0.00002887789,0.00024652903,0.00031314636,0.000058885948,0.0041114944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972945,0.0000799955,0.000021076276,0.00005313792,0.00007207079,0.00004425032],"domain_scores_gemma":[0.9990416,0.00064716034,0.00009109849,0.000115067174,0.000057914174,0.00004711461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052616803,0.0004032285,0.00053293747,0.00046084105,0.000604258,0.0015481728,0.0012687909,0.0010349128,0.0016227476],"category_scores_gemma":[0.0016931139,0.00031755178,0.0012599239,0.00035114275,0.0015466103,0.0017179806,0.0009514141,0.00094791205,0.0001868328],"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.00004652038,0.000024169467,0.0005045078,0.000045478897,0.000016850045,0.00011282444,0.00014157376,0.85896856,0.002661186,0.1351099,0.000110726454,0.0022576568],"study_design_scores_gemma":[0.0000062975714,0.000008557553,0.000074148884,0.000003362185,0.0000065192394,0.000012983416,0.000021756574,0.97161466,0.0006805342,0.027046062,0.00052029203,0.000004846337],"about_ca_topic_score_codex":0.0048966403,"about_ca_topic_score_gemma":0.004818461,"teacher_disagreement_score":0.0048966403,"about_ca_system_score_codex":0.0014369539,"about_ca_system_score_gemma":0.0011093266,"threshold_uncertainty_score":0.010425866},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103304654,0.00020656515,0.87625843,0.00021523626,0.0001608636,0.00017569821,0.00026223584,0.0018188044,0.01759747],"genre_scores_gemma":[0.34548157,0.00027177023,0.62346125,0.00011193089,0.000051989144,0.0002788531,0.0010849526,0.0010989719,0.028158773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994209,0.00010694533,0.000047031877,0.00013227818,0.00022300462,0.0000698539],"domain_scores_gemma":[0.99762195,0.00151283,0.00013305803,0.00043813803,0.0002142805,0.000079731915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008074528,0.00077387295,0.00077110727,0.0010312585,0.0008504243,0.0009449953,0.0016030739,0.0014390156,0.008073187],"category_scores_gemma":[0.005612149,0.00072889775,0.0010337166,0.0013160119,0.001305028,0.002106011,0.0027150617,0.0012051866,0.0018863766],"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.00064399303,0.00022386143,0.0013834154,0.00073525525,0.00006759614,0.0011637056,0.0011103123,0.071487725,0.05331092,0.43914488,0.0115424385,0.41918585],"study_design_scores_gemma":[0.0001548158,0.00022901174,0.0004323051,0.00012219265,0.000102964565,0.00077936164,0.00022914707,0.34402582,0.08896682,0.54135406,0.023525883,0.00007753095],"about_ca_topic_score_codex":0.00044746898,"about_ca_topic_score_gemma":0.00073657767,"teacher_disagreement_score":0.008073187,"about_ca_system_score_codex":0.00057767174,"about_ca_system_score_gemma":0.00040864918,"threshold_uncertainty_score":0.02700746},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011064549,0.123243004,0.68699527,0.010029887,0.0041142832,0.00028924458,0.0014751522,0.00079143833,0.16199718],"genre_scores_gemma":[0.41273937,0.0888651,0.40951186,0.0039488752,0.0066485177,0.0015862148,0.001909288,0.0002602368,0.07453055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985839,0.0004689997,0.00013772794,0.00029359496,0.00041492505,0.00010079227],"domain_scores_gemma":[0.9976725,0.0013777906,0.00013822857,0.00020391992,0.0005322888,0.000075261865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015520791,0.0011967045,0.0019576177,0.002898105,0.0015175034,0.006162952,0.0016908258,0.0028060125,0.0121218255],"category_scores_gemma":[0.0039666253,0.00071906275,0.0017084138,0.0045212107,0.005278822,0.005705082,0.0016393947,0.0043431716,0.0020887624],"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.0000074061677,0.0000109032035,0.0001315247,0.0001664132,0.000013956134,0.00007547414,0.00032648994,0.0029750436,0.00023737682,0.97240406,0.0029828064,0.020668495],"study_design_scores_gemma":[0.000006034756,0.000010225991,0.00014338685,0.00011621514,0.000009420543,0.000096543576,0.00013086335,0.0075177928,0.0000875867,0.9428199,0.04904748,0.000014529379],"about_ca_topic_score_codex":0.005662888,"about_ca_topic_score_gemma":0.0024203127,"teacher_disagreement_score":0.0121218255,"about_ca_system_score_codex":0.0034476486,"about_ca_system_score_gemma":0.0019764672,"threshold_uncertainty_score":0.040551543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004942714,0.00008977218,0.99189353,0.000120829216,0.000041024847,0.000059379887,0.00011675707,0.0006403867,0.002095738],"genre_scores_gemma":[0.15335295,0.00022603347,0.8404706,0.000111755304,0.000037905014,0.00033952974,0.0005445189,0.00022299355,0.0046936707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982375,0.000041649124,0.000010977913,0.00004670931,0.000058099915,0.000018866833],"domain_scores_gemma":[0.99961483,0.00017630884,0.000022843893,0.000053316337,0.000104198945,0.000028522016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004446242,0.00071333494,0.0010534734,0.0011016289,0.0006690896,0.0010690475,0.0022944382,0.0015381858,0.00453535],"category_scores_gemma":[0.0014731403,0.00044039317,0.00095040933,0.0012946966,0.00063204323,0.00093462947,0.0014598832,0.0010654954,0.0009260486],"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.000049684662,0.00003975133,0.00032576045,0.000059432947,0.000028447303,0.00004196664,0.000060151535,0.8374919,0.001937935,0.028529054,0.0031652295,0.1282707],"study_design_scores_gemma":[0.0000047437034,0.0000057285943,0.000020998257,0.0000027186504,0.0000033797064,0.000005989573,0.0000034822708,0.9955823,0.00016920392,0.0037808581,0.00041803333,0.0000025098152],"about_ca_topic_score_codex":0.01396205,"about_ca_topic_score_gemma":0.010144963,"teacher_disagreement_score":0.01396205,"about_ca_system_score_codex":0.0010613328,"about_ca_system_score_gemma":0.0010888957,"threshold_uncertainty_score":0.027761579},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11374545,0.00079474604,0.42169654,0.0014406805,0.0008642153,0.0001528779,0.000357566,0.0013933576,0.45955452],"genre_scores_gemma":[0.76036245,0.00064010883,0.044161383,0.000674352,0.00024919247,0.00013445091,0.000484727,0.00054447405,0.19274887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997205,0.000038057668,0.0000096859585,0.000052355503,0.00011665643,0.000062673644],"domain_scores_gemma":[0.99941194,0.0001703036,0.000040903742,0.00016715015,0.0001249683,0.00008474645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023182033,0.00053651485,0.00051589054,0.00074640056,0.0012212732,0.0013205952,0.0008761407,0.00079800416,0.021900937],"category_scores_gemma":[0.0015233366,0.00023208461,0.00050847384,0.0005556274,0.0011728023,0.0016889933,0.0019164198,0.0015141707,0.0032547957],"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.00007579627,0.000037409005,0.00017569262,0.000061219995,0.0000146030025,0.00009393401,0.00010064077,0.0054568946,0.0049302205,0.9389059,0.00972536,0.0404224],"study_design_scores_gemma":[0.000017869195,0.00003783331,0.00019393898,0.000016921522,0.000010031544,0.00020635249,0.00004859561,0.034397356,0.0027353824,0.9485117,0.013808278,0.000015786965],"about_ca_topic_score_codex":0.0003949815,"about_ca_topic_score_gemma":0.0004763637,"teacher_disagreement_score":0.021900937,"about_ca_system_score_codex":0.0004210213,"about_ca_system_score_gemma":0.00047387488,"threshold_uncertainty_score":0.07326591},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02187627,0.0016392806,0.6996716,0.006405899,0.009009202,0.00035274465,0.0009318754,0.003676967,0.25643608],"genre_scores_gemma":[0.4281255,0.004652708,0.40968013,0.006670931,0.003528468,0.0007587051,0.0026579387,0.0033144678,0.14061113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879587,0.00027873745,0.00008702865,0.00025481146,0.00045440864,0.0001291872],"domain_scores_gemma":[0.9984456,0.0006365657,0.00006357178,0.0005146371,0.00020500059,0.00013470692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012330395,0.000908794,0.0007652985,0.0014253658,0.0014084338,0.001846525,0.0013270318,0.0009067571,0.026318977],"category_scores_gemma":[0.0031470382,0.0003550649,0.0025621282,0.0012499576,0.0026767422,0.0038647898,0.0036329266,0.003655179,0.0055481307],"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.0002091926,0.00022880176,0.00037529605,0.00031726563,0.000073417694,0.0013368282,0.00083077035,0.002767603,0.010969453,0.87487775,0.032366116,0.07564746],"study_design_scores_gemma":[0.000028115677,0.00009610029,0.0006080692,0.000045546378,0.000043346125,0.001145882,0.00022840028,0.0040959306,0.0076878546,0.884084,0.10187567,0.000061008614],"about_ca_topic_score_codex":0.0020944623,"about_ca_topic_score_gemma":0.0023613416,"teacher_disagreement_score":0.026318977,"about_ca_system_score_codex":0.00058418256,"about_ca_system_score_gemma":0.0005418654,"threshold_uncertainty_score":0.08804572},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007315816,0.27969608,0.05862596,0.01772144,0.007493597,0.00012585524,0.0004349729,0.00057426665,0.6345963],"genre_scores_gemma":[0.014361269,0.26348665,0.04639699,0.0037605204,0.0032096307,0.00019242123,0.00058104465,0.0003713974,0.66764],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996928,0.000040399784,0.000015003908,0.00003243404,0.00019332329,0.000026058304],"domain_scores_gemma":[0.9993369,0.00026846258,0.000028321883,0.00005799978,0.00023415592,0.00007407879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005338539,0.0009078632,0.00084533566,0.0012164859,0.00088845653,0.003937971,0.0009286229,0.0016905223,0.01795393],"category_scores_gemma":[0.00095050177,0.00045976063,0.00033014393,0.0034033824,0.0021091127,0.0041107824,0.0010787993,0.0032277175,0.0121717695],"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.000012542396,0.000032976313,0.000083857834,0.00042033088,0.000012177162,0.00008310762,0.0002779251,0.0010184753,0.00088734913,0.39350596,0.40212303,0.2015423],"study_design_scores_gemma":[0.0000022820286,0.0000047947487,0.000094482835,0.00016279695,0.0000029668045,0.000108416876,0.00002942503,0.00039501963,0.00010828039,0.054970678,0.9441143,0.0000065503323],"about_ca_topic_score_codex":0.004944496,"about_ca_topic_score_gemma":0.009514964,"teacher_disagreement_score":0.01795393,"about_ca_system_score_codex":0.0027783173,"about_ca_system_score_gemma":0.0029987765,"threshold_uncertainty_score":0.060061872},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10103148,0.0025124731,0.38271955,0.0037788644,0.0022423721,0.00014518756,0.0009465482,0.0012143811,0.5054091],"genre_scores_gemma":[0.6434976,0.002142904,0.07689377,0.00078576896,0.00069960154,0.0002056358,0.0012149047,0.0013628214,0.27319705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996207,0.000092794355,0.000016765774,0.000077105724,0.00012708172,0.00006557471],"domain_scores_gemma":[0.9995819,0.0001454817,0.000030370924,0.0001086477,0.00007806287,0.00005551299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033996816,0.00074281817,0.00084138947,0.0012029284,0.0013448212,0.0015083158,0.00074827106,0.001180869,0.027022118],"category_scores_gemma":[0.0019162109,0.00034984425,0.0007942262,0.0010389284,0.0014828058,0.0023802095,0.0016096836,0.0017885342,0.0038325307],"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.000015810414,0.000006107887,0.00004272323,0.000018940787,0.000003951895,0.000032005177,0.00003822774,0.001466818,0.00043057246,0.98763204,0.0023814803,0.007931305],"study_design_scores_gemma":[0.000008665308,0.0000075636335,0.00005395522,0.000011085043,0.0000027353958,0.000054087053,0.000023121573,0.008799304,0.00047899995,0.9796901,0.010864924,0.0000054994703],"about_ca_topic_score_codex":0.0016411594,"about_ca_topic_score_gemma":0.0010968978,"teacher_disagreement_score":0.027022118,"about_ca_system_score_codex":0.0011474327,"about_ca_system_score_gemma":0.00063391705,"threshold_uncertainty_score":0.09039801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20505235,0.0082176775,0.49175406,0.018532705,0.00397372,0.00013210227,0.00034398405,0.0020280287,0.2699654],"genre_scores_gemma":[0.9578642,0.0018082059,0.028768355,0.0009161152,0.00089800276,0.000098847915,0.000057512716,0.000118597585,0.009470135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955887,0.00014944501,0.000018457118,0.00007375887,0.00012351864,0.00007585192],"domain_scores_gemma":[0.9985549,0.00073920185,0.00008896732,0.00030803794,0.00014997287,0.00015893314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078950706,0.00049374404,0.0006991915,0.00075092417,0.0018836053,0.0037005031,0.0010165771,0.0019733112,0.0067602512],"category_scores_gemma":[0.003910293,0.00036794823,0.00038096527,0.00071032305,0.0041982387,0.00788939,0.0017804032,0.0017150131,0.00092126813],"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.0000542183,0.000017050494,0.00008684575,0.000036612786,0.000006966779,0.00008622055,0.00009780613,0.002271673,0.001310896,0.98466796,0.0030105098,0.008353221],"study_design_scores_gemma":[0.000018525689,0.000014514184,0.000028577713,0.00000765183,0.0000049081586,0.000077321,0.000026013407,0.0145187685,0.00074128626,0.97940457,0.005146879,0.000011060885],"about_ca_topic_score_codex":0.00040046405,"about_ca_topic_score_gemma":0.00029804683,"teacher_disagreement_score":0.0067602512,"about_ca_system_score_codex":0.0005778573,"about_ca_system_score_gemma":0.00047164754,"threshold_uncertainty_score":0.022615254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021910148,0.0017091399,0.9555437,0.0033055847,0.00045115183,0.00037505652,0.00045797793,0.0014343784,0.014812809],"genre_scores_gemma":[0.3465168,0.0021398892,0.611724,0.0027842266,0.001153319,0.0020425587,0.0014129903,0.0016473302,0.030578913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98522687,0.003834825,0.00092531776,0.0027180952,0.005000079,0.0022946685],"domain_scores_gemma":[0.9115184,0.060816903,0.0025411912,0.016636599,0.0048417337,0.0036451844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018145923,0.004521724,0.0053639016,0.0038686744,0.00419424,0.009241347,0.014660781,0.009249314,0.020505331],"category_scores_gemma":[0.082148276,0.002775915,0.004930016,0.0059425025,0.009210601,0.022797108,0.0190384,0.022971034,0.004516299],"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.0022530737,0.000524641,0.0011970481,0.0007815839,0.0002372765,0.00014384833,0.0011150833,0.21290463,0.0101797525,0.63495535,0.020667326,0.11504045],"study_design_scores_gemma":[0.00016310542,0.00019230781,0.00023177225,0.000098321405,0.00013249303,0.00011889927,0.00012418292,0.5852174,0.0034390588,0.40656534,0.003639518,0.000077615245],"about_ca_topic_score_codex":0.0033515415,"about_ca_topic_score_gemma":0.0039634504,"teacher_disagreement_score":0.020505331,"about_ca_system_score_codex":0.011293515,"about_ca_system_score_gemma":0.0055811186,"threshold_uncertainty_score":0.09596592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6108876,0.0007527252,0.114380054,0.0013390857,0.00097443565,0.00011702553,0.00058289926,0.0010077765,0.26995835],"genre_scores_gemma":[0.94755703,0.00017746422,0.016673304,0.00027446615,0.00007055781,0.00011412725,0.00025839193,0.00016601998,0.034708597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969566,0.000058487713,0.000013395985,0.000052245967,0.00009068936,0.000089615365],"domain_scores_gemma":[0.99964094,0.00005908622,0.000033304503,0.00007208881,0.000046734407,0.00014792936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024853132,0.00041280207,0.00053678366,0.0009548699,0.0017100681,0.0017313235,0.00096906757,0.0011191448,0.024796799],"category_scores_gemma":[0.0009868795,0.00033583277,0.00033426296,0.000515938,0.001999555,0.001728426,0.0031717464,0.0007994667,0.00265856],"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.00019502614,0.000065012144,0.00026708137,0.00008043739,0.00002246357,0.00035429772,0.00013048222,0.005497603,0.0065078223,0.9766018,0.0032573605,0.007020734],"study_design_scores_gemma":[0.00017138153,0.00011462564,0.0006456187,0.00006726661,0.000023801536,0.0006199346,0.0004944544,0.05390303,0.0078101764,0.917028,0.01904065,0.00008106693],"about_ca_topic_score_codex":0.00050202844,"about_ca_topic_score_gemma":0.00068450265,"teacher_disagreement_score":0.024796799,"about_ca_system_score_codex":0.0005802363,"about_ca_system_score_gemma":0.00044731417,"threshold_uncertainty_score":0.08295363},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074963877,0.1299216,0.68846905,0.0052019586,0.0024179635,0.00008672192,0.00019303948,0.0014442953,0.16476892],"genre_scores_gemma":[0.37905356,0.13998295,0.38311547,0.0037814337,0.0029361425,0.00084729056,0.0005333673,0.0010245598,0.08872525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995396,0.00012312167,0.00002175342,0.00011702037,0.00015758951,0.00004086561],"domain_scores_gemma":[0.9994081,0.00037931526,0.00002607181,0.00013066336,0.0000290536,0.000026724316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081538426,0.0007512451,0.0012163724,0.0005835181,0.00056974875,0.0029009308,0.0030323854,0.0023992439,0.0053518615],"category_scores_gemma":[0.0015634722,0.00081520673,0.0005839479,0.0011408644,0.0065268828,0.004784622,0.0011857344,0.0037138509,0.0020461485],"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.00001799719,0.000037224178,0.00004112697,0.00022967874,0.00000861432,0.000030336985,0.000086564396,0.005564309,0.0022608382,0.9202791,0.007918961,0.0635253],"study_design_scores_gemma":[0.000024376208,0.00004506336,0.000047725753,0.00013681137,0.00000985963,0.00018150613,0.00003380792,0.020121543,0.005670517,0.8794484,0.09425123,0.00002913071],"about_ca_topic_score_codex":0.00041698435,"about_ca_topic_score_gemma":0.00026872152,"teacher_disagreement_score":0.0053518615,"about_ca_system_score_codex":0.0013706929,"about_ca_system_score_gemma":0.001062733,"threshold_uncertainty_score":0.017903805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31008542,0.0017470351,0.59832424,0.0014093926,0.00028002038,0.00024775544,0.0010185259,0.001624373,0.085263304],"genre_scores_gemma":[0.85279876,0.0010835006,0.11293713,0.00062276307,0.00020664935,0.00048425453,0.0009798789,0.0007622492,0.030124743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847776,0.00032083094,0.00013511255,0.00028453962,0.00050467777,0.00027713252],"domain_scores_gemma":[0.99630547,0.0018380719,0.0003880636,0.0005273617,0.0007398576,0.00020129183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015175417,0.00035541694,0.0007076386,0.0011745269,0.0017736744,0.001679092,0.0007977194,0.0011712406,0.007906229],"category_scores_gemma":[0.0062349243,0.00047363646,0.000999228,0.0010233842,0.0022203624,0.004938817,0.0018276062,0.0014558925,0.0020324276],"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.00004467331,0.000012985816,0.00022639064,0.00004519564,0.000006679931,0.000111469766,0.00027700502,0.0011087632,0.0033245073,0.9887664,0.0007393848,0.0053365096],"study_design_scores_gemma":[0.000036248362,0.000047588353,0.00022169075,0.00003035517,0.000022736098,0.00032517326,0.00013013215,0.020427434,0.0061781355,0.95590115,0.016651886,0.000027383468],"about_ca_topic_score_codex":0.0019022812,"about_ca_topic_score_gemma":0.0012146205,"teacher_disagreement_score":0.007906229,"about_ca_system_score_codex":0.0010333227,"about_ca_system_score_gemma":0.0011333709,"threshold_uncertainty_score":0.026448965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5781919,0.010013217,0.33294988,0.007502965,0.0016565116,0.000142695,0.00040794918,0.0013328629,0.06780211],"genre_scores_gemma":[0.93883026,0.0032235482,0.04037721,0.0006456421,0.00015148749,0.00012888113,0.00020550197,0.0001593216,0.016278109],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998865,0.000018899875,0.00000453906,0.000037001722,0.00004148338,0.000011524376],"domain_scores_gemma":[0.9998104,0.00006789084,0.00003558048,0.0000389987,0.000021070306,0.000025990308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015615707,0.00016927754,0.00015343344,0.00017755931,0.00034136797,0.0010269779,0.00030624573,0.0008751012,0.001675699],"category_scores_gemma":[0.0008920591,0.00022820816,0.00017113873,0.0001413461,0.0010343578,0.0021893647,0.00033943492,0.00037051408,0.0010030264],"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.0001087268,0.00009228563,0.0028402524,0.0008015754,0.000083805506,0.0004883358,0.0007454772,0.019893494,0.5623636,0.30396456,0.0073207812,0.10129707],"study_design_scores_gemma":[0.00008422916,0.0003870243,0.0054868846,0.00017098123,0.00010621449,0.00163233,0.00054474286,0.098902576,0.38698152,0.39581847,0.10975013,0.00013491203],"about_ca_topic_score_codex":0.0002697164,"about_ca_topic_score_gemma":0.00025809204,"teacher_disagreement_score":0.001675699,"about_ca_system_score_codex":0.00024603526,"about_ca_system_score_gemma":0.00026538433,"threshold_uncertainty_score":0.0056057572},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055984624,0.2561428,0.23509645,0.17626007,0.0034720355,0.00006245368,0.0005003764,0.00040876234,0.2720724],"genre_scores_gemma":[0.8829829,0.06779106,0.032471314,0.004810474,0.0034712409,0.00012913285,0.00012547562,0.000104882594,0.008113558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989793,0.00041186574,0.00004168131,0.000203125,0.000278229,0.00008585833],"domain_scores_gemma":[0.99107146,0.007052576,0.00026959233,0.00064747425,0.00061136583,0.00034746237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024622187,0.0006474655,0.0007040929,0.0013715135,0.0019266375,0.0055915527,0.0016236394,0.003290326,0.0044754827],"category_scores_gemma":[0.009139221,0.00058196794,0.00036971227,0.0016193374,0.016289078,0.014453136,0.002554516,0.0046404446,0.0007741038],"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.000008247827,0.0000111789295,0.00016742869,0.00005876319,0.0000034494776,0.00002482343,0.00006114404,0.0011563002,0.000072907744,0.9923126,0.0009865734,0.0051363898],"study_design_scores_gemma":[0.0000028874506,0.0000030566216,0.000067344445,0.00003280254,0.0000010424884,0.00002368756,0.0000677174,0.0013570534,0.00006304412,0.9946471,0.003729901,0.0000043142863],"about_ca_topic_score_codex":0.0021999236,"about_ca_topic_score_gemma":0.0016330866,"teacher_disagreement_score":0.0055915527,"about_ca_system_score_codex":0.0029723947,"about_ca_system_score_gemma":0.0021563906,"threshold_uncertainty_score":0.021566331},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032412957,0.002995743,0.7421816,0.001591015,0.0042512664,0.00015200122,0.00057250983,0.0029900915,0.21285282],"genre_scores_gemma":[0.45093924,0.003894259,0.39533663,0.0015422712,0.0025749742,0.0004100899,0.0013298945,0.0035333713,0.14043921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999476,0.00008506598,0.000057487043,0.00014944289,0.00015956779,0.000072509814],"domain_scores_gemma":[0.9991041,0.000387538,0.000049873102,0.00020991954,0.00019637804,0.000052182546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005338289,0.0006752592,0.0006965512,0.0014393438,0.00114506,0.0024626965,0.0007552912,0.00085880444,0.012437248],"category_scores_gemma":[0.0022419058,0.00039058266,0.0010646427,0.0013119607,0.0018286904,0.0038890643,0.0011818386,0.0017408229,0.004909129],"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.00008357842,0.000017266771,0.00005807291,0.00011775751,0.000009553657,0.00018330537,0.00024678197,0.0007999275,0.0075673563,0.8716498,0.009523962,0.109742604],"study_design_scores_gemma":[0.00002232688,0.000056799377,0.00010522717,0.000080552534,0.000018019198,0.00047880804,0.00006908644,0.007080914,0.012502061,0.8732397,0.10630181,0.000044542052],"about_ca_topic_score_codex":0.00083829573,"about_ca_topic_score_gemma":0.0007323735,"teacher_disagreement_score":0.012437248,"about_ca_system_score_codex":0.00064628525,"about_ca_system_score_gemma":0.00085535116,"threshold_uncertainty_score":0.041606784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05602927,0.00028999586,0.90902007,0.000090242334,0.00024653136,0.0001994953,0.0003944989,0.0038921034,0.029837769],"genre_scores_gemma":[0.25431946,0.00047749872,0.6638268,0.00013606752,0.00006622042,0.0007352119,0.0012627274,0.0011953161,0.077980705],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992907,0.000082159895,0.00005835395,0.00017474602,0.0002740385,0.00012005812],"domain_scores_gemma":[0.9987728,0.0003073483,0.000074486685,0.00058287376,0.00017261441,0.00008977649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041060188,0.0008591679,0.00076619565,0.00075604004,0.0007643135,0.0011177075,0.0017456639,0.00064862915,0.01147495],"category_scores_gemma":[0.0015066285,0.00084621087,0.0009692518,0.000842143,0.0007098909,0.0017063502,0.002431696,0.0011547123,0.0069835456],"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.0009783373,0.00031148043,0.001470562,0.0009077677,0.00012031108,0.0005594478,0.00044469806,0.027230697,0.4589332,0.21067336,0.013531587,0.28483853],"study_design_scores_gemma":[0.00021822457,0.0005347313,0.001388967,0.00012341488,0.00014565699,0.0011367657,0.00017447612,0.14795303,0.59084135,0.1585857,0.09875658,0.00014113024],"about_ca_topic_score_codex":0.0002688986,"about_ca_topic_score_gemma":0.0005817408,"teacher_disagreement_score":0.01147495,"about_ca_system_score_codex":0.00035181438,"about_ca_system_score_gemma":0.00036213253,"threshold_uncertainty_score":0.038387477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31407082,0.0008058098,0.57686454,0.0017760975,0.0011625137,0.00068548426,0.0017484151,0.002767995,0.10011829],"genre_scores_gemma":[0.78415376,0.0005614913,0.17892401,0.0007766224,0.000338293,0.0005443777,0.0017940941,0.0006324674,0.032274928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932504,0.00010306084,0.000034760298,0.000095992196,0.00023333168,0.00020774058],"domain_scores_gemma":[0.9992144,0.00023747761,0.00007550662,0.00014174379,0.00019325897,0.00013760215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041819367,0.00069599913,0.0005913095,0.0010686931,0.0012968656,0.0011735439,0.0007032278,0.00072721037,0.0064566648],"category_scores_gemma":[0.0015021669,0.0003085654,0.0008277821,0.0011962457,0.001130885,0.00087581185,0.0019997433,0.0013225349,0.0016021682],"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.000248446,0.00014099482,0.00050060323,0.0001608661,0.000022196185,0.00033304142,0.00038277707,0.0054986435,0.020236114,0.90393966,0.010082607,0.05845407],"study_design_scores_gemma":[0.00015376939,0.0003774433,0.0006941417,0.0001262997,0.000064258165,0.0005149168,0.00022147395,0.03700654,0.06271411,0.83362705,0.06432294,0.00017714554],"about_ca_topic_score_codex":0.0016755004,"about_ca_topic_score_gemma":0.0017240996,"teacher_disagreement_score":0.0064566648,"about_ca_system_score_codex":0.0010229836,"about_ca_system_score_gemma":0.002392324,"threshold_uncertainty_score":0.02159971},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41882378,0.0026002133,0.38710633,0.0004959852,0.00067090924,0.00015640189,0.00031901634,0.0020893996,0.18773803],"genre_scores_gemma":[0.89318997,0.0008555614,0.057075232,0.000114101116,0.000070111484,0.00014903436,0.00036551934,0.00013177143,0.048048712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998933,0.000016724494,0.000006152386,0.000023974559,0.00003067507,0.00002915071],"domain_scores_gemma":[0.99987113,0.000032115197,0.000015295735,0.00003033857,0.000018306717,0.000032748867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096113865,0.00021899038,0.00042045175,0.0003497047,0.0004598542,0.0009408968,0.0005836305,0.0005961586,0.008590743],"category_scores_gemma":[0.0003376458,0.00026947403,0.00027598048,0.00031933206,0.00058507104,0.00050805917,0.00069895503,0.00037194652,0.0013122607],"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.00019866094,0.00009823743,0.00037926805,0.0002583265,0.000033768283,0.0003919807,0.00041859926,0.085629895,0.11303424,0.72530735,0.0076241978,0.06662556],"study_design_scores_gemma":[0.00013236713,0.00028224726,0.0005596875,0.00004466047,0.000027066357,0.00039940854,0.00018532694,0.5603763,0.039662324,0.3563182,0.04194247,0.00006989701],"about_ca_topic_score_codex":0.0003514245,"about_ca_topic_score_gemma":0.00047768056,"teacher_disagreement_score":0.008590743,"about_ca_system_score_codex":0.0002974504,"about_ca_system_score_gemma":0.00017120989,"threshold_uncertainty_score":0.028738856},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08589145,0.08778747,0.2523354,0.012001379,0.0031102062,0.00007677218,0.0006388676,0.0006468773,0.55751157],"genre_scores_gemma":[0.8176601,0.031818517,0.05352598,0.0014796705,0.0029473007,0.00021794389,0.0005993289,0.00018241318,0.09156873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994856,0.00016925186,0.00003034967,0.00007903595,0.00016954799,0.00006615097],"domain_scores_gemma":[0.9989374,0.00069035636,0.000073823394,0.00014839164,0.00010921863,0.000040850104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005392596,0.0006018941,0.00054603233,0.0016824068,0.0012094842,0.0030379551,0.00057666836,0.0012426232,0.0043778867],"category_scores_gemma":[0.0030261986,0.00030393363,0.00039656687,0.0023069375,0.004612472,0.003664873,0.0010990655,0.0021929322,0.0009662542],"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.000005163599,0.0000034007855,0.000019719297,0.000018641886,9.988313e-7,0.000011724751,0.000080097554,0.00038710452,0.00011832571,0.9888277,0.0015158061,0.009011323],"study_design_scores_gemma":[0.0000017471771,0.000003246334,0.000018567032,0.0000123044265,8.770791e-7,0.000026954292,0.0000241859,0.0005226153,0.000103824896,0.9913668,0.00791579,0.000003195989],"about_ca_topic_score_codex":0.00081085926,"about_ca_topic_score_gemma":0.00066475925,"teacher_disagreement_score":0.0043778867,"about_ca_system_score_codex":0.0013125513,"about_ca_system_score_gemma":0.0005315028,"threshold_uncertainty_score":0.014645457},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08573101,0.004420221,0.28942567,0.0015102421,0.00239209,0.00017976633,0.0002790199,0.00045496062,0.615607],"genre_scores_gemma":[0.60499996,0.0037154884,0.09221511,0.0010760723,0.0012722266,0.00046030065,0.0003068911,0.00059875567,0.29535517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.00022896063,0.000065274,0.00019261231,0.00038033872,0.00010459843],"domain_scores_gemma":[0.99885654,0.00051016983,0.00010208345,0.00020624806,0.00023412594,0.000090907364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083418563,0.0008046562,0.0007626347,0.0015815498,0.001813017,0.0038642462,0.00093931716,0.0011434577,0.012434338],"category_scores_gemma":[0.003997716,0.00058961863,0.00054069347,0.001945827,0.0040607257,0.005199463,0.0015714953,0.002119262,0.0036250406],"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.000006756207,0.0000034563418,0.000009915187,0.00001005859,0.000001342155,0.000026773048,0.00006430727,0.00016201031,0.00024567428,0.99472445,0.0006846962,0.0040605674],"study_design_scores_gemma":[0.0000034607797,0.000006482208,0.0000170519,0.000005572208,0.0000021785813,0.00007182384,0.000029586026,0.0006476675,0.0008818271,0.9883195,0.010007277,0.000007522405],"about_ca_topic_score_codex":0.00053141214,"about_ca_topic_score_gemma":0.0004158062,"teacher_disagreement_score":0.012434338,"about_ca_system_score_codex":0.0010682391,"about_ca_system_score_gemma":0.0007614524,"threshold_uncertainty_score":0.04159701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13074124,0.0025770178,0.8469665,0.0011369772,0.00024159622,0.00007960588,0.0000680454,0.0018361802,0.01635285],"genre_scores_gemma":[0.8011926,0.0013092149,0.1926098,0.00027245996,0.00019489531,0.00007093096,0.00007093515,0.00020466541,0.0040744874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993376,0.00019039641,0.00004287293,0.00016089658,0.00018366381,0.000084444066],"domain_scores_gemma":[0.9986632,0.0006387156,0.00013954724,0.00033961973,0.00013078719,0.00008817179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545525,0.00045751713,0.00040326198,0.00043345543,0.0007494839,0.0010666578,0.00071430334,0.00081360765,0.0021327678],"category_scores_gemma":[0.0020639964,0.00029274586,0.0006106604,0.0005664906,0.0025872078,0.0013162844,0.0014593814,0.000891658,0.0003565227],"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.00014258618,0.000058369886,0.00054313376,0.00020206644,0.000014608429,0.0005543212,0.0005872178,0.04720129,0.045164585,0.86620015,0.00090471253,0.03842704],"study_design_scores_gemma":[0.000042753803,0.00016756648,0.00032788658,0.00005848018,0.000048308095,0.0009902754,0.0002560741,0.2567303,0.064600624,0.6442337,0.032477684,0.00006648961],"about_ca_topic_score_codex":0.0009239959,"about_ca_topic_score_gemma":0.00089772587,"teacher_disagreement_score":0.0021327678,"about_ca_system_score_codex":0.0007682713,"about_ca_system_score_gemma":0.0005739029,"threshold_uncertainty_score":0.007134855},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040475145,0.00029956992,0.95007914,0.0012000145,0.0001553658,0.00008300926,0.00008912501,0.00040689824,0.0072116978],"genre_scores_gemma":[0.08317577,0.00038009207,0.91179323,0.00034344353,0.000060924325,0.0001752292,0.00027985848,0.00013035272,0.0036610996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955493,0.000107959066,0.000025331288,0.000100504134,0.00015889217,0.000052316536],"domain_scores_gemma":[0.9991737,0.0005002483,0.00006674847,0.000074517295,0.00013871012,0.00004606798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007336008,0.00050956703,0.00057785184,0.00075059,0.00062837696,0.0010538839,0.0009564606,0.0014080462,0.0025168373],"category_scores_gemma":[0.0030249832,0.0003730107,0.0006201249,0.000567013,0.0011948011,0.0011852595,0.0010654848,0.0016958024,0.0008737997],"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.00024087308,0.0001577432,0.00059484475,0.00042402817,0.000058511563,0.00021733048,0.0003565088,0.2551727,0.049579985,0.5707287,0.006771969,0.115696825],"study_design_scores_gemma":[0.00018359334,0.00013632364,0.00019426765,0.000068806476,0.000023661498,0.00017130462,0.00015196027,0.5819966,0.02491781,0.35703507,0.035080355,0.000040242387],"about_ca_topic_score_codex":0.0009164027,"about_ca_topic_score_gemma":0.0008363839,"teacher_disagreement_score":0.0025168373,"about_ca_system_score_codex":0.0005894793,"about_ca_system_score_gemma":0.0010854076,"threshold_uncertainty_score":0.008419633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8876752,0.00054383534,0.083910406,0.0015066382,0.00018535774,0.00007054629,0.0006797326,0.0006642615,0.024763966],"genre_scores_gemma":[0.96296215,0.00043542718,0.015537476,0.00017871172,0.00011211002,0.0001381997,0.0008552624,0.00043648196,0.019344121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.00012680954,0.000030064431,0.00009646029,0.00014630055,0.00016399876],"domain_scores_gemma":[0.9810688,0.013420659,0.0013290597,0.00070805417,0.0022652426,0.0012082556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009383533,0.0005637825,0.00075190014,0.0017710051,0.001433526,0.002356902,0.0013585169,0.0015187619,0.009764248],"category_scores_gemma":[0.017423103,0.0005086091,0.0005932921,0.0009274005,0.0010358015,0.0024142116,0.001213837,0.0012980347,0.0015850842],"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.0010830885,0.00019393406,0.00677676,0.000686487,0.00007580854,0.0006722638,0.0011901935,0.091724634,0.07711064,0.77020216,0.010283979,0.040000096],"study_design_scores_gemma":[0.000094187824,0.00022282024,0.0037251457,0.00012822583,0.000058784273,0.00088854606,0.00045924124,0.6313024,0.038367074,0.3211518,0.003505523,0.000096212454],"about_ca_topic_score_codex":0.0016660288,"about_ca_topic_score_gemma":0.0010070787,"teacher_disagreement_score":0.009764248,"about_ca_system_score_codex":0.0012928686,"about_ca_system_score_gemma":0.0013684285,"threshold_uncertainty_score":0.032664657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88395965,0.000041724557,0.10675766,0.0017729216,0.00011923084,0.00012382472,0.00049129775,0.0017277624,0.005006045],"genre_scores_gemma":[0.9630299,0.00002079899,0.034821313,0.00022892588,0.00006203915,0.00003546311,0.00073051796,0.00017608773,0.0008949708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966023,0.00083743583,0.00037129995,0.00093779335,0.0006919452,0.0005593017],"domain_scores_gemma":[0.9693581,0.024116976,0.0014062821,0.0014292208,0.002495005,0.0011943534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033563073,0.00036539577,0.0006397997,0.00067907,0.0010643125,0.002843307,0.0014308828,0.0017597694,0.004020156],"category_scores_gemma":[0.014608584,0.0006252725,0.0013118533,0.00044721656,0.002185201,0.0044186697,0.0013288106,0.0019557572,0.00070205564],"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.010671016,0.0015759972,0.12643276,0.0015684793,0.0009155436,0.010586595,0.004903436,0.077625096,0.2751485,0.2844461,0.017286247,0.18884024],"study_design_scores_gemma":[0.00057689607,0.0010464276,0.007992992,0.00009977861,0.00040196753,0.0023834805,0.0021250863,0.38805708,0.1369882,0.45542184,0.0047285045,0.00017769779],"about_ca_topic_score_codex":0.00089481217,"about_ca_topic_score_gemma":0.0012908938,"teacher_disagreement_score":0.004020156,"about_ca_system_score_codex":0.00064883847,"about_ca_system_score_gemma":0.0017641995,"threshold_uncertainty_score":0.017750084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2765057,0.0004956051,0.693113,0.0006389711,0.000084687104,0.00008117325,0.0008374175,0.0019198856,0.02632348],"genre_scores_gemma":[0.8670172,0.00025028083,0.12631921,0.00019446401,0.00007413508,0.00012371145,0.0006918045,0.00030187963,0.0050273724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772733,0.0005375063,0.00017774235,0.00082160224,0.0004131148,0.0003227664],"domain_scores_gemma":[0.99488884,0.002202987,0.00038610765,0.0016435535,0.000570875,0.00030762466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013350778,0.0004930043,0.0005459012,0.000807619,0.001105821,0.0014355226,0.00096180197,0.000652393,0.003181502],"category_scores_gemma":[0.0068843546,0.0005396488,0.0009390402,0.00094786106,0.0036653727,0.0031403017,0.0028871023,0.0010688799,0.0005360485],"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.00009605251,0.000023452367,0.0013581419,0.00007912495,0.000025122188,0.0002744338,0.00042045297,0.022292735,0.0063619297,0.946954,0.00091688347,0.021197585],"study_design_scores_gemma":[0.000034508736,0.000047675087,0.00086668576,0.000040792427,0.00005869468,0.00030941959,0.00012771552,0.0894513,0.008816754,0.8889467,0.011248156,0.000051618423],"about_ca_topic_score_codex":0.0025838518,"about_ca_topic_score_gemma":0.0027037258,"teacher_disagreement_score":0.003181502,"about_ca_system_score_codex":0.0010484712,"about_ca_system_score_gemma":0.00111313,"threshold_uncertainty_score":0.010643125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049849387,0.00028302416,0.94243604,0.0001853839,0.00006581986,0.00010045763,0.00006316537,0.00078267115,0.006234116],"genre_scores_gemma":[0.42352122,0.00021601256,0.57304716,0.00006813024,0.000028343928,0.0001483397,0.00009594426,0.0002182405,0.0026565895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997135,0.000110508416,0.000014249045,0.00004849568,0.00008737718,0.00002583569],"domain_scores_gemma":[0.9991172,0.0005379656,0.00006193526,0.000074252814,0.00016580094,0.00004280767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006183694,0.00071783137,0.00084147486,0.0010614045,0.00053137215,0.0007639341,0.00084935693,0.00075520226,0.0018767205],"category_scores_gemma":[0.002693248,0.00039065804,0.00060181244,0.0009790573,0.0004878918,0.0005514099,0.00093413086,0.0006621034,0.00028968154],"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.00006330435,0.000065715845,0.001190245,0.00009234882,0.0000612393,0.000095166404,0.00009710931,0.86421746,0.0056969817,0.007851679,0.00091971067,0.11964901],"study_design_scores_gemma":[0.0000053798904,0.000014631173,0.00007250327,0.0000027618532,0.0000052805863,0.00001692936,0.0000072050652,0.9973339,0.0004920527,0.0016771093,0.00036978975,0.0000024405856],"about_ca_topic_score_codex":0.0045123002,"about_ca_topic_score_gemma":0.0034448726,"teacher_disagreement_score":0.0045123002,"about_ca_system_score_codex":0.0004261276,"about_ca_system_score_gemma":0.0009718904,"threshold_uncertainty_score":0.008972108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03216536,0.001943507,0.81174517,0.0023469666,0.0016629864,0.00010208651,0.0005378927,0.0013944765,0.1481016],"genre_scores_gemma":[0.5654153,0.0018678874,0.3064361,0.0017577108,0.0010401511,0.00044865353,0.00094634295,0.0016194235,0.120468415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933463,0.00020317016,0.00004267207,0.00009950815,0.00022122794,0.000098845034],"domain_scores_gemma":[0.9992323,0.00031904757,0.00004517627,0.00022639184,0.00012359656,0.00005352678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057907775,0.0005863749,0.0005797855,0.0010052903,0.0009631858,0.001546086,0.0010533128,0.00083012023,0.013202082],"category_scores_gemma":[0.003774264,0.000218986,0.0005880463,0.0009781375,0.0011293198,0.0018655253,0.002567719,0.0018752652,0.0031196657],"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.00006338455,0.000017357546,0.00011196527,0.000059610913,0.000006070932,0.000051234612,0.000059095764,0.003226752,0.00087532046,0.93472123,0.007003559,0.053804338],"study_design_scores_gemma":[0.000012624468,0.000021302763,0.00007222642,0.000036785346,0.0000062382096,0.00010521006,0.000017671193,0.02327645,0.0015019153,0.9451825,0.02975767,0.000009327316],"about_ca_topic_score_codex":0.0005329697,"about_ca_topic_score_gemma":0.00076094904,"teacher_disagreement_score":0.013202082,"about_ca_system_score_codex":0.0006877856,"about_ca_system_score_gemma":0.0005526999,"threshold_uncertainty_score":0.044165313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19043097,0.0024436791,0.72569364,0.0034567702,0.0005999821,0.00011373368,0.001599574,0.0020158433,0.07364574],"genre_scores_gemma":[0.9061062,0.00093143963,0.07305036,0.000991519,0.0005170639,0.00019533887,0.0012817363,0.00067443633,0.01625187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978764,0.0006929389,0.00026161055,0.0004008751,0.00048638307,0.00028185273],"domain_scores_gemma":[0.9956916,0.0023066038,0.00032689242,0.00077071605,0.00068971666,0.00021443343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018496106,0.000501612,0.0009719539,0.0026714695,0.002643983,0.004823583,0.0011037319,0.0015004514,0.0074565094],"category_scores_gemma":[0.0050623347,0.0010668768,0.0013330544,0.003177571,0.003788757,0.011346764,0.0032119406,0.0022319527,0.0016113396],"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.000027181046,0.000006228485,0.00016011564,0.000035558984,0.000007352932,0.000049715738,0.0002991688,0.0003230282,0.00062293105,0.991384,0.0008288027,0.0062558455],"study_design_scores_gemma":[0.000009966491,0.000013852578,0.00016411992,0.000019767069,0.0000159928,0.00011574003,0.00008457907,0.0025031457,0.0008866864,0.9888732,0.007289653,0.000023187622],"about_ca_topic_score_codex":0.0011038571,"about_ca_topic_score_gemma":0.00088293053,"teacher_disagreement_score":0.0074565094,"about_ca_system_score_codex":0.0014331029,"about_ca_system_score_gemma":0.0012497874,"threshold_uncertainty_score":0.024944544},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063845864,0.0014797964,0.72724235,0.00026439774,0.00025804067,0.00040449342,0.012673464,0.24582823,0.005464748],"genre_scores_gemma":[0.030732151,0.0015477639,0.89788115,0.0004358619,0.00009561604,0.0018601733,0.03266957,0.02731442,0.007463321],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882334,0.00023139833,0.00015136779,0.00022512971,0.0004881359,0.00008055461],"domain_scores_gemma":[0.9985008,0.0009357218,0.0001681226,0.00011270147,0.00020237282,0.000080387406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020492636,0.0026390874,0.0019771757,0.0019832577,0.0011670932,0.0019045622,0.0030825238,0.0014785181,0.014529099],"category_scores_gemma":[0.003611479,0.0020704956,0.002361583,0.0010608349,0.0005014201,0.0015304376,0.0012059065,0.0028755725,0.010572683],"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.0012916565,0.0004454023,0.0053832703,0.0049885116,0.0009925305,0.001324184,0.00069361005,0.059657454,0.118794344,0.026464846,0.30774716,0.47221705],"study_design_scores_gemma":[0.0008670367,0.0004616106,0.0033632934,0.00039331664,0.00042249323,0.0016741203,0.00015580983,0.4656619,0.13354734,0.05398844,0.3389932,0.0004714208],"about_ca_topic_score_codex":0.0018826661,"about_ca_topic_score_gemma":0.0035019408,"teacher_disagreement_score":0.014529099,"about_ca_system_score_codex":0.0008264569,"about_ca_system_score_gemma":0.0015918935,"threshold_uncertainty_score":0.048604727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53290844,0.0014079538,0.45199022,0.00076719705,0.0000781966,0.00010034842,0.00037365046,0.0005227378,0.011851187],"genre_scores_gemma":[0.81354344,0.0011332461,0.18085453,0.00021169714,0.00007869146,0.00012486047,0.0005273299,0.00014966748,0.0033766336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906415,0.00016872064,0.000070166214,0.00021779108,0.0003447545,0.00013437183],"domain_scores_gemma":[0.9866349,0.0087414915,0.0015575532,0.0013408018,0.0013377505,0.00038739576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011781944,0.00049931486,0.00070405327,0.0017527805,0.00077822246,0.0012056207,0.000982226,0.0007639581,0.001835811],"category_scores_gemma":[0.0189392,0.0003614074,0.00046749713,0.0015967558,0.001600648,0.0018582197,0.0010431862,0.0011274413,0.00036588951],"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.0009703198,0.00022381912,0.020453956,0.0005241526,0.000081907,0.00079987163,0.0010370346,0.2892689,0.041217178,0.42309865,0.0027836033,0.2195405],"study_design_scores_gemma":[0.00008180477,0.0004699147,0.0030604263,0.0001612806,0.000057181467,0.0022033881,0.0003419811,0.52268803,0.03441501,0.42802957,0.008339687,0.00015180647],"about_ca_topic_score_codex":0.0010126686,"about_ca_topic_score_gemma":0.00091350364,"teacher_disagreement_score":0.001835811,"about_ca_system_score_codex":0.0007622383,"about_ca_system_score_gemma":0.0014664074,"threshold_uncertainty_score":0.0062309504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14129166,0.0007151508,0.81831026,0.0009921421,0.00009451597,0.00006858187,0.00014626542,0.0006884221,0.03769307],"genre_scores_gemma":[0.86786604,0.00036042987,0.12135105,0.00021007094,0.00007183589,0.00015202409,0.0002569242,0.0003876381,0.009344008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919516,0.00028882653,0.00004047174,0.00014156936,0.00021847602,0.00011546006],"domain_scores_gemma":[0.9969085,0.0022522984,0.00011442523,0.0004306461,0.00017803993,0.00011610308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112282,0.0003152974,0.0009811929,0.0005563765,0.00087279495,0.0015897788,0.001625839,0.0011218206,0.0037447123],"category_scores_gemma":[0.0058344016,0.0005605593,0.0007543356,0.0006173942,0.002156288,0.0022141796,0.0021002917,0.0020010998,0.0005819977],"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.0001178223,0.000032461296,0.00018948279,0.00007989777,0.00001294418,0.000051456853,0.00016157735,0.023720877,0.0042062537,0.95005924,0.0011094728,0.020258466],"study_design_scores_gemma":[0.000014682235,0.000018961884,0.000070399554,0.0000121913545,0.0000078549965,0.00004386701,0.000020535364,0.0592907,0.0024730912,0.9364752,0.0015631111,0.000009349513],"about_ca_topic_score_codex":0.00074239925,"about_ca_topic_score_gemma":0.00078309095,"teacher_disagreement_score":0.0037447123,"about_ca_system_score_codex":0.000798467,"about_ca_system_score_gemma":0.00055864337,"threshold_uncertainty_score":0.012527347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26497567,0.0050235875,0.63067234,0.0065642074,0.00066447584,0.00014360296,0.0001809397,0.00044975049,0.091325454],"genre_scores_gemma":[0.8965641,0.0026801259,0.0889413,0.00044337552,0.00028774634,0.0002427642,0.00012232998,0.000080982274,0.010637242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999079,0.00036415536,0.000045842127,0.00017258088,0.00017843231,0.00015997833],"domain_scores_gemma":[0.99893934,0.0005999972,0.00008920543,0.00020331555,0.00008730969,0.00008090704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009612884,0.00050708716,0.0008074878,0.0005290686,0.002117482,0.0026160853,0.0011725131,0.0016199079,0.0032985134],"category_scores_gemma":[0.0031472477,0.00032054173,0.0009597282,0.0007876224,0.0038345938,0.008022271,0.002725874,0.0014352568,0.00057990046],"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.000022467688,0.000008639395,0.00006280467,0.000045339257,0.0000066990174,0.000050160717,0.000074703334,0.018337062,0.0007761228,0.97755057,0.0003469138,0.0027185907],"study_design_scores_gemma":[0.000016818809,0.0000137883835,0.000041534156,0.000012929242,0.0000065313957,0.00005629264,0.000042899534,0.060030248,0.00071483955,0.93502337,0.0040295543,0.0000110700985],"about_ca_topic_score_codex":0.0010701494,"about_ca_topic_score_gemma":0.00076534227,"teacher_disagreement_score":0.0032985134,"about_ca_system_score_codex":0.0012508925,"about_ca_system_score_gemma":0.000815495,"threshold_uncertainty_score":0.0110346675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24073455,0.008123569,0.62290037,0.005750355,0.0006742764,0.00016499052,0.0021215924,0.0007910683,0.11873913],"genre_scores_gemma":[0.96139383,0.0048302,0.018526647,0.00061407464,0.00082401256,0.00039333847,0.0005589718,0.00024412043,0.012614856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973464,0.0007701857,0.00008838374,0.00034462352,0.0005910087,0.0008594543],"domain_scores_gemma":[0.97701687,0.018797088,0.00085504237,0.0011386493,0.0015896681,0.00060267036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028826937,0.0015594169,0.0020442593,0.002802499,0.0017152269,0.0037555473,0.0024785295,0.0017329875,0.00945736],"category_scores_gemma":[0.02094321,0.0007447986,0.00082191353,0.0032102147,0.004798923,0.0048602647,0.0033250074,0.0032405653,0.0013261555],"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.00025361485,0.00006645907,0.00028629266,0.00025033957,0.000036356396,0.00023903635,0.00020495604,0.1522767,0.0044470592,0.82295966,0.005859894,0.013119626],"study_design_scores_gemma":[0.00003606086,0.000045646884,0.00019431468,0.00010511872,0.00002732415,0.00022489535,0.00006757789,0.43070167,0.0017546617,0.56419903,0.002584414,0.00005933241],"about_ca_topic_score_codex":0.0022523112,"about_ca_topic_score_gemma":0.0009956326,"teacher_disagreement_score":0.00945736,"about_ca_system_score_codex":0.0036963285,"about_ca_system_score_gemma":0.0020769364,"threshold_uncertainty_score":0.031637967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4802723,0.002778989,0.41223344,0.007910666,0.0003522767,0.00016770726,0.0010172623,0.0010706995,0.09419669],"genre_scores_gemma":[0.956813,0.0012535258,0.029040825,0.0009192619,0.00044481776,0.00033008985,0.0007129533,0.00053064787,0.009954922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977849,0.00074469345,0.00017937922,0.0003605573,0.00058466155,0.0003458463],"domain_scores_gemma":[0.9561208,0.036822543,0.0016834665,0.002654106,0.0015108576,0.0012082561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004060988,0.00096761854,0.0012782539,0.002792752,0.0028365043,0.005012572,0.0025661197,0.0020294548,0.008774363],"category_scores_gemma":[0.027483128,0.00092303986,0.0014081569,0.0031081913,0.005988147,0.016216064,0.0034350108,0.0048708296,0.0009180725],"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.00007309649,0.000031499,0.00033923524,0.00005730606,0.000009561481,0.00005763244,0.00038412336,0.0040137274,0.0007022601,0.98910975,0.00095099927,0.0042708204],"study_design_scores_gemma":[0.0000123485415,0.00001221349,0.00006257987,0.000014006801,0.000005829384,0.00004215268,0.000055440574,0.007636902,0.00029766595,0.9911084,0.0007431646,0.000009284438],"about_ca_topic_score_codex":0.0012581839,"about_ca_topic_score_gemma":0.00092987524,"teacher_disagreement_score":0.008774363,"about_ca_system_score_codex":0.0024270886,"about_ca_system_score_gemma":0.0012331229,"threshold_uncertainty_score":0.029353201},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029502038,0.09721778,0.22559328,0.13385199,0.0035658116,0.00013524604,0.0005367511,0.0006092622,0.50898784],"genre_scores_gemma":[0.80574244,0.07597813,0.06613159,0.012281845,0.0073650675,0.00030457258,0.00040087456,0.00026369482,0.031531878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741817,0.0010494698,0.00009873549,0.00032643284,0.00091629836,0.00019100074],"domain_scores_gemma":[0.9944517,0.0034435138,0.00017509768,0.0009917617,0.0005215781,0.000416272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019864135,0.00041713263,0.0006623025,0.0019473938,0.0037609125,0.007846321,0.000977369,0.0017990831,0.006422115],"category_scores_gemma":[0.008265181,0.0003626535,0.00060813216,0.0030277527,0.019348288,0.0148442015,0.0040645725,0.0047430294,0.0010989672],"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.000012453825,0.000009278413,0.00035064804,0.0001162686,0.000010380602,0.000060495928,0.0005422994,0.0005835037,0.0001862546,0.9728301,0.0056124236,0.019685877],"study_design_scores_gemma":[0.0000018885165,0.000003275048,0.00021160612,0.000058860733,0.0000024317346,0.000065265944,0.0002902243,0.00083160296,0.0000763374,0.9543897,0.04406078,0.000008026421],"about_ca_topic_score_codex":0.0025915364,"about_ca_topic_score_gemma":0.002762467,"teacher_disagreement_score":0.007846321,"about_ca_system_score_codex":0.0017417588,"about_ca_system_score_gemma":0.0019216886,"threshold_uncertainty_score":0.021484077},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20086436,0.0017685607,0.3137888,0.0056013498,0.0015177039,0.00035292064,0.0009164163,0.002706139,0.47248375],"genre_scores_gemma":[0.81290877,0.0011591081,0.044219464,0.0022378762,0.0007990439,0.0004568873,0.00071452913,0.0013653697,0.13613884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971938,0.00075933896,0.00012535493,0.0005359161,0.0008152315,0.00057019846],"domain_scores_gemma":[0.9959441,0.0016153113,0.00029987263,0.0010782507,0.00052926096,0.00053316285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015303297,0.001565923,0.0017752099,0.0032914865,0.0038431752,0.005722474,0.0010545071,0.0030893188,0.025074968],"category_scores_gemma":[0.007706684,0.001027707,0.001501055,0.0024331142,0.004131462,0.010372659,0.0047405562,0.004057437,0.0071564736],"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.00005044211,0.000022999635,0.00014063304,0.00002815841,0.000014081629,0.00005926762,0.00010782206,0.00039416357,0.0009638455,0.98639166,0.002882279,0.00894463],"study_design_scores_gemma":[0.000011448359,0.000012067686,0.00008900067,0.000009034263,0.000009628761,0.0000921653,0.0000408896,0.0016491833,0.0006626182,0.99176437,0.005646415,0.0000131112465],"about_ca_topic_score_codex":0.00043737632,"about_ca_topic_score_gemma":0.0009629109,"teacher_disagreement_score":0.025074968,"about_ca_system_score_codex":0.0010985532,"about_ca_system_score_gemma":0.000865993,"threshold_uncertainty_score":0.08388412},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43753833,0.0015307426,0.5019536,0.00287468,0.00030040677,0.00014673448,0.0006877409,0.0009838186,0.05398402],"genre_scores_gemma":[0.88810843,0.0011764114,0.090561084,0.0004909338,0.0002750823,0.000093765004,0.0020251675,0.00027340767,0.016995784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919754,0.000203734,0.000055814762,0.00020083957,0.00018603627,0.00015601653],"domain_scores_gemma":[0.994574,0.0036640917,0.00047787005,0.00063690275,0.00039418176,0.00025287463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006080258,0.0004964898,0.0006895363,0.0010913538,0.0009594991,0.0027085312,0.0010304261,0.001342443,0.0043018423],"category_scores_gemma":[0.006271655,0.0004071607,0.00060159934,0.0015302765,0.0015328754,0.0043380586,0.0013857723,0.0014413958,0.00091190357],"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.00051747164,0.00023614385,0.0024877016,0.00024573677,0.00004057854,0.00036378897,0.00093013165,0.04994553,0.016153352,0.79128784,0.009112306,0.1286794],"study_design_scores_gemma":[0.000018942046,0.000041256215,0.0007309771,0.000027621507,0.000012212935,0.0002071386,0.00018093192,0.10447022,0.0047141383,0.8848854,0.004687683,0.000023482928],"about_ca_topic_score_codex":0.0012915714,"about_ca_topic_score_gemma":0.001352275,"teacher_disagreement_score":0.0043018423,"about_ca_system_score_codex":0.0007036143,"about_ca_system_score_gemma":0.00042979067,"threshold_uncertainty_score":0.014391124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049738877,0.00082777615,0.9431323,0.00031295675,0.00007321803,0.0001112246,0.000017328062,0.00031988192,0.005466403],"genre_scores_gemma":[0.415291,0.0011005515,0.57997924,0.00015054249,0.00004244999,0.00008984331,0.00003390905,0.000055909135,0.0032567084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996057,0.00011445821,0.00001667904,0.000038966777,0.00020410317,0.000020052794],"domain_scores_gemma":[0.99929345,0.0004095883,0.000087019296,0.00010734663,0.00008284251,0.000019789035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054058165,0.00034108816,0.00033297422,0.00051773834,0.00027258412,0.00039073385,0.00041613256,0.00045093868,0.0008649832],"category_scores_gemma":[0.0017520054,0.00016636049,0.0004573957,0.00040308828,0.0009598022,0.0006475683,0.0004364702,0.0006936739,0.00022774606],"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.00038848605,0.0002602249,0.0022996687,0.000765447,0.00024612423,0.0005267783,0.0003119594,0.22735712,0.2131621,0.15909676,0.0016208731,0.39396447],"study_design_scores_gemma":[0.00005104693,0.00038437825,0.0006211297,0.000034290904,0.000050279297,0.0007517441,0.000026483303,0.89692926,0.06316533,0.025246061,0.012715648,0.000024350027],"about_ca_topic_score_codex":0.0002022555,"about_ca_topic_score_gemma":0.00027268342,"teacher_disagreement_score":0.0008649832,"about_ca_system_score_codex":0.00019664822,"about_ca_system_score_gemma":0.00029860483,"threshold_uncertainty_score":0.0028936267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5855187,0.00011208775,0.40941623,0.00022578587,0.000023907754,0.00008328685,0.00012636736,0.00033616886,0.0041574147],"genre_scores_gemma":[0.56626564,0.00014014257,0.4314934,0.000036393627,0.0000049750997,0.00009765417,0.0002614413,0.0000506455,0.0016496468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998796,0.000038751954,0.000011577844,0.000028403281,0.00002082218,0.000020823849],"domain_scores_gemma":[0.99976844,0.00012430456,0.000036713045,0.000020015434,0.00003014911,0.000020413941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023100815,0.00042087803,0.00033858267,0.00022388207,0.00029522183,0.0005431041,0.0005298246,0.00043542153,0.0010530449],"category_scores_gemma":[0.00065945875,0.0001844436,0.00033127484,0.0003624052,0.00028403415,0.00031559,0.0002474286,0.00049657596,0.000189693],"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.00043342295,0.0004099787,0.0046670735,0.00029492058,0.00008830935,0.0005011097,0.00019542946,0.72698134,0.16701521,0.02206521,0.0010641617,0.07628382],"study_design_scores_gemma":[0.00004909498,0.00026043245,0.0006218608,0.000006894954,0.000026585674,0.000088368186,0.00010605011,0.9124011,0.07750219,0.005817155,0.003104276,0.00001594434],"about_ca_topic_score_codex":0.002763167,"about_ca_topic_score_gemma":0.002592212,"teacher_disagreement_score":0.002763167,"about_ca_system_score_codex":0.00037835463,"about_ca_system_score_gemma":0.00066306855,"threshold_uncertainty_score":0.0054941177},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046486873,0.0007945388,0.9474739,0.00074305927,0.000083524836,0.00015335313,0.0004878968,0.0009827905,0.002794067],"genre_scores_gemma":[0.31988707,0.00048246948,0.6730838,0.0002568713,0.00020164174,0.00039472154,0.0017907324,0.00061658723,0.0032861216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965082,0.0013761931,0.00018691903,0.0008086975,0.00066800055,0.00045212908],"domain_scores_gemma":[0.96573234,0.026526079,0.0011992101,0.0035739539,0.0017537195,0.0012146842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006710859,0.0015531435,0.002634533,0.0024119983,0.0021510136,0.0035320176,0.006988322,0.0034366846,0.006449056],"category_scores_gemma":[0.036612652,0.0016359035,0.0026753931,0.0038498605,0.0024763413,0.008801959,0.004760976,0.0067722495,0.0014111908],"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.0009320033,0.0006442489,0.00411918,0.0006409925,0.00020384713,0.00015119521,0.000886753,0.49844062,0.0034645814,0.26988056,0.016189475,0.20444652],"study_design_scores_gemma":[0.000058669226,0.000038306993,0.00025342655,0.000037421752,0.00003178564,0.000053991385,0.00007412639,0.7462155,0.0006093724,0.2517069,0.00090288447,0.00001761837],"about_ca_topic_score_codex":0.003259525,"about_ca_topic_score_gemma":0.0071231383,"teacher_disagreement_score":0.006988322,"about_ca_system_score_codex":0.003415156,"about_ca_system_score_gemma":0.002614925,"threshold_uncertainty_score":0.03549081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7429628,0.0003887455,0.23071054,0.0039430615,0.00019900617,0.0004912943,0.0030739547,0.0048540947,0.013376555],"genre_scores_gemma":[0.91988975,0.00014937947,0.07115759,0.00056946214,0.00019081906,0.00014319833,0.0037584896,0.00061572425,0.0035255572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962728,0.00067198364,0.00028651155,0.0012277582,0.00080946356,0.0007314578],"domain_scores_gemma":[0.96766216,0.02564676,0.001507236,0.0023165534,0.0012530033,0.0016143542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024761374,0.00093751686,0.0019275814,0.0007910312,0.0015704556,0.00486011,0.002296679,0.0016711312,0.009640984],"category_scores_gemma":[0.016258063,0.0013973954,0.0027091017,0.0009561449,0.0033474362,0.009457078,0.003784386,0.005013295,0.0012564965],"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.00843161,0.0019013732,0.024228651,0.0020737525,0.0005812201,0.0013615845,0.0036082512,0.15399358,0.07109416,0.5507744,0.032781146,0.14917025],"study_design_scores_gemma":[0.00062529894,0.00039940662,0.0017669449,0.000059620284,0.00013623969,0.0002746164,0.0009095188,0.15625943,0.019515544,0.8161401,0.0038088814,0.000104328356],"about_ca_topic_score_codex":0.002423573,"about_ca_topic_score_gemma":0.004453948,"teacher_disagreement_score":0.009640984,"about_ca_system_score_codex":0.0018075387,"about_ca_system_score_gemma":0.0024852362,"threshold_uncertainty_score":0.03225231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45866573,0.0011414608,0.39877796,0.0063581024,0.00028299613,0.00010700491,0.0005812089,0.0010209434,0.13306461],"genre_scores_gemma":[0.97769713,0.00026470545,0.013534373,0.0004765326,0.00023923934,0.000117094925,0.00025245777,0.00021056614,0.0072078276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983942,0.0005888966,0.000080581754,0.00023799429,0.00039623803,0.0003021506],"domain_scores_gemma":[0.9873733,0.009754777,0.0006002103,0.00084086217,0.0009221555,0.00050872524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021250977,0.00045639664,0.00086331903,0.0021291098,0.0027966641,0.0042444905,0.0018309446,0.0018239503,0.010284524],"category_scores_gemma":[0.013381513,0.000635454,0.0012426251,0.001401593,0.004449142,0.007604819,0.002319975,0.0033991265,0.0009937533],"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.000014566034,0.000012323929,0.00010594212,0.000015132794,0.0000027617746,0.00004258311,0.00027352932,0.0013202161,0.00035561458,0.99601763,0.0004260247,0.0014135878],"study_design_scores_gemma":[0.000008989926,0.000006651591,0.000045245524,0.000005446024,0.0000029662312,0.000035505356,0.000055431326,0.010221102,0.0002436498,0.98890954,0.00045819487,0.000007386833],"about_ca_topic_score_codex":0.0012790296,"about_ca_topic_score_gemma":0.00076653744,"teacher_disagreement_score":0.010284524,"about_ca_system_score_codex":0.0016669488,"about_ca_system_score_gemma":0.0011124685,"threshold_uncertainty_score":0.034405112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16538903,0.023482215,0.57480824,0.024795815,0.0021327862,0.000090861286,0.0003046964,0.00071223604,0.20828405],"genre_scores_gemma":[0.93863416,0.005283317,0.04424171,0.0021398158,0.0018605781,0.00008678785,0.00011232145,0.00017706644,0.007464212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983491,0.0004731884,0.00009654428,0.0004145696,0.0004116401,0.0002549529],"domain_scores_gemma":[0.98817635,0.008776549,0.0002943887,0.0018122923,0.0006274399,0.0003130072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003033458,0.0004715048,0.0010920662,0.0012882333,0.0019831047,0.0027651424,0.0016301406,0.0015593895,0.0036349038],"category_scores_gemma":[0.012449859,0.00055639347,0.00095417426,0.0009951873,0.014259033,0.011714074,0.0031495509,0.004107832,0.0004339501],"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.000012859802,0.000007084013,0.00008331129,0.00003063227,0.000004505304,0.000025943324,0.00007391023,0.0015950755,0.00020545252,0.99393773,0.00047700107,0.0035465192],"study_design_scores_gemma":[0.0000031511884,0.0000041182934,0.000040243074,0.000008605661,0.0000017437103,0.000016386415,0.000008112963,0.0024211735,0.000120205965,0.9959859,0.0013860324,0.0000042053784],"about_ca_topic_score_codex":0.0011183715,"about_ca_topic_score_gemma":0.0007054224,"teacher_disagreement_score":0.0036349038,"about_ca_system_score_codex":0.0016201856,"about_ca_system_score_gemma":0.0007882276,"threshold_uncertainty_score":0.01604265},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009622843,0.0011831989,0.0050520455,0.0022109493,0.002738574,0.00005788796,0.019431528,0.013438679,0.9549248],"genre_scores_gemma":[0.012383986,0.0011853552,0.0031489243,0.0007189193,0.0007734221,0.00009040909,0.020951778,0.014459849,0.9462874],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995228,0.000068092195,0.000035521534,0.00011914786,0.00017457921,0.00007992894],"domain_scores_gemma":[0.9994221,0.00007311327,0.000037168156,0.00013938783,0.000176215,0.00015201305],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052314077,0.0010819662,0.00091673376,0.0018706314,0.001619026,0.006433934,0.0012225466,0.001237173,0.7751515],"category_scores_gemma":[0.0018134381,0.0006428558,0.00084666896,0.002244168,0.0009507798,0.0053906543,0.0042396844,0.0016365865,0.75098664],"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.000078014615,0.000015056472,0.0001482865,0.00013252067,0.000005242678,0.000057282345,0.00014968702,0.000060993374,0.00024786798,0.024870612,0.9148188,0.05941559],"study_design_scores_gemma":[0.0000051204743,0.0000029107214,0.00008227177,0.000024501676,0.0000011292923,0.00004813946,0.00003190207,0.000035317826,0.00007479616,0.0016994637,0.9979906,0.0000037836603],"about_ca_topic_score_codex":0.0028532872,"about_ca_topic_score_gemma":0.0031820312,"teacher_disagreement_score":0.22484851,"about_ca_system_score_codex":0.0011830351,"about_ca_system_score_gemma":0.0007603622,"threshold_uncertainty_score":0.32071906},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021608356,0.000821915,0.93548894,0.0027866373,0.00073949463,0.0005748317,0.002857815,0.013786261,0.02133582],"genre_scores_gemma":[0.08619431,0.0022976918,0.88466954,0.0019497635,0.00021273787,0.0003556314,0.008345917,0.0044228053,0.011551587],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940685,0.002277417,0.0008570234,0.00063555327,0.0019454182,0.00021611716],"domain_scores_gemma":[0.9848786,0.0060326084,0.0005797811,0.0059583816,0.002322681,0.00022799568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007771497,0.000701971,0.0005228556,0.0023182218,0.0009708632,0.0063790446,0.002048159,0.0018337152,0.0039359513],"category_scores_gemma":[0.025639573,0.0009589265,0.0012157955,0.004706697,0.0012371883,0.007071348,0.0036544066,0.0031233248,0.0028150626],"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.00029757,0.0003378067,0.0038613211,0.0006838894,0.0001886723,0.0018943504,0.007596706,0.01741024,0.022777105,0.3648923,0.055260204,0.52479976],"study_design_scores_gemma":[0.00008434837,0.00008075472,0.00084999553,0.00031490577,0.00009564633,0.0010600061,0.0016622664,0.04440784,0.03337934,0.19843906,0.71951103,0.00011481512],"about_ca_topic_score_codex":0.0017817722,"about_ca_topic_score_gemma":0.0012159918,"teacher_disagreement_score":0.007771497,"about_ca_system_score_codex":0.0010491566,"about_ca_system_score_gemma":0.0014189024,"threshold_uncertainty_score":0.041100085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008933173,0.00016896,0.9896359,0.00011457269,0.000031777054,0.00003136096,0.000038622384,0.00014047287,0.0009052268],"genre_scores_gemma":[0.21404801,0.00042113347,0.77784294,0.00014611353,0.00012100223,0.00023861445,0.0003382567,0.000111445064,0.006732496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915755,0.00019944813,0.00004689615,0.00023342832,0.00029750064,0.00006512289],"domain_scores_gemma":[0.99900395,0.0004562896,0.00009211507,0.000100785925,0.00028853974,0.00005844044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082191627,0.00054962165,0.0011719983,0.00167125,0.0012463762,0.00068927946,0.00209135,0.0011930645,0.0021036582],"category_scores_gemma":[0.0018743728,0.00039879107,0.0011971502,0.0015018665,0.0008353852,0.0016172981,0.0012999034,0.0010067377,0.00040711724],"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.00022907804,0.0001830089,0.0018009183,0.00040009854,0.00027864147,0.00021563338,0.0005435453,0.5744568,0.013296121,0.17276306,0.0041688937,0.2316642],"study_design_scores_gemma":[0.000016336455,0.00004921566,0.0002334422,0.000010111257,0.00002880902,0.00007095989,0.00003748167,0.95684254,0.00266462,0.0378935,0.0021341532,0.00001877179],"about_ca_topic_score_codex":0.0051794746,"about_ca_topic_score_gemma":0.0048559816,"teacher_disagreement_score":0.0051794746,"about_ca_system_score_codex":0.00088241755,"about_ca_system_score_gemma":0.0012715419,"threshold_uncertainty_score":0.01029861},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13657421,0.0027484964,0.7897645,0.0019884584,0.0003748416,0.00010783501,0.0013823984,0.0015288286,0.06553044],"genre_scores_gemma":[0.75599253,0.0018069892,0.20726672,0.00044606975,0.00024454147,0.00023131358,0.0018138418,0.00058382977,0.031614188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979651,0.0006034965,0.00015709776,0.00047125982,0.00050663296,0.00029635293],"domain_scores_gemma":[0.9962291,0.002018114,0.0002674843,0.00051105197,0.0006466861,0.0003275424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016100132,0.00070206105,0.000926008,0.0036167195,0.0027939966,0.0061556604,0.0012272917,0.002111823,0.0113571575],"category_scores_gemma":[0.0053257807,0.0009876315,0.0016920988,0.004476658,0.0038352185,0.009324581,0.0036391113,0.0027318501,0.0025579967],"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.00001555457,0.0000072457397,0.00018767896,0.000029095008,0.0000077822815,0.000071509065,0.00025674922,0.00071916747,0.0003903397,0.9936227,0.0006387998,0.004053328],"study_design_scores_gemma":[0.000011289173,0.0000074652544,0.0001506497,0.000014530188,0.000011068351,0.00010243871,0.00008768325,0.0038156654,0.00035338776,0.9887061,0.006726654,0.000013058158],"about_ca_topic_score_codex":0.0023713692,"about_ca_topic_score_gemma":0.0022328321,"teacher_disagreement_score":0.0113571575,"about_ca_system_score_codex":0.0020810014,"about_ca_system_score_gemma":0.0008083558,"threshold_uncertainty_score":0.03799349},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019350494,0.7828929,0.20077614,0.0020557363,0.0011201055,0.000031789285,0.00006413998,0.00024800704,0.010876088],"genre_scores_gemma":[0.034474425,0.90240306,0.054471735,0.0007412462,0.00168986,0.00012886028,0.00015072132,0.00008070432,0.0058593997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995024,0.00015232844,0.000029542101,0.00008860218,0.00020278302,0.000024286745],"domain_scores_gemma":[0.99900526,0.0007323295,0.000047089674,0.00005567708,0.00012074089,0.000038902166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011187434,0.0014007537,0.0020682358,0.0010990965,0.0004716464,0.0014646058,0.002975969,0.0027353377,0.001818247],"category_scores_gemma":[0.0020463704,0.00076443405,0.0005878559,0.003738758,0.0034266997,0.002616068,0.0013734709,0.0029209114,0.0013643106],"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.00007065127,0.00009187338,0.00031772113,0.0032778154,0.00010887554,0.00023610287,0.00012168448,0.087596335,0.00294571,0.44260737,0.01778873,0.44483715],"study_design_scores_gemma":[0.000053862073,0.00007229654,0.00022800885,0.00067729806,0.000053256346,0.00066173024,0.000045987625,0.078693174,0.003180602,0.5622702,0.35400218,0.00006146762],"about_ca_topic_score_codex":0.0021943862,"about_ca_topic_score_gemma":0.0015176168,"teacher_disagreement_score":0.002975969,"about_ca_system_score_codex":0.001468819,"about_ca_system_score_gemma":0.0015226672,"threshold_uncertainty_score":0.010657132},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05971244,0.00030646485,0.9343007,0.0008751908,0.000059479917,0.0001464615,0.000625806,0.0009534106,0.0030199802],"genre_scores_gemma":[0.6175826,0.00052770774,0.3728785,0.00069666136,0.00030627925,0.0003403179,0.0028489863,0.00074387225,0.0040751235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99017185,0.0024195057,0.0011600698,0.0026353195,0.0030308731,0.0005824287],"domain_scores_gemma":[0.9703648,0.01950899,0.0020147352,0.004338792,0.0031163467,0.00065636996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005365652,0.0005948452,0.0011058736,0.0013556927,0.0009901843,0.0028356977,0.0014032217,0.0015930792,0.0027100618],"category_scores_gemma":[0.027442748,0.0004893039,0.0019611258,0.0012290464,0.003669757,0.0099927075,0.002930611,0.0029094853,0.00069577165],"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.00034500545,0.00013832882,0.005251226,0.00082587264,0.00018654302,0.00072804856,0.004242968,0.02430906,0.02073153,0.83927095,0.0034223443,0.100548066],"study_design_scores_gemma":[0.00003970104,0.00012974143,0.0011262282,0.0000886442,0.00014282695,0.00063530996,0.0009988316,0.09222837,0.021137593,0.8722382,0.011147162,0.000087361914],"about_ca_topic_score_codex":0.0008059953,"about_ca_topic_score_gemma":0.0007338826,"teacher_disagreement_score":0.005365652,"about_ca_system_score_codex":0.0011167172,"about_ca_system_score_gemma":0.0009901711,"threshold_uncertainty_score":0.028376639},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033560183,0.0039992863,0.93207633,0.0034411538,0.00049525825,0.00008721925,0.0001620961,0.0004710453,0.025707362],"genre_scores_gemma":[0.58204275,0.0022464667,0.39412034,0.00083041866,0.0005635331,0.00022678234,0.00023010795,0.00014677526,0.019592822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990221,0.00037273217,0.00004284669,0.0001364859,0.0003506559,0.000075198775],"domain_scores_gemma":[0.9976864,0.0016046667,0.00010551775,0.0003038414,0.00023821372,0.000061404964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000919795,0.00045259343,0.00064070034,0.0009642439,0.0006304326,0.001469715,0.0015039358,0.0013824677,0.005975208],"category_scores_gemma":[0.0066295587,0.00026439686,0.0005145577,0.001157467,0.0025972407,0.0034228163,0.0010644576,0.0014635175,0.000580887],"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.00010162479,0.00003200466,0.00021531312,0.000091321774,0.000017649236,0.000035307916,0.00006528913,0.031932786,0.002491985,0.8803328,0.0030134174,0.08167046],"study_design_scores_gemma":[0.00002092722,0.000022594728,0.00012492789,0.000018270428,0.0000070378874,0.000034431563,0.000017036928,0.09919946,0.0013784056,0.89360833,0.0055564772,0.000012108904],"about_ca_topic_score_codex":0.0015578141,"about_ca_topic_score_gemma":0.0019132976,"teacher_disagreement_score":0.005975208,"about_ca_system_score_codex":0.0016954246,"about_ca_system_score_gemma":0.00085634814,"threshold_uncertainty_score":0.019989073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015961643,0.00033838683,0.9813369,0.0002310812,0.000044898195,0.000031588865,0.00007752513,0.00012873509,0.0018492711],"genre_scores_gemma":[0.5999088,0.0009514329,0.39473757,0.00027055212,0.00019048138,0.00024086832,0.00034170962,0.00008289824,0.0032756296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982539,0.00064091175,0.000082894476,0.00024119238,0.0005905904,0.00019045074],"domain_scores_gemma":[0.99625117,0.00217366,0.00035747347,0.00029956456,0.0008183754,0.000099707024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016210967,0.0006301233,0.0008059642,0.00060865,0.000442013,0.0011773239,0.00073613215,0.0012025641,0.0013813035],"category_scores_gemma":[0.006789575,0.00035474193,0.00036431645,0.00077632547,0.0010242908,0.0013428516,0.0010660143,0.00076416024,0.00042393385],"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.00042086377,0.000051250685,0.00082852616,0.00039958692,0.000061874154,0.00028294814,0.00022560345,0.58745706,0.015724856,0.280768,0.0034505874,0.11032883],"study_design_scores_gemma":[0.000078953395,0.00009124536,0.0001205611,0.00004213186,0.00002599652,0.00016274546,0.00002803823,0.9169244,0.011036747,0.06898134,0.0024699473,0.000037842103],"about_ca_topic_score_codex":0.0009416187,"about_ca_topic_score_gemma":0.0009110299,"teacher_disagreement_score":0.0016210967,"about_ca_system_score_codex":0.0008772438,"about_ca_system_score_gemma":0.0018273722,"threshold_uncertainty_score":0.008573294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33698362,0.00044974746,0.6100947,0.00076467893,0.0002728093,0.00018783529,0.0006696959,0.00045370474,0.050123185],"genre_scores_gemma":[0.8524499,0.0006893714,0.108156025,0.0004396197,0.00021719895,0.00028138232,0.0009503168,0.00034546875,0.03647071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985869,0.00027771422,0.00016507554,0.00034780387,0.00031789148,0.00030472619],"domain_scores_gemma":[0.9980233,0.0006513491,0.0003274602,0.00029706827,0.000528652,0.00017236153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747572,0.00038482822,0.00041977974,0.0011651363,0.0013025637,0.0017648326,0.00060775725,0.0007426196,0.005877774],"category_scores_gemma":[0.0036251352,0.00029738375,0.0012058676,0.0008793008,0.0024278979,0.0060539255,0.0020179679,0.0012713076,0.001056642],"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.000044363132,0.000012192383,0.00028458942,0.00003376643,0.0000060653088,0.00015121856,0.000294405,0.0020913354,0.0030943388,0.98666024,0.000391137,0.006936313],"study_design_scores_gemma":[0.000021093912,0.00009639899,0.00029787765,0.000026673037,0.000012859573,0.0003474092,0.00030632058,0.018869808,0.010826523,0.9565475,0.012600839,0.000046606565],"about_ca_topic_score_codex":0.0013741239,"about_ca_topic_score_gemma":0.0009732604,"teacher_disagreement_score":0.005877774,"about_ca_system_score_codex":0.0009528533,"about_ca_system_score_gemma":0.0010782608,"threshold_uncertainty_score":0.019663095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36390144,0.009046627,0.48518533,0.0037822209,0.00088510773,0.00020757508,0.0012066141,0.00043551635,0.13534948],"genre_scores_gemma":[0.8403552,0.0033739347,0.1278972,0.00073950086,0.000758074,0.00038223682,0.00072730036,0.00011131239,0.025655182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896693,0.0002307077,0.00011066753,0.00024238817,0.00030649125,0.00014279969],"domain_scores_gemma":[0.9985606,0.0006133578,0.00023528234,0.00014017135,0.0003224376,0.0001280288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009723841,0.00055315864,0.00068751856,0.0024981247,0.0019601935,0.0026528363,0.0008441717,0.0012970243,0.0041429573],"category_scores_gemma":[0.0027840133,0.00048669433,0.0010710664,0.001950203,0.004442264,0.005889751,0.0019814218,0.0016053788,0.0011605573],"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.000011046751,0.000005625226,0.000076176504,0.000022762966,0.0000022818815,0.000056694287,0.0001903936,0.00037609242,0.00044868124,0.9959188,0.0002635201,0.002627998],"study_design_scores_gemma":[0.0000072917583,0.000030998854,0.00014874569,0.000024791752,0.0000075188123,0.00017921736,0.00010215978,0.0040084794,0.0006112606,0.9850168,0.009843123,0.000019593925],"about_ca_topic_score_codex":0.0011944091,"about_ca_topic_score_gemma":0.0009403201,"teacher_disagreement_score":0.0041429573,"about_ca_system_score_codex":0.0016845312,"about_ca_system_score_gemma":0.0011548646,"threshold_uncertainty_score":0.01385963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2385213,0.0019057714,0.7220127,0.002503161,0.0001451761,0.0001364196,0.00074532576,0.0010876668,0.032942496],"genre_scores_gemma":[0.9045152,0.0010668464,0.083712466,0.0005805086,0.0002808522,0.000118324904,0.0005184713,0.0007384637,0.008468822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996811,0.0011232627,0.00021248976,0.00053716014,0.00083020964,0.00048591124],"domain_scores_gemma":[0.97059566,0.024889102,0.00082990807,0.0018278807,0.0011037797,0.00075362023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039826296,0.0009227502,0.0017485721,0.0023105799,0.0014819017,0.003037929,0.0028818317,0.0021267587,0.008272047],"category_scores_gemma":[0.025221372,0.001919094,0.0016897202,0.0022836016,0.0046838294,0.019982051,0.007284927,0.004845143,0.0008767244],"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.00016875577,0.000026487767,0.00071191805,0.000111384485,0.000030949384,0.00015945797,0.00104115,0.015145762,0.0023252575,0.9618451,0.00079444895,0.01763929],"study_design_scores_gemma":[0.000022546084,0.000019108082,0.00019229327,0.00002036294,0.00002379035,0.000043390424,0.00007001374,0.02971422,0.00092410564,0.96766704,0.0012828223,0.000020340349],"about_ca_topic_score_codex":0.003177118,"about_ca_topic_score_gemma":0.0028875223,"teacher_disagreement_score":0.008272047,"about_ca_system_score_codex":0.0024313373,"about_ca_system_score_gemma":0.0018678203,"threshold_uncertainty_score":0.027672768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064100295,0.0001940763,0.9333312,0.00023262876,0.000018062792,0.00003529242,0.00012767687,0.00025307832,0.001707659],"genre_scores_gemma":[0.78225124,0.0004755281,0.21144876,0.0000945876,0.00005157033,0.0001340125,0.00044827373,0.00016257523,0.0049334336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993622,0.00026848883,0.00002506507,0.000111669586,0.00014677654,0.00008584104],"domain_scores_gemma":[0.99707603,0.0023926205,0.00019780001,0.00014466693,0.0001452067,0.00004360216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009090945,0.00055466045,0.0008539537,0.0003854638,0.00033974118,0.00078608416,0.0007524162,0.0010541541,0.001668934],"category_scores_gemma":[0.0061999084,0.00039691615,0.00041790956,0.00080693513,0.00084064784,0.0018091808,0.00093056966,0.0008414797,0.00040411996],"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.00025629104,0.000029480763,0.00034416106,0.000100750534,0.000025065305,0.00011985938,0.000091220914,0.9137051,0.004854076,0.04294977,0.0005287796,0.036995385],"study_design_scores_gemma":[0.00001457926,0.00002362071,0.00005893793,0.000006739315,0.000004285853,0.000026773227,0.000014278073,0.97656167,0.003252355,0.01976233,0.00026732826,0.0000070611386],"about_ca_topic_score_codex":0.0026205909,"about_ca_topic_score_gemma":0.0017824806,"teacher_disagreement_score":0.0026205909,"about_ca_system_score_codex":0.0008553124,"about_ca_system_score_gemma":0.0015594978,"threshold_uncertainty_score":0.0062057376},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032439982,0.00068450475,0.97775376,0.00080960384,0.0001550133,0.00013864433,0.00005272945,0.0018958893,0.015265867],"genre_scores_gemma":[0.1616265,0.0019675903,0.82377946,0.00029738058,0.0001240291,0.00088666286,0.0002810068,0.0006328821,0.0104044285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988109,0.0007595628,0.000050846782,0.000069004906,0.00026969792,0.000039999453],"domain_scores_gemma":[0.9986438,0.0009443843,0.000038131275,0.00016922869,0.00013994821,0.00006447506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015740583,0.0008218599,0.00055094,0.00059446524,0.00085994386,0.001967048,0.0014429656,0.0014811236,0.008212773],"category_scores_gemma":[0.004607096,0.00047462032,0.00044083083,0.00074155146,0.0008375176,0.0015789083,0.0016848336,0.0013156446,0.001791691],"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.00015256098,0.00009777991,0.0007849733,0.00034324324,0.000064948326,0.00018946292,0.00051803846,0.41144532,0.004163469,0.43093166,0.014886921,0.13642167],"study_design_scores_gemma":[0.000055717454,0.000042092328,0.00011467858,0.0000980435,0.000022971179,0.00007321302,0.000054253986,0.78312385,0.0018161071,0.12516433,0.08941053,0.000024284902],"about_ca_topic_score_codex":0.0030256493,"about_ca_topic_score_gemma":0.0032635026,"teacher_disagreement_score":0.008212773,"about_ca_system_score_codex":0.001083679,"about_ca_system_score_gemma":0.0010441736,"threshold_uncertainty_score":0.027474463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48056576,0.0004210781,0.50272226,0.0034660366,0.00016072922,0.00009490471,0.00073354447,0.0031257924,0.008709864],"genre_scores_gemma":[0.9679469,0.00012325517,0.028814046,0.00039497175,0.00017228385,0.00008804484,0.00040811778,0.0005166457,0.0015356715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901681,0.002592148,0.00097492797,0.0024993597,0.002511512,0.001254103],"domain_scores_gemma":[0.7549335,0.20262748,0.010551305,0.020744612,0.008163083,0.0029800374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007236925,0.0009258994,0.0015629609,0.0026580482,0.0024908443,0.006048084,0.0036909555,0.003113815,0.0034302461],"category_scores_gemma":[0.08898359,0.001481118,0.0016999383,0.0020231544,0.008553339,0.014044949,0.0045309733,0.0059869387,0.0006042833],"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.0015885872,0.0002664407,0.014653074,0.0004641881,0.00011831074,0.00096694333,0.002663607,0.028711792,0.015382681,0.88320196,0.0040714904,0.047910843],"study_design_scores_gemma":[0.0000775014,0.000076679535,0.0008216516,0.000041520394,0.000056327197,0.00048238123,0.00019985806,0.055220813,0.010484334,0.9313234,0.0011652353,0.00005025746],"about_ca_topic_score_codex":0.0006566663,"about_ca_topic_score_gemma":0.0004699142,"teacher_disagreement_score":0.007236925,"about_ca_system_score_codex":0.0016612523,"about_ca_system_score_gemma":0.0015923489,"threshold_uncertainty_score":0.038272977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081089996,0.0011663163,0.8813997,0.0013439168,0.0002862532,0.00007911362,0.0009963948,0.0030890384,0.03054933],"genre_scores_gemma":[0.68459696,0.0013078089,0.25776616,0.0011371705,0.00023261279,0.00034065027,0.0019029288,0.0027577507,0.049958017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844533,0.00031553686,0.00020693848,0.00026026915,0.00053599646,0.00023591614],"domain_scores_gemma":[0.9958105,0.0019373568,0.00025902147,0.0012807235,0.00046312905,0.00024933452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016802626,0.0005451161,0.000632405,0.0009566306,0.0010647598,0.002686517,0.0014519693,0.0011099746,0.008376155],"category_scores_gemma":[0.005474428,0.0005508282,0.0009531217,0.0015662906,0.0022003686,0.007443583,0.002858897,0.002561162,0.0017887343],"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.00019553424,0.000024404015,0.00023804155,0.00013897174,0.0000125495135,0.00011146807,0.0005258138,0.006780759,0.0051122336,0.93932974,0.0029910863,0.044539474],"study_design_scores_gemma":[0.000028399056,0.0000408041,0.0001078768,0.00004450461,0.000021138992,0.000215751,0.0001393865,0.019499792,0.010848425,0.9453318,0.023674343,0.000047767975],"about_ca_topic_score_codex":0.0006535414,"about_ca_topic_score_gemma":0.00077772833,"teacher_disagreement_score":0.008376155,"about_ca_system_score_codex":0.00081314344,"about_ca_system_score_gemma":0.0011278964,"threshold_uncertainty_score":0.028021038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023921554,0.00012742123,0.99648213,0.0000885534,0.000019937585,0.000030901585,0.00003279668,0.00014853527,0.00067756145],"genre_scores_gemma":[0.11812557,0.0007124204,0.8777672,0.00018258854,0.00015047567,0.00037270194,0.0003065789,0.00022258701,0.002159861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828714,0.00070708815,0.00010268111,0.00032585062,0.00043663263,0.00014057054],"domain_scores_gemma":[0.98960507,0.008242859,0.00052432984,0.00062674045,0.00086166133,0.00013929537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024144172,0.001489833,0.0013250079,0.0014666888,0.0007236669,0.0013192791,0.0021134475,0.0015264112,0.0031267146],"category_scores_gemma":[0.014982061,0.0009297334,0.0011661857,0.0016203801,0.0016156737,0.0039272234,0.002701248,0.003074709,0.0010931138],"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.0002969264,0.00011509759,0.0006871143,0.00034898086,0.00009523743,0.00014595172,0.00030717495,0.5501659,0.009481467,0.22105622,0.002782968,0.21451688],"study_design_scores_gemma":[0.000016252474,0.000043427182,0.00006512463,0.000016747525,0.000007381814,0.000041733812,0.000015583635,0.9547666,0.0019388649,0.04199309,0.0010805387,0.000014685098],"about_ca_topic_score_codex":0.0022882551,"about_ca_topic_score_gemma":0.002053514,"teacher_disagreement_score":0.0031267146,"about_ca_system_score_codex":0.0010822363,"about_ca_system_score_gemma":0.0018091567,"threshold_uncertainty_score":0.012768805},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13957143,0.0021411625,0.2913718,0.003699405,0.0024248187,0.00047996826,0.020270303,0.013324871,0.52671623],"genre_scores_gemma":[0.5602995,0.0023037004,0.11612925,0.001224866,0.00083559955,0.00053285324,0.017953893,0.0032280234,0.2974923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994568,0.000077436314,0.00004022764,0.00011655783,0.00017558919,0.00013333696],"domain_scores_gemma":[0.99881446,0.00026728737,0.00018960438,0.000175434,0.00043107747,0.00012230751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038232232,0.0006215353,0.0003250374,0.0008817494,0.00077334733,0.0011498058,0.00053505483,0.00048774853,0.054224107],"category_scores_gemma":[0.002248936,0.00025482292,0.0004161248,0.0011962929,0.00069248525,0.0011554264,0.0009141545,0.00075375533,0.025290973],"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.0008789361,0.00010413375,0.0014475984,0.0006382452,0.000028758215,0.00058873603,0.0006287656,0.007823942,0.043672964,0.5593507,0.15812916,0.2267081],"study_design_scores_gemma":[0.00016097247,0.00031150144,0.0022195366,0.0002547778,0.000034510445,0.00073384476,0.00030607075,0.014421725,0.07941116,0.14976361,0.75224584,0.00013648013],"about_ca_topic_score_codex":0.004069175,"about_ca_topic_score_gemma":0.003808065,"teacher_disagreement_score":0.054224107,"about_ca_system_score_codex":0.0012888464,"about_ca_system_score_gemma":0.0014142718,"threshold_uncertainty_score":0.18139768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18048388,0.00020413676,0.76838815,0.00064365304,0.0001610476,0.00016963894,0.00042044642,0.003455844,0.0460732],"genre_scores_gemma":[0.87008274,0.00010063991,0.11275147,0.00029103356,0.00005081675,0.00022646142,0.000305245,0.000719072,0.015472531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859935,0.000421411,0.00013456216,0.00032688328,0.00029116665,0.00022664557],"domain_scores_gemma":[0.9969458,0.0010950961,0.00023037357,0.001038228,0.00045548202,0.00023502464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012935847,0.00050406245,0.0005865088,0.000725089,0.000994685,0.0026412772,0.002071357,0.0012921484,0.010508639],"category_scores_gemma":[0.0052262996,0.0006357142,0.0007775775,0.0006942787,0.0023272708,0.0037499731,0.0025296563,0.0017416269,0.0024759963],"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.00017920986,0.00006554946,0.00035252408,0.000067266286,0.000016081534,0.00042455035,0.0003842161,0.012484037,0.010536245,0.961711,0.0011582059,0.0126210805],"study_design_scores_gemma":[0.00008053852,0.00005866202,0.00009701774,0.000016450593,0.000014843472,0.000212605,0.00011304446,0.11517833,0.015262137,0.86248904,0.00640621,0.00007105162],"about_ca_topic_score_codex":0.00088026526,"about_ca_topic_score_gemma":0.0007740536,"teacher_disagreement_score":0.010508639,"about_ca_system_score_codex":0.0009799723,"about_ca_system_score_gemma":0.0012022662,"threshold_uncertainty_score":0.03515488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57689095,0.004755187,0.28122666,0.008050843,0.0003062826,0.00030547136,0.0010570413,0.0008018936,0.12660566],"genre_scores_gemma":[0.9749868,0.00075989804,0.017001223,0.00019019749,0.00006602981,0.000062482744,0.000086592816,0.00004119229,0.0068057505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987564,0.0003851068,0.00005648642,0.00015801119,0.00041579458,0.00022831732],"domain_scores_gemma":[0.99596846,0.0030665228,0.00023646248,0.00029015707,0.00028742527,0.00015091054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016273722,0.00057339086,0.0006543027,0.00066396745,0.0012901175,0.0017489535,0.0011634169,0.0025918582,0.0046846606],"category_scores_gemma":[0.0061752982,0.00019909027,0.0008820843,0.0011749918,0.002058672,0.0025123928,0.0017557264,0.001527341,0.00034187958],"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.00056092435,0.0002692198,0.0032255168,0.0003581551,0.00012473112,0.017816026,0.00068780704,0.32878974,0.0049138456,0.58351254,0.008011827,0.051729705],"study_design_scores_gemma":[0.00011819151,0.00039801362,0.0008865226,0.000042657706,0.00009122791,0.0033826982,0.00045443335,0.73376715,0.008753232,0.2336442,0.01838615,0.00007556022],"about_ca_topic_score_codex":0.0033608594,"about_ca_topic_score_gemma":0.002382048,"teacher_disagreement_score":0.0046846606,"about_ca_system_score_codex":0.0015048992,"about_ca_system_score_gemma":0.00077042973,"threshold_uncertainty_score":0.01567173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072610253,0.00011628303,0.9744124,0.00021558737,0.0000624039,0.00010707664,0.00030948775,0.0152149955,0.0023007558],"genre_scores_gemma":[0.058798004,0.000106247644,0.9343457,0.00017139596,0.0000356609,0.00014185475,0.0015006292,0.0015540833,0.0033464173],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882275,0.00017452883,0.00012165868,0.000467248,0.00027774854,0.00013594833],"domain_scores_gemma":[0.99803776,0.0011020069,0.000058432604,0.00039315154,0.00033771776,0.000070920505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011787197,0.0012446968,0.0015148303,0.0013101596,0.0015214158,0.0031416693,0.0027457622,0.0023020948,0.011853254],"category_scores_gemma":[0.003782851,0.0015270101,0.0020479837,0.002106949,0.0012648074,0.0051368885,0.002854632,0.0027542962,0.0050961687],"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.00034517134,0.00025756878,0.00083252403,0.00030516717,0.00009835047,0.00043241083,0.00052501477,0.021672767,0.023819664,0.07948453,0.026918173,0.84530884],"study_design_scores_gemma":[0.00019274438,0.0001115203,0.00072245963,0.000084874,0.00019161942,0.000806444,0.00026986908,0.68389994,0.05866334,0.22176199,0.033150915,0.00014433161],"about_ca_topic_score_codex":0.0038213786,"about_ca_topic_score_gemma":0.0049610753,"teacher_disagreement_score":0.011853254,"about_ca_system_score_codex":0.0011534886,"about_ca_system_score_gemma":0.002048393,"threshold_uncertainty_score":0.039653063},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019639088,0.0021232497,0.033701513,0.047586814,0.015134174,0.0012092779,0.02659213,0.058379836,0.7956339],"genre_scores_gemma":[0.07849403,0.0016068735,0.045472283,0.021086395,0.0015216576,0.00091452786,0.010442528,0.0046155187,0.83584625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966824,0.000086680135,0.00002609748,0.000039550967,0.00011776329,0.00006166534],"domain_scores_gemma":[0.995965,0.0015148189,0.00016897607,0.00043985705,0.0010007535,0.00091062085],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007614321,0.00071187626,0.0005835835,0.0010571571,0.0008602463,0.001982683,0.0010816029,0.0024555286,0.51732314],"category_scores_gemma":[0.0083273,0.00036940593,0.0002602353,0.0006868974,0.00038189505,0.0030262475,0.0016526545,0.0014964639,0.16769885],"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.00052052265,0.0001941003,0.00065951975,0.00007507401,0.000005112038,0.000092030685,0.000060743703,0.000091325375,0.00047109576,0.005262141,0.9083386,0.084229715],"study_design_scores_gemma":[0.00020790297,0.00014564535,0.0016721819,0.00012025652,0.00001561704,0.00013638043,0.0002420124,0.0009137067,0.001046796,0.011142915,0.98430055,0.000055954297],"about_ca_topic_score_codex":0.0029936086,"about_ca_topic_score_gemma":0.0055524525,"teacher_disagreement_score":0.51732314,"about_ca_system_score_codex":0.00070104474,"about_ca_system_score_gemma":0.0009523818,"threshold_uncertainty_score":0.68847996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46331075,0.012549655,0.40529788,0.0071476237,0.0008704536,0.00027831428,0.0037276556,0.0020662835,0.10475131],"genre_scores_gemma":[0.90603435,0.005871113,0.067070834,0.0009587779,0.0007819752,0.00046319433,0.0026808258,0.00083154463,0.015307237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785644,0.00044707296,0.00007515596,0.00037620758,0.00055379124,0.0006912591],"domain_scores_gemma":[0.97312295,0.02049986,0.0011446079,0.0019501714,0.0011954049,0.0020869358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029737258,0.002757259,0.0028723697,0.0033093023,0.0015816174,0.0031839663,0.0046359673,0.0026073484,0.0115363365],"category_scores_gemma":[0.02297097,0.00086229347,0.0020511583,0.002283772,0.0032411523,0.0043939007,0.004220214,0.0046197046,0.0019059505],"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.0021337278,0.00042806193,0.0059023406,0.0019507366,0.0004922207,0.00077167474,0.0011568307,0.39968234,0.0428858,0.42272845,0.02969284,0.09217504],"study_design_scores_gemma":[0.00014279566,0.0005830629,0.0032967126,0.00035641526,0.0003434269,0.0013005468,0.00038048075,0.6640426,0.014000277,0.30239046,0.012956393,0.00020686725],"about_ca_topic_score_codex":0.0017692231,"about_ca_topic_score_gemma":0.0013627498,"teacher_disagreement_score":0.0115363365,"about_ca_system_score_codex":0.0020815707,"about_ca_system_score_gemma":0.0013745642,"threshold_uncertainty_score":0.038592875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06399894,0.0007625959,0.8299478,0.0017298774,0.0011276689,0.00026272677,0.0012789501,0.0016369125,0.09925447],"genre_scores_gemma":[0.79498464,0.0008568777,0.15852532,0.0011163563,0.0011039756,0.00052879285,0.0007934552,0.00040399024,0.041686546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951756,0.0009417482,0.0003995527,0.0008838279,0.0017298885,0.00086930353],"domain_scores_gemma":[0.99482346,0.0018798041,0.00057248096,0.00093678484,0.0011329963,0.0006544996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029811591,0.001166349,0.0013675784,0.0019470897,0.0033756946,0.0066460026,0.0023332804,0.0021013392,0.013396203],"category_scores_gemma":[0.0050677415,0.00084187795,0.0017652317,0.0021642898,0.005725432,0.009721826,0.0034050923,0.0043768557,0.0032347792],"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.000027270708,0.00002394644,0.000050311715,0.00001797317,0.00000699921,0.00007172216,0.00006501445,0.00047972242,0.000545762,0.99624544,0.0006117878,0.0018540057],"study_design_scores_gemma":[0.00003147087,0.000025453945,0.00004908567,0.000011394538,0.000017219929,0.0001998005,0.00005102316,0.006744753,0.0015038983,0.9864581,0.004872826,0.000034977955],"about_ca_topic_score_codex":0.0009826898,"about_ca_topic_score_gemma":0.0007222893,"teacher_disagreement_score":0.013396203,"about_ca_system_score_codex":0.001360766,"about_ca_system_score_gemma":0.0023974082,"threshold_uncertainty_score":0.044814765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42961255,0.0013559316,0.4608913,0.0037675838,0.00032699303,0.0001059647,0.0007587674,0.0004101846,0.102770686],"genre_scores_gemma":[0.95760953,0.0009067851,0.02559642,0.00027292187,0.00028470578,0.00011260165,0.0003738087,0.00014871075,0.014694479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.00031364593,0.000090755544,0.00024001877,0.0003666434,0.00023495765],"domain_scores_gemma":[0.996307,0.0020221234,0.0004414569,0.0003345165,0.0005610898,0.00033378226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301354,0.0007719712,0.0010400356,0.0022904768,0.0021213465,0.0035525346,0.0013215018,0.0015814753,0.008106695],"category_scores_gemma":[0.006498026,0.0006033079,0.0011696088,0.002822174,0.0041920063,0.007838956,0.0024454915,0.0027564713,0.0006952116],"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.000008285344,0.0000038100936,0.000053830052,0.0000071158433,0.000001941712,0.00002015253,0.00006328622,0.00075758895,0.000129778,0.9980763,0.000121724384,0.0007562484],"study_design_scores_gemma":[0.0000090441545,0.0000075232592,0.000057278634,0.0000048828056,0.0000028221345,0.000036379293,0.000032004707,0.005315558,0.00014785101,0.9934736,0.000907198,0.0000057667926],"about_ca_topic_score_codex":0.0025656864,"about_ca_topic_score_gemma":0.0011882727,"teacher_disagreement_score":0.008106695,"about_ca_system_score_codex":0.0023706926,"about_ca_system_score_gemma":0.0011320037,"threshold_uncertainty_score":0.027119637},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012167937,0.011602503,0.0064795855,0.1441739,0.10219447,0.00017563337,0.016880047,0.0048839953,0.701442],"genre_scores_gemma":[0.032937214,0.0052072313,0.0019766374,0.013904343,0.006342091,0.000047226502,0.011411731,0.0012162882,0.92695725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994986,0.000043859753,0.000019812529,0.00012894602,0.00024035054,0.000068435125],"domain_scores_gemma":[0.99813485,0.00025775188,0.00013246384,0.0003777843,0.00055022887,0.0005469204],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0008627915,0.00046908474,0.000570126,0.0010987311,0.0018999134,0.005412598,0.00078157603,0.0029731055,0.2557025],"category_scores_gemma":[0.0035592744,0.000247714,0.0006034778,0.0013131415,0.0010026585,0.0022810174,0.0015906777,0.0032096577,0.15459882],"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.000054239405,0.000012509015,0.00033084798,0.00007079862,0.000016048663,0.000551971,0.00007960489,0.000028088225,0.0032030728,0.010038067,0.9434386,0.042176113],"study_design_scores_gemma":[0.0000069261123,0.000009599444,0.00043511525,0.000026581285,0.000004732514,0.00036789113,0.000090035996,0.000026393049,0.0017215773,0.002301348,0.99500483,0.000005049028],"about_ca_topic_score_codex":0.0018070723,"about_ca_topic_score_gemma":0.0023893055,"teacher_disagreement_score":0.9991372,"about_ca_system_score_codex":0.0016509041,"about_ca_system_score_gemma":0.0016057732,"threshold_uncertainty_score":0.8554101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6663595,0.0017180014,0.27181596,0.00057519117,0.00032313046,0.00007304831,0.00038822662,0.00043666377,0.0583103],"genre_scores_gemma":[0.95677125,0.00043991537,0.026689518,0.00023870592,0.0001882059,0.00006799836,0.00030110343,0.00011390894,0.015189271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905187,0.00013358236,0.00010056062,0.00032981552,0.00021242382,0.00017170432],"domain_scores_gemma":[0.9984073,0.00059797894,0.00035804612,0.00024863947,0.00026400076,0.00012407993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043104746,0.00036469992,0.0004709317,0.0010034302,0.001016321,0.0018214588,0.0006728089,0.00063420646,0.004133279],"category_scores_gemma":[0.0023966169,0.00025320367,0.0006790697,0.0007456974,0.0027813576,0.0032979676,0.0012948508,0.00096176943,0.0007713057],"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.000045641606,0.00001769956,0.00046503387,0.00004407183,0.000008798946,0.00027404664,0.00045135836,0.0016481677,0.0041368348,0.9837617,0.00031560808,0.008830954],"study_design_scores_gemma":[0.00001563209,0.00007537513,0.00046122097,0.00002448029,0.00001667169,0.00048656584,0.0002948805,0.009382949,0.005252752,0.96904683,0.014914567,0.000028167804],"about_ca_topic_score_codex":0.0006587317,"about_ca_topic_score_gemma":0.0005107754,"teacher_disagreement_score":0.004133279,"about_ca_system_score_codex":0.000731357,"about_ca_system_score_gemma":0.00036717628,"threshold_uncertainty_score":0.013827205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056983676,0.00037341003,0.9390784,0.00011236293,0.000027452865,0.00015135594,0.00011363476,0.00058346486,0.0025762455],"genre_scores_gemma":[0.24604152,0.00025239502,0.75062144,0.00008199051,0.000019431895,0.00021396244,0.0004545735,0.00016687314,0.0021478452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998498,0.000043011445,0.00000846503,0.000031432333,0.00004035622,0.000026809916],"domain_scores_gemma":[0.9997671,0.00011348253,0.000032299675,0.000025536017,0.00004074453,0.000020821586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039122734,0.000703453,0.00083358376,0.000938369,0.00046280157,0.00040723753,0.001043223,0.00069821835,0.0022100823],"category_scores_gemma":[0.0006483946,0.00046109396,0.0006575941,0.0009847234,0.0004089224,0.0010064221,0.0006566666,0.00044030754,0.0003990105],"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.00014625903,0.00008198796,0.0007523136,0.00013996322,0.00006233117,0.00021217683,0.00012465836,0.827452,0.01578022,0.009372034,0.0034806672,0.14239535],"study_design_scores_gemma":[0.00004021144,0.00012683144,0.00019024134,0.000008231607,0.000021635216,0.00008315603,0.000035285142,0.9918716,0.0025134224,0.0036730145,0.001426447,0.000010010402],"about_ca_topic_score_codex":0.0016825653,"about_ca_topic_score_gemma":0.0033711833,"teacher_disagreement_score":0.0022100823,"about_ca_system_score_codex":0.00054788333,"about_ca_system_score_gemma":0.0010756591,"threshold_uncertainty_score":0.0073934793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22400962,0.00063776196,0.64828867,0.0038141098,0.0005525589,0.00018884425,0.0029281136,0.0034356285,0.11614473],"genre_scores_gemma":[0.89864945,0.00025292984,0.07628592,0.0006009704,0.00019083534,0.00014612345,0.0014332294,0.00037207434,0.022068482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885154,0.00034707517,0.000068637804,0.00016526297,0.00035898498,0.00020848167],"domain_scores_gemma":[0.9973183,0.0013093869,0.0001809368,0.00060353347,0.0004080467,0.00017975007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073203305,0.00048592433,0.00049766083,0.0009792154,0.0009823228,0.001854848,0.0006449174,0.00092437014,0.007228687],"category_scores_gemma":[0.006688956,0.00025659142,0.0004424719,0.0008917175,0.0011496405,0.0012027307,0.0020993992,0.0010554127,0.0028117932],"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.0005734836,0.000052700845,0.0014561311,0.0001222852,0.000033927554,0.00053124747,0.00030850808,0.012812127,0.01345857,0.88039684,0.014412586,0.07584151],"study_design_scores_gemma":[0.00009516352,0.000082662234,0.0007445549,0.00007395591,0.000024211438,0.0006486182,0.00012232833,0.1529368,0.017517481,0.81546485,0.012234468,0.00005494941],"about_ca_topic_score_codex":0.0012980519,"about_ca_topic_score_gemma":0.0015673304,"teacher_disagreement_score":0.007228687,"about_ca_system_score_codex":0.00101303,"about_ca_system_score_gemma":0.0014396845,"threshold_uncertainty_score":0.02418232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5687733,0.025208827,0.35013407,0.002972003,0.0025350512,0.0010263647,0.0011805216,0.0021169754,0.046052832],"genre_scores_gemma":[0.765004,0.021309508,0.19232854,0.0007952069,0.0006501773,0.00036798447,0.0006858225,0.00015126275,0.018707616],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999149,0.000012323177,0.000008496268,0.000017510623,0.00003504796,0.000011770255],"domain_scores_gemma":[0.9999349,0.000019955027,0.000013365497,0.000010623253,0.000005293479,0.000015876312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002927799,0.0002988304,0.0002847657,0.00077640096,0.000310093,0.0005340793,0.0003263857,0.00035711343,0.005051807],"category_scores_gemma":[0.00020469028,0.00011027649,0.0003030485,0.0006333868,0.00036322753,0.0005055534,0.00029696926,0.0006567032,0.0012250696],"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.001569856,0.0007478914,0.0030294585,0.00044992522,0.000033882698,0.0039053313,0.000080331585,0.0005658449,0.59534323,0.0044707176,0.003941925,0.38586167],"study_design_scores_gemma":[0.0010928898,0.013790638,0.026581943,0.00017273428,0.0004608185,0.08644139,0.00020394399,0.0060297064,0.7351311,0.00486704,0.12508693,0.00014095647],"about_ca_topic_score_codex":0.00016122634,"about_ca_topic_score_gemma":0.00030717324,"teacher_disagreement_score":0.005051807,"about_ca_system_score_codex":0.000115302864,"about_ca_system_score_gemma":0.00030977593,"threshold_uncertainty_score":0.016900003},"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":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057204794,0.4641422,0.14658824,0.095105566,0.05301045,0.00012060292,0.0003831631,0.0006448939,0.23428448],"genre_scores_gemma":[0.18883908,0.4547304,0.07492018,0.033498023,0.15909415,0.00031990887,0.00044550482,0.00049450033,0.087658316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998417,0.00052968785,0.00008890338,0.00018395562,0.00063761615,0.0001428127],"domain_scores_gemma":[0.99548066,0.0024610176,0.0002021667,0.0004257946,0.001113085,0.0003171427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029936132,0.0012579969,0.0017859983,0.0038267588,0.0024169222,0.006201968,0.0011434028,0.0032671622,0.0090556145],"category_scores_gemma":[0.0065639755,0.0005046401,0.000751798,0.0029595795,0.009274956,0.0115813585,0.002196863,0.008480045,0.003081866],"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.00010068734,0.000046026642,0.00016710517,0.00046193218,0.000029053761,0.000067276014,0.0001727721,0.00058975763,0.00084552635,0.85832536,0.059495233,0.079699166],"study_design_scores_gemma":[0.000043226726,0.000083690495,0.00016915122,0.00023643041,0.00001981927,0.00027064697,0.00011298848,0.0015607667,0.00078504765,0.5838023,0.41287562,0.000040287054],"about_ca_topic_score_codex":0.00067288615,"about_ca_topic_score_gemma":0.00055805314,"teacher_disagreement_score":0.0090556145,"about_ca_system_score_codex":0.0037656857,"about_ca_system_score_gemma":0.002154157,"threshold_uncertainty_score":0.03029406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025496853,0.00013006688,0.9953335,0.00011498247,0.0000312332,0.000036730245,0.0001351834,0.0009970447,0.0006716309],"genre_scores_gemma":[0.06261233,0.00029998875,0.9309995,0.00019507113,0.00010168024,0.00026936995,0.0014314489,0.0011572841,0.0029333383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971847,0.00081574364,0.00029960516,0.00063631375,0.00087150215,0.00019218338],"domain_scores_gemma":[0.9860788,0.010230559,0.0006253633,0.0012704699,0.0015195981,0.0002752643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032020968,0.0016370299,0.0016052519,0.0022262428,0.0009825793,0.002552829,0.0031223986,0.0029098946,0.0062401476],"category_scores_gemma":[0.023425387,0.0011134658,0.0017471544,0.002513611,0.0013019801,0.00496116,0.00387582,0.0043018647,0.0033807084],"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.00018884597,0.00013816201,0.0012540601,0.00033150832,0.0000916264,0.00014403286,0.0003645514,0.41457295,0.0038300364,0.14734626,0.007655732,0.42408234],"study_design_scores_gemma":[0.000024057477,0.000015235702,0.00007510556,0.00002691713,0.000011182732,0.000048892354,0.000022543856,0.87795424,0.0014208696,0.1186524,0.0017295979,0.00001891373],"about_ca_topic_score_codex":0.0039593955,"about_ca_topic_score_gemma":0.0049246927,"teacher_disagreement_score":0.0062401476,"about_ca_system_score_codex":0.0027612755,"about_ca_system_score_gemma":0.0026231732,"threshold_uncertainty_score":0.020875394},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014372753,0.087463066,0.61389494,0.020835837,0.001361032,0.00023255388,0.00093334966,0.0010007366,0.2599057],"genre_scores_gemma":[0.5388188,0.14665122,0.2212537,0.0031075568,0.0022841643,0.0015860634,0.0012684636,0.0004619971,0.08456815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994548,0.00018905205,0.000026753718,0.00007399037,0.00020259473,0.000052859472],"domain_scores_gemma":[0.9993094,0.0003832664,0.00004474578,0.00011965847,0.000098491844,0.000044327164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081167987,0.00088861276,0.0007972471,0.0011337423,0.00082912773,0.003498877,0.00228495,0.0025724126,0.0067926305],"category_scores_gemma":[0.0030449196,0.0006285749,0.0006697675,0.0016932139,0.003126092,0.005335193,0.0012398232,0.0023879886,0.0029552842],"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.000004145349,0.000007770528,0.00003915326,0.000077337965,0.0000036997355,0.000017428154,0.000057129353,0.008841206,0.000075429954,0.9802232,0.0026809606,0.007972638],"study_design_scores_gemma":[0.000006257162,0.0000073335395,0.00002336879,0.00004879773,0.0000024290093,0.000031331587,0.000027271371,0.019831002,0.000094952615,0.9558198,0.024101913,0.0000056109598],"about_ca_topic_score_codex":0.002057218,"about_ca_topic_score_gemma":0.0013099854,"teacher_disagreement_score":0.0067926305,"about_ca_system_score_codex":0.0017580054,"about_ca_system_score_gemma":0.0013051777,"threshold_uncertainty_score":0.022723615},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007315665,0.17850728,0.21896937,0.03500422,0.004462095,0.00013020368,0.000395903,0.00054084783,0.5546745],"genre_scores_gemma":[0.5227773,0.21258105,0.12833767,0.013456686,0.021018514,0.0007161587,0.00088903785,0.0004793887,0.099744156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986494,0.00038738272,0.000078135825,0.00023018566,0.0005489903,0.00010600417],"domain_scores_gemma":[0.998767,0.0006134519,0.000062622225,0.00032060914,0.00016260933,0.00007373363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009877435,0.0007634909,0.000758046,0.0014997299,0.0016283612,0.004962681,0.001184342,0.0022025136,0.009186395],"category_scores_gemma":[0.0029337772,0.00038775787,0.0007085348,0.0022700657,0.0065826434,0.006594587,0.0022390052,0.0029164194,0.00310261],"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.0000036824683,0.000005578968,0.000044020053,0.00008625862,0.0000050042368,0.000027505279,0.00006585167,0.0006014151,0.00013890925,0.9864733,0.0038324662,0.00871612],"study_design_scores_gemma":[0.0000027869808,0.0000047893063,0.00004544097,0.000042617306,0.0000021956566,0.00007691993,0.00002575316,0.0011229536,0.00008161905,0.9324106,0.06618095,0.0000034229845],"about_ca_topic_score_codex":0.0009608338,"about_ca_topic_score_gemma":0.0005191675,"teacher_disagreement_score":0.009186395,"about_ca_system_score_codex":0.0017658082,"about_ca_system_score_gemma":0.0010558154,"threshold_uncertainty_score":0.0307315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18474835,0.0025414214,0.7712181,0.0026908848,0.00026698233,0.00007931466,0.00088918605,0.0008697083,0.03669604],"genre_scores_gemma":[0.97046006,0.0011760822,0.02387692,0.00023426622,0.00018040957,0.00018417215,0.00028501076,0.0001705414,0.0034325873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976299,0.0006393933,0.00009462354,0.00029577457,0.00067651196,0.00066384696],"domain_scores_gemma":[0.962811,0.030724496,0.0014986476,0.0023972476,0.0019258079,0.0006428531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030418292,0.0013143878,0.0013443622,0.0017938031,0.001038873,0.0032055608,0.0022835927,0.0016124677,0.0045424704],"category_scores_gemma":[0.02931154,0.00064305315,0.0007663676,0.001460815,0.005630503,0.0056877295,0.0028057538,0.0029728042,0.00058789167],"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.00018684859,0.000060517843,0.0004691705,0.0002050835,0.000041743715,0.000159663,0.00017584517,0.60369366,0.005376458,0.38100776,0.0016770705,0.0069461684],"study_design_scores_gemma":[0.000014615452,0.000021268055,0.00011184943,0.000053335367,0.000013515124,0.0000468797,0.000034059096,0.86581033,0.0029968577,0.13030724,0.00056115707,0.00002879794],"about_ca_topic_score_codex":0.0024227202,"about_ca_topic_score_gemma":0.0010781623,"teacher_disagreement_score":0.0045424704,"about_ca_system_score_codex":0.0030762062,"about_ca_system_score_gemma":0.0017964562,"threshold_uncertainty_score":0.022319555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16925953,0.000741863,0.8249852,0.0005788312,0.00008724621,0.00008486432,0.00013868003,0.00023988944,0.0038838806],"genre_scores_gemma":[0.9615081,0.00046229688,0.036038246,0.000071727794,0.000061597566,0.0000863114,0.00005490935,0.000024103418,0.0016927897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769294,0.0009416895,0.0000836381,0.0002567425,0.00065960287,0.00036539425],"domain_scores_gemma":[0.98731184,0.008958384,0.0018679283,0.0008025513,0.00090618746,0.00015313175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023896226,0.0010484917,0.0010932423,0.00071765046,0.00081603567,0.0011660863,0.0013784859,0.0013546054,0.0011118741],"category_scores_gemma":[0.009501469,0.00032362554,0.00032673497,0.0011469405,0.0020775246,0.0017783104,0.001520656,0.0010534995,0.0002979542],"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.00059306336,0.00005245701,0.0005346462,0.00031114748,0.00003536495,0.0005599797,0.00024253863,0.9104782,0.01413257,0.054389555,0.00057253725,0.018097892],"study_design_scores_gemma":[0.00004506624,0.00011481408,0.00013773485,0.000016121467,0.000016624115,0.00015795235,0.000054070675,0.97259593,0.006283402,0.02005966,0.00049024937,0.00002830207],"about_ca_topic_score_codex":0.0008543891,"about_ca_topic_score_gemma":0.00070584845,"teacher_disagreement_score":0.0023896226,"about_ca_system_score_codex":0.0007741772,"about_ca_system_score_gemma":0.00070116663,"threshold_uncertainty_score":0.012637675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69499946,0.0010609695,0.22499089,0.0032987476,0.00013208367,0.00007576317,0.0009820537,0.0006156461,0.07384442],"genre_scores_gemma":[0.9853543,0.0002986562,0.0093340175,0.00024898702,0.00016665834,0.000092848284,0.00041599016,0.0001607066,0.0039277864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877447,0.00033730047,0.00007172541,0.00020171177,0.00039176643,0.00022311877],"domain_scores_gemma":[0.98087376,0.015541936,0.0008302228,0.0011533649,0.0010245838,0.0005762586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012162402,0.00037169023,0.0005385849,0.00216467,0.0013937856,0.0035675312,0.0010035249,0.001110778,0.0047332747],"category_scores_gemma":[0.012563848,0.00050501304,0.0006308053,0.0017914438,0.0023919677,0.0048463363,0.0014096112,0.0022414066,0.00051330193],"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.000042466952,0.000015242434,0.00041889923,0.00004155472,0.000004134669,0.000057545305,0.00036469175,0.0024537344,0.0020490068,0.98896027,0.0006447689,0.004947739],"study_design_scores_gemma":[0.000011515695,0.000010951549,0.00022351142,0.000015772817,0.000006363915,0.000091315276,0.000071138726,0.013958725,0.0016095118,0.98303276,0.0009557341,0.00001284028],"about_ca_topic_score_codex":0.0010281276,"about_ca_topic_score_gemma":0.0006799731,"teacher_disagreement_score":0.0047332747,"about_ca_system_score_codex":0.0012930748,"about_ca_system_score_gemma":0.0008686843,"threshold_uncertainty_score":0.015834332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16309711,0.0010360323,0.7721092,0.009837526,0.00033046573,0.00029695735,0.0024989937,0.001466498,0.049327333],"genre_scores_gemma":[0.8560598,0.0009608113,0.11595791,0.0016282321,0.00037718387,0.00042989157,0.0036001848,0.0004789754,0.02050701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570113,0.000945441,0.00037499567,0.0011599129,0.0010574089,0.00076120545],"domain_scores_gemma":[0.9751713,0.021229194,0.0007251817,0.0010238925,0.0013502922,0.00050019234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039676917,0.0011321084,0.001563522,0.0014495965,0.0022394997,0.0051143817,0.004813616,0.003642853,0.009695163],"category_scores_gemma":[0.022345517,0.0014475521,0.004460647,0.0023006662,0.004586162,0.013060695,0.0055077514,0.009483182,0.00078926026],"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.00006004942,0.00005675511,0.0006289132,0.00012412756,0.000047160083,0.0001717978,0.0005966889,0.013800828,0.00056931586,0.9754936,0.002009426,0.0064413096],"study_design_scores_gemma":[0.000063672145,0.000009023743,0.00010841858,0.000018513752,0.000030903626,0.000049549482,0.000075411546,0.045035303,0.0006866742,0.95222026,0.0016876243,0.0000146818875],"about_ca_topic_score_codex":0.009220986,"about_ca_topic_score_gemma":0.006318441,"teacher_disagreement_score":0.009695163,"about_ca_system_score_codex":0.004789618,"about_ca_system_score_gemma":0.0031980902,"threshold_uncertainty_score":0.034751296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5813738,0.0005460904,0.39475578,0.0011893624,0.00016968507,0.00015076752,0.0016295017,0.0031791974,0.017005889],"genre_scores_gemma":[0.8283541,0.00027070587,0.16115412,0.00021434762,0.00010140555,0.00009769949,0.0027868398,0.00079237676,0.006228272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826294,0.00018122653,0.0001736572,0.00059523416,0.00045133417,0.00033560116],"domain_scores_gemma":[0.99498886,0.0033336945,0.0003488516,0.0004955793,0.00051950535,0.0003135366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011001287,0.0008284091,0.0011062124,0.001227049,0.0010952188,0.0051107393,0.0013321362,0.0011965516,0.0068626083],"category_scores_gemma":[0.007740821,0.0009115057,0.0019767305,0.0016845537,0.0021460075,0.010974375,0.0026598298,0.0023229646,0.0012715384],"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.0017180066,0.00059876544,0.005882139,0.001637944,0.0002448011,0.0012304906,0.0055649932,0.027029708,0.06530769,0.74895465,0.0072266795,0.13460413],"study_design_scores_gemma":[0.00007916403,0.00013832941,0.0006413696,0.000109221146,0.0001260566,0.00038074475,0.0013010453,0.030596431,0.02836626,0.9306186,0.0075652506,0.000077552715],"about_ca_topic_score_codex":0.0011188788,"about_ca_topic_score_gemma":0.002188947,"teacher_disagreement_score":0.0068626083,"about_ca_system_score_codex":0.0010641807,"about_ca_system_score_gemma":0.0010088183,"threshold_uncertainty_score":0.022957742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03886667,0.00040414755,0.93823016,0.0020263246,0.0002501808,0.000079524856,0.0005183301,0.0023339374,0.017290747],"genre_scores_gemma":[0.4616234,0.00086240045,0.51955795,0.0012019172,0.00020575129,0.00020602315,0.0014745921,0.0018732958,0.0129946405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841285,0.00047058496,0.00012305175,0.0002994971,0.00051878905,0.00017523172],"domain_scores_gemma":[0.9954684,0.0024792033,0.00020779338,0.0010566984,0.0006008906,0.0001869517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018943966,0.0005813709,0.00053065416,0.0009188701,0.0019404135,0.0026990909,0.0010755283,0.001919843,0.0056025716],"category_scores_gemma":[0.009924731,0.00074663037,0.0014158821,0.00089370826,0.004670845,0.007299975,0.0032869768,0.004442568,0.0013254635],"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.000049898237,0.000016844871,0.0007840488,0.00012919224,0.000016639655,0.00061030546,0.0011206645,0.009922016,0.0037784774,0.9561838,0.002252183,0.025135886],"study_design_scores_gemma":[0.000014464113,0.000015814523,0.00036568358,0.00004187218,0.000020650376,0.00039353868,0.00014749893,0.021175873,0.0048527485,0.9479627,0.024970591,0.000038673876],"about_ca_topic_score_codex":0.0040132236,"about_ca_topic_score_gemma":0.0041618547,"teacher_disagreement_score":0.0056025716,"about_ca_system_score_codex":0.0009791837,"about_ca_system_score_gemma":0.0021859373,"threshold_uncertainty_score":0.018742442},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42419684,0.0072149215,0.4395399,0.019707505,0.00053998985,0.00015152863,0.0012698594,0.00047496022,0.10690448],"genre_scores_gemma":[0.96967334,0.0018441596,0.021905728,0.0004471378,0.00040575728,0.00014912235,0.00053977955,0.00014550384,0.0048894617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637234,0.0012818434,0.00024460323,0.00040861577,0.0012827325,0.00040982052],"domain_scores_gemma":[0.9662905,0.028353013,0.0011342369,0.0023065156,0.0013594285,0.0005562892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033907145,0.0008194502,0.0016764881,0.0017814449,0.0019473614,0.00523097,0.003007132,0.0024758053,0.0053280466],"category_scores_gemma":[0.029620698,0.0010547944,0.0014694465,0.00227882,0.005090517,0.013637657,0.0034874901,0.0057194466,0.00053973164],"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.00003972096,0.000026619293,0.00035430334,0.00007127001,0.000015370491,0.00005614448,0.00017486293,0.026916938,0.00031528893,0.96609217,0.0011202039,0.0048170867],"study_design_scores_gemma":[0.0000060296716,0.0000045786883,0.00009054307,0.00001136831,0.0000047083436,0.000022199203,0.000030502633,0.0560027,0.00013274896,0.94317615,0.00050725,0.000011211782],"about_ca_topic_score_codex":0.003205558,"about_ca_topic_score_gemma":0.0015501302,"teacher_disagreement_score":0.0053280466,"about_ca_system_score_codex":0.003698106,"about_ca_system_score_gemma":0.0013755136,"threshold_uncertainty_score":0.026831806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4119304,0.0015494173,0.5564565,0.0038699768,0.00021052582,0.00018192943,0.0014950392,0.00086317834,0.023442999],"genre_scores_gemma":[0.9171374,0.0009118638,0.07420263,0.00036189618,0.00030690484,0.00037930557,0.0010373722,0.0003538431,0.005308894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995365,0.00085687445,0.00037526665,0.0011230152,0.0013694447,0.00091029797],"domain_scores_gemma":[0.96160924,0.030923827,0.0016574055,0.0029027297,0.0018092481,0.0010975518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551547,0.0007650506,0.0017220475,0.0016636747,0.0016084985,0.0049253237,0.0019681118,0.0016589242,0.006261417],"category_scores_gemma":[0.022770235,0.0004953728,0.0023015868,0.0022161957,0.004563964,0.01054209,0.0043500187,0.004809846,0.00057725015],"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.00036685786,0.00012109012,0.0013331115,0.00021217996,0.000031104773,0.00020419825,0.00072099024,0.059433073,0.0064250897,0.90711445,0.0019316267,0.022106193],"study_design_scores_gemma":[0.000018636176,0.000043631164,0.00021929639,0.000019666855,0.000015111422,0.0000799899,0.00007478631,0.14457402,0.0030703219,0.8507325,0.0011139367,0.000038156948],"about_ca_topic_score_codex":0.0026062352,"about_ca_topic_score_gemma":0.0016072447,"teacher_disagreement_score":0.006261417,"about_ca_system_score_codex":0.0032734163,"about_ca_system_score_gemma":0.0024584245,"threshold_uncertainty_score":0.023750365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43315047,0.004394356,0.40647346,0.013595842,0.0010886061,0.00008336048,0.00065712555,0.00080591324,0.13975088],"genre_scores_gemma":[0.96089536,0.0017035953,0.020627273,0.00089447096,0.0011791702,0.00009990919,0.00033749788,0.0004234028,0.013839306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753153,0.0007750208,0.000106009385,0.00035131056,0.0008195924,0.0004165591],"domain_scores_gemma":[0.9673227,0.026419347,0.0011216265,0.0025573361,0.0015378465,0.001041099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030601725,0.0010729061,0.0019059161,0.003679916,0.0022557997,0.0044802064,0.0026020021,0.002697183,0.010059607],"category_scores_gemma":[0.031135147,0.0010285294,0.0008981999,0.0036726084,0.006700984,0.013416838,0.0049079363,0.0052082143,0.0009794761],"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.00006537647,0.000014927899,0.0003328515,0.000044504464,0.000009641881,0.000041392184,0.00013513572,0.002602747,0.0003249488,0.9866426,0.0010779273,0.008707978],"study_design_scores_gemma":[0.000008489699,0.000004682894,0.00006235396,0.000011896434,0.000006030188,0.000025178604,0.000016969258,0.0067659295,0.00013201618,0.99216664,0.00079397653,0.0000057889197],"about_ca_topic_score_codex":0.001367458,"about_ca_topic_score_gemma":0.0012458687,"teacher_disagreement_score":0.010059607,"about_ca_system_score_codex":0.0019391692,"about_ca_system_score_gemma":0.00097093027,"threshold_uncertainty_score":0.033652723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8130523,0.0017620232,0.12740235,0.001062412,0.00017617753,0.000108221684,0.0006278459,0.0004920153,0.055316642],"genre_scores_gemma":[0.9376779,0.0006969097,0.04986521,0.00050419325,0.00009719743,0.00020242119,0.0006115287,0.00007524198,0.010269311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00013207308,0.00005219556,0.00010821536,0.0002806141,0.00016220297],"domain_scores_gemma":[0.996089,0.002167455,0.0006503807,0.00034142128,0.000436101,0.0003156914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006362176,0.0004406191,0.0006065883,0.0014842107,0.0011417517,0.001285431,0.00076241046,0.0014664549,0.0025159996],"category_scores_gemma":[0.0033525196,0.000632336,0.00044838057,0.00092745875,0.0013713333,0.0010376173,0.0012861572,0.0011346267,0.00062061305],"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.00039258023,0.000048844886,0.0011184919,0.00018788752,0.000028119754,0.0003226649,0.00036346953,0.004798049,0.022889925,0.9534044,0.0017692606,0.014676208],"study_design_scores_gemma":[0.00025517397,0.00029486982,0.0015553079,0.0001809425,0.00007831812,0.0017925049,0.0002470117,0.050808493,0.05301664,0.8745238,0.017115561,0.00013149016],"about_ca_topic_score_codex":0.00042306527,"about_ca_topic_score_gemma":0.000490721,"teacher_disagreement_score":0.0025159996,"about_ca_system_score_codex":0.0011124515,"about_ca_system_score_gemma":0.00089134456,"threshold_uncertainty_score":0.008416891},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093611896,0.0021151486,0.8524664,0.00063773716,0.00043844077,0.00013659798,0.00014349545,0.0025376035,0.04791264],"genre_scores_gemma":[0.7772965,0.001063643,0.1871629,0.00033920194,0.00007658507,0.0001546468,0.00035971685,0.0005157465,0.03303099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996731,0.00007851179,0.000010616278,0.0000823002,0.000110761706,0.000044705324],"domain_scores_gemma":[0.999577,0.00018476341,0.00003589856,0.0001290995,0.000035061148,0.00003828166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392484,0.00038964042,0.00066032854,0.0003922083,0.00042107765,0.0009832291,0.0013179492,0.0013715083,0.005587421],"category_scores_gemma":[0.0013601319,0.00036170986,0.0005503264,0.00055110856,0.0006903181,0.0007598842,0.0011207109,0.0013768446,0.0021681974],"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.0005161693,0.0002268883,0.0005191378,0.0003025617,0.000081221755,0.0002513588,0.0003066827,0.10946089,0.2041777,0.43407932,0.008411042,0.24166702],"study_design_scores_gemma":[0.00012605872,0.00018996123,0.00030647186,0.00003531352,0.000042870997,0.00045190012,0.00004575089,0.663031,0.13977316,0.16462594,0.031316087,0.000055607754],"about_ca_topic_score_codex":0.00024569934,"about_ca_topic_score_gemma":0.0002559481,"teacher_disagreement_score":0.005587421,"about_ca_system_score_codex":0.000499056,"about_ca_system_score_gemma":0.00031279112,"threshold_uncertainty_score":0.018691838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65318894,0.00072867965,0.2583032,0.0023368848,0.0002297949,0.0000849835,0.0005303793,0.001152362,0.08344487],"genre_scores_gemma":[0.96319604,0.000203126,0.024734559,0.00034019505,0.00011941753,0.00006681171,0.0001799528,0.0001806397,0.010979248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927133,0.000138432,0.000036218964,0.00013518358,0.00021127392,0.00020756485],"domain_scores_gemma":[0.9958352,0.0020077808,0.00034605994,0.00040593446,0.00046866515,0.0009363256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007104246,0.00036687712,0.0008712399,0.0016483323,0.0021040495,0.0025544418,0.0012034727,0.0011089197,0.006137691],"category_scores_gemma":[0.005130851,0.0006424191,0.00067423936,0.0009531779,0.0022442248,0.0036105865,0.0028429395,0.0022261483,0.0005374541],"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.000044465152,0.000015637477,0.0002664009,0.000032230222,0.000006375656,0.00011134362,0.00028353606,0.0008218256,0.003801435,0.9913106,0.0006073341,0.002698915],"study_design_scores_gemma":[0.000033838853,0.000016615288,0.0003104119,0.000014461269,0.000011984548,0.00014832817,0.00009856693,0.015832745,0.0011285354,0.9805093,0.0018782736,0.000017038921],"about_ca_topic_score_codex":0.0012832003,"about_ca_topic_score_gemma":0.0017720433,"teacher_disagreement_score":0.006137691,"about_ca_system_score_codex":0.001841531,"about_ca_system_score_gemma":0.0010642766,"threshold_uncertainty_score":0.020532668},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008222846,0.00004857269,0.9985336,0.000096194104,0.000019932877,0.000022361608,0.0000146741095,0.00018517829,0.00025717725],"genre_scores_gemma":[0.024056224,0.00011847521,0.97462875,0.00010133228,0.00003835488,0.00013483754,0.000078911115,0.00006214489,0.00078100257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796474,0.0006488639,0.00016614932,0.00044561026,0.00069983833,0.00007470134],"domain_scores_gemma":[0.9973556,0.0013518207,0.00020999991,0.00039134084,0.00061523827,0.00007608602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312524,0.0008291866,0.0009921849,0.0023615425,0.00092424423,0.0018106822,0.0018156905,0.0017431813,0.0022891283],"category_scores_gemma":[0.010046562,0.00062725326,0.0012518425,0.0030674895,0.0020741315,0.002095407,0.0018186726,0.001987166,0.0016826398],"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.00013543756,0.00010960247,0.001544723,0.00022212625,0.000155733,0.00015692358,0.00026476616,0.3775532,0.013523429,0.17583211,0.0029934773,0.42750847],"study_design_scores_gemma":[0.00002096136,0.000034470606,0.00017324439,0.000023912387,0.000014338752,0.000077503035,0.000025737565,0.91562647,0.00413134,0.075488016,0.0043608937,0.000023102444],"about_ca_topic_score_codex":0.0021442366,"about_ca_topic_score_gemma":0.0016863429,"teacher_disagreement_score":0.0023615425,"about_ca_system_score_codex":0.0014203982,"about_ca_system_score_gemma":0.0021484229,"threshold_uncertainty_score":0.012229979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5038767,0.00054397143,0.48246637,0.00042037817,0.000060210852,0.000049520066,0.00012414511,0.00025775042,0.012200931],"genre_scores_gemma":[0.9359075,0.00024582786,0.05714008,0.00010575405,0.00003594348,0.000103205195,0.00011934803,0.00008249654,0.0062598553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883217,0.00023600688,0.000105858984,0.00034695628,0.00022294767,0.00025617497],"domain_scores_gemma":[0.99708635,0.0015259797,0.0003954266,0.0003537051,0.00043821195,0.00020028012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013650118,0.00023721017,0.0004652687,0.0012686799,0.0011265407,0.0014811794,0.00093248766,0.0010637935,0.002428592],"category_scores_gemma":[0.004021376,0.0003661144,0.0014586014,0.00044327887,0.00292354,0.002054418,0.0011518477,0.0012172926,0.00030288906],"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.00015163294,0.00003497266,0.0026389703,0.00010041134,0.0000318392,0.001184057,0.00096883666,0.016040461,0.022749411,0.94395596,0.00031793525,0.011825533],"study_design_scores_gemma":[0.000061883846,0.00026591288,0.0019641623,0.000064465356,0.000059880662,0.0013916652,0.00049940473,0.19803368,0.023288699,0.7696387,0.0046120416,0.000119560995],"about_ca_topic_score_codex":0.0013835839,"about_ca_topic_score_gemma":0.0007920525,"teacher_disagreement_score":0.002428592,"about_ca_system_score_codex":0.00090151717,"about_ca_system_score_gemma":0.00075174787,"threshold_uncertainty_score":0.008124471},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12551339,0.0047249952,0.7727477,0.0040704743,0.0018355589,0.00015240039,0.00078578945,0.0006886685,0.08948108],"genre_scores_gemma":[0.8038152,0.0041989186,0.15410092,0.0020055803,0.0015377508,0.0006554759,0.0009455728,0.0005683274,0.032172255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774724,0.0006980203,0.00015040852,0.0002981502,0.0007806385,0.00032548778],"domain_scores_gemma":[0.99376583,0.0038479378,0.00050422986,0.0005905755,0.0008932937,0.00039819337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448983,0.0013536878,0.0010631051,0.0036180736,0.0018231762,0.0035606679,0.0011953117,0.0019559676,0.004229695],"category_scores_gemma":[0.008250627,0.00044771002,0.0009446856,0.0029485167,0.0055345744,0.004781154,0.0035648881,0.0032977029,0.00090236583],"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.000013382628,0.0000031818163,0.000035705016,0.000013273799,0.00000172312,0.0000151797985,0.00006300042,0.001006559,0.00015008522,0.99531496,0.00042098065,0.0029620042],"study_design_scores_gemma":[0.0000071217532,0.000008939804,0.000032280444,0.000021271808,0.0000025593874,0.000034360488,0.000024208151,0.0055565,0.00023907908,0.990765,0.0033001078,0.000008535067],"about_ca_topic_score_codex":0.002245454,"about_ca_topic_score_gemma":0.0013282108,"teacher_disagreement_score":0.004229695,"about_ca_system_score_codex":0.0021066954,"about_ca_system_score_gemma":0.0013727059,"threshold_uncertainty_score":0.015285194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89925265,0.001174358,0.07977626,0.0008337934,0.00016671493,0.000056785175,0.0005390066,0.00033182523,0.017868645],"genre_scores_gemma":[0.98271966,0.00051518716,0.011403812,0.00016163659,0.00019841391,0.000086841384,0.00060459547,0.00013323204,0.0041766292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989453,0.00024708098,0.00013386548,0.00023411014,0.00026716464,0.00017242388],"domain_scores_gemma":[0.98109996,0.013273115,0.002169183,0.0014027066,0.0011071878,0.0009477286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475355,0.0006309508,0.0011728465,0.003048697,0.0021384289,0.0038391522,0.0012430808,0.0015565739,0.004281901],"category_scores_gemma":[0.014365912,0.00042397587,0.00072729005,0.0039565084,0.0030532468,0.0064747524,0.0017339711,0.0014140232,0.0007672226],"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.0005174715,0.00009071888,0.003220874,0.00012930941,0.00002486425,0.00073726365,0.0010990954,0.007877026,0.0042011617,0.9617346,0.0017975114,0.018570187],"study_design_scores_gemma":[0.000043685184,0.00010491381,0.0011224379,0.00005424456,0.00002416458,0.00077170954,0.00029247496,0.029384725,0.0017952891,0.96391845,0.0024403906,0.00004759443],"about_ca_topic_score_codex":0.0007036787,"about_ca_topic_score_gemma":0.0005425657,"teacher_disagreement_score":0.004281901,"about_ca_system_score_codex":0.0009265186,"about_ca_system_score_gemma":0.00072367076,"threshold_uncertainty_score":0.014324427},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020753117,0.00019852314,0.99195683,0.00028155887,0.00008627759,0.00006675018,0.000042091786,0.00016359887,0.0051289718],"genre_scores_gemma":[0.114338644,0.0007145281,0.87579393,0.00032697586,0.00013111586,0.0005917912,0.00015681292,0.000113202186,0.007833125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891925,0.00029710963,0.000120030316,0.0001773671,0.00041954394,0.00006671558],"domain_scores_gemma":[0.999047,0.00046214642,0.00006793197,0.0001637422,0.00018359342,0.00007556759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013912944,0.0005722424,0.0007347773,0.0005567518,0.00066811754,0.0023698402,0.0020364542,0.0009351073,0.0046314807],"category_scores_gemma":[0.0019830368,0.00028827068,0.0012403713,0.0009052891,0.0019456992,0.0022872295,0.0013350644,0.0026123805,0.0011927168],"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.000051671563,0.00004676786,0.0001420527,0.00021237833,0.00003636672,0.00018557155,0.0002170764,0.086841665,0.005707547,0.85713255,0.0016869314,0.04773942],"study_design_scores_gemma":[0.000027440103,0.000072781426,0.000048896793,0.000046004825,0.000019180427,0.00017200808,0.000042942887,0.4288891,0.004115784,0.54408985,0.02245132,0.00002465156],"about_ca_topic_score_codex":0.0007458033,"about_ca_topic_score_gemma":0.00090104656,"teacher_disagreement_score":0.0046314807,"about_ca_system_score_codex":0.0008268342,"about_ca_system_score_gemma":0.0012214343,"threshold_uncertainty_score":0.01549387},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25705525,0.00037739045,0.71815467,0.0018313106,0.00024816615,0.00092540006,0.0023581428,0.010957444,0.008092275],"genre_scores_gemma":[0.45518485,0.000124204,0.53309965,0.00077707577,0.00016807862,0.0011747591,0.0058340933,0.0004929375,0.0031443338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99381423,0.001720815,0.00072560925,0.0020035289,0.0013278608,0.0004079655],"domain_scores_gemma":[0.9325448,0.0562123,0.002239935,0.0048351,0.0032550853,0.0009128163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058332263,0.001942707,0.0012938449,0.002031161,0.0014844786,0.002486986,0.004092928,0.004335195,0.007320127],"category_scores_gemma":[0.038732115,0.0008050707,0.0022160185,0.0019378951,0.0026332026,0.007594242,0.0031783958,0.002126618,0.0020983028],"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.0030100786,0.0016217664,0.04239597,0.0008977585,0.0006629525,0.000450204,0.00060625724,0.11057404,0.020709878,0.038705327,0.016364733,0.7640011],"study_design_scores_gemma":[0.00050892774,0.00072710123,0.003387698,0.000117675205,0.00023297158,0.000693963,0.00048223324,0.84338516,0.027076244,0.11933318,0.003984986,0.000069880676],"about_ca_topic_score_codex":0.0014941045,"about_ca_topic_score_gemma":0.0022328822,"teacher_disagreement_score":0.007320127,"about_ca_system_score_codex":0.0011592342,"about_ca_system_score_gemma":0.003129848,"threshold_uncertainty_score":0.030849397},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31328794,0.00090566126,0.6111411,0.0036990661,0.0002475194,0.000049666935,0.00016185326,0.0004932939,0.07001385],"genre_scores_gemma":[0.94713116,0.0005096716,0.046781823,0.00018280957,0.000077454446,0.000042428826,0.000097684955,0.00006738786,0.005109586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996631,0.00010957016,0.00001837819,0.00006787676,0.000095007745,0.000046140503],"domain_scores_gemma":[0.99739313,0.0020098025,0.000092252034,0.00032274384,0.00011899483,0.000062963474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081323757,0.0002500251,0.00029606267,0.0002871622,0.000604125,0.0015404754,0.00081622065,0.00052640133,0.0030464805],"category_scores_gemma":[0.005736246,0.00020956354,0.00053626567,0.00027262702,0.0023252377,0.0030966112,0.0013021047,0.0010424455,0.00033214103],"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.00010046739,0.00002767355,0.0009886632,0.000089601264,0.000018309825,0.00011471351,0.00014435744,0.09717887,0.0059753666,0.8801081,0.00055663113,0.014697264],"study_design_scores_gemma":[0.000015897429,0.000044560788,0.00043257046,0.000036073692,0.00001689647,0.000078628844,0.00003280315,0.646035,0.004863291,0.34466255,0.0037653302,0.000016388041],"about_ca_topic_score_codex":0.0011897887,"about_ca_topic_score_gemma":0.0013009023,"teacher_disagreement_score":0.0030464805,"about_ca_system_score_codex":0.0005751484,"about_ca_system_score_gemma":0.0007336022,"threshold_uncertainty_score":0.0101915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63258404,0.0010139216,0.3340241,0.000804358,0.00012360282,0.00011196795,0.0006278643,0.00071885076,0.029991336],"genre_scores_gemma":[0.95584863,0.0003879313,0.041729577,0.00010934031,0.0000602615,0.000073909876,0.00019161915,0.00006176791,0.0015368756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962507,0.00081575016,0.00041838243,0.0008349326,0.0011175991,0.0005626661],"domain_scores_gemma":[0.9347452,0.044618025,0.0064370786,0.0050864527,0.0068724407,0.0022407111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025298053,0.0008483964,0.00049483386,0.0037548894,0.001173574,0.0036373828,0.0009788059,0.0015009372,0.002585831],"category_scores_gemma":[0.03118714,0.0005807536,0.0004920911,0.0018082476,0.0042997533,0.006716185,0.0029467987,0.0021913552,0.00042182195],"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.00028939126,0.00009507158,0.0077784797,0.00019010335,0.000065509135,0.00062522164,0.0007076863,0.02315891,0.016184563,0.91524374,0.00050085183,0.035160597],"study_design_scores_gemma":[0.000031797535,0.00016639804,0.0037830903,0.0000892159,0.0000706345,0.0015971187,0.00040590874,0.07888911,0.030110432,0.8798408,0.0048511564,0.000164485],"about_ca_topic_score_codex":0.00035307877,"about_ca_topic_score_gemma":0.00032841138,"teacher_disagreement_score":0.0037548894,"about_ca_system_score_codex":0.0011178193,"about_ca_system_score_gemma":0.0009874357,"threshold_uncertainty_score":0.013379037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01031982,0.00055424706,0.981185,0.00049660093,0.00004460609,0.00008423526,0.00012641701,0.0004248814,0.006764083],"genre_scores_gemma":[0.35637322,0.0014234941,0.63010955,0.0005098231,0.00022098522,0.0010495961,0.00059658755,0.0007785537,0.008938221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962196,0.001122743,0.00048409475,0.00092283543,0.00094085536,0.00030999264],"domain_scores_gemma":[0.9921968,0.005465785,0.0006559805,0.00095988455,0.0005077651,0.00021385895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038373875,0.0010487854,0.0007021825,0.0012885659,0.0011894521,0.0030111794,0.0029352645,0.001465676,0.004387895],"category_scores_gemma":[0.009299863,0.0012811195,0.0023914704,0.0015716943,0.007583271,0.0086564375,0.002874356,0.004615746,0.0010977524],"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.000012808527,0.000016355425,0.00011157394,0.00010022277,0.000005892722,0.000040180374,0.00029775136,0.004798805,0.0012840074,0.98389155,0.00041312474,0.0090278005],"study_design_scores_gemma":[0.000015251311,0.000021677683,0.000038086102,0.00005441013,0.000013181614,0.00015824115,0.00009775991,0.024207346,0.004993729,0.96111125,0.009261652,0.00002741134],"about_ca_topic_score_codex":0.0009092145,"about_ca_topic_score_gemma":0.00070232403,"teacher_disagreement_score":0.004387895,"about_ca_system_score_codex":0.002487294,"about_ca_system_score_gemma":0.0015933955,"threshold_uncertainty_score":0.020294309},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029378233,0.0006561681,0.9633305,0.00085272786,0.00006908618,0.000033114702,0.000118526455,0.00021729904,0.005344284],"genre_scores_gemma":[0.7625408,0.0017893706,0.22768204,0.00032853644,0.00022280314,0.00013403647,0.0003292723,0.00022374793,0.0067493026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916005,0.00038565832,0.00002753017,0.00012997321,0.00018558522,0.00011127146],"domain_scores_gemma":[0.9975955,0.0019007773,0.00013237243,0.00015138442,0.00016512633,0.000054794353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010376514,0.00071503647,0.0009530944,0.00047077393,0.00048535934,0.0010879039,0.0010667625,0.0018325644,0.0029341232],"category_scores_gemma":[0.007686931,0.00043335545,0.00045897698,0.0013093182,0.0011730823,0.0020964644,0.0013253089,0.0013837393,0.00057960843],"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.00017701251,0.00003464076,0.00039461267,0.00015597511,0.00004530606,0.0002973882,0.00011757316,0.8064181,0.004385964,0.14282553,0.0021034323,0.04304445],"study_design_scores_gemma":[0.000019681966,0.000026666496,0.000068235895,0.0000130490935,0.0000085579195,0.00008863716,0.000024161764,0.9209235,0.0026536302,0.07502435,0.0011371017,0.0000125318975],"about_ca_topic_score_codex":0.0035275044,"about_ca_topic_score_gemma":0.0022414685,"teacher_disagreement_score":0.0035275044,"about_ca_system_score_codex":0.0008815369,"about_ca_system_score_gemma":0.0017647141,"threshold_uncertainty_score":0.009815633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03677277,0.0007458901,0.9564372,0.00016919099,0.00011228772,0.00015446676,0.00008745402,0.0010549125,0.004465837],"genre_scores_gemma":[0.39767793,0.00070114323,0.58833575,0.0002421058,0.000044080443,0.00015039486,0.00023872938,0.00010117469,0.012508599],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993999,0.00013590214,0.000024744144,0.00009515571,0.00028506955,0.00005917166],"domain_scores_gemma":[0.9995528,0.0001423436,0.00005157616,0.00015159395,0.00007006342,0.000031559583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004655504,0.00047870868,0.0005212732,0.00056005805,0.00028411296,0.0005307093,0.000904137,0.0007186592,0.0018332029],"category_scores_gemma":[0.00070920226,0.00020676662,0.00038867941,0.00027894325,0.0006583159,0.0010682945,0.0011349272,0.00075115956,0.0006763187],"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.00081827526,0.00026838694,0.0009797816,0.0006182729,0.00023822139,0.000556655,0.000233575,0.06053791,0.51650053,0.10422564,0.002846134,0.31217664],"study_design_scores_gemma":[0.00011235269,0.0007738781,0.00050081965,0.00005395812,0.000058883783,0.0018448716,0.00007338948,0.36959848,0.5750758,0.014062686,0.037741475,0.000103432016],"about_ca_topic_score_codex":0.00020448332,"about_ca_topic_score_gemma":0.00034964504,"teacher_disagreement_score":0.0018332029,"about_ca_system_score_codex":0.0003494404,"about_ca_system_score_gemma":0.00032348427,"threshold_uncertainty_score":0.0061326623},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025434287,0.047241993,0.06037176,0.013975111,0.0044729076,0.00006198361,0.00034277723,0.0011402672,0.8698498],"genre_scores_gemma":[0.07724814,0.026779799,0.029661488,0.0050344607,0.0026174157,0.00022681532,0.0005439865,0.00066812907,0.8572197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952924,0.00013418897,0.00001266739,0.00010814167,0.00017491629,0.00004085887],"domain_scores_gemma":[0.99957937,0.00016223271,0.000014580502,0.0001320784,0.00006093824,0.000050936305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046060982,0.00074611075,0.0005298945,0.0010902866,0.0011346304,0.003053511,0.00096255133,0.0015812266,0.042207006],"category_scores_gemma":[0.001861728,0.00043689212,0.0002992598,0.0010355371,0.0036381138,0.006222867,0.0019498597,0.002256637,0.020507522],"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.000015928303,0.000013757216,0.00006294895,0.0000853694,0.00000460809,0.00003089222,0.00017683975,0.00063934096,0.00063179806,0.78456616,0.11563387,0.098138474],"study_design_scores_gemma":[0.000006431549,0.000008599801,0.00004397728,0.000055177174,0.0000024138835,0.00006379828,0.000043014425,0.0006708901,0.0005785952,0.24023691,0.7582835,0.0000066115663],"about_ca_topic_score_codex":0.0009119865,"about_ca_topic_score_gemma":0.0009034894,"teacher_disagreement_score":0.042207006,"about_ca_system_score_codex":0.0012561621,"about_ca_system_score_gemma":0.0010385623,"threshold_uncertainty_score":0.14119649},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04790357,0.0006414166,0.9356463,0.0006450207,0.00030996266,0.0002595334,0.00014157237,0.0040405267,0.010412192],"genre_scores_gemma":[0.7433098,0.00059060194,0.23781306,0.0002932513,0.00025525782,0.00032151624,0.0003845566,0.00020314047,0.016828816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981382,0.00044946143,0.00012604994,0.00026012037,0.00076655275,0.00025964226],"domain_scores_gemma":[0.9976804,0.0006486104,0.0002748548,0.00067489396,0.00053243723,0.00018875458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452689,0.0004401726,0.0007034299,0.0009976242,0.0014064822,0.0018748072,0.0011868004,0.0011305318,0.0033585122],"category_scores_gemma":[0.0026679554,0.0003614467,0.00043458678,0.0009764815,0.0014835021,0.003085003,0.002447416,0.0011361624,0.0018515537],"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.0016081304,0.00018165109,0.0012547977,0.00031856808,0.00008620797,0.0007830674,0.00064631255,0.04749852,0.10220035,0.6685465,0.01073633,0.1661395],"study_design_scores_gemma":[0.00047078214,0.00079310616,0.00069612224,0.000107178275,0.00013460178,0.00093706016,0.00007953572,0.6353454,0.108520836,0.16219749,0.09044852,0.00026935432],"about_ca_topic_score_codex":0.0013120808,"about_ca_topic_score_gemma":0.0009364987,"teacher_disagreement_score":0.0033585122,"about_ca_system_score_codex":0.0011499998,"about_ca_system_score_gemma":0.0016290838,"threshold_uncertainty_score":0.011235356},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18626148,0.0075678667,0.7821475,0.001010235,0.0010737858,0.00048661948,0.00024276899,0.0029408478,0.018268893],"genre_scores_gemma":[0.47646925,0.006151423,0.49791098,0.0009329114,0.00018228157,0.00047341853,0.00059623906,0.00060637575,0.016677195],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890053,0.00021969825,0.00009944729,0.0002550628,0.00040739763,0.000117917516],"domain_scores_gemma":[0.9983292,0.0005918292,0.00029093388,0.0003002209,0.00039874288,0.00008908533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011979236,0.0009968037,0.0011870238,0.0006177091,0.000594981,0.0011528395,0.0014375506,0.001645159,0.0025256565],"category_scores_gemma":[0.0028330227,0.00088018476,0.0005742537,0.0005672608,0.0011166746,0.0016528425,0.001010209,0.0020084565,0.0022265532],"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.00065838895,0.00040124907,0.0004731559,0.0013863724,0.000044730583,0.00038523143,0.00028574438,0.0358283,0.75376165,0.057286445,0.0028056535,0.14668311],"study_design_scores_gemma":[0.00009657236,0.0010202953,0.00010777659,0.00009126177,0.00005132648,0.00050549174,0.00007632627,0.048827898,0.90178436,0.019617088,0.027777327,0.000044338525],"about_ca_topic_score_codex":0.00023141596,"about_ca_topic_score_gemma":0.0004043346,"teacher_disagreement_score":0.0025256565,"about_ca_system_score_codex":0.00045704766,"about_ca_system_score_gemma":0.0010735011,"threshold_uncertainty_score":0.008449137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70667285,0.000619452,0.23764129,0.0013543424,0.00023178045,0.0000847911,0.000335658,0.00045804205,0.052601747],"genre_scores_gemma":[0.96392155,0.0001828577,0.026937034,0.0002659336,0.0001300942,0.00009182201,0.00021108301,0.0000845675,0.008175053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874794,0.00025040985,0.00010792531,0.00024004866,0.00035298397,0.00030073692],"domain_scores_gemma":[0.99440646,0.0027862284,0.0008447924,0.0006974607,0.0007822182,0.00048292024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032327,0.0003431825,0.00047964,0.002138785,0.0015438359,0.0023235625,0.0009840577,0.0009821577,0.002690198],"category_scores_gemma":[0.0049107033,0.00022423906,0.00073440105,0.0013877744,0.0038234538,0.002369015,0.0017351807,0.0013897589,0.0005223926],"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.000050776634,0.000024436496,0.0004493752,0.000027206523,0.0000052760965,0.00010973958,0.00020062718,0.0037914969,0.0014539448,0.98684907,0.0004955258,0.006542441],"study_design_scores_gemma":[0.00000999975,0.000038350983,0.00025753048,0.000020777365,0.0000048709053,0.00018467783,0.00008802747,0.02613781,0.0030262808,0.96760637,0.0026012745,0.000024172028],"about_ca_topic_score_codex":0.0010236015,"about_ca_topic_score_gemma":0.00047654787,"teacher_disagreement_score":0.002690198,"about_ca_system_score_codex":0.001878987,"about_ca_system_score_gemma":0.0006930626,"threshold_uncertainty_score":0.013633132},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012061127,0.00003471262,0.9979132,0.00008463751,0.000019512314,0.000032948123,0.000031431588,0.00010228715,0.00057516334],"genre_scores_gemma":[0.06752645,0.00020713436,0.9286383,0.000106553794,0.00008553513,0.0003349473,0.00035106548,0.0001298972,0.002620116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890125,0.00033254022,0.000090165595,0.00024814333,0.00033191856,0.00009606127],"domain_scores_gemma":[0.99555594,0.0033833066,0.00025308013,0.00039910205,0.0003074079,0.00010121326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002101524,0.0012360393,0.0014077721,0.0010397299,0.0009784395,0.0014228096,0.0018130961,0.0021512993,0.007393888],"category_scores_gemma":[0.009498998,0.000807674,0.0015475294,0.0008676523,0.0015041756,0.0029923152,0.0033466567,0.003534383,0.0015934675],"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.00008930301,0.0001356759,0.0004898876,0.0003423987,0.00009125422,0.000355181,0.0002803661,0.22208688,0.0064704926,0.6094388,0.00454556,0.1556742],"study_design_scores_gemma":[0.000030813266,0.000029363913,0.000068674555,0.000020316313,0.000013412341,0.00012045141,0.000036653473,0.65381914,0.0013128618,0.34177363,0.002750276,0.000024334744],"about_ca_topic_score_codex":0.0008310684,"about_ca_topic_score_gemma":0.0009267869,"teacher_disagreement_score":0.007393888,"about_ca_system_score_codex":0.0006835701,"about_ca_system_score_gemma":0.0020574157,"threshold_uncertainty_score":0.024735034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22370176,0.0013388868,0.66236365,0.011191053,0.00073223846,0.00039579964,0.0011762775,0.0029538437,0.09614651],"genre_scores_gemma":[0.9298352,0.000335623,0.061324887,0.0009328731,0.00019382531,0.00024898202,0.00028404445,0.00030707114,0.0065373946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687284,0.0007158411,0.00023382773,0.0006820293,0.0005973991,0.0008980731],"domain_scores_gemma":[0.9784168,0.013338102,0.0007581531,0.004546063,0.001422667,0.0015182402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039328905,0.0008754711,0.001433651,0.0011632328,0.0020793818,0.00435049,0.002550323,0.0033578167,0.0145193525],"category_scores_gemma":[0.029516397,0.0011074598,0.00123871,0.0010096082,0.0051817745,0.011037451,0.005474306,0.0050958716,0.0020961163],"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.0002642704,0.000049746228,0.0004807472,0.00015015356,0.000018493623,0.00012320485,0.00021498335,0.003949285,0.0012084311,0.97929484,0.002526776,0.011719247],"study_design_scores_gemma":[0.000066426015,0.00002647001,0.000084702086,0.00002086455,0.000014287455,0.000082445775,0.00007172262,0.020848725,0.001544457,0.97531146,0.0019082569,0.000020150961],"about_ca_topic_score_codex":0.0011680529,"about_ca_topic_score_gemma":0.0012096323,"teacher_disagreement_score":0.0145193525,"about_ca_system_score_codex":0.0013008186,"about_ca_system_score_gemma":0.0033700159,"threshold_uncertainty_score":0.048572123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76685846,0.0005258746,0.20898075,0.0031867407,0.00018008535,0.00026427006,0.0018849965,0.0016919551,0.016426876],"genre_scores_gemma":[0.96490264,0.00017996089,0.028183695,0.00033907636,0.00024658925,0.00023603425,0.0018343586,0.00033515383,0.0037424106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948454,0.00073026493,0.00049983355,0.0017810722,0.0009494817,0.0011938706],"domain_scores_gemma":[0.9672107,0.02537115,0.0022989877,0.0016197582,0.0015848461,0.0019146232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046287226,0.00073452987,0.0014733551,0.0025527305,0.004538087,0.007981977,0.0027011584,0.002370662,0.0059366445],"category_scores_gemma":[0.017025651,0.0012013481,0.0047414517,0.0015599345,0.0055669043,0.010857115,0.0031266566,0.005811253,0.0004080122],"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.0013003835,0.0005581711,0.006768401,0.00038744012,0.00016934708,0.0014989498,0.0057779,0.00881512,0.024538856,0.92778724,0.0028850418,0.019513087],"study_design_scores_gemma":[0.00044899384,0.00017901997,0.002708563,0.00007166165,0.00020472621,0.0009875016,0.0014499332,0.057848703,0.023811154,0.90708995,0.0050641634,0.00013563372],"about_ca_topic_score_codex":0.004671209,"about_ca_topic_score_gemma":0.0027443615,"teacher_disagreement_score":0.007981977,"about_ca_system_score_codex":0.0038128453,"about_ca_system_score_gemma":0.002932992,"threshold_uncertainty_score":0.027664304},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.373104,0.0008456507,0.5820124,0.0017839468,0.00045566258,0.00018771504,0.0011588585,0.0008342075,0.03961751],"genre_scores_gemma":[0.8850555,0.00044357422,0.10010093,0.00031185977,0.00016120491,0.000506931,0.00073534856,0.00023090086,0.012453809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977901,0.00049480674,0.00017567693,0.00041939752,0.00074854156,0.00037144622],"domain_scores_gemma":[0.99050176,0.004797106,0.001204883,0.0015061181,0.0012014842,0.0007886645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010562425,0.000809108,0.0012181539,0.003518573,0.0016882023,0.0036618412,0.0019792279,0.0027898268,0.0066498257],"category_scores_gemma":[0.011863704,0.0007483067,0.0009950683,0.0023165704,0.0035604716,0.0046674726,0.003416365,0.0027561123,0.0007941687],"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.00007075718,0.000017415014,0.0003910724,0.000041094656,0.000016014572,0.000101950514,0.00011868315,0.010697434,0.0013425018,0.9820451,0.0005182528,0.0046395995],"study_design_scores_gemma":[0.000038973223,0.000027583914,0.00023252309,0.000044250894,0.0000088114475,0.00015505753,0.00008083862,0.09378368,0.002358923,0.90086424,0.0023633137,0.0000418195],"about_ca_topic_score_codex":0.0015761002,"about_ca_topic_score_gemma":0.0013331211,"teacher_disagreement_score":0.0066498257,"about_ca_system_score_codex":0.0022317932,"about_ca_system_score_gemma":0.0014894556,"threshold_uncertainty_score":0.022245884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062266253,0.0023312648,0.8659888,0.0020190119,0.000344212,0.000115960465,0.0004567038,0.0008650943,0.0656128],"genre_scores_gemma":[0.8068517,0.0027922443,0.14524895,0.0005840021,0.00036425248,0.00053216564,0.00051422784,0.00038805255,0.042724468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967086,0.00009283947,0.000020413661,0.00007190161,0.000093267394,0.000050688923],"domain_scores_gemma":[0.9991499,0.0005060531,0.000056825796,0.00012748521,0.000089459056,0.000070246555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039122492,0.0005787428,0.0007157285,0.00075823494,0.0010666471,0.0029187403,0.0018947347,0.00192259,0.0067399917],"category_scores_gemma":[0.0019309629,0.0005685529,0.0009476664,0.0010917182,0.0024210394,0.0033519892,0.0011053666,0.0019812314,0.0011848407],"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.000008260592,0.000013139285,0.000060980376,0.00003559363,0.000006588003,0.000047837257,0.00012205436,0.0164076,0.00066707167,0.97740865,0.0012773444,0.0039448566],"study_design_scores_gemma":[0.0000073738047,0.000006567235,0.00002684108,0.000010197621,0.0000049846094,0.000035793553,0.000027134822,0.09717526,0.0002682129,0.90000963,0.0024202205,0.000007790726],"about_ca_topic_score_codex":0.0019289182,"about_ca_topic_score_gemma":0.0017141855,"teacher_disagreement_score":0.0067399917,"about_ca_system_score_codex":0.0013534867,"about_ca_system_score_gemma":0.0009073633,"threshold_uncertainty_score":0.022547543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00762065,0.0128978845,0.106649905,0.0025998286,0.0015546686,0.0000752759,0.00012756861,0.0004790802,0.8679951],"genre_scores_gemma":[0.26725975,0.029976217,0.052224565,0.0022191936,0.001565018,0.0004149401,0.00028180145,0.00042658666,0.64563197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987125,0.000025407398,0.0000049443115,0.000027096274,0.000050615312,0.000020709542],"domain_scores_gemma":[0.99989235,0.00004743618,0.000005776243,0.00002519247,0.000020258169,0.000009022523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021229486,0.0007890821,0.00039047113,0.00047284408,0.0010420147,0.0017509309,0.00081707863,0.001037098,0.012820634],"category_scores_gemma":[0.00055560353,0.00039098348,0.00033436526,0.00080844905,0.0016960737,0.004326785,0.0011121909,0.00151751,0.0045413775],"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.0000049810546,0.0000053550025,0.000010018497,0.000052546417,0.0000014991394,0.000039935076,0.00006848248,0.00040306317,0.00060915307,0.97138983,0.009141751,0.018273365],"study_design_scores_gemma":[0.000003874333,0.000007724528,0.000022645114,0.000025359825,0.0000022728248,0.00012434815,0.000024833202,0.0012462079,0.00094311684,0.9016076,0.09598733,0.0000047195635],"about_ca_topic_score_codex":0.0005014184,"about_ca_topic_score_gemma":0.00048542483,"teacher_disagreement_score":0.012820634,"about_ca_system_score_codex":0.0006057991,"about_ca_system_score_gemma":0.0003840218,"threshold_uncertainty_score":0.042889297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2391051,0.0025995215,0.7208303,0.0013633742,0.00026718885,0.00012297381,0.00043028124,0.0005723044,0.034709],"genre_scores_gemma":[0.92064095,0.0018455554,0.06143347,0.0003015724,0.00013757676,0.0000723664,0.00032140172,0.00008463241,0.015162336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996136,0.000056852437,0.000015360796,0.000045995304,0.00016365376,0.00010464196],"domain_scores_gemma":[0.9985499,0.00082704675,0.00013491295,0.00017298352,0.00027699742,0.000038149727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035123512,0.00036808345,0.00024816574,0.00039656836,0.00040704894,0.00068479497,0.00046058284,0.00071316503,0.0020354134],"category_scores_gemma":[0.0031594995,0.000171285,0.00031387398,0.000558956,0.00074387545,0.000990314,0.0006354371,0.0008006999,0.0003311236],"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.00014724226,0.00004753716,0.0011354018,0.00017939345,0.000031028125,0.0003639137,0.00022503104,0.30677822,0.01892933,0.6099983,0.003796845,0.058367845],"study_design_scores_gemma":[0.000033700664,0.00009231786,0.0006877352,0.00006610432,0.000029881689,0.00047058245,0.000042126034,0.76023465,0.021091104,0.19816335,0.019039717,0.000048727954],"about_ca_topic_score_codex":0.003545656,"about_ca_topic_score_gemma":0.0033233012,"teacher_disagreement_score":0.003545656,"about_ca_system_score_codex":0.0012309719,"about_ca_system_score_gemma":0.0009201404,"threshold_uncertainty_score":0.008931339},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12888364,0.04371695,0.18365762,0.007875685,0.0025422,0.00013425793,0.0011954018,0.0005342309,0.63146],"genre_scores_gemma":[0.8529646,0.015284829,0.050758306,0.0014769618,0.003567575,0.00048002793,0.00080788595,0.00025150887,0.07440838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995981,0.000085224485,0.000020339152,0.00009658231,0.00015490434,0.000044884713],"domain_scores_gemma":[0.9989379,0.0005995353,0.00009104839,0.00015966297,0.00014563596,0.00006615319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047298134,0.00055234047,0.0006537483,0.0019719696,0.0014721896,0.0033129249,0.00055023155,0.0011177378,0.005630316],"category_scores_gemma":[0.0031433546,0.00033681036,0.0003363156,0.0020588073,0.0041058757,0.0031805872,0.0011375638,0.0019603393,0.0015488627],"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.0000036394208,0.000003050048,0.000045546352,0.000016421505,0.0000010277251,0.000009541254,0.000054086908,0.00021810709,0.00013726631,0.9934048,0.0011790381,0.004927437],"study_design_scores_gemma":[0.000003060118,0.000005359469,0.000074117386,0.00001496605,0.0000019528354,0.00006467717,0.000025049008,0.0007522464,0.0002657014,0.98534817,0.01344064,0.000003887197],"about_ca_topic_score_codex":0.0005291099,"about_ca_topic_score_gemma":0.0003351165,"teacher_disagreement_score":0.005630316,"about_ca_system_score_codex":0.00086206215,"about_ca_system_score_gemma":0.0005812892,"threshold_uncertainty_score":0.018835306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66828763,0.00045918312,0.29867736,0.00082278304,0.00021162617,0.00021255194,0.0009192394,0.0036047318,0.026804972],"genre_scores_gemma":[0.9098971,0.00026213966,0.08403067,0.000115343166,0.000023854764,0.000331731,0.00055003527,0.00025638318,0.0045327353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997118,0.00008136896,0.000019709083,0.000044582903,0.00008092067,0.00006157952],"domain_scores_gemma":[0.9992937,0.00030767612,0.000048228892,0.00011500283,0.00015232204,0.000083014216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004223478,0.0005112801,0.00078299583,0.00035577017,0.0008876477,0.0011215567,0.0017073707,0.0014353667,0.0029707754],"category_scores_gemma":[0.0018126311,0.0004681069,0.0006394245,0.00062260986,0.0009128894,0.0010184563,0.0008094519,0.00096190086,0.00037167358],"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.000083741776,0.00005270654,0.0009976508,0.00005987375,0.00002942137,0.00018554578,0.00014067226,0.9749737,0.005366555,0.012531067,0.0010667753,0.004512389],"study_design_scores_gemma":[0.000018131412,0.0000116006395,0.00009752275,0.0000027779074,0.0000023019716,0.000012535998,0.000012697773,0.9960598,0.001339468,0.0014603608,0.0009769828,0.0000058377977],"about_ca_topic_score_codex":0.010290899,"about_ca_topic_score_gemma":0.0033542009,"teacher_disagreement_score":0.010290899,"about_ca_system_score_codex":0.0010566486,"about_ca_system_score_gemma":0.0011919071,"threshold_uncertainty_score":0.020461977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016243786,0.0014733373,0.96725476,0.0004868518,0.00016656666,0.00009348151,0.000034515306,0.00029148452,0.013955151],"genre_scores_gemma":[0.42906916,0.0016933753,0.5579026,0.00044759305,0.00012911034,0.00048005691,0.00010573819,0.0002007255,0.009971634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994974,0.0002230285,0.000019882124,0.000073130075,0.00015724522,0.000029196915],"domain_scores_gemma":[0.999456,0.0003356797,0.000059731705,0.000044175064,0.00008838388,0.000016093627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084507756,0.00077558716,0.00084298284,0.00059181947,0.00040685668,0.0009242015,0.00087525125,0.001419168,0.002509443],"category_scores_gemma":[0.0031395033,0.0003355217,0.00044039678,0.0010151012,0.0016192711,0.0010364694,0.000740717,0.0010229128,0.00054924906],"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.00004168685,0.000041072588,0.00031588494,0.00012434053,0.000039590912,0.0000631235,0.000052033833,0.834331,0.0035423974,0.116077095,0.0012802165,0.044091556],"study_design_scores_gemma":[0.000023397804,0.000032593147,0.00006829827,0.000016332071,0.000008144271,0.000032786185,0.0000083564555,0.96442866,0.0009768574,0.031092322,0.0033030764,0.000009135375],"about_ca_topic_score_codex":0.0016383389,"about_ca_topic_score_gemma":0.001243021,"teacher_disagreement_score":0.002509443,"about_ca_system_score_codex":0.0009075016,"about_ca_system_score_gemma":0.00095833745,"threshold_uncertainty_score":0.008394957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34135565,0.001837135,0.6235784,0.0019169693,0.00020153249,0.00037977338,0.0016366953,0.0013784012,0.027715445],"genre_scores_gemma":[0.7131847,0.0012492469,0.27136904,0.0003466034,0.0001595674,0.00043467674,0.0020932334,0.00035466082,0.010808203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802893,0.00047129538,0.00012940577,0.00058452744,0.00039322174,0.0003925589],"domain_scores_gemma":[0.99249953,0.005498384,0.00064305187,0.0007678929,0.00025116306,0.00033997334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091007905,0.0009938697,0.0013053139,0.0008024693,0.0014261941,0.0031639105,0.0018844042,0.0013639701,0.009637857],"category_scores_gemma":[0.008610165,0.0009374718,0.001617469,0.0015336447,0.0019762302,0.0059190653,0.0029790082,0.0021163195,0.0008428202],"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.00038396296,0.00022999295,0.0026780048,0.0005298474,0.00011281241,0.00071409,0.000635518,0.681436,0.0073592514,0.24774477,0.005771282,0.052404407],"study_design_scores_gemma":[0.00011767793,0.000110502755,0.00045182984,0.000046315843,0.000042073883,0.00033905002,0.00024712528,0.6012409,0.0033762173,0.38433895,0.009655823,0.000033515124],"about_ca_topic_score_codex":0.0040974203,"about_ca_topic_score_gemma":0.003909732,"teacher_disagreement_score":0.009637857,"about_ca_system_score_codex":0.0024003773,"about_ca_system_score_gemma":0.00081163266,"threshold_uncertainty_score":0.03224188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09321692,0.0012855397,0.8833188,0.006368528,0.00019988338,0.000063300104,0.000384315,0.00073790835,0.014424808],"genre_scores_gemma":[0.8553218,0.00081296515,0.13301283,0.001000338,0.0005007678,0.00014126825,0.00044073642,0.00033967537,0.008429603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99209565,0.0028795649,0.00070512685,0.0017245527,0.0015961069,0.000999021],"domain_scores_gemma":[0.9119669,0.07602047,0.002556307,0.004606292,0.0039538564,0.00089619873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007395327,0.00094722863,0.0018672417,0.0022841252,0.0021996577,0.004268125,0.003296985,0.002431529,0.0049122814],"category_scores_gemma":[0.059161395,0.0014379348,0.0028042507,0.0023446588,0.009518191,0.016131986,0.0057767425,0.006213526,0.0006421357],"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.00010649786,0.00003511146,0.0010285832,0.000100006844,0.000043150947,0.00012364221,0.0005849018,0.009870916,0.0006035586,0.9703856,0.0018255796,0.015292309],"study_design_scores_gemma":[0.000013488511,0.000007317864,0.00007501443,0.000009409775,0.000013700688,0.000041040592,0.000022397404,0.018699706,0.00046565066,0.98021084,0.0004260028,0.000015411022],"about_ca_topic_score_codex":0.0039110435,"about_ca_topic_score_gemma":0.0027816552,"teacher_disagreement_score":0.007395327,"about_ca_system_score_codex":0.002470695,"about_ca_system_score_gemma":0.0024700582,"threshold_uncertainty_score":0.03911072},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013666004,0.10241933,0.60440946,0.18598591,0.018999934,0.00012339948,0.0003865113,0.0017557708,0.07225368],"genre_scores_gemma":[0.45303386,0.10516724,0.31103048,0.050725527,0.032943577,0.0006440407,0.00046241007,0.0014384853,0.04455439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.987717,0.00458824,0.0006682181,0.0019065385,0.004363802,0.00075626257],"domain_scores_gemma":[0.9243254,0.053661577,0.0019445798,0.010600965,0.008322634,0.0011448566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015787117,0.0011677564,0.002255279,0.002673868,0.003645625,0.00643064,0.003536597,0.0074446187,0.0061698454],"category_scores_gemma":[0.06421354,0.00081730605,0.0011700775,0.0018654694,0.023223119,0.023126965,0.005817811,0.013235009,0.0035870352],"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.00004248117,0.000023506911,0.0002626732,0.0003457364,0.000031698142,0.00011512458,0.00047709394,0.0024143672,0.00076225115,0.94764507,0.009060895,0.038819186],"study_design_scores_gemma":[0.0000146318525,0.00003133897,0.000062619474,0.00017866722,0.000009859618,0.00014883328,0.00007895887,0.00283887,0.0008715591,0.9614185,0.034305356,0.000040841536],"about_ca_topic_score_codex":0.0012137614,"about_ca_topic_score_gemma":0.00057717616,"teacher_disagreement_score":0.015787117,"about_ca_system_score_codex":0.0025245657,"about_ca_system_score_gemma":0.0033224737,"threshold_uncertainty_score":0.083491206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19265693,0.037574217,0.55238795,0.008200251,0.0025631513,0.00015186111,0.0002649658,0.0008715566,0.2053291],"genre_scores_gemma":[0.8620683,0.0061651138,0.1131674,0.0005505192,0.00069353235,0.00012119996,0.000105915315,0.00014021494,0.01698781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953556,0.00015549749,0.00003517071,0.000084443076,0.00014581456,0.000043507178],"domain_scores_gemma":[0.999185,0.00048349964,0.000060016504,0.00012679408,0.00010062737,0.000043932047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050705165,0.0002930019,0.00051394204,0.0007102509,0.000934784,0.0016144479,0.0010105574,0.0010449014,0.0029457621],"category_scores_gemma":[0.003255399,0.00038044955,0.00022512488,0.0012390993,0.002501273,0.0028101797,0.00058998034,0.001712908,0.00068659335],"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.000028083114,0.000013556505,0.00006232015,0.000063656174,0.0000026873267,0.000081093116,0.000100919606,0.0038494316,0.0015454127,0.9778845,0.00085453305,0.015513844],"study_design_scores_gemma":[0.000008091985,0.000014706339,0.000042094547,0.00002368349,0.0000035572,0.00010762728,0.000044836514,0.014142227,0.002423082,0.97240305,0.010775484,0.00001164002],"about_ca_topic_score_codex":0.0012655581,"about_ca_topic_score_gemma":0.0007608562,"teacher_disagreement_score":0.0029457621,"about_ca_system_score_codex":0.0007828041,"about_ca_system_score_gemma":0.0005303207,"threshold_uncertainty_score":0.0098544955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4500461,0.00058315176,0.40556,0.0011538864,0.00029407968,0.00012922748,0.00017297371,0.0003940139,0.14166665],"genre_scores_gemma":[0.9291741,0.00047281492,0.03650618,0.0003872775,0.00034544966,0.000107828935,0.0002564333,0.000095150084,0.032654796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989221,0.00022350912,0.000051806783,0.00014266955,0.00039648707,0.0002634164],"domain_scores_gemma":[0.99900335,0.00021483499,0.00020050602,0.00013146322,0.00022349875,0.00022626488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000993494,0.0004611555,0.00048502194,0.0008625321,0.0017671223,0.0024096016,0.0008629975,0.0007161143,0.007018532],"category_scores_gemma":[0.001907279,0.0002983311,0.0010460792,0.00080628606,0.0026713095,0.0037865115,0.0028429287,0.0023722595,0.001862446],"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.0000155419,0.000022624914,0.00009285206,0.000018664496,0.0000038124417,0.000099869125,0.0002571718,0.001328076,0.0015792107,0.9931211,0.0003583889,0.0031027158],"study_design_scores_gemma":[0.000019365629,0.000028790386,0.00009036271,0.0000069728703,0.000005500409,0.00017632465,0.00014427463,0.008243374,0.0027826657,0.98458856,0.0038961396,0.000017689352],"about_ca_topic_score_codex":0.00053669745,"about_ca_topic_score_gemma":0.0003966183,"teacher_disagreement_score":0.007018532,"about_ca_system_score_codex":0.00091016537,"about_ca_system_score_gemma":0.00094579515,"threshold_uncertainty_score":0.023479342},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035180293,0.00062422076,0.9395936,0.0018726989,0.00012144177,0.00009316025,0.00030356055,0.00042645275,0.021784585],"genre_scores_gemma":[0.59437597,0.0007715194,0.38921878,0.0005844646,0.0003147185,0.00047751062,0.00052029535,0.00020189832,0.013534852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869823,0.00036988905,0.000101669735,0.00029018696,0.00033940174,0.00020058037],"domain_scores_gemma":[0.99781007,0.0011424175,0.0002254859,0.00027998953,0.00038872325,0.00015333763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017333621,0.00060693355,0.0005333773,0.00097468623,0.0010770193,0.0027175108,0.0018822378,0.0012573753,0.0038396171],"category_scores_gemma":[0.0035499376,0.00041905543,0.0016404393,0.00085664034,0.004523233,0.005744236,0.0017231494,0.002001778,0.000883457],"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.000011617152,0.000015173485,0.00007306627,0.00002634297,0.0000035314133,0.00007224458,0.00020050071,0.0058182343,0.000994493,0.9902098,0.0002734557,0.0023015325],"study_design_scores_gemma":[0.00004140294,0.000029447943,0.00005960698,0.00002364298,0.0000128299835,0.000112786074,0.0000834214,0.074180275,0.0012434026,0.9145062,0.009684817,0.000022099535],"about_ca_topic_score_codex":0.0035630846,"about_ca_topic_score_gemma":0.002181812,"teacher_disagreement_score":0.0038396171,"about_ca_system_score_codex":0.0025312654,"about_ca_system_score_gemma":0.0021156652,"threshold_uncertainty_score":0.018365681},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047878098,0.0006399607,0.94559735,0.00053016766,0.00008697104,0.00017386257,0.000249011,0.00031073258,0.0045338846],"genre_scores_gemma":[0.5353,0.00085320015,0.45710152,0.00045320851,0.0002084958,0.0007056592,0.00052865845,0.00020156964,0.0046477206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99435693,0.00290323,0.00033868168,0.00080076966,0.0011450048,0.00045529247],"domain_scores_gemma":[0.9776619,0.012307357,0.0036519035,0.0026387516,0.0028244306,0.0009157113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068344628,0.0014867308,0.0012212821,0.0016699608,0.0008021818,0.0021785714,0.0011386219,0.001774773,0.0058158254],"category_scores_gemma":[0.018321764,0.0011713671,0.0007263452,0.0015280078,0.0014006803,0.0038506985,0.0014580138,0.0013017029,0.0013925849],"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.00076949626,0.00032104252,0.0032692726,0.0004842999,0.00011939437,0.00023333251,0.0003005679,0.36114988,0.020119384,0.51205844,0.0054878504,0.095687084],"study_design_scores_gemma":[0.00024578322,0.0008979952,0.00079388916,0.00015657589,0.000051569667,0.0004205204,0.00012789946,0.51837915,0.008236006,0.46110103,0.009521892,0.0000677329],"about_ca_topic_score_codex":0.00037924497,"about_ca_topic_score_gemma":0.00047859983,"teacher_disagreement_score":0.0068344628,"about_ca_system_score_codex":0.0016330376,"about_ca_system_score_gemma":0.0011257167,"threshold_uncertainty_score":0.036144495},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15805583,0.0086467145,0.78317004,0.004900751,0.00039406386,0.00009631629,0.0013088656,0.0009502139,0.04247719],"genre_scores_gemma":[0.9713,0.003208302,0.020343369,0.0004546809,0.0004435264,0.00022514368,0.0003491739,0.00015753458,0.0035181958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694985,0.0007129513,0.000103869424,0.00032050622,0.0008965747,0.0010163272],"domain_scores_gemma":[0.96507436,0.02922272,0.0015146917,0.001575022,0.0017577494,0.0008554365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036120913,0.0017952389,0.0016958031,0.002801465,0.0013658479,0.0042279945,0.0022291318,0.0016209477,0.0044178353],"category_scores_gemma":[0.026628267,0.00090003584,0.000739408,0.0027552026,0.0050257854,0.005638047,0.003522665,0.0034256198,0.00059362524],"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.00033900255,0.000097148186,0.0004058637,0.0003213111,0.00005787136,0.00028317134,0.00032334833,0.5101377,0.006963016,0.46444508,0.004341151,0.012285295],"study_design_scores_gemma":[0.000041949872,0.000047733134,0.00018808681,0.00011372022,0.000029583873,0.00009493537,0.000076151875,0.68825656,0.0036145414,0.30611998,0.0013583129,0.000058398364],"about_ca_topic_score_codex":0.002983334,"about_ca_topic_score_gemma":0.0015140913,"teacher_disagreement_score":0.0044178353,"about_ca_system_score_codex":0.0038671421,"about_ca_system_score_gemma":0.0018151124,"threshold_uncertainty_score":0.02805829},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3122611,0.00018323715,0.67221034,0.00072672893,0.000068064146,0.00012488278,0.00007489419,0.0003798685,0.013970972],"genre_scores_gemma":[0.8643208,0.00013008268,0.12966865,0.00007574872,0.000017146785,0.00008097255,0.000056320514,0.000036499274,0.0056137447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994729,0.00020672122,0.000020487156,0.00006659079,0.00015044353,0.00008275922],"domain_scores_gemma":[0.9988446,0.0007819012,0.00009455849,0.00013150112,0.00011925839,0.000028058883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008955,0.0003783415,0.00037795684,0.0006499534,0.00043675757,0.0006481237,0.00046046078,0.0005466695,0.0018603101],"category_scores_gemma":[0.0032587533,0.00014138439,0.00039446072,0.0004580764,0.0010440045,0.00064843224,0.00045618523,0.00063498574,0.00020727153],"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.00026500647,0.00006237947,0.0017737861,0.000060984454,0.0000638411,0.0002547298,0.00015431354,0.78739935,0.011850473,0.13816197,0.0009544327,0.058998816],"study_design_scores_gemma":[0.000016912834,0.000050176404,0.00017355547,0.0000071859195,0.0000082809265,0.000054996846,0.000012566707,0.97439045,0.0037072513,0.02084635,0.0007266448,0.0000057071597],"about_ca_topic_score_codex":0.0021875894,"about_ca_topic_score_gemma":0.0017993888,"teacher_disagreement_score":0.0021875894,"about_ca_system_score_codex":0.0010665618,"about_ca_system_score_gemma":0.0010028072,"threshold_uncertainty_score":0.0077385306},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012895675,0.0006674581,0.9796775,0.0002262343,0.00013787393,0.0001626159,0.00012654315,0.0012568843,0.004849151],"genre_scores_gemma":[0.14240287,0.000512858,0.85238653,0.00024199118,0.00006895361,0.0004973918,0.00039971678,0.0005120633,0.0029776029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99751174,0.0008306768,0.00020874859,0.00045771635,0.0008518367,0.00013921616],"domain_scores_gemma":[0.99254954,0.004332748,0.0006619571,0.0011560596,0.0010424653,0.00025716922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024386877,0.0010819822,0.0008980916,0.0012314498,0.0009342925,0.0014141358,0.0011842371,0.0018028308,0.0076256683],"category_scores_gemma":[0.014779615,0.00084054365,0.00089332176,0.00096869137,0.002026386,0.0017138558,0.0017832562,0.0014958938,0.0033237783],"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.00064901664,0.00023040126,0.002878252,0.0017235443,0.00009095715,0.0005764615,0.00059651135,0.22443876,0.078903876,0.35620156,0.011719776,0.3219909],"study_design_scores_gemma":[0.00023050749,0.00058060983,0.00042140236,0.00027381076,0.00007131404,0.00075380376,0.000117454925,0.49259165,0.055480246,0.39650226,0.052901935,0.00007505102],"about_ca_topic_score_codex":0.00037328745,"about_ca_topic_score_gemma":0.0004320238,"teacher_disagreement_score":0.0076256683,"about_ca_system_score_codex":0.0009380811,"about_ca_system_score_gemma":0.001282237,"threshold_uncertainty_score":0.02551043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4954807,0.0015583355,0.42857373,0.004642328,0.0003251848,0.00010520892,0.0005431563,0.00058306183,0.06818824],"genre_scores_gemma":[0.95840263,0.0009632851,0.02277018,0.0002063127,0.0001780412,0.000087223096,0.0003042255,0.0002651974,0.016822943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921155,0.00022148757,0.000041824806,0.00011458342,0.00025559595,0.0001549545],"domain_scores_gemma":[0.9944218,0.0034447159,0.0004360515,0.0007457632,0.00043138236,0.0005203747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215326,0.00051356107,0.0009798692,0.0014922901,0.002300616,0.0028643992,0.0018496404,0.0021105444,0.0077486997],"category_scores_gemma":[0.010388564,0.00046831803,0.0009535022,0.0019694553,0.0037513662,0.006325822,0.0025930197,0.0022028973,0.0005106722],"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.00003437207,0.0000091334205,0.00016778175,0.000013851384,0.0000034975155,0.000053789456,0.00010693333,0.008745191,0.00027138618,0.987608,0.00046924702,0.002516688],"study_design_scores_gemma":[0.000010800966,0.0000105625095,0.00010013368,0.0000069668204,0.0000031160462,0.000059058253,0.00005666684,0.031686567,0.00032865195,0.96666145,0.0010683925,0.0000075143457],"about_ca_topic_score_codex":0.0036632335,"about_ca_topic_score_gemma":0.0015348018,"teacher_disagreement_score":0.0077486997,"about_ca_system_score_codex":0.0014592091,"about_ca_system_score_gemma":0.0010373999,"threshold_uncertainty_score":0.02592194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01818086,0.000146206,0.9772562,0.00020643574,0.000044425873,0.00005261644,0.000045693643,0.00024857649,0.0038190598],"genre_scores_gemma":[0.48502687,0.00020706985,0.5105699,0.00013748805,0.00003857347,0.00017819149,0.00014155671,0.00006288733,0.003637426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996457,0.00008598446,0.000017469985,0.00007258683,0.00013160182,0.000046584453],"domain_scores_gemma":[0.9996675,0.00013226527,0.000046112993,0.00003978909,0.00008068483,0.000033660628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037538508,0.00041032306,0.0005141743,0.0004348288,0.00043733235,0.0005120023,0.0008067791,0.0005602121,0.0015182253],"category_scores_gemma":[0.0010683256,0.00029810308,0.00042484532,0.0006421057,0.00047666606,0.00047568016,0.00064697576,0.000501488,0.00021372447],"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.00005500993,0.00002550572,0.0003902565,0.000048410166,0.000015854708,0.00006756233,0.000047244033,0.9448002,0.0038273674,0.011707349,0.0010477658,0.037967503],"study_design_scores_gemma":[0.000008536383,0.000023655823,0.00007689019,0.0000023503164,0.0000036696183,0.000019188994,0.000009503427,0.99575186,0.0007057745,0.002534212,0.0008604525,0.0000039985725],"about_ca_topic_score_codex":0.0077618286,"about_ca_topic_score_gemma":0.0058059576,"teacher_disagreement_score":0.0077618286,"about_ca_system_score_codex":0.00084527844,"about_ca_system_score_gemma":0.0011674261,"threshold_uncertainty_score":0.015433311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5115188,0.000595488,0.44315335,0.0014578823,0.00023464079,0.00008936602,0.0005862737,0.0012565455,0.04110773],"genre_scores_gemma":[0.95076054,0.00023404286,0.031353097,0.00035225053,0.0001566152,0.000121323545,0.00047704508,0.0004730141,0.016071938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980562,0.0004012576,0.00017272972,0.00046422787,0.00044007998,0.0004654971],"domain_scores_gemma":[0.99124616,0.005128079,0.00063809234,0.0013354863,0.00082722283,0.000824931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020599284,0.00067740143,0.0016287349,0.0017330709,0.0033598167,0.003866692,0.0016838755,0.0013412564,0.006853005],"category_scores_gemma":[0.0092770895,0.0008032898,0.0016078707,0.0018925427,0.0046634357,0.009589749,0.00502745,0.0033663407,0.00086553185],"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.00012259673,0.000024944262,0.00024082013,0.000030217292,0.0000076744645,0.00019013904,0.0005104272,0.0013908003,0.0010825761,0.98967654,0.0006429873,0.006080267],"study_design_scores_gemma":[0.000028929535,0.000022402262,0.00008935875,0.000008183907,0.000008167658,0.00020640974,0.00011583783,0.0033321201,0.0012298283,0.99341655,0.0015282846,0.000013990556],"about_ca_topic_score_codex":0.0010208951,"about_ca_topic_score_gemma":0.0008482287,"teacher_disagreement_score":0.006853005,"about_ca_system_score_codex":0.0014055569,"about_ca_system_score_gemma":0.0011258096,"threshold_uncertainty_score":0.022925615},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10190852,0.00019568607,0.87642527,0.0015117951,0.00021826237,0.00006768446,0.000107989705,0.0006912313,0.018873554],"genre_scores_gemma":[0.62191516,0.00018628179,0.35864243,0.00045754111,0.0001559359,0.00019177754,0.00033555445,0.00034525685,0.017770065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922323,0.00027986272,0.00003177431,0.0001665212,0.00018528641,0.00011327854],"domain_scores_gemma":[0.996393,0.0027506263,0.00014073828,0.00039325544,0.00020853714,0.000113805196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011054112,0.0005956142,0.00094427087,0.0005906907,0.001197705,0.0014536711,0.0014685238,0.0020629643,0.007294358],"category_scores_gemma":[0.0075711156,0.000395228,0.0007510064,0.00079795136,0.0019386461,0.0033686066,0.0027994544,0.0024410007,0.0011496274],"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.00045848967,0.00020229166,0.0004859428,0.00022577705,0.00003569414,0.00021735784,0.00026280907,0.15245868,0.0062656817,0.73939604,0.0059416355,0.09404958],"study_design_scores_gemma":[0.00008413405,0.00006736162,0.00005822251,0.000013195303,0.000009404857,0.0000344855,0.00005225995,0.27893528,0.004264847,0.7134947,0.0029707502,0.000015420532],"about_ca_topic_score_codex":0.0011394623,"about_ca_topic_score_gemma":0.0012814605,"teacher_disagreement_score":0.007294358,"about_ca_system_score_codex":0.0007530646,"about_ca_system_score_gemma":0.0013281622,"threshold_uncertainty_score":0.024402082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03350483,0.0024712426,0.9487997,0.0014865833,0.00026516922,0.000072460876,0.0003345286,0.00025119272,0.012814133],"genre_scores_gemma":[0.5528978,0.0070618438,0.41670358,0.0005684975,0.0009948226,0.0005215841,0.0012084938,0.00046312634,0.019580254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983425,0.00058146304,0.00015756207,0.00030995838,0.00042412494,0.00018435915],"domain_scores_gemma":[0.99168396,0.005806377,0.0008782036,0.00062120636,0.0006353901,0.00037474648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017883809,0.0010249711,0.0007836146,0.0017507726,0.0011450425,0.0020623892,0.0011238974,0.0016402886,0.0066963704],"category_scores_gemma":[0.008485015,0.00033494883,0.0013099432,0.0029949695,0.004017615,0.006221684,0.0022136013,0.0023989275,0.0011587446],"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.0000258228,0.000014323758,0.00017079608,0.00005725461,0.000006655444,0.00012711178,0.00011777801,0.012598135,0.0010491699,0.9742321,0.0005580406,0.01104298],"study_design_scores_gemma":[0.0000073987617,0.00004016272,0.00006471252,0.000020246573,0.0000043257505,0.00012920571,0.00005424054,0.041135013,0.00095053785,0.9521983,0.0053798067,0.000016041686],"about_ca_topic_score_codex":0.0014721544,"about_ca_topic_score_gemma":0.00076099037,"teacher_disagreement_score":0.0066963704,"about_ca_system_score_codex":0.0013858151,"about_ca_system_score_gemma":0.0010170116,"threshold_uncertainty_score":0.022401571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019779086,0.00015812945,0.9525271,0.00094528147,0.000099514094,0.00029473976,0.00010449656,0.000766859,0.025324818],"genre_scores_gemma":[0.27523816,0.00038329617,0.7072176,0.00043146138,0.000050069946,0.0011690056,0.00027743872,0.00025087578,0.014982131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992035,0.00020855654,0.00011248432,0.00015094125,0.00025494923,0.00006972969],"domain_scores_gemma":[0.99907625,0.00020106966,0.00012857051,0.00030619546,0.00019795501,0.00008984437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089658174,0.00045359886,0.00035960568,0.00055883644,0.0006630146,0.0014471435,0.000827904,0.0010484618,0.0038184822],"category_scores_gemma":[0.0020658781,0.00029960347,0.00064761826,0.00046362286,0.0016927916,0.0015830263,0.0014432452,0.0007672317,0.0010915846],"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.00007957035,0.00007655316,0.001024969,0.0002988774,0.00003638788,0.0004694241,0.00058197184,0.024110258,0.020759728,0.8811199,0.0037078292,0.067734525],"study_design_scores_gemma":[0.00017140484,0.00024887695,0.00054562703,0.000110015484,0.00006424194,0.0010023962,0.00030096344,0.16879925,0.023651663,0.67082345,0.13423069,0.000051358715],"about_ca_topic_score_codex":0.00051605015,"about_ca_topic_score_gemma":0.00077622087,"teacher_disagreement_score":0.0038184822,"about_ca_system_score_codex":0.0006959265,"about_ca_system_score_gemma":0.00093088264,"threshold_uncertainty_score":0.01277411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079669274,0.0035267873,0.67317915,0.005544046,0.0009740037,0.00014947055,0.00049637083,0.00072060066,0.2357404],"genre_scores_gemma":[0.84956104,0.002815321,0.085283145,0.0010383938,0.00081659836,0.00033458968,0.00059863896,0.0003301354,0.05922219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992428,0.0002441545,0.000052436295,0.00016637414,0.00019135288,0.00010297208],"domain_scores_gemma":[0.9980762,0.0012278376,0.00008550211,0.00034770323,0.00015735262,0.000105268955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095345406,0.0008828368,0.0010774055,0.00087765773,0.001464513,0.0027143257,0.0011445977,0.0014711398,0.011132596],"category_scores_gemma":[0.004927656,0.0006080455,0.000954618,0.0013168355,0.0036270719,0.0064115776,0.0035773457,0.002860016,0.0011935123],"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.000018561737,0.0000067609612,0.00010528042,0.00003533161,0.00000831963,0.00009721241,0.0000984393,0.00447996,0.0002101565,0.9841351,0.0018040357,0.009000768],"study_design_scores_gemma":[0.0000053998842,0.0000031624534,0.000020292937,0.000004136549,0.0000024987878,0.00002860314,0.000010105548,0.005284466,0.000055018965,0.9933297,0.0012540831,0.0000023335042],"about_ca_topic_score_codex":0.0010178636,"about_ca_topic_score_gemma":0.00084624346,"teacher_disagreement_score":0.011132596,"about_ca_system_score_codex":0.0007021995,"about_ca_system_score_gemma":0.0005381507,"threshold_uncertainty_score":0.037242234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06062687,0.00076508714,0.9203336,0.0029842744,0.0001671677,0.000163827,0.00051201903,0.0018564627,0.012590647],"genre_scores_gemma":[0.7060848,0.00085454306,0.28135967,0.0009731469,0.0002687006,0.00032801105,0.0008184397,0.0008867492,0.008425901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99431336,0.0023404923,0.0005176898,0.0008269858,0.0013721004,0.0006293399],"domain_scores_gemma":[0.9843491,0.011658911,0.0007896792,0.0015321797,0.0012669768,0.00040319253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049801758,0.000609528,0.0009543456,0.0018135174,0.0025108135,0.0040135076,0.0017258747,0.0024905757,0.004056013],"category_scores_gemma":[0.021556927,0.0010654365,0.0014269997,0.0022784024,0.0071167476,0.011165184,0.0042984043,0.0038613123,0.000763053],"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.000027426799,0.00001576529,0.00040702918,0.000060043592,0.000009094121,0.00033133713,0.00091874535,0.0075915214,0.00062304485,0.9810898,0.00084651465,0.00807971],"study_design_scores_gemma":[0.000011237206,0.000007755177,0.000071942915,0.00001316459,0.0000073054425,0.00012138857,0.00009143808,0.019601807,0.0007291696,0.97573644,0.0035913377,0.000017041835],"about_ca_topic_score_codex":0.0038696355,"about_ca_topic_score_gemma":0.002660895,"teacher_disagreement_score":0.0049801758,"about_ca_system_score_codex":0.0024340139,"about_ca_system_score_gemma":0.0025819268,"threshold_uncertainty_score":0.026337981},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02976038,0.00057024084,0.9432078,0.0012264816,0.00022762509,0.00007572427,0.00029134884,0.0005676608,0.024072712],"genre_scores_gemma":[0.4407289,0.0010653768,0.53109497,0.0012523234,0.00045427796,0.00069319905,0.001038338,0.0008000742,0.022872591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647635,0.001132661,0.00015660452,0.00049754884,0.0012608638,0.00047601367],"domain_scores_gemma":[0.99077237,0.0056756907,0.00037332097,0.0016774142,0.0008921309,0.0006091241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00241966,0.0011135787,0.0014100765,0.0020071722,0.0015271591,0.003036175,0.0027867467,0.0015973184,0.0065594288],"category_scores_gemma":[0.014242174,0.000891024,0.0015890972,0.0023775366,0.0033404343,0.004169787,0.006540086,0.004586765,0.0016902585],"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.0001010479,0.000040254265,0.00017558946,0.000070082664,0.000015950134,0.00002828635,0.00010049234,0.02737211,0.0018951533,0.94702303,0.0029857543,0.020192116],"study_design_scores_gemma":[0.000026934518,0.000033358097,0.00007567542,0.00003372564,0.000011472076,0.000029371928,0.000024545894,0.10165961,0.0021809659,0.8918957,0.0040045455,0.000024156061],"about_ca_topic_score_codex":0.0013610875,"about_ca_topic_score_gemma":0.0020725075,"teacher_disagreement_score":0.0065594288,"about_ca_system_score_codex":0.0029800124,"about_ca_system_score_gemma":0.002370292,"threshold_uncertainty_score":0.02194351},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18814716,0.0051702005,0.721133,0.0071018906,0.0019588007,0.0005194722,0.00073992525,0.0013855711,0.07384397],"genre_scores_gemma":[0.90972483,0.0016045516,0.06931141,0.0006581928,0.0006841345,0.00022375755,0.0003318795,0.00007015522,0.01739107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998635,0.00030886958,0.000100084195,0.00021073464,0.00054424617,0.00020101076],"domain_scores_gemma":[0.9990626,0.00029180554,0.00013321334,0.00028206586,0.00016247312,0.00006786931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912229,0.0005610366,0.00055568747,0.0007534071,0.00077814574,0.0013830108,0.0006550312,0.0009896231,0.0035656083],"category_scores_gemma":[0.0018955087,0.00029208124,0.00035669052,0.0012415567,0.0012142851,0.0032918544,0.00206525,0.0018353427,0.0012895592],"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.0009656452,0.00019707727,0.00077364047,0.00043959802,0.00006743451,0.00035185704,0.0002052871,0.01049068,0.065805085,0.7717998,0.00859387,0.14031005],"study_design_scores_gemma":[0.0006966318,0.00069432764,0.0009087941,0.00015922818,0.00013433737,0.0014106754,0.00009326032,0.09369102,0.18567492,0.6419024,0.074490696,0.0001436982],"about_ca_topic_score_codex":0.0001922946,"about_ca_topic_score_gemma":0.00015033687,"teacher_disagreement_score":0.0035656083,"about_ca_system_score_codex":0.0012048142,"about_ca_system_score_gemma":0.0017910294,"threshold_uncertainty_score":0.011928141},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17192963,0.001145477,0.7441522,0.0019829876,0.000301811,0.00008686373,0.00024446993,0.0007147209,0.07944186],"genre_scores_gemma":[0.7810902,0.00091472606,0.18105711,0.00061730377,0.00038987742,0.0002581761,0.0010038759,0.00088489644,0.033783816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983845,0.0005092906,0.00009727803,0.00029217813,0.0004969051,0.00021992908],"domain_scores_gemma":[0.9938775,0.0039975387,0.00032941566,0.0008206948,0.0006053129,0.000369643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013426809,0.0005422085,0.0008901835,0.001640333,0.0022088974,0.002390838,0.0013586611,0.0012231668,0.008469668],"category_scores_gemma":[0.011692194,0.0007668673,0.00097028527,0.0015467972,0.003491143,0.006791161,0.0044787433,0.0020885507,0.0013131596],"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.00005992397,0.00001710296,0.00034963764,0.000046972782,0.0000071089207,0.00010924957,0.00036657997,0.005868452,0.00097152416,0.9757608,0.0013729313,0.015069722],"study_design_scores_gemma":[0.000009394282,0.000019253695,0.0002443935,0.000027900915,0.000006533196,0.00009939146,0.00013021399,0.051496215,0.0009614182,0.9414002,0.0055930256,0.000011971274],"about_ca_topic_score_codex":0.002587882,"about_ca_topic_score_gemma":0.002608925,"teacher_disagreement_score":0.008469668,"about_ca_system_score_codex":0.0008968598,"about_ca_system_score_gemma":0.00070193957,"threshold_uncertainty_score":0.028333843},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25350282,0.00038105028,0.046668362,0.0040731155,0.0015247527,0.00018640017,0.00294748,0.0015716683,0.6891444],"genre_scores_gemma":[0.93055147,0.00014789554,0.010613854,0.00077336346,0.00030484027,0.000115171366,0.0027281572,0.001114952,0.05365031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984938,0.00023801984,0.00016384094,0.0004187302,0.00046650667,0.0002192271],"domain_scores_gemma":[0.9966905,0.0010611144,0.00025135485,0.00092045305,0.0008952249,0.00018126247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010064864,0.0005851324,0.00059917883,0.00084549794,0.002198237,0.0019429927,0.0008613762,0.001631517,0.03606],"category_scores_gemma":[0.003813081,0.000406874,0.0003278714,0.0012496219,0.0022436108,0.0050652586,0.0030170542,0.0026226393,0.009019879],"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.0013288804,0.00022880334,0.009914336,0.00029331734,0.00004662741,0.0015125755,0.014732221,0.00020748752,0.06515677,0.77865446,0.026162824,0.10176173],"study_design_scores_gemma":[0.0001404787,0.0003392117,0.019412464,0.00017679141,0.00007083019,0.0040025357,0.01507701,0.0030984469,0.059627805,0.18516998,0.7126874,0.00019714591],"about_ca_topic_score_codex":0.002487373,"about_ca_topic_score_gemma":0.002727617,"teacher_disagreement_score":0.03606,"about_ca_system_score_codex":0.00087254995,"about_ca_system_score_gemma":0.001077576,"threshold_uncertainty_score":0.12063271},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008266826,0.000044343145,0.9731804,0.00027931703,0.000075334116,0.00020892781,0.00014314661,0.014587329,0.0032143507],"genre_scores_gemma":[0.10499208,0.000102903745,0.88069975,0.00036969467,0.000047012407,0.0007122518,0.0008015558,0.0035006464,0.008774071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986481,0.0005627558,0.00013954075,0.00018801179,0.00037710188,0.00008450919],"domain_scores_gemma":[0.9967705,0.0022334487,0.0000963318,0.0003606424,0.00035237148,0.00018679963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002701053,0.0007613399,0.0006509378,0.00065905694,0.0008924591,0.0028579251,0.0024676789,0.0022192239,0.014505474],"category_scores_gemma":[0.007837513,0.0008165463,0.0011214655,0.00032454598,0.0011245448,0.004600905,0.0043088268,0.002563881,0.0034733668],"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.001433157,0.0011611268,0.0028339701,0.0014736899,0.00024173134,0.0027259977,0.012809723,0.04416224,0.14233187,0.2502629,0.062267408,0.4782962],"study_design_scores_gemma":[0.00041034195,0.0002810735,0.00042293902,0.00013417902,0.00015785864,0.0008098631,0.000754943,0.58834326,0.073578484,0.082850434,0.25209767,0.00015895024],"about_ca_topic_score_codex":0.0009599724,"about_ca_topic_score_gemma":0.0012464847,"teacher_disagreement_score":0.014505474,"about_ca_system_score_codex":0.0005286794,"about_ca_system_score_gemma":0.0005565521,"threshold_uncertainty_score":0.04852563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063224435,0.088868044,0.56633985,0.013404871,0.0020520936,0.00020474393,0.0005808069,0.0010449674,0.26428014],"genre_scores_gemma":[0.70386076,0.0446073,0.21152242,0.0032882115,0.003056953,0.000793959,0.0005242011,0.00037401065,0.031972256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980525,0.0005413882,0.0001105464,0.0005173373,0.00060300797,0.00017535516],"domain_scores_gemma":[0.9948737,0.003901471,0.00017634344,0.0004264137,0.0004525002,0.0001696192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018278838,0.001039939,0.0009569834,0.001965475,0.0013598384,0.0031894555,0.0009595695,0.0018612338,0.0037648343],"category_scores_gemma":[0.008316656,0.0005571497,0.00049433904,0.0033756515,0.0054970267,0.0060429033,0.0023820559,0.004722702,0.0018700244],"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.000049614053,0.000014977625,0.00016550816,0.00018731739,0.000008453769,0.000069063775,0.00012258909,0.007418399,0.0008771832,0.96454483,0.0031317198,0.023410235],"study_design_scores_gemma":[0.0000091062,0.000022030206,0.00012279216,0.00006762756,0.000005733789,0.00007162717,0.00002740093,0.016184516,0.0007852303,0.9598589,0.022832321,0.00001263863],"about_ca_topic_score_codex":0.0014401177,"about_ca_topic_score_gemma":0.0009378497,"teacher_disagreement_score":0.0037648343,"about_ca_system_score_codex":0.0027225201,"about_ca_system_score_gemma":0.0011911704,"threshold_uncertainty_score":0.019753337},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047131157,0.016229877,0.82573575,0.006783331,0.0011192523,0.0000784537,0.000100696394,0.00024692426,0.14499262],"genre_scores_gemma":[0.37219083,0.030983001,0.53508335,0.0053571514,0.0034971563,0.00058110966,0.00020680306,0.00036368484,0.051736806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984479,0.0006782636,0.00010687494,0.00025367373,0.00038885153,0.00012443884],"domain_scores_gemma":[0.9993075,0.00046789067,0.000035749574,0.000069660506,0.0000939211,0.00002533299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016874736,0.00056028046,0.0006202491,0.0010183384,0.001486461,0.0020687378,0.0013301332,0.0017779457,0.005623896],"category_scores_gemma":[0.002838454,0.0002911951,0.001476149,0.0021495218,0.0030619435,0.0037641795,0.001263457,0.0028860949,0.0011593761],"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.0000032291953,0.0000041509343,0.000041146057,0.00004698077,0.0000046220985,0.00006770201,0.000099815385,0.0011711689,0.00016878701,0.9908342,0.001174786,0.006383453],"study_design_scores_gemma":[0.000006083764,0.000020601829,0.00008980958,0.00005696647,0.000008545358,0.0002770153,0.000038602535,0.012549866,0.00040761032,0.9226789,0.06385284,0.000013214336],"about_ca_topic_score_codex":0.0016890689,"about_ca_topic_score_gemma":0.001052909,"teacher_disagreement_score":0.005623896,"about_ca_system_score_codex":0.0013567648,"about_ca_system_score_gemma":0.00085086364,"threshold_uncertainty_score":0.018813848},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13075686,0.015089475,0.7509825,0.0012008168,0.00073935534,0.00039082827,0.0007429225,0.0031245027,0.09697269],"genre_scores_gemma":[0.7940464,0.0063044745,0.15041071,0.00047387474,0.00007870874,0.00019962227,0.001504029,0.00022113559,0.04676102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980634,0.000027179556,0.000008146864,0.000052197764,0.000079086574,0.000027031387],"domain_scores_gemma":[0.9997527,0.00008104014,0.00004434446,0.00006205497,0.000024711202,0.00003523872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002380421,0.00024651308,0.0002846859,0.00030711232,0.0003097538,0.00073545123,0.0005560655,0.0006465868,0.0036062736],"category_scores_gemma":[0.0009184631,0.00011956608,0.00034677604,0.00037552806,0.00058201037,0.0006539991,0.0005673,0.00066464266,0.001669917],"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.00015733344,0.00011035344,0.0011209241,0.0006660275,0.000036906145,0.00039643497,0.0002638299,0.011841969,0.20401211,0.5695959,0.009303886,0.20249446],"study_design_scores_gemma":[0.00008521945,0.00035525954,0.0013694904,0.00008792503,0.00004530588,0.0046442067,0.0001833959,0.16401501,0.3198035,0.19972195,0.30961433,0.00007439582],"about_ca_topic_score_codex":0.00050313555,"about_ca_topic_score_gemma":0.0004167155,"teacher_disagreement_score":0.0036062736,"about_ca_system_score_codex":0.00045234582,"about_ca_system_score_gemma":0.0002534822,"threshold_uncertainty_score":0.012064159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5087847,0.00081986125,0.47299892,0.0019144949,0.000035917154,0.00015549606,0.001859868,0.0003932393,0.013037543],"genre_scores_gemma":[0.9286476,0.00052585074,0.06483537,0.00019243252,0.00005044314,0.00025278714,0.0019186874,0.00014906407,0.0034278168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726796,0.00072218,0.00025215873,0.00044884454,0.00095032214,0.00035848867],"domain_scores_gemma":[0.9880795,0.009015081,0.0007713225,0.00096170773,0.0008039439,0.00036857848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064631,0.00045167303,0.00062265346,0.0014033287,0.00096786435,0.0026755254,0.0012070702,0.00096659776,0.0032302036],"category_scores_gemma":[0.011793859,0.000492275,0.0014297174,0.001553528,0.002423421,0.0072483555,0.0020909829,0.0016853926,0.00033274954],"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.00014067745,0.0000620099,0.0042356015,0.00023318193,0.000071465794,0.0003667286,0.0010979942,0.07379334,0.0060056886,0.8886526,0.0015512643,0.023789514],"study_design_scores_gemma":[0.000017733635,0.000025105883,0.00069317524,0.000017394766,0.000027261094,0.00019920415,0.00015690984,0.14441513,0.0034882976,0.84829646,0.0026299316,0.000033346823],"about_ca_topic_score_codex":0.0031904578,"about_ca_topic_score_gemma":0.0020334471,"teacher_disagreement_score":0.0032302036,"about_ca_system_score_codex":0.0027946504,"about_ca_system_score_gemma":0.0014159166,"threshold_uncertainty_score":0.020276725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7874815,0.00013144323,0.19838336,0.0020998472,0.00013063943,0.00018501974,0.0005503155,0.001535947,0.009501937],"genre_scores_gemma":[0.93273115,0.000105802996,0.06360907,0.00044045498,0.00016568179,0.00011773958,0.0010507545,0.0002146549,0.0015647432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955754,0.000975707,0.0004999841,0.0014766539,0.00088471314,0.00058758433],"domain_scores_gemma":[0.9754826,0.019018183,0.0014825161,0.0013961685,0.0016048865,0.0010156281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034097864,0.00035574302,0.00075796584,0.0007592584,0.0012698107,0.003046036,0.000959298,0.0014959374,0.0033865308],"category_scores_gemma":[0.014359743,0.0007092225,0.0014966989,0.0004372727,0.004680865,0.006107789,0.0020677475,0.0018219573,0.000606377],"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.0031966497,0.000631024,0.030427491,0.0012282513,0.0004376738,0.0048739137,0.004240078,0.03790394,0.18832,0.63933283,0.0074029136,0.08200525],"study_design_scores_gemma":[0.00028559013,0.00045722336,0.0037528318,0.00009963516,0.00024240861,0.0016568372,0.0012716125,0.15400112,0.13074483,0.6992537,0.008039123,0.00019515675],"about_ca_topic_score_codex":0.0005021739,"about_ca_topic_score_gemma":0.00044621667,"teacher_disagreement_score":0.0034097864,"about_ca_system_score_codex":0.0009085771,"about_ca_system_score_gemma":0.0013528082,"threshold_uncertainty_score":0.018032908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09947855,0.010286204,0.7858223,0.0071140593,0.0013967486,0.00019754039,0.0019728737,0.000877125,0.09285467],"genre_scores_gemma":[0.8174292,0.007395942,0.11443778,0.0019342918,0.0023052888,0.000751038,0.0017354015,0.00040182352,0.053609293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970186,0.0013657648,0.00019344098,0.00046325108,0.0006561228,0.0003029089],"domain_scores_gemma":[0.99343735,0.003926124,0.00086962344,0.00085199944,0.0004336673,0.00048125462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023314164,0.0012587934,0.0012443104,0.0028711872,0.0015642466,0.0055583236,0.0017257426,0.0017627607,0.009206099],"category_scores_gemma":[0.0132479435,0.00070545165,0.0012061594,0.0024740244,0.0050719096,0.006204437,0.0021976628,0.0024626448,0.0026247406],"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.000023042916,0.000009827659,0.00015298865,0.00004297911,0.0000102113545,0.00007102288,0.000045958306,0.0025250497,0.00025457182,0.9895682,0.0024180585,0.004878218],"study_design_scores_gemma":[0.000013769555,0.000014236444,0.000101972386,0.000022801729,0.000009197246,0.0001610413,0.000039588132,0.010278198,0.0002453606,0.9829662,0.0061333193,0.000014369108],"about_ca_topic_score_codex":0.00071253494,"about_ca_topic_score_gemma":0.0011614873,"teacher_disagreement_score":0.009206099,"about_ca_system_score_codex":0.0015381009,"about_ca_system_score_gemma":0.0012924469,"threshold_uncertainty_score":0.030797422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6196794,0.0023647777,0.2573768,0.0020684176,0.00028595683,0.00008232701,0.00060271437,0.00048782633,0.11705178],"genre_scores_gemma":[0.95492876,0.0005855524,0.023964407,0.0002683517,0.00032592108,0.00007678769,0.00036227066,0.000106623695,0.019381357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924916,0.00021300401,0.000050313865,0.00019150489,0.00016791085,0.00012811487],"domain_scores_gemma":[0.9967464,0.0018785836,0.00042222583,0.0003162057,0.00026022107,0.00037633174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087269384,0.00025385563,0.0005499219,0.0016604664,0.0015371207,0.0021923555,0.00060518796,0.0007339819,0.004996165],"category_scores_gemma":[0.005068191,0.000353872,0.0005906747,0.0010176116,0.00272226,0.0036585496,0.0015905845,0.0009609117,0.00052833406],"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.0000557462,0.000015558751,0.0010585632,0.000039699757,0.000010557237,0.00012954262,0.00031602292,0.0014857852,0.0012136077,0.9852604,0.0010777613,0.009336694],"study_design_scores_gemma":[0.000014864083,0.000015798321,0.0011484431,0.000018191355,0.000017761278,0.00040468937,0.0001998529,0.010138209,0.0010340039,0.9806528,0.0063394485,0.00001592577],"about_ca_topic_score_codex":0.0016104033,"about_ca_topic_score_gemma":0.0028604155,"teacher_disagreement_score":0.004996165,"about_ca_system_score_codex":0.00089236937,"about_ca_system_score_gemma":0.0005812559,"threshold_uncertainty_score":0.016713798},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029044636,0.0029835454,0.62739474,0.0028561307,0.0013362416,0.00029516782,0.002137318,0.00222639,0.33172584],"genre_scores_gemma":[0.54811525,0.0029454427,0.2329474,0.0021539691,0.0013146687,0.0008776552,0.00584005,0.0015342166,0.20427136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983485,0.00044129565,0.00014248145,0.00031112233,0.00051269727,0.00024390922],"domain_scores_gemma":[0.99861705,0.0005734971,0.00009182702,0.0003784159,0.00022196143,0.00011719971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011320814,0.00095429516,0.00081294123,0.0023912236,0.0025265494,0.004596365,0.0014926149,0.0012567288,0.028378775],"category_scores_gemma":[0.0035136899,0.0005220999,0.0018283041,0.002130934,0.0027174305,0.0059638326,0.0039663934,0.0029552265,0.009114321],"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.000011532374,0.000014702214,0.00004250058,0.00003326318,0.000007550605,0.000034972192,0.00007708803,0.0005477541,0.0002019303,0.9866296,0.0035608062,0.008838322],"study_design_scores_gemma":[0.000007837105,0.0000074949826,0.00003623516,0.00001612197,0.000007500609,0.000060476792,0.000035233807,0.0019983463,0.00037356658,0.9761332,0.021313738,0.000010280343],"about_ca_topic_score_codex":0.0017095048,"about_ca_topic_score_gemma":0.0028620264,"teacher_disagreement_score":0.028378775,"about_ca_system_score_codex":0.0019920527,"about_ca_system_score_gemma":0.0012616388,"threshold_uncertainty_score":0.09493649},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11286381,0.0023106665,0.5411738,0.003905817,0.0012421571,0.00020859599,0.0025014586,0.001467498,0.33432612],"genre_scores_gemma":[0.7970134,0.0017358611,0.106530786,0.0019465387,0.00041144647,0.0004947909,0.0021349774,0.00066711754,0.089065105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811053,0.000377415,0.00013064302,0.0005008517,0.0004535606,0.00042702307],"domain_scores_gemma":[0.99562585,0.0018356167,0.00035693785,0.001177509,0.0004229761,0.0005811303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007107598,0.0007907961,0.0004719869,0.0018303345,0.001696513,0.0032268187,0.0014069697,0.001974458,0.027356133],"category_scores_gemma":[0.008516327,0.000588406,0.00091328344,0.0020610786,0.0034695824,0.0073719085,0.003876107,0.0028345857,0.0025949467],"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.000036811634,0.000010622406,0.00012281901,0.000037468042,0.000004338151,0.00009498768,0.000096379044,0.00042583313,0.0003207498,0.98973644,0.0022164823,0.0068970826],"study_design_scores_gemma":[0.000011376574,0.000013422981,0.00015268619,0.000031559157,0.000008013455,0.00020880916,0.00009097948,0.0016589141,0.00072300044,0.9782146,0.018869221,0.000017479308],"about_ca_topic_score_codex":0.0011189599,"about_ca_topic_score_gemma":0.0015283761,"teacher_disagreement_score":0.027356133,"about_ca_system_score_codex":0.0008839745,"about_ca_system_score_gemma":0.0008788929,"threshold_uncertainty_score":0.0915153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3856324,0.0048183803,0.559808,0.0028874306,0.0001150357,0.00010441347,0.00056601956,0.00029259504,0.045775753],"genre_scores_gemma":[0.9558871,0.0012915474,0.03847955,0.00010184877,0.00010166856,0.0001490922,0.0001924958,0.000036957426,0.0037598114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877447,0.00023619902,0.000085142085,0.00031648186,0.00042416138,0.0001635794],"domain_scores_gemma":[0.99283445,0.0054725823,0.00056536525,0.00046013144,0.00046985803,0.000197638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016939,0.00029205033,0.00053333153,0.000925944,0.00077150785,0.002340648,0.0008450091,0.0010719759,0.0017760145],"category_scores_gemma":[0.008460014,0.00031761054,0.00048345973,0.00084672833,0.0032023264,0.0041154586,0.0011457672,0.0017372452,0.00018914863],"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.00004129027,0.000012415619,0.00055654667,0.000062035724,0.000008090979,0.0000611191,0.00021032235,0.022670122,0.002380248,0.9665815,0.00022550764,0.0071908436],"study_design_scores_gemma":[0.0000068336026,0.000014752842,0.00030900526,0.000014277374,0.000005451404,0.00006121955,0.000043297463,0.08249808,0.0019428082,0.91344064,0.0016453025,0.000018287808],"about_ca_topic_score_codex":0.0016387664,"about_ca_topic_score_gemma":0.00091310736,"teacher_disagreement_score":0.002340648,"about_ca_system_score_codex":0.0018325634,"about_ca_system_score_gemma":0.00084227667,"threshold_uncertainty_score":0.013296187},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20809205,0.0013082346,0.3640743,0.0019129831,0.0035687068,0.00029164224,0.003041313,0.004914142,0.4127966],"genre_scores_gemma":[0.7781606,0.00085167354,0.043086205,0.0007953239,0.0004746773,0.00019160396,0.0034375577,0.0010698054,0.17193262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991648,0.00013364639,0.00005292357,0.00022103473,0.00022784589,0.00019973813],"domain_scores_gemma":[0.99903935,0.00022632137,0.00012818817,0.0003265125,0.00013929751,0.0001403294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000492229,0.0006659803,0.00048931834,0.0009812822,0.00096690713,0.0019804405,0.0009554797,0.0005265687,0.030653259],"category_scores_gemma":[0.00177775,0.00020006705,0.0006512406,0.00072470936,0.0010774543,0.002058009,0.002260173,0.0012700502,0.008631107],"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.0002568972,0.000101296224,0.001094663,0.00017544164,0.00006561448,0.00045950103,0.00036912,0.0011270992,0.023022959,0.8614891,0.01775214,0.09408621],"study_design_scores_gemma":[0.00008292042,0.00020684241,0.0012822988,0.000087169865,0.00006518829,0.0011272602,0.00048084138,0.005260341,0.045274917,0.7533162,0.19274636,0.00006964417],"about_ca_topic_score_codex":0.0007905169,"about_ca_topic_score_gemma":0.00094144786,"teacher_disagreement_score":0.030653259,"about_ca_system_score_codex":0.0006482957,"about_ca_system_score_gemma":0.0006916381,"threshold_uncertainty_score":0.10254538},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15556157,0.005688085,0.7732986,0.0015085601,0.0003741719,0.000193718,0.00019506109,0.0009798926,0.062200326],"genre_scores_gemma":[0.85518134,0.0017849301,0.13282493,0.00043280917,0.00006068088,0.00030310653,0.00026873167,0.0001592421,0.0089843515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956816,0.00017069333,0.000016232783,0.0000862994,0.00009992896,0.00005871569],"domain_scores_gemma":[0.9988417,0.0007743081,0.00010935094,0.00014000156,0.00007037493,0.00006438362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009720988,0.00053359085,0.0007545491,0.0005012863,0.00063212786,0.0014528399,0.00094126037,0.00146808,0.0034841096],"category_scores_gemma":[0.004332446,0.00034915705,0.00050378917,0.0006167711,0.0016252827,0.0017112618,0.0014381559,0.0007825304,0.0009033228],"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.00018818429,0.00010060769,0.0013274334,0.0002700919,0.00014787048,0.0003080792,0.00014993019,0.65893877,0.008213154,0.27223945,0.0029844816,0.05513197],"study_design_scores_gemma":[0.000085281055,0.00015679395,0.00038223818,0.000034126428,0.0000356198,0.00029491226,0.000079162804,0.809553,0.0037413144,0.16893382,0.016671488,0.000032214935],"about_ca_topic_score_codex":0.0008221219,"about_ca_topic_score_gemma":0.0006468802,"teacher_disagreement_score":0.0034841096,"about_ca_system_score_codex":0.00062591344,"about_ca_system_score_gemma":0.0006684147,"threshold_uncertainty_score":0.01165545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14318869,0.0006017502,0.82114166,0.0006600908,0.00021826259,0.00011923588,0.0019331556,0.005263025,0.026874132],"genre_scores_gemma":[0.8588374,0.00022249577,0.12678802,0.00018009273,0.00004795642,0.00016863683,0.0012359562,0.0003758018,0.012143706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910825,0.0002117356,0.00009716231,0.00027885864,0.00015684844,0.00014706049],"domain_scores_gemma":[0.997336,0.0012874859,0.00022407508,0.00064784806,0.0003127493,0.00019181444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066724676,0.00035335403,0.0006598432,0.00068000454,0.0009605693,0.0021557075,0.0015438859,0.0009955813,0.003879255],"category_scores_gemma":[0.0035624988,0.00036034262,0.0012632759,0.00067644694,0.0024325484,0.001891113,0.001495938,0.0008151947,0.00096976495],"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.00023974218,0.000051572762,0.0015445285,0.00013610412,0.000043317767,0.0006722185,0.00039558503,0.039691377,0.0063295597,0.93092436,0.0020327717,0.017938763],"study_design_scores_gemma":[0.000059376882,0.00008037447,0.00043435153,0.000050743496,0.000056330144,0.0004688995,0.0001360315,0.1771621,0.006064453,0.801519,0.013912146,0.000056264318],"about_ca_topic_score_codex":0.0037750744,"about_ca_topic_score_gemma":0.004845099,"teacher_disagreement_score":0.003879255,"about_ca_system_score_codex":0.0012633505,"about_ca_system_score_gemma":0.0023096907,"threshold_uncertainty_score":0.012977362},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13715477,0.0033288938,0.2484055,0.006194497,0.0027099524,0.00012809946,0.0021021878,0.0013451204,0.59863096],"genre_scores_gemma":[0.77991164,0.0019874356,0.057956364,0.0018583188,0.0011629168,0.00031172577,0.0010720219,0.00042424674,0.15531532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995753,0.000082110906,0.000020599877,0.000094556504,0.000118982876,0.00010840408],"domain_scores_gemma":[0.9986424,0.000638879,0.00016873049,0.00016259974,0.00019249551,0.000194985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051044184,0.0005172806,0.0004449834,0.0016939355,0.00097302353,0.002252741,0.0006698728,0.00073688733,0.03581395],"category_scores_gemma":[0.0039953245,0.00018972882,0.0003021542,0.00095066754,0.0012619477,0.0027595193,0.001516633,0.0012934302,0.008629655],"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.00006618157,0.000012423272,0.0001468133,0.00006797294,0.0000064815376,0.000051648003,0.000072451694,0.0009963519,0.00086374074,0.966108,0.012758025,0.018849926],"study_design_scores_gemma":[0.000032794556,0.00005263224,0.00043194526,0.000048834772,0.0000125273655,0.00027544625,0.00008687559,0.008242853,0.0013324259,0.9284764,0.060982063,0.000025043946],"about_ca_topic_score_codex":0.00061542966,"about_ca_topic_score_gemma":0.00093386084,"teacher_disagreement_score":0.03581395,"about_ca_system_score_codex":0.0008328485,"about_ca_system_score_gemma":0.00063321565,"threshold_uncertainty_score":0.11980963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6473487,0.0020195593,0.1762791,0.0020572685,0.00086285,0.00011885314,0.0014142192,0.00050188485,0.16939753],"genre_scores_gemma":[0.9489426,0.00038118762,0.023973903,0.00031997025,0.00039151887,0.00012910097,0.00050202163,0.00013045782,0.025229167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999332,0.00016706716,0.000053463347,0.00015572684,0.0001667698,0.00012490219],"domain_scores_gemma":[0.99797994,0.0009856336,0.00030262265,0.00017470447,0.00020212993,0.00035497823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267454,0.00043789422,0.00048104566,0.0023249625,0.0012990612,0.0025310125,0.00084549637,0.00088454946,0.0091295615],"category_scores_gemma":[0.002965846,0.00032327216,0.000495788,0.0009588502,0.00245902,0.0032767758,0.0013012921,0.0009829684,0.0012170352],"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.00009196957,0.000024834042,0.0002979146,0.000060842805,0.000009392872,0.00012555736,0.00024547143,0.00069302245,0.002297766,0.9848986,0.0019642534,0.009290364],"study_design_scores_gemma":[0.000017550869,0.000025896878,0.0004496033,0.000024479512,0.000009470466,0.00025656135,0.00010183799,0.003556694,0.0009037765,0.98893225,0.0057015396,0.000020334253],"about_ca_topic_score_codex":0.0005061207,"about_ca_topic_score_gemma":0.0008392612,"teacher_disagreement_score":0.0091295615,"about_ca_system_score_codex":0.0007417685,"about_ca_system_score_gemma":0.00042057398,"threshold_uncertainty_score":0.03054142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4062648,0.0061381273,0.34688678,0.0054541416,0.0010871524,0.00018900544,0.0011346417,0.00085268484,0.23199253],"genre_scores_gemma":[0.8934811,0.001405051,0.066164136,0.0009734951,0.0003153745,0.00020193265,0.0005102289,0.00014307117,0.036805645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993272,0.00019417367,0.00006987453,0.00015541495,0.00012460475,0.00012866143],"domain_scores_gemma":[0.9979819,0.0011748656,0.0003154602,0.0001896533,0.00015430119,0.00018370684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091500586,0.00044836733,0.00050722854,0.0023390828,0.0018712815,0.0028230543,0.0008988853,0.0014973326,0.008231713],"category_scores_gemma":[0.0039545093,0.0005304777,0.0006859857,0.0018305611,0.0019593104,0.004143915,0.0017694302,0.0014488774,0.001701538],"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.000046237452,0.00001588311,0.0004254793,0.00006130265,0.000008897424,0.00021002718,0.00013674342,0.0012221178,0.0008454144,0.9855839,0.002563986,0.00888],"study_design_scores_gemma":[0.000009895546,0.000011358247,0.00030340656,0.000027437474,0.000006154078,0.0003325859,0.00005802999,0.004130179,0.0003812262,0.99024826,0.004479312,0.000012302048],"about_ca_topic_score_codex":0.0009886271,"about_ca_topic_score_gemma":0.0018337615,"teacher_disagreement_score":0.008231713,"about_ca_system_score_codex":0.0015115385,"about_ca_system_score_gemma":0.00059505505,"threshold_uncertainty_score":0.027537763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33695677,0.0008427132,0.5986488,0.0010434571,0.00012234242,0.000107691114,0.0011908396,0.001856826,0.0592305],"genre_scores_gemma":[0.88958925,0.00034395617,0.09374828,0.000373828,0.00010491071,0.0001512085,0.0006203546,0.00031236434,0.014755795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983469,0.00022774929,0.00012896965,0.00035655216,0.0006630965,0.0002766497],"domain_scores_gemma":[0.9922998,0.0038070432,0.0007403179,0.0007982055,0.0015018011,0.0008528059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138758,0.00032076673,0.00044694034,0.0015313807,0.0014727925,0.0021358044,0.00078421785,0.0006853852,0.0039947326],"category_scores_gemma":[0.007412326,0.000553736,0.00070712867,0.0009288516,0.0026844416,0.0038845872,0.0018641957,0.0017478323,0.00081800413],"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.00004790406,0.000020388545,0.0010568413,0.00007322527,0.00001052946,0.00023170449,0.00054663385,0.0018895899,0.010762402,0.9700228,0.0010368644,0.014301137],"study_design_scores_gemma":[0.000030311643,0.000046964204,0.0012190925,0.000040393308,0.000023253644,0.00060385035,0.0001535174,0.029084168,0.008571488,0.94621205,0.013971268,0.000043679287],"about_ca_topic_score_codex":0.002095824,"about_ca_topic_score_gemma":0.0020132218,"teacher_disagreement_score":0.0039947326,"about_ca_system_score_codex":0.002081847,"about_ca_system_score_gemma":0.0012786936,"threshold_uncertainty_score":0.01510489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46399873,0.00075589685,0.17528678,0.001980141,0.0004893449,0.0001422716,0.0020646602,0.0010268722,0.35425535],"genre_scores_gemma":[0.9426197,0.0003065263,0.016267048,0.000445765,0.00017254852,0.000116593284,0.0010050092,0.00024198004,0.038824808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889463,0.00017380387,0.000062901505,0.00033020767,0.0002661334,0.0002723604],"domain_scores_gemma":[0.99832803,0.0005480568,0.00023445887,0.0003688322,0.00021040584,0.0003102801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070776884,0.0004323977,0.00041560212,0.001134034,0.0012777317,0.0023615516,0.0009411635,0.00069712166,0.016954048],"category_scores_gemma":[0.0034225543,0.0002704325,0.000563363,0.0010872455,0.0014968992,0.0037962873,0.0027058008,0.0014614104,0.0022451764],"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.00013400789,0.000046502817,0.0005805725,0.00008420412,0.000014286488,0.00017802548,0.00020165871,0.0013257967,0.0026925346,0.972259,0.005069867,0.01741362],"study_design_scores_gemma":[0.000030654744,0.000029028784,0.0010432961,0.000027723641,0.000017452527,0.0003614491,0.00007096866,0.0041957935,0.0025760813,0.9747525,0.016868155,0.000026869548],"about_ca_topic_score_codex":0.0012197259,"about_ca_topic_score_gemma":0.0011635693,"teacher_disagreement_score":0.016954048,"about_ca_system_score_codex":0.0011245366,"about_ca_system_score_gemma":0.00062344805,"threshold_uncertainty_score":0.05671692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22684681,0.0029596623,0.7458402,0.0012750952,0.000092324335,0.000181163,0.0005432385,0.0005413998,0.021720087],"genre_scores_gemma":[0.87876856,0.001552674,0.11382586,0.0002690619,0.00025428954,0.00023803079,0.00039639598,0.0003694408,0.0043257466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961551,0.0008802252,0.00022769789,0.0008405374,0.0013085484,0.00058795424],"domain_scores_gemma":[0.92685634,0.061143756,0.003852803,0.0037098671,0.0020731764,0.002364086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004038183,0.0011023969,0.0011150562,0.0032240346,0.0012491881,0.0033510972,0.0021735458,0.0017244682,0.004812949],"category_scores_gemma":[0.032854073,0.00094020594,0.0014060657,0.0025873727,0.004556968,0.013736551,0.004796148,0.003998772,0.0005703198],"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.00021152945,0.000078078265,0.0028491737,0.00024605758,0.00006807016,0.00021162974,0.0008829334,0.058644038,0.008019265,0.8969887,0.0010125937,0.030787984],"study_design_scores_gemma":[0.000019359457,0.00008602025,0.0010493302,0.0000474179,0.000038670958,0.000229502,0.00009920766,0.1522776,0.004370736,0.83936465,0.00237106,0.000046383735],"about_ca_topic_score_codex":0.0010922487,"about_ca_topic_score_gemma":0.0010997222,"teacher_disagreement_score":0.004812949,"about_ca_system_score_codex":0.0032552052,"about_ca_system_score_gemma":0.0014058629,"threshold_uncertainty_score":0.02361828},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049271416,0.0006404631,0.86657023,0.0031759408,0.0014084915,0.00046540165,0.0006782797,0.003266656,0.07452306],"genre_scores_gemma":[0.6653919,0.0005404329,0.28058165,0.001138867,0.00041966757,0.0007184053,0.0005547145,0.000701366,0.04995298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960389,0.0010788399,0.0002964635,0.00052149047,0.001038775,0.0010253637],"domain_scores_gemma":[0.9917923,0.0026560333,0.00052906346,0.0032213337,0.0009363375,0.000864901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428712,0.0013521069,0.0009372204,0.0016466383,0.0027855835,0.003156997,0.002047284,0.0025783437,0.009758721],"category_scores_gemma":[0.007927671,0.0008238295,0.0015822673,0.0015895049,0.003979041,0.0044261585,0.006676153,0.0035913766,0.0041399146],"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.00024534375,0.00007867214,0.00019347119,0.000089038294,0.000015143981,0.00018767756,0.00028411587,0.0024151148,0.003868212,0.96671194,0.0047253845,0.021185797],"study_design_scores_gemma":[0.00019430644,0.00019853788,0.00028001508,0.00013294102,0.000067336994,0.0007122925,0.00018210211,0.037564177,0.025037002,0.90062714,0.034811944,0.00019224554],"about_ca_topic_score_codex":0.0010174987,"about_ca_topic_score_gemma":0.0011879853,"teacher_disagreement_score":0.009758721,"about_ca_system_score_codex":0.0018852163,"about_ca_system_score_gemma":0.0031624804,"threshold_uncertainty_score":0.03264612},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013218887,0.05581105,0.52174294,0.028572347,0.008235965,0.00026247877,0.0018358721,0.004374134,0.36594638],"genre_scores_gemma":[0.2828159,0.06441032,0.45930913,0.00847165,0.0052479357,0.00088744966,0.0033853278,0.0012673907,0.17420484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882513,0.00031394357,0.000072814306,0.00026863493,0.0004110961,0.000108309905],"domain_scores_gemma":[0.99865985,0.0005603517,0.00005607029,0.00041511058,0.00019371731,0.00011495072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010546257,0.00086287584,0.0007486552,0.0015188913,0.0019350124,0.0049596797,0.0013611076,0.0016713645,0.02624067],"category_scores_gemma":[0.008326434,0.00043376483,0.000999815,0.0021390547,0.00441169,0.0100009,0.0032699583,0.0025730296,0.013414428],"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.000072302464,0.000025467545,0.00031512906,0.00037324807,0.000036261812,0.00012819981,0.0005465502,0.004342037,0.0011559792,0.8183261,0.043887157,0.13079157],"study_design_scores_gemma":[0.00002021996,0.00002567224,0.000093178554,0.00019730172,0.00001362951,0.0001867463,0.000104227234,0.004039523,0.0012847076,0.64646345,0.34754246,0.00002894672],"about_ca_topic_score_codex":0.001297895,"about_ca_topic_score_gemma":0.0011810923,"teacher_disagreement_score":0.02624067,"about_ca_system_score_codex":0.0011931765,"about_ca_system_score_gemma":0.0012300988,"threshold_uncertainty_score":0.08778381},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015938383,0.004114065,0.9485946,0.0016783504,0.00053265394,0.00013981038,0.000118651675,0.0008658939,0.028017651],"genre_scores_gemma":[0.33082402,0.0054812203,0.6447693,0.0008802299,0.00034380652,0.00051703554,0.0003459787,0.000620326,0.016218148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891365,0.00031734354,0.00007890097,0.00012539559,0.000404597,0.00016008478],"domain_scores_gemma":[0.99800116,0.0010746757,0.000091785616,0.00034183505,0.00039852972,0.00009198805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012933009,0.0006961889,0.00075325335,0.0008678173,0.0014901401,0.0023290927,0.0017447916,0.0014756247,0.003940609],"category_scores_gemma":[0.0058030435,0.00059845735,0.000814497,0.0010347698,0.002999113,0.0026074105,0.002041619,0.001869987,0.0013691032],"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.00008533575,0.000024837056,0.00018755962,0.00024041803,0.000019118314,0.000047683217,0.00019682998,0.05030039,0.0034966897,0.8899212,0.0039572986,0.051522724],"study_design_scores_gemma":[0.000049907983,0.000072730945,0.000068350724,0.00015271785,0.0000214121,0.00007838707,0.00007092543,0.1457938,0.008136132,0.7877122,0.05781054,0.00003278497],"about_ca_topic_score_codex":0.0016449913,"about_ca_topic_score_gemma":0.0021641613,"teacher_disagreement_score":0.003940609,"about_ca_system_score_codex":0.0013521957,"about_ca_system_score_gemma":0.0014516327,"threshold_uncertainty_score":0.01318264},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04902753,0.0013886234,0.87647957,0.0011686147,0.00063980714,0.00040247824,0.0018403571,0.001621286,0.06743168],"genre_scores_gemma":[0.4850003,0.0020052227,0.44124448,0.00074395,0.00056744815,0.0010658747,0.0029560514,0.001171515,0.065245174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663097,0.00049279735,0.0004615279,0.0011224733,0.00084845803,0.00044372815],"domain_scores_gemma":[0.9955545,0.0015290269,0.00046611833,0.0012318786,0.00097272464,0.00024568988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016261882,0.0010261617,0.0010042407,0.0027322646,0.0023132227,0.0045414856,0.0019315896,0.0014081053,0.015574755],"category_scores_gemma":[0.0071132104,0.00059419556,0.0028581822,0.0022615981,0.004691781,0.010817316,0.004782786,0.0032853337,0.0033972596],"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.00004440602,0.0000198026,0.00029601797,0.00008582657,0.0000142137405,0.000112279165,0.00038522974,0.003606645,0.0018072883,0.97133315,0.0013945585,0.020900575],"study_design_scores_gemma":[0.00001922901,0.00008385977,0.00030313182,0.00009047924,0.00003155292,0.00039592816,0.00029955164,0.026705025,0.007297073,0.892447,0.07226536,0.00006184847],"about_ca_topic_score_codex":0.0025314232,"about_ca_topic_score_gemma":0.0015446175,"teacher_disagreement_score":0.015574755,"about_ca_system_score_codex":0.0025419788,"about_ca_system_score_gemma":0.0018791327,"threshold_uncertainty_score":0.052102745},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050466433,0.35792747,0.07706631,0.02716921,0.012730328,0.00008843183,0.00034510443,0.00080710644,0.51881945],"genre_scores_gemma":[0.071507186,0.28009084,0.058368813,0.016629817,0.0067522055,0.00018966434,0.0006148278,0.001049245,0.5647973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991172,0.00016453875,0.000043977692,0.00015824684,0.0004516696,0.000064478445],"domain_scores_gemma":[0.9986047,0.0009310055,0.00005926475,0.00014878312,0.00020132736,0.000054874374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006454115,0.0009005501,0.00067275984,0.0015201654,0.0016982566,0.0034554212,0.0010109724,0.0019719913,0.021025054],"category_scores_gemma":[0.0025584898,0.00040766268,0.00052474014,0.0019280307,0.0041797208,0.006090235,0.0021663515,0.0033494877,0.008462591],"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.000017331884,0.00002156083,0.0001219079,0.00048653485,0.000010473523,0.00012784272,0.001004141,0.0014079796,0.0008213514,0.81053746,0.062290434,0.12315303],"study_design_scores_gemma":[0.0000029384723,0.000013554821,0.000078020836,0.00036936085,0.0000034970783,0.00028670407,0.0001427084,0.000369745,0.0005741602,0.22308104,0.7750655,0.000012798197],"about_ca_topic_score_codex":0.0011866399,"about_ca_topic_score_gemma":0.0015527101,"teacher_disagreement_score":0.021025054,"about_ca_system_score_codex":0.0020029738,"about_ca_system_score_gemma":0.0015325091,"threshold_uncertainty_score":0.070335865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0820503,0.0002829752,0.84545726,0.0005672015,0.0005797736,0.00024978642,0.00096361974,0.019562729,0.050286364],"genre_scores_gemma":[0.4873424,0.0002568443,0.4381026,0.00077996106,0.00012515037,0.00023392205,0.002306669,0.0066285,0.06422388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998823,0.0001502574,0.00006088789,0.00031003242,0.0003899392,0.00026589437],"domain_scores_gemma":[0.9979119,0.0005199289,0.000100409095,0.0010386157,0.00033340836,0.00009568091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007530898,0.0014745011,0.0011157969,0.0010384767,0.001332904,0.0017136821,0.0022359693,0.0018006988,0.027301988],"category_scores_gemma":[0.0027459385,0.00064777356,0.0011586772,0.0010481861,0.0014079906,0.0021514702,0.0037879632,0.0017409405,0.008558124],"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.0015232457,0.0004130331,0.00321057,0.0005926888,0.000118293145,0.00092686183,0.0007066716,0.021652233,0.10378535,0.18477736,0.030486643,0.65180707],"study_design_scores_gemma":[0.00022557395,0.0006439384,0.0019076681,0.00018847788,0.00023010507,0.0017628311,0.0004888711,0.21096721,0.297805,0.3284517,0.15710868,0.00022002707],"about_ca_topic_score_codex":0.0011242153,"about_ca_topic_score_gemma":0.0024440528,"teacher_disagreement_score":0.027301988,"about_ca_system_score_codex":0.0007747074,"about_ca_system_score_gemma":0.0011553575,"threshold_uncertainty_score":0.09133428},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32991675,0.00085939845,0.6104839,0.00072085566,0.00029620828,0.00007242597,0.0002920259,0.00037083533,0.056987662],"genre_scores_gemma":[0.9153794,0.0004542357,0.066657096,0.00036211027,0.00036421706,0.00010946005,0.00041905377,0.00017503029,0.016079402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981743,0.0002649039,0.00009974356,0.00040804886,0.00070644415,0.0003465608],"domain_scores_gemma":[0.995146,0.0022434203,0.0005446496,0.00079205714,0.0007739364,0.0004999006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011231718,0.0003805794,0.0004614125,0.0011720285,0.0014040539,0.0017387402,0.0006551466,0.00078083016,0.0045768656],"category_scores_gemma":[0.0044408916,0.00020757431,0.00067514536,0.0009196229,0.004375545,0.003379489,0.0024691303,0.0017114434,0.0007441768],"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.00003534383,0.000009633766,0.00028122007,0.000021334305,0.0000033017463,0.000056875797,0.00016349881,0.0017543482,0.0014132907,0.9889564,0.0002920661,0.00701279],"study_design_scores_gemma":[0.000008334405,0.000051291943,0.00022712817,0.000019102094,0.0000058709247,0.00024484957,0.00015071414,0.014332208,0.0044468883,0.9709416,0.009550283,0.000021823973],"about_ca_topic_score_codex":0.0006771384,"about_ca_topic_score_gemma":0.0005346549,"teacher_disagreement_score":0.0045768656,"about_ca_system_score_codex":0.0006872493,"about_ca_system_score_gemma":0.00074844476,"threshold_uncertainty_score":0.015311122},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028348707,0.36140677,0.11191548,0.01371965,0.028957956,0.0004309459,0.0064639915,0.007216253,0.46705413],"genre_scores_gemma":[0.004723423,0.09303108,0.025635427,0.0010420429,0.0014726039,0.000095533855,0.0037799617,0.0012529516,0.86896694],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994155,0.000038293805,0.000025118265,0.000102004975,0.00034173467,0.00007731011],"domain_scores_gemma":[0.9989893,0.00015019317,0.000028059094,0.000082594226,0.0005080465,0.00024175801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008950769,0.0019106423,0.0014370559,0.0019804584,0.0011891604,0.0039338334,0.0018419622,0.0011193857,0.09808287],"category_scores_gemma":[0.0014675893,0.0009970141,0.00061666855,0.0042433836,0.0012594153,0.0028708035,0.0014241658,0.0023634161,0.06220444],"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.000055399767,0.000020503587,0.000105137915,0.00046858267,0.000011515782,0.000043852793,0.00013432911,0.00047801126,0.0014804547,0.0064522917,0.8149394,0.17581053],"study_design_scores_gemma":[0.000006140044,0.0000124856415,0.00026014136,0.00019075052,0.0000070815317,0.00013428951,0.000043624746,0.0003628586,0.000823371,0.0028113078,0.99533844,0.000009477899],"about_ca_topic_score_codex":0.024221946,"about_ca_topic_score_gemma":0.08496656,"teacher_disagreement_score":0.09808287,"about_ca_system_score_codex":0.0032932565,"about_ca_system_score_gemma":0.0054294583,"threshold_uncertainty_score":0.32811987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13077882,0.00084990443,0.8392154,0.0043795607,0.00008663305,0.00014541773,0.0006677593,0.0013094075,0.022567116],"genre_scores_gemma":[0.83624643,0.00074219453,0.1556944,0.0007603587,0.00018427365,0.00034470743,0.00067032245,0.0005409213,0.0048164683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961676,0.0012021912,0.00022693725,0.0007253872,0.0012023185,0.00047547882],"domain_scores_gemma":[0.9701138,0.023879636,0.001083829,0.0033957905,0.0012093686,0.00031764663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029147172,0.00043451515,0.000671825,0.0011359775,0.0014123679,0.0027970327,0.0012744816,0.0013342395,0.0056459117],"category_scores_gemma":[0.022515658,0.00080119603,0.001409555,0.0011309044,0.0042688423,0.010805913,0.0020549244,0.0036929268,0.0007797873],"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.000052659467,0.000029795048,0.0010496927,0.00011341591,0.000022597485,0.00023514852,0.0009284312,0.018305136,0.0027504521,0.94924647,0.0013439482,0.025922284],"study_design_scores_gemma":[0.000009980358,0.000016514097,0.0002951959,0.000027118718,0.000013455335,0.00013633555,0.00010722041,0.04339291,0.002594634,0.9480814,0.005308499,0.000016807271],"about_ca_topic_score_codex":0.0019893697,"about_ca_topic_score_gemma":0.0017959396,"teacher_disagreement_score":0.0056459117,"about_ca_system_score_codex":0.0018230686,"about_ca_system_score_gemma":0.0015140675,"threshold_uncertainty_score":0.0188874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53360784,0.0012925568,0.44823903,0.00033738522,0.000100161815,0.00035172966,0.002085157,0.0020794435,0.011906631],"genre_scores_gemma":[0.6415426,0.0017909382,0.3416181,0.00021413625,0.00003409381,0.00046793165,0.0024149953,0.00039358423,0.011523491],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999746,0.00003076544,0.000018657227,0.00010094951,0.00006563024,0.000037868922],"domain_scores_gemma":[0.9996557,0.0001398016,0.00003890909,0.000079372716,0.00006137813,0.000024754112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052713335,0.00032409362,0.0003382926,0.0009965531,0.00059619296,0.0007111012,0.00057894393,0.0005281762,0.0042234818],"category_scores_gemma":[0.0006439317,0.00023806842,0.000374529,0.00046487214,0.00044943602,0.00079734926,0.0004831375,0.00074594514,0.0016210064],"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.000053460335,0.000010755331,0.00032502005,0.000031712403,0.0000050826493,0.000021707063,0.00002556483,0.00015140041,0.9941713,0.00081800163,0.000038430535,0.0043475903],"study_design_scores_gemma":[0.000021655014,0.000116120325,0.0035267114,0.000009105922,0.000023148354,0.00023226248,0.000050262915,0.00671689,0.98427397,0.0008317619,0.0041851746,0.000012931341],"about_ca_topic_score_codex":0.0025149481,"about_ca_topic_score_gemma":0.003068983,"teacher_disagreement_score":0.0042234818,"about_ca_system_score_codex":0.00063659914,"about_ca_system_score_gemma":0.00046938818,"threshold_uncertainty_score":0.014128983},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08938747,0.00047028135,0.9030325,0.00039579344,0.000060883514,0.000105818,0.00051858986,0.00050816184,0.005520605],"genre_scores_gemma":[0.672205,0.0010613159,0.31864056,0.0002003219,0.0001150625,0.00041465843,0.0011954291,0.00039759095,0.005769972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977443,0.0004475286,0.0002452079,0.00073653035,0.0006184966,0.0002078571],"domain_scores_gemma":[0.9916026,0.004366264,0.0015899204,0.0012091306,0.0009388764,0.00029316536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016597908,0.00095157913,0.000650868,0.0025177584,0.0012230485,0.0025061022,0.001714742,0.0014182694,0.0033242602],"category_scores_gemma":[0.011931323,0.0005613907,0.0016523619,0.002219208,0.004529223,0.007858216,0.0021494883,0.0015086684,0.0006464848],"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.0001130053,0.00004706666,0.0021140287,0.00017231825,0.000034466117,0.00032850576,0.0006552169,0.13605574,0.01413393,0.8162026,0.0005963221,0.029546747],"study_design_scores_gemma":[0.000016425958,0.000073745054,0.00035836166,0.00006146253,0.000025791483,0.00025782592,0.00021192979,0.2583077,0.015437595,0.7172007,0.007986101,0.000062298626],"about_ca_topic_score_codex":0.0024683457,"about_ca_topic_score_gemma":0.0011919138,"teacher_disagreement_score":0.0033242602,"about_ca_system_score_codex":0.0017431928,"about_ca_system_score_gemma":0.0009076543,"threshold_uncertainty_score":0.012647867},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07470559,0.0004927039,0.90683126,0.00054281903,0.000102905404,0.00027915428,0.00077746296,0.0011632671,0.015104845],"genre_scores_gemma":[0.29767352,0.00044555624,0.6943193,0.00018854768,0.00006461036,0.0003972332,0.0015209697,0.00042460914,0.00496574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732697,0.0006598396,0.00022627845,0.00040073527,0.0010588536,0.00032735907],"domain_scores_gemma":[0.99048513,0.0048941365,0.00054484257,0.0015072005,0.0020355252,0.00053323334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013258872,0.0006847819,0.0012791485,0.0024371094,0.0011302953,0.0016373683,0.0012716395,0.0012892762,0.0045103747],"category_scores_gemma":[0.017668739,0.00068059977,0.00081672205,0.0020874965,0.0014251405,0.0023672453,0.0026367716,0.0015574419,0.001429467],"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.0003871496,0.00019920943,0.00206831,0.00051228644,0.00005673087,0.0003702803,0.0006420601,0.18888074,0.017080743,0.4497225,0.016409636,0.32367042],"study_design_scores_gemma":[0.00009165342,0.00019546167,0.0004397546,0.00008094259,0.00002937409,0.00042041566,0.00025262785,0.53707445,0.01708979,0.4245218,0.019736394,0.00006735651],"about_ca_topic_score_codex":0.0011944615,"about_ca_topic_score_gemma":0.0015620883,"teacher_disagreement_score":0.0045103747,"about_ca_system_score_codex":0.0014226042,"about_ca_system_score_gemma":0.0028679343,"threshold_uncertainty_score":0.015088677},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010562449,0.001891032,0.903058,0.00086197257,0.000690913,0.0002430771,0.0012874815,0.008173454,0.073231556],"genre_scores_gemma":[0.14727241,0.0018236972,0.69022685,0.00070056855,0.00041137155,0.0004683398,0.0061875447,0.003910602,0.14899863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812466,0.00022189027,0.00011547041,0.0007733734,0.0005811427,0.00018347746],"domain_scores_gemma":[0.9984629,0.0004700546,0.00008449473,0.00057637185,0.0003274189,0.00007875782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001341602,0.0013201344,0.001022791,0.004497662,0.001985235,0.004983407,0.0024436822,0.0017598965,0.03752544],"category_scores_gemma":[0.004554749,0.0010474739,0.001173792,0.002892923,0.0029623106,0.005493053,0.0043756156,0.0018296805,0.029796973],"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.00015997993,0.000051912233,0.0011983418,0.0004109565,0.000030520652,0.00018590128,0.00088431797,0.0019542943,0.036417663,0.22446424,0.037337795,0.696904],"study_design_scores_gemma":[0.000020297051,0.00007510315,0.0017335229,0.00026832652,0.000059884875,0.0008687501,0.0008859442,0.037031688,0.1141251,0.32602942,0.51880443,0.00009752754],"about_ca_topic_score_codex":0.0016177986,"about_ca_topic_score_gemma":0.0011642688,"teacher_disagreement_score":0.03752544,"about_ca_system_score_codex":0.0009816473,"about_ca_system_score_gemma":0.001502169,"threshold_uncertainty_score":0.12553513},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23902434,0.011061516,0.5323822,0.023499906,0.0010984645,0.00009503507,0.00024069421,0.0013043126,0.19129357],"genre_scores_gemma":[0.899995,0.003247929,0.08033406,0.0011037546,0.0004869973,0.00012005877,0.00015221671,0.000469217,0.01409076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.00015881269,0.00002784002,0.00012856913,0.00014633343,0.00007360473],"domain_scores_gemma":[0.99843365,0.0010491406,0.00007813346,0.00024938458,0.00010012234,0.000089597714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985422,0.00031925045,0.0005532417,0.0003742242,0.00094497605,0.0026631309,0.00080415333,0.0012787818,0.0023796558],"category_scores_gemma":[0.0045240726,0.0004227085,0.0006790668,0.0005464642,0.0059468364,0.007622942,0.0018643892,0.0038357307,0.00048004524],"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.000021111697,0.00000970334,0.00022612435,0.000052912877,0.000009485832,0.000060553004,0.00070156524,0.0034904105,0.0013272789,0.9728309,0.0016540858,0.019615913],"study_design_scores_gemma":[0.000004259562,0.0000044041853,0.000087232205,0.000010099093,0.0000029909459,0.00004001181,0.000055414544,0.005022573,0.0003498188,0.9912668,0.003149321,0.0000070720816],"about_ca_topic_score_codex":0.0007173869,"about_ca_topic_score_gemma":0.0005876855,"teacher_disagreement_score":0.0026631309,"about_ca_system_score_codex":0.0008131035,"about_ca_system_score_gemma":0.0007640892,"threshold_uncertainty_score":0.007960737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8179717,0.00041172458,0.17598012,0.0002657593,0.00011631575,0.00004923137,0.000038785765,0.0004968959,0.004669479],"genre_scores_gemma":[0.9878561,0.00015798061,0.011271539,0.000022308783,0.0000061713617,0.000028379467,0.000020130698,0.00003017811,0.00060732395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995326,0.00011790608,0.000036798312,0.00006893351,0.00017495676,0.00006880956],"domain_scores_gemma":[0.996958,0.0017126604,0.0004370221,0.0005862937,0.00019664214,0.000109327026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097081973,0.00038846993,0.00049133436,0.000296024,0.00040108454,0.0009202987,0.000997648,0.0007969729,0.0009965554],"category_scores_gemma":[0.006903962,0.0004108883,0.00045339073,0.00025752914,0.0013255039,0.0013077267,0.0009643248,0.00084015535,0.00027400837],"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.00022824523,0.00010602382,0.0014610671,0.0001736034,0.000037664475,0.00018307292,0.000156805,0.8829171,0.056982074,0.04862673,0.0002526011,0.008875061],"study_design_scores_gemma":[0.00004115191,0.00013184204,0.00028242258,0.000013544549,0.000013054965,0.000048686798,0.000022138394,0.96057945,0.02727069,0.011009777,0.00056399597,0.000023202165],"about_ca_topic_score_codex":0.00058706716,"about_ca_topic_score_gemma":0.00028063313,"teacher_disagreement_score":0.000997648,"about_ca_system_score_codex":0.0006312248,"about_ca_system_score_gemma":0.00052635564,"threshold_uncertainty_score":0.0051342845},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2063265,0.00041041497,0.7720228,0.00024341203,0.00018393743,0.00029773708,0.0004160278,0.0024704842,0.017628813],"genre_scores_gemma":[0.53915226,0.0002950031,0.44625095,0.00009757963,0.000037920672,0.00034270744,0.0011346287,0.00068758294,0.012001287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953604,0.00010805374,0.000026059435,0.00008835353,0.00016572389,0.00007573844],"domain_scores_gemma":[0.9989567,0.0005268332,0.00006404525,0.00018318962,0.000211586,0.00005758032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049583573,0.0005611248,0.00039338597,0.00094824267,0.00051840005,0.0006951811,0.0006623189,0.0003446775,0.0038238005],"category_scores_gemma":[0.002481605,0.00031477568,0.0008117031,0.000687996,0.0006944871,0.0009005265,0.0017156246,0.00072530983,0.0010911411],"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.00047625197,0.0002572141,0.0024075655,0.0005789824,0.000077112796,0.0009115619,0.001405182,0.09408137,0.09237533,0.3499301,0.008085762,0.44941348],"study_design_scores_gemma":[0.00018789532,0.00041840915,0.0014128018,0.000093245275,0.00007918101,0.0006996171,0.0004184239,0.45819423,0.17900614,0.31710768,0.042280857,0.000101558304],"about_ca_topic_score_codex":0.0006641805,"about_ca_topic_score_gemma":0.00083577534,"teacher_disagreement_score":0.0038238005,"about_ca_system_score_codex":0.0005346735,"about_ca_system_score_gemma":0.0004956746,"threshold_uncertainty_score":0.012791812},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01662364,0.0054496536,0.3481313,0.13746946,0.02028858,0.00022625527,0.0012122665,0.0015734521,0.46902543],"genre_scores_gemma":[0.42302668,0.0060069812,0.13995767,0.03855525,0.015224116,0.00095021323,0.0013175544,0.0018710603,0.37309045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984415,0.00033865758,0.0000689961,0.0002692816,0.00062118884,0.00026028926],"domain_scores_gemma":[0.9985097,0.0006727677,0.000066985376,0.00033547689,0.00028229773,0.00013264635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014548142,0.0011617866,0.0013395847,0.0013742901,0.003599758,0.0027718933,0.0030929246,0.0030402578,0.043427043],"category_scores_gemma":[0.0046063396,0.00037764528,0.0012576687,0.00091500586,0.004181628,0.010119038,0.0036261498,0.003938416,0.0072489665],"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.000040133164,0.00001789315,0.000062376916,0.00010731325,0.0000064998676,0.00020245735,0.00018895157,0.00057207997,0.0008020175,0.96489376,0.02594821,0.00715825],"study_design_scores_gemma":[0.00001674093,0.000015548452,0.00014692907,0.00004077642,0.0000058514142,0.00016635246,0.00017766724,0.002590958,0.001478573,0.9012227,0.09411538,0.000022534474],"about_ca_topic_score_codex":0.0027698562,"about_ca_topic_score_gemma":0.0014356874,"teacher_disagreement_score":0.043427043,"about_ca_system_score_codex":0.0013371342,"about_ca_system_score_gemma":0.0005832813,"threshold_uncertainty_score":0.14527798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6308997,0.0016144139,0.18418594,0.0037004305,0.00035308546,0.000069875525,0.0014352885,0.0008511534,0.17689],"genre_scores_gemma":[0.9567752,0.0004543593,0.021212023,0.00022956786,0.00009930969,0.000042908414,0.0005806859,0.0001391972,0.020466762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995577,0.000109289154,0.000017193013,0.000109121065,0.00012168262,0.00008504056],"domain_scores_gemma":[0.996951,0.0016951113,0.00028395772,0.00043243397,0.0002816977,0.00035586843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272108,0.00035722513,0.00038742903,0.0014372879,0.0009599709,0.001617419,0.0008702973,0.00088367,0.013373282],"category_scores_gemma":[0.004992253,0.00023710795,0.00042308684,0.00079063704,0.0016512815,0.003141747,0.0010633953,0.0013503496,0.0011656726],"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.00017369016,0.000038359198,0.0007847918,0.00012301755,0.000016116615,0.000071181756,0.00012641882,0.0077163833,0.0029216895,0.9652042,0.00555493,0.01726933],"study_design_scores_gemma":[0.000032675754,0.000041397674,0.0010917132,0.000035995265,0.000023033212,0.00028792024,0.00013687517,0.06450844,0.007719333,0.91885424,0.0072403066,0.000027991307],"about_ca_topic_score_codex":0.0007686192,"about_ca_topic_score_gemma":0.0012905132,"teacher_disagreement_score":0.013373282,"about_ca_system_score_codex":0.00092660415,"about_ca_system_score_gemma":0.000529205,"threshold_uncertainty_score":0.044738114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041957792,0.0012499597,0.9414703,0.0007407108,0.00041763662,0.00014100803,0.0004707445,0.0016930203,0.011858755],"genre_scores_gemma":[0.5427983,0.0017992337,0.43385953,0.00095291034,0.0005867002,0.0003501163,0.001157024,0.00030292352,0.018193359],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785966,0.00058721885,0.00014918087,0.00030617925,0.0007902742,0.00030749134],"domain_scores_gemma":[0.99387145,0.0032643538,0.0007054956,0.0010907886,0.0008778369,0.0001900642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015757873,0.0011711908,0.00088913616,0.0015137381,0.0008641157,0.0016119995,0.001169371,0.0010649718,0.003169373],"category_scores_gemma":[0.009143376,0.00038848975,0.0005313425,0.0018265801,0.0020677084,0.0016009932,0.0021854609,0.0010751494,0.0017574038],"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.001606145,0.00015112116,0.0035806268,0.00064451684,0.0002463857,0.0006589946,0.0005971073,0.2482695,0.051242772,0.3060107,0.019006182,0.36798596],"study_design_scores_gemma":[0.000097014476,0.00031297727,0.00082448416,0.00019365027,0.00009116361,0.00073427684,0.00017768313,0.7280616,0.047808267,0.20758744,0.013992818,0.000118596145],"about_ca_topic_score_codex":0.003872419,"about_ca_topic_score_gemma":0.006256014,"teacher_disagreement_score":0.003872419,"about_ca_system_score_codex":0.0010871548,"about_ca_system_score_gemma":0.0026865695,"threshold_uncertainty_score":0.010602653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2278194,0.00026448094,0.74896127,0.0011932186,0.00010756976,0.00018143357,0.00047991856,0.0026290282,0.018363664],"genre_scores_gemma":[0.8415752,0.0002121921,0.14762755,0.00038522432,0.00012036647,0.00040949136,0.0006013304,0.00047414115,0.008594439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650013,0.001074372,0.00028032498,0.0008261755,0.00082082616,0.00049813784],"domain_scores_gemma":[0.98291117,0.010812105,0.0008791641,0.0032733984,0.0015720412,0.0005521622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002817043,0.0006317637,0.0013061751,0.0010216185,0.0018612816,0.0030660785,0.0014130836,0.0015105739,0.003965887],"category_scores_gemma":[0.012838396,0.00089094165,0.0024092533,0.0009079147,0.0050382856,0.0050265794,0.0036290248,0.0032347052,0.00083476247],"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.00013265476,0.000061617226,0.0006209147,0.00017676533,0.00006615943,0.0004248206,0.0009502346,0.057788346,0.005988775,0.9197891,0.0017981486,0.012202511],"study_design_scores_gemma":[0.00007243261,0.00003640435,0.000214693,0.000025249426,0.000042971005,0.00015964355,0.00010076133,0.09977495,0.008023853,0.8860448,0.0054609547,0.00004333509],"about_ca_topic_score_codex":0.0024300804,"about_ca_topic_score_gemma":0.0016390176,"teacher_disagreement_score":0.003965887,"about_ca_system_score_codex":0.0016638332,"about_ca_system_score_gemma":0.0027405927,"threshold_uncertainty_score":0.014898181},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0365545,0.00031057,0.9379991,0.00056401745,0.00029948112,0.00019794532,0.00033387588,0.0017357542,0.022004683],"genre_scores_gemma":[0.5977409,0.0004833712,0.37347487,0.00041798275,0.00022195297,0.0004948359,0.0006924844,0.00049109536,0.025982454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869496,0.00034722802,0.00009440513,0.00022779177,0.00040725162,0.000228349],"domain_scores_gemma":[0.99731296,0.0009496838,0.00028984304,0.00084773323,0.00028915115,0.00031064765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012143158,0.00084423687,0.00082469196,0.0010448437,0.00143556,0.0015326886,0.001203655,0.0011413052,0.0054989383],"category_scores_gemma":[0.003735486,0.0006506351,0.001075194,0.0011577681,0.0018449303,0.0019150113,0.004876764,0.0018958785,0.003226354],"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.00048558126,0.0001599213,0.0005850319,0.0003012759,0.00005537257,0.0005496097,0.00053502317,0.018011749,0.024596976,0.86781293,0.008282157,0.07862427],"study_design_scores_gemma":[0.00024385624,0.0004454061,0.0005275258,0.00018937392,0.00010372799,0.0013175793,0.00014805644,0.16051392,0.04895972,0.7458875,0.041435603,0.00022776012],"about_ca_topic_score_codex":0.00046331718,"about_ca_topic_score_gemma":0.0005811199,"teacher_disagreement_score":0.0054989383,"about_ca_system_score_codex":0.0008946246,"about_ca_system_score_gemma":0.0017371882,"threshold_uncertainty_score":0.018395782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5851589,0.002512099,0.3820093,0.0011741376,0.00033499429,0.00015314654,0.000818802,0.0011778935,0.026660735],"genre_scores_gemma":[0.9466961,0.00061336096,0.045147434,0.00031449154,0.00009754412,0.00016658184,0.00039738664,0.00015708039,0.006410056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969505,0.00044446805,0.00040175812,0.0010953487,0.0007197623,0.00038807513],"domain_scores_gemma":[0.99309677,0.0030151217,0.00093171647,0.0018767096,0.00076790154,0.000311875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010073502,0.00037996547,0.00056056626,0.0007331853,0.0010982277,0.0018799637,0.001336681,0.0011714966,0.0026672941],"category_scores_gemma":[0.0072405846,0.00047671943,0.0011076296,0.0008048329,0.0040108496,0.005441933,0.0023490586,0.001384124,0.0005250733],"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.00041124973,0.00006240822,0.004406206,0.00037517023,0.00006524538,0.0024272334,0.0014689363,0.015698839,0.046833623,0.88648385,0.0015478319,0.04021937],"study_design_scores_gemma":[0.000057489997,0.0002700951,0.0022506102,0.000114151124,0.00009651804,0.0048671234,0.0005752796,0.057902712,0.051567584,0.85039884,0.031763762,0.00013581921],"about_ca_topic_score_codex":0.00058287726,"about_ca_topic_score_gemma":0.00037179585,"teacher_disagreement_score":0.0026672941,"about_ca_system_score_codex":0.00080062856,"about_ca_system_score_gemma":0.0008931005,"threshold_uncertainty_score":0.008923054},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044414725,0.00045656308,0.93753654,0.00057000114,0.00019889728,0.00032989195,0.0011054862,0.002416774,0.012971142],"genre_scores_gemma":[0.3427599,0.0003456263,0.63984585,0.0005178047,0.0001052396,0.00046954406,0.0026915208,0.0007096425,0.012554907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865156,0.000671551,0.00004677916,0.00018448976,0.00023874271,0.00020699484],"domain_scores_gemma":[0.995634,0.0022480958,0.00021017231,0.0009874152,0.0006415752,0.00027859138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012088795,0.0009712471,0.00086541765,0.0015360387,0.00083394523,0.0014699285,0.0015153317,0.0007435941,0.0066892193],"category_scores_gemma":[0.0039523314,0.0007102499,0.0011857384,0.0018416492,0.00077929656,0.0016584891,0.001672986,0.0015373622,0.0018035603],"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.0010084984,0.0008034203,0.0026720038,0.00095295225,0.00021470286,0.0002738818,0.00047523787,0.2675567,0.032329384,0.17398223,0.06039881,0.45933223],"study_design_scores_gemma":[0.000073939955,0.00011298229,0.0004434439,0.00003862963,0.00004361031,0.00011218328,0.00008632841,0.8422334,0.009231062,0.14244531,0.005145985,0.000033038425],"about_ca_topic_score_codex":0.003111368,"about_ca_topic_score_gemma":0.0062090433,"teacher_disagreement_score":0.0066892193,"about_ca_system_score_codex":0.0010784396,"about_ca_system_score_gemma":0.0015581339,"threshold_uncertainty_score":0.02237767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076262117,0.011699977,0.96110237,0.004440162,0.0005378164,0.000076215285,0.00028571725,0.000120384706,0.014111163],"genre_scores_gemma":[0.34581873,0.027423194,0.60668635,0.0033357833,0.003888643,0.0009937502,0.0009517718,0.00033229924,0.010569425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98895246,0.00484448,0.0006750285,0.0014511689,0.003586843,0.00048999494],"domain_scores_gemma":[0.9699526,0.02248113,0.001077649,0.003750214,0.0022068827,0.0005315532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008433986,0.0017126064,0.0014504747,0.0038390136,0.0016546902,0.0056650606,0.0025891513,0.0037507908,0.0025173917],"category_scores_gemma":[0.036381956,0.00070393994,0.0013651906,0.0053337985,0.010455891,0.0156095475,0.006981918,0.007704989,0.0009619898],"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.000043879867,0.000010100139,0.00013982545,0.00010515527,0.000012878187,0.00003835374,0.00018714355,0.008526525,0.00039642266,0.9674222,0.0013956927,0.02172165],"study_design_scores_gemma":[0.000011550944,0.000046315305,0.000088184606,0.00008675411,0.000009302898,0.00008824964,0.00005941759,0.03460187,0.0006433184,0.95435286,0.009983995,0.00002817246],"about_ca_topic_score_codex":0.0021137493,"about_ca_topic_score_gemma":0.00083485164,"teacher_disagreement_score":0.008433986,"about_ca_system_score_codex":0.0051114494,"about_ca_system_score_gemma":0.0021209489,"threshold_uncertainty_score":0.044603705},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011753934,0.00060695125,0.97581416,0.0009112443,0.00014116542,0.00012507624,0.00017916327,0.0005319835,0.009936345],"genre_scores_gemma":[0.34530288,0.0017128787,0.64014065,0.00091994315,0.0013881158,0.0011805508,0.0010448812,0.0009462843,0.007363866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9760833,0.009895924,0.0021968333,0.0052417195,0.0048990916,0.0016830972],"domain_scores_gemma":[0.9340982,0.04304843,0.0033731274,0.0152397845,0.0035771134,0.0006634013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019617489,0.0016333199,0.001701338,0.0066051665,0.0026710338,0.007646681,0.003911623,0.0030305898,0.0051890905],"category_scores_gemma":[0.053525314,0.0015197746,0.007743719,0.0032152766,0.014278302,0.01823257,0.011019167,0.009065188,0.0012529471],"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.000034690922,0.000016444912,0.00028148261,0.00010742438,0.00003604679,0.00004452602,0.00066088646,0.005021638,0.0005972693,0.9821062,0.00064185687,0.010451678],"study_design_scores_gemma":[0.000013960452,0.0000281811,0.000083728846,0.000051183684,0.00003610548,0.000068435846,0.00012822644,0.012842214,0.0015844584,0.97959375,0.0055334764,0.000036363337],"about_ca_topic_score_codex":0.0013900878,"about_ca_topic_score_gemma":0.00079880224,"teacher_disagreement_score":0.019617489,"about_ca_system_score_codex":0.0053218137,"about_ca_system_score_gemma":0.0021180897,"threshold_uncertainty_score":0.10374838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5509737,0.007989086,0.20640229,0.0049024336,0.00052127265,0.0001532397,0.0012270163,0.0003301031,0.22750096],"genre_scores_gemma":[0.9331746,0.0045247255,0.0266137,0.00043260097,0.000626917,0.0001656681,0.0008533131,0.00019409502,0.03341428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968493,0.00006912322,0.00001313668,0.00006406738,0.000118985714,0.000049809194],"domain_scores_gemma":[0.99856925,0.0009067846,0.00017022637,0.00010086069,0.000108738415,0.00014422806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027031856,0.0005692586,0.0006040193,0.0016562996,0.0008626218,0.0021371096,0.0009951447,0.0010860788,0.007440642],"category_scores_gemma":[0.0029149044,0.00058333966,0.0005652649,0.0021504294,0.0016876679,0.0035951566,0.0011762958,0.0021691415,0.00056901993],"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.000055342603,0.000033692126,0.00051297864,0.000121706194,0.000015536256,0.000077424935,0.00025138364,0.021060314,0.0011368508,0.951517,0.0049603065,0.020257493],"study_design_scores_gemma":[0.0000065752747,0.000006399364,0.00025730417,0.0000123423215,0.000005055429,0.000043256372,0.000049868417,0.012622541,0.00016959522,0.984528,0.0022924044,0.0000065199506],"about_ca_topic_score_codex":0.0015330075,"about_ca_topic_score_gemma":0.0014961625,"teacher_disagreement_score":0.007440642,"about_ca_system_score_codex":0.0011397402,"about_ca_system_score_gemma":0.0004187981,"threshold_uncertainty_score":0.024891496},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68381727,0.00014202828,0.29039857,0.0024966365,0.00028774378,0.00021710533,0.0009597993,0.0033158723,0.018364944],"genre_scores_gemma":[0.88530195,0.0000956628,0.10786423,0.00036577188,0.00014041486,0.000076451746,0.0017777386,0.00042429008,0.003953515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997359,0.0006091345,0.0002796863,0.000799787,0.0005547674,0.0003976926],"domain_scores_gemma":[0.98535687,0.011964859,0.0005356219,0.0007425442,0.0009367559,0.00046333016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027445378,0.00044285777,0.0007737377,0.00058131624,0.0010276375,0.00309205,0.0016226125,0.0017935358,0.0044814823],"category_scores_gemma":[0.008858259,0.00082085107,0.0018427708,0.0005183507,0.0026697095,0.005138241,0.0013877539,0.0024388141,0.0012111957],"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.0046986416,0.00078454136,0.028564796,0.0016062357,0.0005372023,0.006244083,0.0035795902,0.04582033,0.20802283,0.44493148,0.021469433,0.23374084],"study_design_scores_gemma":[0.00030494257,0.0005090664,0.003209405,0.00010119675,0.00026329065,0.0018019679,0.0013377374,0.14826748,0.10383663,0.7322749,0.007949196,0.00014410415],"about_ca_topic_score_codex":0.00070868776,"about_ca_topic_score_gemma":0.0010475882,"teacher_disagreement_score":0.0044814823,"about_ca_system_score_codex":0.00062821223,"about_ca_system_score_gemma":0.0013543423,"threshold_uncertainty_score":0.014992118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09207621,0.0005818141,0.88197184,0.0007947122,0.00011090343,0.00010676113,0.00031086392,0.00070930045,0.023337618],"genre_scores_gemma":[0.8332606,0.000804612,0.14559396,0.00034977178,0.00010509538,0.0004951432,0.00041556696,0.00018556355,0.018789673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995427,0.00011806728,0.00002975204,0.00012877805,0.00011481864,0.000065787695],"domain_scores_gemma":[0.99894994,0.0005660183,0.00009753281,0.00020772222,0.00010454167,0.00007424725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037997798,0.00037808155,0.0004428441,0.000562615,0.0008442119,0.0022040673,0.0014082756,0.001401242,0.0050129853],"category_scores_gemma":[0.0017996732,0.00040497727,0.00096101145,0.0006044098,0.0023792698,0.0032955722,0.001120886,0.0012886592,0.0009194967],"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.000017845192,0.000017145063,0.00019705968,0.00004322148,0.000008482688,0.000116714255,0.00017986362,0.026717193,0.0029072918,0.966214,0.00044269368,0.0031386039],"study_design_scores_gemma":[0.000018711797,0.000032354772,0.00009628128,0.00001817287,0.000012456521,0.00011421207,0.00009184429,0.23217383,0.0019468411,0.7604437,0.005033161,0.000018419976],"about_ca_topic_score_codex":0.0016886861,"about_ca_topic_score_gemma":0.0013827572,"teacher_disagreement_score":0.0050129853,"about_ca_system_score_codex":0.0011829372,"about_ca_system_score_gemma":0.0007997543,"threshold_uncertainty_score":0.016770124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15583931,0.00043048896,0.80773336,0.003359541,0.00025178012,0.00013717577,0.00093904044,0.0015027489,0.02980659],"genre_scores_gemma":[0.91899455,0.00033800997,0.068422586,0.00091330096,0.0002779774,0.00039956087,0.0010896766,0.0005666438,0.0089976685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963797,0.0009801022,0.00035338514,0.0006008476,0.0011753725,0.00051055965],"domain_scores_gemma":[0.97303605,0.021281123,0.0008245736,0.0020837842,0.0022160814,0.0005583496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002703366,0.00068638794,0.0009898396,0.0019788162,0.0013613974,0.0042043794,0.002460012,0.0023783827,0.0070560244],"category_scores_gemma":[0.01678852,0.0009323708,0.002140187,0.0013690875,0.004086292,0.008646728,0.003017753,0.0054287636,0.00075751456],"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.00005740555,0.000040173953,0.00024916127,0.00005913129,0.00001179084,0.000103694154,0.0002737976,0.0054137274,0.0016811955,0.9870384,0.00079541735,0.0042761606],"study_design_scores_gemma":[0.000017844563,0.0000142085655,0.000063610576,0.000010165353,0.000011562857,0.000049560334,0.000051532432,0.043658346,0.001701728,0.9538077,0.00060031726,0.000013506494],"about_ca_topic_score_codex":0.0013782372,"about_ca_topic_score_gemma":0.001454058,"teacher_disagreement_score":0.0070560244,"about_ca_system_score_codex":0.0019352067,"about_ca_system_score_gemma":0.0016861663,"threshold_uncertainty_score":0.02360475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36626178,0.0075963126,0.45533112,0.002043587,0.001913303,0.0013826764,0.00370457,0.020749059,0.14101762],"genre_scores_gemma":[0.52312124,0.0011155166,0.45399675,0.0006661105,0.0001403443,0.00049329025,0.0059022815,0.0019877492,0.012576697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516726,0.0018780612,0.0003085,0.0005655415,0.0015840628,0.00049659464],"domain_scores_gemma":[0.99171174,0.004021401,0.00029365876,0.0008176106,0.0028975287,0.00025810025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053716917,0.0015858526,0.001452042,0.0013770518,0.00087949727,0.001750811,0.0019563278,0.0020300555,0.009571877],"category_scores_gemma":[0.015664214,0.0003264647,0.00092355756,0.0013410436,0.00090642413,0.0013514548,0.0013084288,0.0011597543,0.0025711579],"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.0023021183,0.00051061454,0.005405876,0.00088438403,0.00027389676,0.00016773643,0.00013556301,0.6045525,0.0069463914,0.015671127,0.032890048,0.33025974],"study_design_scores_gemma":[0.00033989458,0.0009357355,0.0010880113,0.00011496836,0.00009936719,0.00014098542,0.000178103,0.9613318,0.010671474,0.0053566205,0.019694375,0.000048666738],"about_ca_topic_score_codex":0.006658941,"about_ca_topic_score_gemma":0.0062250965,"teacher_disagreement_score":0.009571877,"about_ca_system_score_codex":0.0017926268,"about_ca_system_score_gemma":0.0039949585,"threshold_uncertainty_score":0.032021105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87307614,0.00034110108,0.082804285,0.0021555962,0.00010365315,0.000050212424,0.00059733546,0.00051065115,0.04036104],"genre_scores_gemma":[0.99465925,0.00007203248,0.0023637812,0.00006204788,0.00006311654,0.00004499097,0.00026987144,0.00007732824,0.0023876543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989806,0.00021876745,0.000044965866,0.00018185144,0.00033587829,0.00023791548],"domain_scores_gemma":[0.9925688,0.004723873,0.0006014956,0.00076237513,0.00055950816,0.00078395073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012617025,0.0005138029,0.0010176484,0.0017091794,0.0016733698,0.0034303148,0.0015274778,0.0018731938,0.012257418],"category_scores_gemma":[0.011172446,0.000620519,0.00074243214,0.0008943123,0.001883617,0.004312464,0.0024931438,0.0017647225,0.0006960724],"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.00026568206,0.000095989766,0.0018412388,0.000086859654,0.00002684658,0.00016246304,0.0002370808,0.05069568,0.0036623676,0.93331176,0.0024480834,0.007165957],"study_design_scores_gemma":[0.000025496047,0.000030320416,0.0010644087,0.000015144912,0.000014264458,0.0000790556,0.000078097626,0.43302172,0.0017247343,0.5633924,0.0005277093,0.000026727274],"about_ca_topic_score_codex":0.0011549944,"about_ca_topic_score_gemma":0.00083496334,"teacher_disagreement_score":0.012257418,"about_ca_system_score_codex":0.0013654942,"about_ca_system_score_gemma":0.0008995724,"threshold_uncertainty_score":0.041005194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36968926,0.0062008607,0.26335052,0.004993101,0.0054120263,0.0005369055,0.008560297,0.005319117,0.33593798],"genre_scores_gemma":[0.7545125,0.0016651546,0.08067882,0.0015829615,0.00067587045,0.0007225959,0.0049017128,0.0017888788,0.15347157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821115,0.00046342032,0.00021246298,0.00032850032,0.00033800452,0.00044662022],"domain_scores_gemma":[0.9981528,0.0005547725,0.0002147938,0.0005135661,0.0003878712,0.00017620901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073884666,0.0014624922,0.0010783924,0.0016958024,0.0031371939,0.003431968,0.0011583418,0.001702588,0.02627329],"category_scores_gemma":[0.00347251,0.00061934884,0.0009966547,0.0014383298,0.0029317872,0.0052935476,0.0027433112,0.0013534881,0.013298648],"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.0008184829,0.00009117897,0.0017264314,0.0007478362,0.0001662764,0.0013451381,0.00095206586,0.0015062828,0.01978487,0.8636161,0.029373106,0.07987219],"study_design_scores_gemma":[0.000037650447,0.000084627434,0.0006677496,0.00014561968,0.00010690638,0.00070029695,0.00052143965,0.0020811001,0.012325591,0.86866146,0.114583224,0.00008439757],"about_ca_topic_score_codex":0.00061935035,"about_ca_topic_score_gemma":0.0009803809,"teacher_disagreement_score":0.02627329,"about_ca_system_score_codex":0.0007794047,"about_ca_system_score_gemma":0.00087181333,"threshold_uncertainty_score":0.08789289},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37310275,0.0005453672,0.61361426,0.001655493,0.0003359006,0.000072356524,0.00021323202,0.001638371,0.008822209],"genre_scores_gemma":[0.8614869,0.00024002024,0.13078801,0.00069855066,0.00010989001,0.00009229719,0.000262935,0.00032635435,0.0059950952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988422,0.0002536853,0.00011651337,0.00032632853,0.00027435497,0.00018690605],"domain_scores_gemma":[0.99178386,0.005460843,0.0004804117,0.0016370871,0.0003645158,0.00027333043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009481045,0.00048060084,0.0007237538,0.0005927046,0.0005576796,0.0016827334,0.0013946414,0.0013971013,0.00315025],"category_scores_gemma":[0.009575078,0.0004714895,0.0007301198,0.0006415133,0.0016599954,0.005019042,0.0030543706,0.002425677,0.0008142103],"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.0015894421,0.00039718853,0.0032817216,0.00066995306,0.00014531754,0.0007706978,0.00071852515,0.049102604,0.15668188,0.39347145,0.003954111,0.3892172],"study_design_scores_gemma":[0.000115754934,0.00023190177,0.00047831933,0.00008482553,0.000049957558,0.00043233903,0.00022803522,0.27723595,0.08327513,0.6328239,0.004992994,0.0000509508],"about_ca_topic_score_codex":0.00023504527,"about_ca_topic_score_gemma":0.0005224917,"teacher_disagreement_score":0.00315025,"about_ca_system_score_codex":0.0004206193,"about_ca_system_score_gemma":0.000739165,"threshold_uncertainty_score":0.010538638},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034578428,0.0019934932,0.93359417,0.00020781562,0.0004007333,0.0004680929,0.0017173903,0.02354231,0.0034975254],"genre_scores_gemma":[0.13555926,0.0022792455,0.841816,0.0002759008,0.00013247968,0.0014808719,0.007840689,0.0015585816,0.00905693],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993814,0.00007460874,0.000055409146,0.00014278007,0.00028332503,0.00006247559],"domain_scores_gemma":[0.9998061,0.000033823497,0.000049495113,0.00003346887,0.000029438534,0.00004766699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005152929,0.0013240466,0.0007701592,0.0008975224,0.00058355264,0.0008340581,0.0013954605,0.00063114293,0.0031575896],"category_scores_gemma":[0.0004554366,0.00092029746,0.0007873991,0.0004369321,0.00035799626,0.00079669885,0.0010631664,0.0022441274,0.0037152239],"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.00021586516,0.000066522516,0.00023115413,0.00044412824,0.000038148894,0.00016543665,0.000073835654,0.0024924292,0.9330287,0.0061551644,0.0031188692,0.053969767],"study_design_scores_gemma":[0.000057919035,0.00040453766,0.00044779395,0.00004696657,0.000039823914,0.00083195796,0.000016898246,0.018745583,0.8167988,0.00177091,0.16075344,0.00008528223],"about_ca_topic_score_codex":0.00034076933,"about_ca_topic_score_gemma":0.00036523593,"teacher_disagreement_score":0.0031575896,"about_ca_system_score_codex":0.0006411502,"about_ca_system_score_gemma":0.00052355207,"threshold_uncertainty_score":0.010563195},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005172917,0.0072087557,0.50332433,0.0012402859,0.0028340286,0.0003922711,0.0040457663,0.052744385,0.42303735],"genre_scores_gemma":[0.012429107,0.0028691278,0.11940672,0.0011599081,0.00030109478,0.00016130359,0.0051509133,0.0076210047,0.8509009],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992379,0.000030981282,0.000031055177,0.00013200507,0.00049050746,0.00007756649],"domain_scores_gemma":[0.9993305,0.000109821965,0.000021416236,0.00023806623,0.00026089596,0.000039231683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048507465,0.001497349,0.0012117918,0.0017087546,0.0012103936,0.00245862,0.002891435,0.001434036,0.08674219],"category_scores_gemma":[0.0013272604,0.0010069904,0.0009975572,0.0017468818,0.00077527686,0.0034930413,0.0017739555,0.001790836,0.1316507],"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.00017824989,0.00006215647,0.0001627606,0.00048655094,0.000041235842,0.00033726386,0.00015939621,0.00076889,0.058892358,0.044669915,0.42791975,0.46632144],"study_design_scores_gemma":[0.000019336463,0.000038170554,0.00025567095,0.0000795033,0.000036491263,0.0011100313,0.000034409913,0.004166418,0.06090005,0.00972566,0.92357486,0.000059421785],"about_ca_topic_score_codex":0.0029323073,"about_ca_topic_score_gemma":0.0051357527,"teacher_disagreement_score":0.08674219,"about_ca_system_score_codex":0.00088491023,"about_ca_system_score_gemma":0.000904267,"threshold_uncertainty_score":0.29018152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078878365,0.00010708224,0.91203827,0.000248545,0.00005685517,0.00007968513,0.00027263557,0.00023942375,0.008079051],"genre_scores_gemma":[0.60763264,0.00033555165,0.3684863,0.00030549633,0.00007881352,0.00025669826,0.00110142,0.00039165758,0.021411426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943227,0.000108886794,0.00002566093,0.00017769526,0.00014164374,0.000113836075],"domain_scores_gemma":[0.9986319,0.00046891737,0.0001512929,0.00019347554,0.00036424104,0.0001900552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004286908,0.00049225485,0.0005045742,0.0009155343,0.0007196053,0.00081355305,0.00092969585,0.00091396336,0.007421794],"category_scores_gemma":[0.0021830134,0.0003280187,0.0006964185,0.0005908985,0.0011996849,0.001545236,0.0010226069,0.001420395,0.0011926555],"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.00009435185,0.000057268895,0.0006303145,0.000108055116,0.000026819182,0.00028631446,0.0002684929,0.09351517,0.01406609,0.86817133,0.0028047743,0.019971123],"study_design_scores_gemma":[0.000019076377,0.00007671097,0.0002990443,0.00001942415,0.000012837796,0.0001841489,0.00012008984,0.45257428,0.002784878,0.53885794,0.0050216755,0.000029817927],"about_ca_topic_score_codex":0.0028685725,"about_ca_topic_score_gemma":0.0021521612,"teacher_disagreement_score":0.007421794,"about_ca_system_score_codex":0.0007286213,"about_ca_system_score_gemma":0.0008805828,"threshold_uncertainty_score":0.024828374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07449611,0.0023970078,0.8757959,0.0013657577,0.00069998374,0.0009225548,0.0021887545,0.0073112347,0.034822732],"genre_scores_gemma":[0.68075866,0.0011472746,0.27273986,0.00056333,0.00030086242,0.00076381536,0.004109254,0.0002168813,0.0394001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991033,0.00016337629,0.00011073416,0.0001396664,0.00033090753,0.00015201226],"domain_scores_gemma":[0.9992424,0.000120198725,0.00006995602,0.00025866937,0.00026085827,0.000047964837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244076,0.00044478677,0.00068848697,0.0010411156,0.00092355715,0.001294979,0.0011412553,0.0007651387,0.008661472],"category_scores_gemma":[0.0016591003,0.00017948724,0.00047360666,0.0011248828,0.00034788964,0.002041387,0.0013273484,0.0006357094,0.0041886456],"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.0029597455,0.00040139872,0.002144682,0.0006426199,0.00017076943,0.00058101676,0.00038474676,0.027706062,0.08402409,0.15039334,0.050517615,0.68007386],"study_design_scores_gemma":[0.0012945225,0.0018340792,0.0026046683,0.00027471437,0.0003334738,0.00391007,0.00022757775,0.4172208,0.27428758,0.13357669,0.16414917,0.00028663198],"about_ca_topic_score_codex":0.0007653233,"about_ca_topic_score_gemma":0.00055526715,"teacher_disagreement_score":0.008661472,"about_ca_system_score_codex":0.0007718991,"about_ca_system_score_gemma":0.0013618071,"threshold_uncertainty_score":0.028975546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3048709,0.0009379313,0.6458742,0.0006247749,0.00022528584,0.00010478924,0.00065426226,0.0011677225,0.045540124],"genre_scores_gemma":[0.85131526,0.0005368048,0.13623019,0.00043398916,0.00021482464,0.0002687191,0.0008070631,0.00024024596,0.0099529065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891245,0.00025771733,0.00006863793,0.00023895931,0.00028632625,0.00023598623],"domain_scores_gemma":[0.9967269,0.001623161,0.00046878625,0.00058288284,0.00031996093,0.00027840235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046767766,0.0005671886,0.0004935328,0.0008689103,0.000854068,0.0018933277,0.0007378099,0.00069386134,0.006219644],"category_scores_gemma":[0.0049277195,0.00041641606,0.00051013636,0.0018623583,0.00078155595,0.002622945,0.0017287066,0.0012141903,0.0008785541],"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.00017418872,0.0000759086,0.0017578619,0.000109225235,0.000021378808,0.00019389098,0.00030682646,0.030452093,0.012175825,0.8967812,0.004439217,0.053512357],"study_design_scores_gemma":[0.000055225577,0.0002115725,0.0014169081,0.000048171358,0.000041757157,0.000619247,0.00020127314,0.20050184,0.014292834,0.7492558,0.033302076,0.000053252534],"about_ca_topic_score_codex":0.00041925206,"about_ca_topic_score_gemma":0.00040812674,"teacher_disagreement_score":0.006219644,"about_ca_system_score_codex":0.00083625014,"about_ca_system_score_gemma":0.00029099084,"threshold_uncertainty_score":0.020806849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04057191,0.00010305516,0.9531664,0.00010112369,0.000018680259,0.000083956504,0.00016990097,0.0002850629,0.0054999115],"genre_scores_gemma":[0.49175304,0.00021989315,0.50358033,0.00011847738,0.000028133116,0.0005394595,0.00058264524,0.0001860289,0.0029919671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989711,0.00024963735,0.000075702854,0.00013892159,0.00044848205,0.00011614575],"domain_scores_gemma":[0.99768806,0.0013708794,0.00023284151,0.0002659278,0.00035286875,0.000089340945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008216273,0.0004769228,0.0004351981,0.000836486,0.0006690332,0.00083046634,0.00079778134,0.0005554439,0.0024345892],"category_scores_gemma":[0.0048678815,0.00040086624,0.0005357392,0.0005263564,0.0010792217,0.0011258272,0.0013955834,0.0011397076,0.000545261],"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.00017404107,0.0000632598,0.0004932727,0.00018684276,0.000019066068,0.00014348252,0.00029610944,0.21392836,0.033445455,0.6831464,0.0015578779,0.06654579],"study_design_scores_gemma":[0.000037430727,0.00017456022,0.00027167975,0.00009067472,0.000015269814,0.00018999071,0.000082297716,0.5512966,0.054273497,0.38303766,0.010469271,0.00006116676],"about_ca_topic_score_codex":0.0006144643,"about_ca_topic_score_gemma":0.00081262906,"teacher_disagreement_score":0.0024345892,"about_ca_system_score_codex":0.00084050366,"about_ca_system_score_gemma":0.0012011818,"threshold_uncertainty_score":0.008144498},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20312826,0.008824759,0.67682314,0.026519783,0.0011923746,0.00095894095,0.0043540196,0.0081628105,0.07003597],"genre_scores_gemma":[0.8137238,0.0023831981,0.15729415,0.0037080518,0.0018281781,0.0013466623,0.003396893,0.0017827069,0.01453623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97516745,0.006694178,0.0013626999,0.0044186693,0.006499231,0.0058577647],"domain_scores_gemma":[0.8601319,0.11351941,0.0051383497,0.012770807,0.004995879,0.0034436572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010210008,0.0037890917,0.004372202,0.0038420074,0.0052855387,0.011151225,0.009090262,0.005544162,0.024181796],"category_scores_gemma":[0.06391566,0.0018835416,0.003782211,0.005820145,0.00808118,0.030653216,0.0124663245,0.009745124,0.004518083],"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.0047948984,0.0015568346,0.008158063,0.003396571,0.0005317873,0.0009281339,0.0021010304,0.23435345,0.017146066,0.5325271,0.056466088,0.13804002],"study_design_scores_gemma":[0.00034161366,0.00035937122,0.00062224164,0.00018115096,0.00017634004,0.00039915802,0.00025550264,0.4119045,0.0063762893,0.5715127,0.0077759298,0.00009508579],"about_ca_topic_score_codex":0.0024406943,"about_ca_topic_score_gemma":0.0021571715,"teacher_disagreement_score":0.024181796,"about_ca_system_score_codex":0.0065036872,"about_ca_system_score_gemma":0.005627916,"threshold_uncertainty_score":0.08089614},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009510484,0.006382979,0.024740977,0.036551435,0.03376826,0.0013849072,0.08308509,0.008911578,0.79566437],"genre_scores_gemma":[0.025779024,0.0020237328,0.017914524,0.0045662774,0.0026628168,0.00039072472,0.054395594,0.002322541,0.8899447],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989379,0.00021173099,0.000036678037,0.00015857117,0.00045811333,0.00019703002],"domain_scores_gemma":[0.9985732,0.000054255448,0.000061221916,0.0001733355,0.0005787993,0.0005592421],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026147047,0.00088063144,0.00056008715,0.0013532238,0.00077606185,0.0022353427,0.0020971019,0.0017439172,0.2763339],"category_scores_gemma":[0.0017231602,0.00023189283,0.00057052285,0.001019632,0.00044594836,0.00093339785,0.0023090555,0.0013128995,0.1731519],"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.00039243323,0.00011420262,0.00059858244,0.00032861586,0.00001969288,0.00013646981,0.00006539649,0.0005130908,0.004194188,0.02078723,0.8881143,0.0847357],"study_design_scores_gemma":[0.000030778854,0.00007190537,0.00065688614,0.000052887288,0.0000042187157,0.00005480042,0.000021644832,0.00024288349,0.0017499874,0.0012977148,0.99580956,0.000006641214],"about_ca_topic_score_codex":0.0051202206,"about_ca_topic_score_gemma":0.0045749024,"teacher_disagreement_score":0.7236661,"about_ca_system_score_codex":0.0027637423,"about_ca_system_score_gemma":0.0036436075,"threshold_uncertainty_score":0.924429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82731986,0.0017228203,0.11852334,0.0019800984,0.00037149852,0.00012720718,0.0006188717,0.0022623886,0.047073927],"genre_scores_gemma":[0.98955905,0.0002081831,0.008623373,0.0001670461,0.00015024985,0.00006440423,0.00015164881,0.00010493112,0.00097106065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990212,0.00011022651,0.00007937667,0.00030751358,0.00021287767,0.00026888427],"domain_scores_gemma":[0.99654096,0.0013173966,0.00046407513,0.0010153642,0.00022498937,0.00043723837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010177492,0.0006853473,0.0009992165,0.0017348487,0.0022235666,0.0036243482,0.001569413,0.0021348943,0.0038845981],"category_scores_gemma":[0.0053288196,0.0006782409,0.0012607198,0.0009770176,0.0047970447,0.004177334,0.002788026,0.0020429601,0.00036094134],"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.000095082745,0.000057360416,0.0022415135,0.000121107485,0.000030568594,0.00042434366,0.0003889409,0.0014655257,0.010134748,0.9761563,0.0019258865,0.006958519],"study_design_scores_gemma":[0.00005030296,0.000051245366,0.0018634928,0.000018048015,0.000038801998,0.0010615741,0.00013467805,0.019218583,0.0051330137,0.96942645,0.0029526593,0.00005126781],"about_ca_topic_score_codex":0.0004643436,"about_ca_topic_score_gemma":0.00039199827,"teacher_disagreement_score":0.0038845981,"about_ca_system_score_codex":0.0009787444,"about_ca_system_score_gemma":0.0005847039,"threshold_uncertainty_score":0.012995243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032779627,0.00012924863,0.96074826,0.00012375748,0.000037860125,0.00009975424,0.00015468815,0.00029309446,0.0056336857],"genre_scores_gemma":[0.50555974,0.00027778893,0.48882243,0.00014763202,0.000032266977,0.0003806169,0.00050328305,0.00009881457,0.0041774837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941826,0.0001365842,0.00003818633,0.000095858064,0.00023923838,0.00007187343],"domain_scores_gemma":[0.99868745,0.0005610749,0.00014612122,0.00024217734,0.0002790532,0.000084164494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357478,0.00052024866,0.0006223121,0.000546447,0.00044547147,0.00060603354,0.0009906485,0.0005249147,0.0018921312],"category_scores_gemma":[0.0028348013,0.00033303452,0.0004456615,0.0007672953,0.00092804746,0.0008913072,0.0014006263,0.0010691885,0.0006000006],"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.00015641982,0.00007086605,0.0004934383,0.00022691568,0.000033484463,0.00034064765,0.00025503378,0.30107468,0.044683523,0.55626285,0.0019621104,0.094440006],"study_design_scores_gemma":[0.00003348873,0.00011117663,0.00013088144,0.000037646252,0.000012452633,0.00017936864,0.000025648385,0.87233263,0.043256216,0.07810671,0.0057234145,0.000050333754],"about_ca_topic_score_codex":0.001015852,"about_ca_topic_score_gemma":0.0009614359,"teacher_disagreement_score":0.0018921312,"about_ca_system_score_codex":0.00062892487,"about_ca_system_score_gemma":0.0017522142,"threshold_uncertainty_score":0.006329775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14191218,0.00078009046,0.83097684,0.0004536492,0.00043213513,0.00023423096,0.00048967043,0.0015038099,0.023217399],"genre_scores_gemma":[0.5580991,0.0010128738,0.42666298,0.00025889478,0.00008715666,0.0003002983,0.001161681,0.00025124624,0.012165689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999178,0.00012223424,0.0000589818,0.0001652388,0.0003220271,0.00015342694],"domain_scores_gemma":[0.9985487,0.0003043843,0.00019386463,0.00038473855,0.00042496165,0.0001432405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040694146,0.00058074255,0.0006036547,0.0010460508,0.00083221425,0.0009116738,0.0007404429,0.00074172777,0.002194189],"category_scores_gemma":[0.0020234673,0.00034424927,0.00068292645,0.0010251743,0.0010362733,0.0006161615,0.0019980064,0.0014444861,0.0011663156],"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.00028314823,0.000161463,0.002034776,0.0006643984,0.00006612634,0.0011176644,0.00094639213,0.039262433,0.13876107,0.6025474,0.006326438,0.20782872],"study_design_scores_gemma":[0.00014150505,0.00083900074,0.0013917087,0.00030344096,0.00013879151,0.0023105752,0.00034854302,0.1880177,0.3913933,0.31791174,0.09696918,0.00023452037],"about_ca_topic_score_codex":0.00034141092,"about_ca_topic_score_gemma":0.00036453566,"teacher_disagreement_score":0.002194189,"about_ca_system_score_codex":0.0005570358,"about_ca_system_score_gemma":0.0012804295,"threshold_uncertainty_score":0.007340312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8466851,0.00010729058,0.14383353,0.0014388085,0.000085203756,0.00010827571,0.00045233185,0.0010183204,0.0062711365],"genre_scores_gemma":[0.95070726,0.00008564989,0.046456613,0.00027586598,0.0001214596,0.00008072256,0.0008651994,0.00017920598,0.0012281043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962997,0.0008418091,0.0004387302,0.0011848438,0.0007852276,0.00044972717],"domain_scores_gemma":[0.9749356,0.019636746,0.0015005028,0.0015347273,0.0014481941,0.00094417547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031932876,0.00030817057,0.0007045406,0.0007532186,0.0011565341,0.0029294034,0.0008326271,0.0011787546,0.0029339641],"category_scores_gemma":[0.013955397,0.0006159698,0.0012483858,0.00042482853,0.003929615,0.0054652505,0.0020437273,0.0017031757,0.00053192524],"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.003335907,0.0005057468,0.036166392,0.0011655785,0.00037047322,0.003967658,0.004177285,0.047885273,0.24702635,0.56239325,0.006344794,0.086661294],"study_design_scores_gemma":[0.00021355669,0.00031928736,0.004126359,0.00008161367,0.00019887323,0.0012506568,0.0011903081,0.16410087,0.14770836,0.6738863,0.006771944,0.00015183754],"about_ca_topic_score_codex":0.000496731,"about_ca_topic_score_gemma":0.00042121756,"teacher_disagreement_score":0.0031932876,"about_ca_system_score_codex":0.0008985538,"about_ca_system_score_gemma":0.0011931974,"threshold_uncertainty_score":0.016887903},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09609882,0.000588541,0.8747432,0.0010001108,0.000114826646,0.00010511873,0.000337853,0.0007147054,0.026296794],"genre_scores_gemma":[0.84929645,0.0007479116,0.12937558,0.0003690153,0.000106852836,0.0004717743,0.00040795584,0.00019007185,0.019034505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995291,0.00012686399,0.000029764575,0.00013314,0.00011751491,0.000063665546],"domain_scores_gemma":[0.9989454,0.00056216854,0.00009503745,0.00022031134,0.00010266008,0.00007442456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039658538,0.00038905587,0.00044519315,0.00055832876,0.00083213614,0.002317329,0.001450206,0.0014868737,0.0053610913],"category_scores_gemma":[0.0018411103,0.0004127263,0.0009175844,0.00061483134,0.0025107802,0.0034945004,0.0011313774,0.0013680623,0.00093734363],"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.000015414354,0.000014904342,0.00017228776,0.000035821748,0.0000072020944,0.000090770314,0.00015327435,0.022807673,0.002287154,0.9713507,0.00043534362,0.002629446],"study_design_scores_gemma":[0.000016754639,0.00002403601,0.00007864429,0.000015039343,0.000009701531,0.000089918554,0.00008238778,0.20200127,0.0016594379,0.7915378,0.00446996,0.000015012461],"about_ca_topic_score_codex":0.0015987372,"about_ca_topic_score_gemma":0.001289308,"teacher_disagreement_score":0.0053610913,"about_ca_system_score_codex":0.0012603705,"about_ca_system_score_gemma":0.00078622095,"threshold_uncertainty_score":0.01793462},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17974886,0.0007475911,0.81359756,0.00068929204,0.0000933416,0.00008321331,0.00016094948,0.00025082153,0.004628412],"genre_scores_gemma":[0.9619547,0.00047571474,0.03531422,0.00007977568,0.00006328163,0.00008468203,0.000061524,0.000026890406,0.001939089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997735,0.0009198391,0.00008250768,0.00026402585,0.0006347652,0.0003637654],"domain_scores_gemma":[0.987207,0.009062027,0.0018338857,0.00086117414,0.0008730663,0.00016276303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023203492,0.001031622,0.0010863779,0.0007120547,0.00080852647,0.0012091076,0.0014471393,0.0014213015,0.0012469307],"category_scores_gemma":[0.009675766,0.0003267976,0.00033289645,0.0011900426,0.0021522124,0.0018349986,0.0015703773,0.0011460372,0.0003306501],"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.0005979355,0.000056697,0.0005589583,0.0003087819,0.00003694555,0.00054684817,0.00024927774,0.895544,0.014494658,0.06987678,0.00064289395,0.017086258],"study_design_scores_gemma":[0.00004260481,0.00010259493,0.0001366061,0.000015975647,0.000015626181,0.00015092967,0.00005538367,0.9664587,0.0064824154,0.026001759,0.0005098523,0.000027536447],"about_ca_topic_score_codex":0.0007926075,"about_ca_topic_score_gemma":0.0006428717,"teacher_disagreement_score":0.0023203492,"about_ca_system_score_codex":0.00080650393,"about_ca_system_score_gemma":0.0006916381,"threshold_uncertainty_score":0.012271345},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37314668,0.001820153,0.5445075,0.0010078683,0.0005495979,0.0003659656,0.0007829952,0.0012745893,0.07654466],"genre_scores_gemma":[0.7936009,0.00087865343,0.1886361,0.00032088874,0.00017160372,0.00032427392,0.00055495574,0.00026947015,0.0152431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969125,0.000057993908,0.000011572396,0.000048018333,0.0001196865,0.00007152091],"domain_scores_gemma":[0.999428,0.00018484038,0.00007572838,0.000111353955,0.00010819074,0.00009179481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002781492,0.00040992195,0.0002778868,0.0008883686,0.0007976723,0.0005799717,0.00046325912,0.0005384799,0.0034822526],"category_scores_gemma":[0.0012431062,0.00019184772,0.000406956,0.00071554026,0.001022528,0.00052413053,0.00091468997,0.00075780513,0.0009754127],"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.00014438806,0.00010605608,0.00070373254,0.00022458775,0.000015995223,0.0003826215,0.00030598757,0.01487719,0.053356368,0.8129774,0.0049387123,0.11196701],"study_design_scores_gemma":[0.000097861855,0.00045672012,0.0011264813,0.00014283234,0.00004613224,0.0011772262,0.00012428878,0.10084069,0.1647113,0.64547795,0.08562333,0.00017515846],"about_ca_topic_score_codex":0.0008635391,"about_ca_topic_score_gemma":0.0011994931,"teacher_disagreement_score":0.0034822526,"about_ca_system_score_codex":0.0007560224,"about_ca_system_score_gemma":0.001072716,"threshold_uncertainty_score":0.011649311},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7460298,0.00092817226,0.113237,0.0031773197,0.00020707183,0.000057512847,0.0010578111,0.0005753443,0.13473],"genre_scores_gemma":[0.9878808,0.00029057116,0.00402237,0.00012820814,0.00020037242,0.000051567677,0.00035456568,0.00008984655,0.0069816234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993992,0.00011597002,0.000028488492,0.00009816694,0.00025198556,0.00010620158],"domain_scores_gemma":[0.9962585,0.0027105722,0.0002617302,0.0003568228,0.00021081818,0.00020155971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006614017,0.00044205133,0.0009815267,0.0011009203,0.0010532385,0.0027400688,0.0010589653,0.0010791282,0.00973712],"category_scores_gemma":[0.0044802106,0.00040058492,0.00081166445,0.0010277765,0.0019688238,0.0040776925,0.0013816284,0.002202521,0.0007410683],"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.00006502291,0.000028343164,0.00026701656,0.000033101773,0.000009596808,0.00005730508,0.00009691323,0.010300174,0.0010410215,0.9814068,0.0013184291,0.0053763366],"study_design_scores_gemma":[0.0000067626534,0.000008991621,0.00024080835,0.0000036206332,0.000004063212,0.000032459684,0.000013834955,0.04063128,0.00034300823,0.9583996,0.0003071485,0.000008408732],"about_ca_topic_score_codex":0.0006644682,"about_ca_topic_score_gemma":0.00047761705,"teacher_disagreement_score":0.00973712,"about_ca_system_score_codex":0.0010043604,"about_ca_system_score_gemma":0.00060069695,"threshold_uncertainty_score":0.03257394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59087,0.0005638902,0.38512772,0.0006102255,0.000120347926,0.000085486165,0.00025216292,0.00057664764,0.021793557],"genre_scores_gemma":[0.8879874,0.0004794084,0.09975508,0.000111507354,0.0002179611,0.00017105842,0.0005301074,0.00023840583,0.010509073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978574,0.00040343212,0.00015919487,0.00053200073,0.00078677374,0.00026121366],"domain_scores_gemma":[0.9925844,0.0043601147,0.0009141307,0.00077644247,0.0009278565,0.0004369708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019831038,0.000561585,0.0008288998,0.00261264,0.0017073114,0.0024824727,0.0014453819,0.000969757,0.0055774814],"category_scores_gemma":[0.0129460385,0.0004720593,0.0005618725,0.0017177884,0.0025512753,0.00859774,0.002003707,0.0012929708,0.00084463396],"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.00025230032,0.0000809385,0.008763695,0.00023556144,0.00003823884,0.00039345116,0.0006252853,0.016745608,0.01784497,0.90188277,0.0012107625,0.0519264],"study_design_scores_gemma":[0.000014453174,0.000057115296,0.0013232297,0.000052337073,0.000031688807,0.0008080094,0.00022577886,0.09408967,0.029042784,0.86903024,0.0052908193,0.000033873046],"about_ca_topic_score_codex":0.0003676607,"about_ca_topic_score_gemma":0.00037899453,"teacher_disagreement_score":0.0055774814,"about_ca_system_score_codex":0.0013690979,"about_ca_system_score_gemma":0.00061427784,"threshold_uncertainty_score":0.018658519},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09870079,0.0014891775,0.86515117,0.0011861756,0.00022328491,0.00008597079,0.00018475275,0.0005324346,0.032446235],"genre_scores_gemma":[0.8597356,0.0015767899,0.12156084,0.0005357081,0.0002611037,0.00014829474,0.0001513128,0.0001478337,0.015882554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941325,0.00015017926,0.000028921497,0.00007935922,0.00023424393,0.00009401429],"domain_scores_gemma":[0.9980671,0.00092039356,0.00023959464,0.00041032073,0.0002876507,0.00007490362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065451476,0.00047004054,0.00035592538,0.000569755,0.0005916745,0.0011500475,0.00065007136,0.00085786224,0.0038104989],"category_scores_gemma":[0.0040605175,0.00014993144,0.0003498426,0.00086471206,0.0014235671,0.0016913974,0.0010543369,0.0012767719,0.0009824642],"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.000064404965,0.000027368322,0.00034253154,0.000085444684,0.000009135219,0.00015744621,0.00012975391,0.050965387,0.010711301,0.89789855,0.0016089943,0.037999585],"study_design_scores_gemma":[0.000018595814,0.00014410086,0.00015273345,0.0000457281,0.000016502969,0.0005011133,0.00007080818,0.40538672,0.02372052,0.5569674,0.012927201,0.00004867183],"about_ca_topic_score_codex":0.0005124615,"about_ca_topic_score_gemma":0.0005801376,"teacher_disagreement_score":0.0038104989,"about_ca_system_score_codex":0.00091359636,"about_ca_system_score_gemma":0.00070796144,"threshold_uncertainty_score":0.012747347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75737053,0.00043372583,0.1984083,0.0003644238,0.00010696658,0.0002500897,0.0032619606,0.0007992509,0.03900472],"genre_scores_gemma":[0.9560001,0.00022769017,0.030255333,0.00013458481,0.00003571098,0.00011896997,0.0027376618,0.000070748414,0.010419303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996573,0.000024201716,0.000020261481,0.000166618,0.000060860457,0.00007078254],"domain_scores_gemma":[0.9992066,0.00022348943,0.00013843004,0.00008344352,0.00019291733,0.00015511739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008985645,0.00039470522,0.00037574008,0.002075414,0.0011510574,0.0010077889,0.0007566596,0.00058486365,0.0063388916],"category_scores_gemma":[0.0010672305,0.00025088424,0.00033191562,0.0016189457,0.000461673,0.0010427788,0.0005351168,0.0004115347,0.00071485527],"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.0013808119,0.00037315983,0.036154322,0.0012230278,0.00011765501,0.0041116597,0.0023851183,0.061279185,0.21702851,0.51229376,0.013960664,0.14969216],"study_design_scores_gemma":[0.00018434631,0.000838387,0.024994621,0.00029236847,0.00019930307,0.0051885713,0.003373342,0.39180592,0.09081559,0.40502587,0.077052206,0.00022947435],"about_ca_topic_score_codex":0.0037338927,"about_ca_topic_score_gemma":0.0027087375,"teacher_disagreement_score":0.0063388916,"about_ca_system_score_codex":0.0009442744,"about_ca_system_score_gemma":0.0005966901,"threshold_uncertainty_score":0.021205723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041138265,0.00016639246,0.9449059,0.0009112887,0.0000661803,0.000399297,0.00043619281,0.0022967593,0.009679812],"genre_scores_gemma":[0.6172326,0.00043479138,0.367345,0.00076437683,0.00012932833,0.0016191013,0.0013144371,0.0006859722,0.010474285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957415,0.0012946725,0.00034618398,0.0007495923,0.0013982384,0.0004699117],"domain_scores_gemma":[0.9922969,0.0049441797,0.00049712445,0.0014906519,0.00057780085,0.00019329372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033744741,0.00075731095,0.0007831089,0.00081197696,0.0013023056,0.0024616765,0.0019838014,0.0012228894,0.008984622],"category_scores_gemma":[0.009604861,0.000685773,0.0014922369,0.00082270615,0.0033074785,0.009391415,0.0050153313,0.004630259,0.001575626],"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.00031618052,0.000153961,0.00045664757,0.00024270278,0.000034352623,0.00015204573,0.0009092545,0.032134168,0.016368976,0.9119541,0.0027047037,0.034572862],"study_design_scores_gemma":[0.0002386086,0.00018807087,0.00021145235,0.00008515368,0.00006663074,0.000090086316,0.00018403426,0.1375657,0.041329406,0.80850583,0.01146495,0.000070078386],"about_ca_topic_score_codex":0.0010671234,"about_ca_topic_score_gemma":0.0017067785,"teacher_disagreement_score":0.008984622,"about_ca_system_score_codex":0.0025974247,"about_ca_system_score_gemma":0.0021345315,"threshold_uncertainty_score":0.030056596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86393166,0.0009611432,0.13036436,0.00019757623,0.00009641786,0.00009508486,0.00012688499,0.0008596627,0.003367242],"genre_scores_gemma":[0.93112814,0.00028085415,0.06623256,0.000057396705,0.000012944968,0.0000710866,0.00010368065,0.00002730432,0.0020858634],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999816,0.000024693802,0.000014489268,0.000035447953,0.00008522413,0.000024134655],"domain_scores_gemma":[0.99961036,0.00010254537,0.00009644396,0.00006351219,0.000099947196,0.000027184336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022888239,0.00024172066,0.00016827238,0.0003610768,0.00022315176,0.00036914297,0.00047963814,0.0003541658,0.0008622782],"category_scores_gemma":[0.0005369764,0.00011310639,0.00018095474,0.00036929836,0.0003563926,0.0004865178,0.0004630955,0.0002401455,0.00026077926],"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.00017047129,0.00008974249,0.0010291844,0.0002116461,0.000024449631,0.00024993072,0.00017949328,0.0060226796,0.9552002,0.008054026,0.00034955793,0.028418707],"study_design_scores_gemma":[0.000013043893,0.00034842297,0.000366183,0.000014779287,0.000019330553,0.0001800453,0.000025456076,0.0306408,0.9640341,0.0004838546,0.0038437033,0.000030276638],"about_ca_topic_score_codex":0.0004564599,"about_ca_topic_score_gemma":0.00046915107,"teacher_disagreement_score":0.0008622782,"about_ca_system_score_codex":0.0003831199,"about_ca_system_score_gemma":0.0002484207,"threshold_uncertainty_score":0.0028845668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2996777,0.00079393387,0.67071545,0.0010535327,0.00012670751,0.000119261014,0.0002227233,0.0006101999,0.02668043],"genre_scores_gemma":[0.88210547,0.00035939767,0.110912204,0.00018082993,0.00012676044,0.00015177677,0.00021066291,0.0001774584,0.0057755588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997982,0.0004866241,0.00022330582,0.0004779165,0.0005107954,0.00031925642],"domain_scores_gemma":[0.99653876,0.001867482,0.00045778102,0.00055436883,0.0003832263,0.0001984827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751638,0.00050153176,0.0005793248,0.001592136,0.0016978387,0.0025455325,0.000942128,0.0010199391,0.003661582],"category_scores_gemma":[0.0047551184,0.00041789876,0.0016073075,0.0011700568,0.005606234,0.008175558,0.0026414555,0.0017991867,0.0005022024],"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.000012693933,0.00001044549,0.00015927781,0.00003193605,0.00000415584,0.000059212336,0.0003761083,0.0014754172,0.00092777144,0.9935314,0.00009860412,0.0033129223],"study_design_scores_gemma":[0.000009302578,0.00002144094,0.00009654005,0.000011062498,0.00000565833,0.0000972004,0.000110579254,0.0140978815,0.0014535917,0.9815036,0.002575413,0.000017698841],"about_ca_topic_score_codex":0.0010644413,"about_ca_topic_score_gemma":0.0005920739,"teacher_disagreement_score":0.003661582,"about_ca_system_score_codex":0.0019291259,"about_ca_system_score_gemma":0.0007271113,"threshold_uncertainty_score":0.01399678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08776041,0.0003479381,0.9048516,0.00022156593,0.00005877478,0.000110366585,0.0001887922,0.0005050985,0.00595554],"genre_scores_gemma":[0.8102236,0.00021000729,0.18348677,0.000109975685,0.000030461046,0.00009885723,0.00026457306,0.00014414676,0.0054316465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992811,0.00020334651,0.00003468523,0.0001368776,0.00020340431,0.00014059714],"domain_scores_gemma":[0.9987056,0.00054521457,0.00017899254,0.0002696844,0.00021143843,0.0000890411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076300465,0.0007913833,0.00078511285,0.00043800572,0.00044187275,0.0007597731,0.0010279729,0.00061225373,0.0037230665],"category_scores_gemma":[0.0036930777,0.00026425018,0.00032654815,0.0009071062,0.00058251625,0.001995928,0.0010799314,0.0007577459,0.0006184967],"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.00045711207,0.00017838819,0.0007803685,0.00021708712,0.000048935075,0.0002041333,0.00014293514,0.7363737,0.025407506,0.058042616,0.004243278,0.17390396],"study_design_scores_gemma":[0.000023722258,0.00014231441,0.00015862397,0.000009172972,0.000012928442,0.00010562926,0.000033184133,0.96615434,0.0065006707,0.025335386,0.0015122868,0.00001171318],"about_ca_topic_score_codex":0.0007268431,"about_ca_topic_score_gemma":0.0009271989,"teacher_disagreement_score":0.0037230665,"about_ca_system_score_codex":0.0007726052,"about_ca_system_score_gemma":0.00080995186,"threshold_uncertainty_score":0.012454867},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06958122,0.03949166,0.80626065,0.027335554,0.0029700606,0.000080749545,0.00040283354,0.0004138197,0.05346344],"genre_scores_gemma":[0.69046676,0.014840638,0.27312014,0.005242404,0.0025733816,0.00026753332,0.00029646105,0.00027448,0.012918229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975242,0.0010427143,0.00024149673,0.0004759361,0.00057762826,0.00013792048],"domain_scores_gemma":[0.99616385,0.0017391538,0.00040259148,0.0005655982,0.000712662,0.0004162038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049849013,0.0005440538,0.0010780544,0.0036198688,0.0030852037,0.008165647,0.0016437169,0.0027132018,0.0046469644],"category_scores_gemma":[0.004906751,0.00048746783,0.0012186662,0.0038388057,0.01272278,0.0237209,0.0037096788,0.0026065973,0.0009217713],"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.000019064399,0.000009636587,0.00023681394,0.00007009472,0.000008870987,0.000058007467,0.0007014832,0.0003443392,0.00026867105,0.99153155,0.0010323086,0.0057190447],"study_design_scores_gemma":[0.0000048804386,0.000020661817,0.00017822534,0.0001228854,0.000010385808,0.00030310967,0.0006947502,0.0017935522,0.0003761541,0.968347,0.028129771,0.000018591354],"about_ca_topic_score_codex":0.0009354713,"about_ca_topic_score_gemma":0.0007412699,"teacher_disagreement_score":0.008165647,"about_ca_system_score_codex":0.002173741,"about_ca_system_score_gemma":0.001101918,"threshold_uncertainty_score":0.026363015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08938747,0.00047028114,0.9030325,0.00039579326,0.000060883573,0.000105818,0.00051858986,0.0005081614,0.00552061],"genre_scores_gemma":[0.6722053,0.001061316,0.31864032,0.0002003216,0.00011506234,0.00041465825,0.0011954282,0.0003975908,0.0057699755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977443,0.0004475286,0.00024520766,0.00073652965,0.0006184966,0.00020785692],"domain_scores_gemma":[0.9916026,0.0043662624,0.0015899211,0.00120913,0.0009388769,0.00029316536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165979,0.00095157913,0.0006508674,0.0025177596,0.0012230474,0.0025061008,0.001714742,0.0014182694,0.0033242602],"category_scores_gemma":[0.011931323,0.0005613907,0.0016523596,0.002219205,0.004529218,0.007858208,0.0021494871,0.001508667,0.00064648513],"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.00011300539,0.000047066704,0.0021140305,0.00017231825,0.000034466113,0.00032850588,0.00065521715,0.1360558,0.014133935,0.8162025,0.00059632206,0.029546764],"study_design_scores_gemma":[0.00001642594,0.00007374504,0.0003583616,0.000061462524,0.000025791454,0.00025782565,0.00021192976,0.25830787,0.015437582,0.7172006,0.007986099,0.00006229862],"about_ca_topic_score_codex":0.0024683434,"about_ca_topic_score_gemma":0.0011919128,"teacher_disagreement_score":0.0033242602,"about_ca_system_score_codex":0.0017431913,"about_ca_system_score_gemma":0.0009076535,"threshold_uncertainty_score":0.012647867},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30997813,0.00089936337,0.645818,0.0005375614,0.00064376125,0.0002835025,0.00072473614,0.001936024,0.039178923],"genre_scores_gemma":[0.70415473,0.0008326667,0.27001593,0.00032545932,0.00008030363,0.00023327727,0.001099683,0.00032870774,0.022929184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993636,0.00009136158,0.000050836414,0.00011195392,0.00023300824,0.00014923495],"domain_scores_gemma":[0.99884367,0.00021496338,0.00013701811,0.00036097228,0.0002930117,0.00015028345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003266861,0.0005587877,0.00051061966,0.0010080477,0.00094838865,0.0010243278,0.00080982764,0.00079061935,0.0031340595],"category_scores_gemma":[0.0015220534,0.00035254582,0.00068177027,0.00090942584,0.0010170165,0.00066357845,0.0018088821,0.0012678312,0.0011538992],"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.00023463882,0.00014814937,0.002148305,0.0004521001,0.000053596872,0.0007579184,0.0006674356,0.026188271,0.12085139,0.7404154,0.003855006,0.104227826],"study_design_scores_gemma":[0.00012853919,0.00081182044,0.002307507,0.00023344088,0.00011208726,0.0022656021,0.0003186971,0.10235433,0.38925564,0.3795325,0.12237333,0.00030652527],"about_ca_topic_score_codex":0.00044460513,"about_ca_topic_score_gemma":0.00048318264,"teacher_disagreement_score":0.0031340595,"about_ca_system_score_codex":0.00069430843,"about_ca_system_score_gemma":0.0011371364,"threshold_uncertainty_score":0.010484517},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009379446,0.0005194908,0.9300742,0.0027728234,0.0002418985,0.00004978679,0.00012740884,0.0019037175,0.054931186],"genre_scores_gemma":[0.50591296,0.0010941634,0.43009478,0.0010862275,0.0005462025,0.00041620637,0.00040779123,0.0016895887,0.058751967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988158,0.00038729023,0.00007100362,0.00014963727,0.0004090717,0.00016719836],"domain_scores_gemma":[0.9982857,0.0010755644,0.000064108404,0.00034332107,0.00017687383,0.00005441993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018097123,0.00062250963,0.0004090066,0.000637153,0.001366764,0.0049695233,0.0022015614,0.0016587614,0.012295289],"category_scores_gemma":[0.0044816164,0.0010824085,0.0008799797,0.0009716095,0.005993417,0.009084852,0.0017624586,0.003868656,0.0039487304],"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.000010454698,0.000010844079,0.00003145922,0.000019700241,0.0000016345307,0.000022931185,0.000135938,0.001658335,0.0005762417,0.98902965,0.0013391264,0.007163744],"study_design_scores_gemma":[0.000012869745,0.000011984349,0.00003084843,0.000016038544,0.000004539836,0.00008513204,0.00005317691,0.020176666,0.0018132937,0.96156067,0.016222296,0.00001235188],"about_ca_topic_score_codex":0.0019110717,"about_ca_topic_score_gemma":0.001384645,"teacher_disagreement_score":0.012295289,"about_ca_system_score_codex":0.0018917324,"about_ca_system_score_gemma":0.0017208282,"threshold_uncertainty_score":0.041131794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6463249,0.0008491096,0.32964182,0.0015967648,0.000103158076,0.00020724052,0.0012726603,0.0011688132,0.018835489],"genre_scores_gemma":[0.9482816,0.00034516418,0.046061963,0.00016274171,0.000097903925,0.00030979115,0.0013120204,0.00017617228,0.00325267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735284,0.0004230601,0.00023429397,0.0007843911,0.0007791153,0.00042623834],"domain_scores_gemma":[0.9838251,0.012533227,0.0009152512,0.0012867026,0.00093594834,0.00050380547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009329609,0.00079498946,0.0009317784,0.0009824918,0.0011720647,0.004654392,0.0014345004,0.0011558033,0.007326277],"category_scores_gemma":[0.009764603,0.0006187783,0.0018960545,0.0014051468,0.0025355057,0.007101282,0.0029689048,0.003352709,0.0007992359],"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.00086777116,0.00058414566,0.007363396,0.0008276087,0.00014083092,0.0006544667,0.0020433983,0.20960075,0.040119078,0.66670865,0.0059107905,0.065179124],"study_design_scores_gemma":[0.000043250195,0.000105599065,0.0013239995,0.000025792324,0.000030896554,0.00026766944,0.00022497581,0.46290374,0.009862359,0.5238388,0.0013015319,0.00007144434],"about_ca_topic_score_codex":0.0016309477,"about_ca_topic_score_gemma":0.0010691992,"teacher_disagreement_score":0.007326277,"about_ca_system_score_codex":0.0020268634,"about_ca_system_score_gemma":0.0013373042,"threshold_uncertainty_score":0.024508834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27032787,0.0020192931,0.6296986,0.002746144,0.00034559067,0.0002483356,0.0011286524,0.0014854077,0.09200021],"genre_scores_gemma":[0.8335774,0.0013208467,0.13864857,0.00063555496,0.00055057433,0.0005149851,0.0020875914,0.0004722692,0.022192126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985133,0.00021156431,0.0001363169,0.0003964333,0.00054775376,0.00019469077],"domain_scores_gemma":[0.9894645,0.008501734,0.0004096886,0.00075366604,0.00052786205,0.00034255814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009450966,0.0010092763,0.0012812128,0.0012891466,0.0015491535,0.005529755,0.0019800682,0.0015965566,0.008649001],"category_scores_gemma":[0.007056942,0.0009977882,0.0027752367,0.0021873333,0.0030497524,0.011546508,0.0033821692,0.0054680402,0.0011641402],"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.00023986818,0.00016363066,0.0009425583,0.00030053718,0.000036148598,0.0002203908,0.0006738243,0.025111279,0.007102835,0.92176926,0.0042746225,0.039165072],"study_design_scores_gemma":[0.000015665522,0.000030052643,0.00036612657,0.000014697825,0.000011867242,0.0001453221,0.00008855119,0.055320635,0.0018703509,0.9409405,0.0011678991,0.000028347258],"about_ca_topic_score_codex":0.0013864065,"about_ca_topic_score_gemma":0.00096673635,"teacher_disagreement_score":0.008649001,"about_ca_system_score_codex":0.0016530205,"about_ca_system_score_gemma":0.0008554111,"threshold_uncertainty_score":0.028933764},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23624316,0.0005620506,0.7290446,0.0019593562,0.0002510589,0.000336752,0.001594628,0.0052979463,0.024710465],"genre_scores_gemma":[0.7719976,0.00043807807,0.21087688,0.00090066687,0.0003024577,0.00040167116,0.0015218081,0.0012514687,0.012309355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995533,0.00053227576,0.00044967132,0.0012444505,0.0015105207,0.0007300376],"domain_scores_gemma":[0.9816969,0.0087977545,0.0016257424,0.004784187,0.0022879126,0.0008075244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020392733,0.0008674267,0.0007661153,0.0016718514,0.0015416258,0.0029556735,0.0022881287,0.0010398325,0.0059259436],"category_scores_gemma":[0.019777393,0.00083638163,0.0023637738,0.001541228,0.004351919,0.007136559,0.004733646,0.0043393876,0.0010600161],"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.00025896184,0.000095343996,0.0019189969,0.0002938715,0.00004160673,0.0006281531,0.0011820444,0.03236273,0.006597638,0.8992243,0.0043599242,0.053036474],"study_design_scores_gemma":[0.000039603106,0.00003954076,0.00026534733,0.00004422168,0.000034750337,0.00038209066,0.00013589059,0.059011713,0.007017854,0.9232198,0.009751604,0.000057541616],"about_ca_topic_score_codex":0.003678827,"about_ca_topic_score_gemma":0.0027704255,"teacher_disagreement_score":0.0059259436,"about_ca_system_score_codex":0.0023806759,"about_ca_system_score_gemma":0.0025437654,"threshold_uncertainty_score":0.019824266},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057219444,0.33031264,0.18977472,0.27840158,0.026213003,0.00006295765,0.0008118976,0.0008470982,0.16785412],"genre_scores_gemma":[0.27203318,0.31764287,0.21241423,0.043859452,0.05300164,0.0003762405,0.0011227764,0.0017297888,0.09781974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966995,0.0013200036,0.00016721684,0.0005364771,0.0010944853,0.0001822212],"domain_scores_gemma":[0.985989,0.008722533,0.00032741122,0.0019483102,0.0021991262,0.00081350445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047819256,0.00072411087,0.0012822528,0.002826919,0.0021755446,0.0072820666,0.0012650646,0.0036953168,0.009396109],"category_scores_gemma":[0.01650549,0.0007124765,0.00090330135,0.0026248929,0.011897615,0.01777566,0.0032394254,0.012917358,0.005013316],"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.000036820697,0.000012086225,0.00020881761,0.00028394454,0.000013055645,0.000085373584,0.00062639755,0.0007296612,0.0003748597,0.9078548,0.049094968,0.04067924],"study_design_scores_gemma":[0.000010204572,0.000017384806,0.00014677407,0.0002437445,0.000005835678,0.00017133447,0.00017541529,0.0014967206,0.0003052007,0.6993248,0.29807708,0.000025488609],"about_ca_topic_score_codex":0.002161137,"about_ca_topic_score_gemma":0.0015404797,"teacher_disagreement_score":0.009396109,"about_ca_system_score_codex":0.0037110555,"about_ca_system_score_gemma":0.002088949,"threshold_uncertainty_score":0.031433105},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02742854,0.019227548,0.81904954,0.005999281,0.0021720352,0.00037377368,0.00024164584,0.0006111253,0.124896586],"genre_scores_gemma":[0.655054,0.019272586,0.28101808,0.0019319069,0.0023843674,0.0006735481,0.00028550794,0.00010990443,0.039270196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857414,0.00036656548,0.000098301,0.00020544996,0.0006304949,0.00012493214],"domain_scores_gemma":[0.9992945,0.0003068047,0.000079715,0.0001522301,0.00013407816,0.000032654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010164701,0.0005746988,0.0005801766,0.000904873,0.0008369799,0.0016951164,0.0007422567,0.0015155114,0.004345131],"category_scores_gemma":[0.0024953862,0.0002909398,0.0005329743,0.0013586727,0.0028369387,0.004756558,0.0017370427,0.002560839,0.0015919481],"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.000061493374,0.000031025695,0.00011912834,0.00020913477,0.000012037171,0.00015405021,0.00013843094,0.002892145,0.0054077124,0.95809364,0.003161309,0.029719863],"study_design_scores_gemma":[0.00010096117,0.00019541004,0.00017912846,0.00014375405,0.000024420631,0.00092605007,0.000066637775,0.034841493,0.020651918,0.84441555,0.09838117,0.0000735202],"about_ca_topic_score_codex":0.00030795144,"about_ca_topic_score_gemma":0.00015242175,"teacher_disagreement_score":0.004345131,"about_ca_system_score_codex":0.0012320663,"about_ca_system_score_gemma":0.0011225819,"threshold_uncertainty_score":0.014535844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022501292,0.0021548925,0.00006118965,0.053502988,0.9422752,0.000013302528,0.00003381899,0.000024881045,0.0019112506],"genre_scores_gemma":[0.00035223528,0.0015713669,0.00007131193,0.030237397,0.9601811,0.000024326308,0.0000244956,0.000031875792,0.0075058513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98918766,0.0023986076,0.0010391336,0.0011720468,0.005390587,0.0008119908],"domain_scores_gemma":[0.9600571,0.017369585,0.0020928166,0.0010299013,0.014108559,0.0053420896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012833199,0.0032109576,0.0030888752,0.005090167,0.005027023,0.011274496,0.004087899,0.018561073,0.022020785],"category_scores_gemma":[0.060376566,0.0009768137,0.0027723585,0.0024080111,0.0045797145,0.005392344,0.0029658773,0.021789087,0.01331831],"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.000021037235,0.000004885125,0.000008477921,0.000071843155,0.000006351547,0.00004136613,0.000010076943,0.0000100524585,0.000015827487,0.00032049257,0.99807453,0.001415088],"study_design_scores_gemma":[0.000068433175,0.00002299423,0.0001530192,0.00049370853,0.00004163507,0.00014662606,0.00006420951,0.00011579159,0.000065020504,0.0019006253,0.9969085,0.000019443358],"about_ca_topic_score_codex":0.0029164045,"about_ca_topic_score_gemma":0.007716281,"teacher_disagreement_score":0.022020785,"about_ca_system_score_codex":0.005293698,"about_ca_system_score_gemma":0.006125309,"threshold_uncertainty_score":0.07366687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2605363,0.0018195166,0.70198387,0.0005946683,0.00054719526,0.00043705353,0.00059193204,0.0016877683,0.031801738],"genre_scores_gemma":[0.6547646,0.00076100865,0.3401363,0.000051882253,0.000020268228,0.00038820808,0.00028855764,0.00010632529,0.0034828794],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961483,0.000068248584,0.00002349695,0.00007303816,0.00017033085,0.000050099534],"domain_scores_gemma":[0.99953175,0.000097532386,0.000126023,0.00009609477,0.000116642856,0.000031981395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035317856,0.00045122718,0.00029172975,0.00041468575,0.00041980116,0.0006367241,0.0006476408,0.00048346916,0.0015725819],"category_scores_gemma":[0.00091949716,0.00032769926,0.00029948525,0.00032394906,0.00042440614,0.00041288644,0.00038220792,0.000413525,0.00058399857],"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.00011781972,0.0001673855,0.0013366292,0.0007093576,0.000057688605,0.00030084685,0.00012817721,0.31551972,0.58583,0.04396808,0.0015881276,0.05027615],"study_design_scores_gemma":[0.000051772382,0.0006267814,0.0019512894,0.00012196466,0.000056069264,0.00021372866,0.00007396782,0.39119956,0.54649127,0.012656993,0.04649579,0.00006073227],"about_ca_topic_score_codex":0.0006150359,"about_ca_topic_score_gemma":0.0010526483,"teacher_disagreement_score":0.0015725819,"about_ca_system_score_codex":0.00071884965,"about_ca_system_score_gemma":0.00059831055,"threshold_uncertainty_score":0.005260825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011157379,0.000018262777,0.980029,0.00008585266,0.000041098265,0.00011585473,0.00016511203,0.0043885126,0.0039989064],"genre_scores_gemma":[0.31068224,0.00007023013,0.6801917,0.000099533114,0.000033192246,0.00040804857,0.00053277,0.0018409651,0.006141404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981002,0.00044508334,0.00013676292,0.000455101,0.0007157287,0.0001472378],"domain_scores_gemma":[0.9958682,0.0014736895,0.00018508972,0.0017487674,0.00061949686,0.00010484532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023965838,0.0006552338,0.0006948165,0.0008589845,0.0008941516,0.0027579986,0.0034644736,0.001750611,0.025174009],"category_scores_gemma":[0.008628749,0.00073542283,0.00097135303,0.0007959028,0.0022250155,0.004772436,0.002863231,0.0019245791,0.00436406],"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.0007194515,0.00043208562,0.0017469404,0.00038993583,0.0000527561,0.0003588742,0.0005750347,0.09147076,0.032013997,0.7333127,0.005215346,0.13371211],"study_design_scores_gemma":[0.00009964159,0.00009610177,0.00017027975,0.000031966585,0.000019251687,0.00014038951,0.00007650168,0.80033827,0.05574066,0.13436654,0.008876006,0.00004440606],"about_ca_topic_score_codex":0.001388879,"about_ca_topic_score_gemma":0.0008743065,"teacher_disagreement_score":0.025174009,"about_ca_system_score_codex":0.00069001125,"about_ca_system_score_gemma":0.0012787995,"threshold_uncertainty_score":0.08421552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010660709,0.00035604506,0.98647135,0.00026867772,0.00006521905,0.000032580723,0.000046743495,0.00076593086,0.0013328186],"genre_scores_gemma":[0.74087334,0.00037715462,0.25415745,0.00014676077,0.00014517023,0.00018033986,0.00017247992,0.00037108597,0.003576184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978168,0.0007131145,0.00012682397,0.0005879877,0.0006038553,0.00015140342],"domain_scores_gemma":[0.9930983,0.0047642626,0.0006904715,0.0007436603,0.00053687807,0.00016648989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028768198,0.0015554604,0.0018141529,0.00084456115,0.0005497131,0.0020907093,0.0022972177,0.001661201,0.0030597607],"category_scores_gemma":[0.014113368,0.0011012948,0.0009704632,0.0009838865,0.0019753848,0.0027017915,0.0021867964,0.0023794726,0.0006538115],"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.00015627878,0.000023560682,0.00012982509,0.000058830043,0.000034037505,0.000033165834,0.0000213248,0.95953804,0.0021142745,0.0145648895,0.00036001188,0.022965804],"study_design_scores_gemma":[0.00000491535,0.000007958005,0.000015170189,0.0000016589313,0.0000030594763,0.000005017031,0.0000011615497,0.9931143,0.00064012007,0.006076873,0.00012728243,0.0000025355873],"about_ca_topic_score_codex":0.0031647994,"about_ca_topic_score_gemma":0.0023198393,"teacher_disagreement_score":0.0031647994,"about_ca_system_score_codex":0.0015567325,"about_ca_system_score_gemma":0.0012041,"threshold_uncertainty_score":0.015214264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81033325,0.008176597,0.16924717,0.00038159316,0.00029182635,0.00021292946,0.0011081429,0.0012495705,0.008998881],"genre_scores_gemma":[0.87926036,0.0062367264,0.10243781,0.0003134242,0.000058302016,0.00040809865,0.0010486165,0.0002446959,0.009991993],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999413,0.000097125325,0.00003737034,0.00012054852,0.0002920803,0.000039741575],"domain_scores_gemma":[0.9992588,0.00023680493,0.00015058438,0.000064512,0.0002628644,0.000026359477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006225529,0.0006430449,0.0003455965,0.0009244186,0.00053864805,0.0006340686,0.0005922754,0.0007371883,0.0017531225],"category_scores_gemma":[0.0012604059,0.00025003057,0.00031148116,0.0010725919,0.000333771,0.00078385917,0.00032961587,0.0008633804,0.0009531317],"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.00006468572,0.000037306745,0.00060233584,0.000121626865,0.0000088380875,0.000037671452,0.00007342593,0.00015855223,0.9907849,0.00015443953,0.00013131098,0.007824876],"study_design_scores_gemma":[0.0000026448254,0.0001499414,0.0018786128,0.0000104642595,0.000015290438,0.00010006253,0.00007916382,0.0019300687,0.9940399,0.00008999914,0.0016891456,0.000014775109],"about_ca_topic_score_codex":0.0006635219,"about_ca_topic_score_gemma":0.000903678,"teacher_disagreement_score":0.0017531225,"about_ca_system_score_codex":0.00042110198,"about_ca_system_score_gemma":0.0005008753,"threshold_uncertainty_score":0.005864799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8169445,0.010175204,0.09934473,0.0033667989,0.00052272,0.0004036465,0.0006843744,0.0008938506,0.06766428],"genre_scores_gemma":[0.9326121,0.0022066399,0.062014233,0.00022232375,0.00014085122,0.00020584698,0.0004319921,0.00019248921,0.0019734444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790204,0.0005876225,0.0000906502,0.0003202945,0.00092911266,0.00017028],"domain_scores_gemma":[0.98577577,0.010263611,0.00069509546,0.0013588915,0.0014699335,0.0004366473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027216892,0.0007901536,0.00072811113,0.0021753563,0.0005676048,0.0023587528,0.00080501474,0.00087445683,0.0032177505],"category_scores_gemma":[0.015539206,0.0002047918,0.0005285567,0.00338902,0.0012837455,0.0036159153,0.000944467,0.0010195033,0.00041841576],"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.0014248127,0.0012787782,0.0123157995,0.001238756,0.00025119088,0.00029815437,0.0004194578,0.49721795,0.04194829,0.08576459,0.008710432,0.34913173],"study_design_scores_gemma":[0.00009072631,0.0010992903,0.008100358,0.00010796974,0.0000924644,0.0002513704,0.00061070663,0.9294164,0.019321382,0.031521514,0.009338899,0.000048889993],"about_ca_topic_score_codex":0.0013137982,"about_ca_topic_score_gemma":0.0012978498,"teacher_disagreement_score":0.0032177505,"about_ca_system_score_codex":0.0013517567,"about_ca_system_score_gemma":0.00091206253,"threshold_uncertainty_score":0.014393806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018817134,0.0070541454,0.74564147,0.0008969854,0.00095112616,0.00017353536,0.0003239499,0.002970256,0.22317149],"genre_scores_gemma":[0.46563587,0.007041321,0.3134656,0.0010594174,0.0004986249,0.0005493486,0.0010073456,0.0020690847,0.20867345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992192,0.00018381972,0.00003498635,0.00020816617,0.0002647812,0.000089026],"domain_scores_gemma":[0.99896693,0.00046759786,0.00004799805,0.0003859657,0.00007776979,0.00005376855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008850334,0.0006753632,0.0007347952,0.00060867664,0.0008609335,0.0019098861,0.0015171365,0.0010650575,0.01545604],"category_scores_gemma":[0.0028643762,0.0005204694,0.0005702774,0.00097489747,0.0017143363,0.0029150723,0.0017727341,0.002457488,0.0051011033],"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.00004994061,0.00003442534,0.00006877261,0.00014534038,0.000013987883,0.000073130606,0.00020913353,0.0028911487,0.005623479,0.82967967,0.009701565,0.15150952],"study_design_scores_gemma":[0.000028379562,0.000049144848,0.000119356795,0.00009283141,0.00002544653,0.0005420277,0.00007909418,0.011636387,0.013446029,0.7844426,0.18950413,0.00003453122],"about_ca_topic_score_codex":0.00017809139,"about_ca_topic_score_gemma":0.00020964569,"teacher_disagreement_score":0.01545604,"about_ca_system_score_codex":0.0004565008,"about_ca_system_score_gemma":0.00040761082,"threshold_uncertainty_score":0.05170566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14628334,0.000805578,0.74438494,0.00066673267,0.0004659832,0.0002948568,0.00043941685,0.007143607,0.09951551],"genre_scores_gemma":[0.7670409,0.0005115422,0.17759089,0.00049060705,0.000114454524,0.0006088001,0.00053795584,0.0013446965,0.051760074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992955,0.00018670646,0.000055534565,0.00014861212,0.00017758507,0.00013605665],"domain_scores_gemma":[0.9990251,0.00039645119,0.000072362054,0.00028296543,0.00013014542,0.000092931106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077364506,0.0006457886,0.00075886125,0.00055214774,0.0009034984,0.0028556024,0.001979013,0.0013453997,0.011687534],"category_scores_gemma":[0.0027983657,0.00068041944,0.0006502238,0.00073873857,0.0016208607,0.0028528937,0.0018053752,0.0016673576,0.0038921358],"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.00026289906,0.00008073775,0.00017734183,0.00013075868,0.000017876642,0.00034768533,0.00034078298,0.017102506,0.016773889,0.93415177,0.0035673738,0.027046386],"study_design_scores_gemma":[0.000155348,0.0001411102,0.00008225832,0.00003825878,0.00002417659,0.00023312091,0.00012363943,0.13495559,0.03313151,0.79820174,0.032811854,0.000101324105],"about_ca_topic_score_codex":0.00064509996,"about_ca_topic_score_gemma":0.0005553441,"teacher_disagreement_score":0.011687534,"about_ca_system_score_codex":0.0008702459,"about_ca_system_score_gemma":0.0007964499,"threshold_uncertainty_score":0.03909874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03306312,0.0008509246,0.93963814,0.0010525549,0.00027915713,0.00008104605,0.00037688567,0.0008485615,0.02380963],"genre_scores_gemma":[0.64476144,0.0014539084,0.31821004,0.00096717384,0.0005484335,0.00042288975,0.00077712006,0.0009914893,0.03186756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978631,0.0006223513,0.00014952093,0.00023993413,0.0008495694,0.00027552244],"domain_scores_gemma":[0.99336255,0.004259815,0.00025578172,0.0009891777,0.0008682776,0.00026439864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013433255,0.0008389461,0.0009328239,0.0013426368,0.0008874988,0.0024099466,0.0013819786,0.001532102,0.006307815],"category_scores_gemma":[0.011523048,0.0006060344,0.0005956355,0.0010086832,0.0018471895,0.0029266218,0.00249361,0.002397854,0.0017527121],"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.00009023623,0.000021860444,0.000104660685,0.00008146157,0.000012755317,0.00005370363,0.00010848059,0.026580043,0.0034264973,0.9358947,0.0028974956,0.030728083],"study_design_scores_gemma":[0.000028798646,0.000029716888,0.000047572084,0.00003866831,0.000012259831,0.00005483765,0.000026858419,0.14862432,0.0058036163,0.83883256,0.006478497,0.000022446744],"about_ca_topic_score_codex":0.0008075936,"about_ca_topic_score_gemma":0.0017778694,"teacher_disagreement_score":0.006307815,"about_ca_system_score_codex":0.0014389176,"about_ca_system_score_gemma":0.0014875351,"threshold_uncertainty_score":0.021101713},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31678072,0.0005468452,0.5752911,0.0020186275,0.00077834533,0.00024048124,0.0020604124,0.0027518577,0.099531665],"genre_scores_gemma":[0.69989806,0.0009821631,0.16747846,0.0005447976,0.00017337632,0.00032898656,0.005513215,0.0021579426,0.12292304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993831,0.000082992985,0.000034775017,0.0002225683,0.00016264386,0.00011392801],"domain_scores_gemma":[0.99817896,0.00060355704,0.000227356,0.0005088845,0.00029203529,0.00018917011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043018025,0.0008226983,0.0006628652,0.0009226684,0.002103309,0.0015294016,0.0013489261,0.0012741461,0.014314682],"category_scores_gemma":[0.0033352075,0.00040998642,0.0008949251,0.0012031634,0.0012275161,0.0020496235,0.0022449787,0.0020840971,0.0051275417],"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.00037364176,0.00010072595,0.002123168,0.0002301029,0.000026249434,0.0008919136,0.00057137426,0.016247673,0.034957685,0.8669386,0.010614044,0.06692476],"study_design_scores_gemma":[0.00007501021,0.00018456126,0.0010548076,0.000095838375,0.00005757241,0.0014001068,0.0004402977,0.065571055,0.064192705,0.78347194,0.08338523,0.00007094675],"about_ca_topic_score_codex":0.0014532614,"about_ca_topic_score_gemma":0.0010930804,"teacher_disagreement_score":0.014314682,"about_ca_system_score_codex":0.00065305084,"about_ca_system_score_gemma":0.0009399801,"threshold_uncertainty_score":0.047887385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21319999,0.0015888542,0.6522832,0.0024688484,0.00039985578,0.00035962783,0.0021401637,0.007986781,0.11957267],"genre_scores_gemma":[0.39071435,0.0016262813,0.5317726,0.0004936764,0.00017221151,0.00016566536,0.006957775,0.0012831017,0.06681433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997094,0.000017065046,0.000018780845,0.00013804094,0.0000647454,0.000051915697],"domain_scores_gemma":[0.99930096,0.0003087253,0.000082935454,0.00016537549,0.00008073112,0.00006124189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000211342,0.000773825,0.00061553787,0.0005073108,0.0005609187,0.002134752,0.0010376647,0.0007670607,0.015435202],"category_scores_gemma":[0.0013198107,0.0005110511,0.00092759926,0.0008853805,0.0007465279,0.0049182265,0.0008442381,0.0012669198,0.006715851],"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.00063340296,0.00023731329,0.006998723,0.001271929,0.00006774059,0.0006045651,0.0010005337,0.02957127,0.11897164,0.10614425,0.07022267,0.664276],"study_design_scores_gemma":[0.000111943984,0.00033904408,0.008076572,0.00022191963,0.00014317801,0.0034834521,0.0011278815,0.2660807,0.11801628,0.44727564,0.15499498,0.00012836463],"about_ca_topic_score_codex":0.0011607435,"about_ca_topic_score_gemma":0.0016869113,"teacher_disagreement_score":0.015435202,"about_ca_system_score_codex":0.0009808186,"about_ca_system_score_gemma":0.0005776409,"threshold_uncertainty_score":0.05163586},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08867304,0.026130795,0.025629897,0.1879585,0.0026201454,0.0000872154,0.000356347,0.00026285634,0.66828114],"genre_scores_gemma":[0.93796235,0.007217915,0.004189509,0.0057150433,0.00042951087,0.00006885983,0.000090010966,0.0002596585,0.04406714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975407,0.0013950537,0.00003986387,0.00020569997,0.0004671109,0.00035157555],"domain_scores_gemma":[0.9968721,0.0018957624,0.00015508477,0.00035826367,0.0004166938,0.00030209334],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0037589958,0.00062418194,0.0004051613,0.0027962588,0.020417392,0.015209139,0.0019190621,0.0034333563,0.0064430577],"category_scores_gemma":[0.007467709,0.0003468875,0.00035432857,0.0035831328,0.07976871,0.014480235,0.0056526377,0.004887729,0.00065459986],"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.000012841116,0.0000033977708,0.00016327284,0.0000308388,0.000002157264,0.00012038432,0.11748063,0.00009204334,0.00011462399,0.8721532,0.0059742397,0.003852234],"study_design_scores_gemma":[0.000013119302,0.000013484347,0.00054480386,0.0002810434,0.000011749372,0.00032324845,0.17043276,0.00043928283,0.00051448646,0.32905975,0.49832726,0.000039099374],"about_ca_topic_score_codex":0.27416807,"about_ca_topic_score_gemma":0.3042745,"teacher_disagreement_score":0.9795826,"about_ca_system_score_codex":0.02792209,"about_ca_system_score_gemma":0.013579124,"threshold_uncertainty_score":0.54514444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37100008,0.00020908086,0.61836594,0.00040097974,0.0001810541,0.00006663575,0.00012052226,0.0007358569,0.008919788],"genre_scores_gemma":[0.9967278,0.000025705918,0.0025404328,0.000013768692,0.000011207958,0.000017761398,0.000010913227,0.000005653264,0.00064677297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995536,0.000087855486,0.000031349988,0.0001397984,0.00010914476,0.00007816966],"domain_scores_gemma":[0.9986552,0.00063431234,0.00025112505,0.000085511594,0.0002705108,0.000103364684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070939725,0.00039186148,0.00053745694,0.0002663938,0.00040831842,0.0010733845,0.0006730372,0.00038581764,0.0016853302],"category_scores_gemma":[0.002045613,0.00014023038,0.00031606155,0.00019433207,0.0007073862,0.00048212698,0.00072903524,0.0006244661,0.00011712735],"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.0009645697,0.0002256847,0.0023563355,0.0002554644,0.0001437947,0.000647912,0.0004787181,0.79968894,0.05346812,0.0766643,0.0013444137,0.0637618],"study_design_scores_gemma":[0.000033131295,0.00012569617,0.0004807257,0.000005521066,0.000012461556,0.000026877891,0.000017221088,0.9875938,0.0026311255,0.008838156,0.00022771598,0.0000075924286],"about_ca_topic_score_codex":0.0024495218,"about_ca_topic_score_gemma":0.002446826,"teacher_disagreement_score":0.0024495218,"about_ca_system_score_codex":0.00049758307,"about_ca_system_score_gemma":0.00078019244,"threshold_uncertainty_score":0.0056379437},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007980921,0.00071317016,0.9747859,0.0011261012,0.0005158643,0.00014878895,0.0003731186,0.0002818595,0.014074273],"genre_scores_gemma":[0.40719694,0.0027457965,0.5344632,0.0008808888,0.0007225388,0.0014309122,0.0007347267,0.00029152422,0.051533423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941134,0.0001675091,0.000036609392,0.00015653687,0.0001214866,0.000106470194],"domain_scores_gemma":[0.999579,0.00014066724,0.00006231899,0.000059567592,0.00010477464,0.000053645534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005923728,0.0012013391,0.00061158475,0.000878612,0.00085179077,0.0017060359,0.0025827289,0.0017224287,0.0057483357],"category_scores_gemma":[0.001105525,0.0004271456,0.0010238722,0.0014962964,0.0012156125,0.0032518932,0.0013047333,0.0024629203,0.001546424],"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.000106618965,0.00014658208,0.0011460729,0.00017686843,0.000047668902,0.00035372603,0.00024625257,0.6246653,0.004409358,0.33236977,0.010281471,0.026050216],"study_design_scores_gemma":[0.000021353433,0.000044889675,0.0001593415,0.000009868281,0.000012163931,0.00007147605,0.000040791554,0.9522325,0.00048073303,0.033851974,0.013058423,0.00001657091],"about_ca_topic_score_codex":0.006191872,"about_ca_topic_score_gemma":0.0062882537,"teacher_disagreement_score":0.006191872,"about_ca_system_score_codex":0.0011181425,"about_ca_system_score_gemma":0.0013344797,"threshold_uncertainty_score":0.019230068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079925945,0.010902077,0.3074185,0.0040139994,0.005285509,0.00051687326,0.026635872,0.07143213,0.5658024],"genre_scores_gemma":[0.07493783,0.010332922,0.28466484,0.005012907,0.00109467,0.0013224575,0.084386565,0.038588252,0.49965966],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984621,0.00020585874,0.00013559191,0.0003426344,0.00065405125,0.00019987118],"domain_scores_gemma":[0.99917895,0.00015640633,0.000051880037,0.00021576766,0.00033415592,0.00006286699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008516114,0.0015727833,0.0013048148,0.0021159702,0.0016779709,0.00602912,0.00282568,0.0017165233,0.17620924],"category_scores_gemma":[0.0032405467,0.0008245827,0.0018291032,0.002487005,0.0010051563,0.005371809,0.004071029,0.0027512936,0.13944992],"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.0004233028,0.00007973894,0.00052243756,0.0011241573,0.00007563086,0.00026210252,0.00035358456,0.0029811817,0.004318308,0.33074835,0.35750514,0.301606],"study_design_scores_gemma":[0.000025681276,0.0000228616,0.00009185704,0.00010208572,0.000016505144,0.00025124932,0.000053412143,0.0018049746,0.0029383365,0.046563998,0.9481043,0.000024638322],"about_ca_topic_score_codex":0.001656015,"about_ca_topic_score_gemma":0.001438495,"teacher_disagreement_score":0.17620924,"about_ca_system_score_codex":0.0017407847,"about_ca_system_score_gemma":0.001531582,"threshold_uncertainty_score":0.5894786},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01722691,0.0007513761,0.88918126,0.0019711463,0.00035745458,0.0002027757,0.00013073157,0.0017897018,0.08838869],"genre_scores_gemma":[0.13838962,0.0011762878,0.8248468,0.0005327182,0.00007582049,0.00025287794,0.00023151758,0.00023894239,0.034255352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997757,0.000047297624,0.000014060672,0.00004070208,0.000094843344,0.000027318556],"domain_scores_gemma":[0.9997377,0.000078500685,0.000019061625,0.000047869493,0.000092618306,0.000024258568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002835923,0.00046878366,0.0002754122,0.0003246515,0.00070871203,0.0012247966,0.00065478863,0.001104736,0.011783605],"category_scores_gemma":[0.0011900574,0.00019892823,0.00053704216,0.0003692336,0.0007560808,0.0014317858,0.000625597,0.0007240256,0.004807973],"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.0001250366,0.00015463358,0.0021960852,0.0006726304,0.000048444348,0.00033122586,0.0005734748,0.09997173,0.030949112,0.4944603,0.01881147,0.35170597],"study_design_scores_gemma":[0.00011534618,0.0002603328,0.0009071031,0.00028984726,0.000040099847,0.00093133806,0.00038427682,0.31467745,0.055138867,0.28968742,0.33747697,0.000090974456],"about_ca_topic_score_codex":0.0017075259,"about_ca_topic_score_gemma":0.0013755793,"teacher_disagreement_score":0.011783605,"about_ca_system_score_codex":0.0005809995,"about_ca_system_score_gemma":0.0009590869,"threshold_uncertainty_score":0.03942007},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053889764,0.00041883544,0.00018753366,0.00012960403,0.000045190656,0.000025863372,0.9964438,0.001430727,0.0007795407],"genre_scores_gemma":[0.0007767423,0.00013092729,0.0005661323,0.000048918682,0.000006558881,0.000054757544,0.9978052,0.0000579126,0.00055288523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865204,0.000174907,0.00011618043,0.00046385985,0.0004222439,0.00017077677],"domain_scores_gemma":[0.99802566,0.00057495665,0.00022618531,0.0005450861,0.00037559593,0.00025256776],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0012204802,0.0044118785,0.0025148713,0.0034703296,0.0010857417,0.003078706,0.0051190546,0.0049866824,0.043642193],"category_scores_gemma":[0.006128614,0.0011403478,0.0029248276,0.0042425417,0.00054262445,0.0016884345,0.0020154188,0.0025844295,0.06677703],"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.00027029944,0.00009707236,0.001910836,0.0028706458,0.00016970844,0.000066465946,0.000025459021,0.0014196119,0.0007210535,0.0005277927,0.9849185,0.007002511],"study_design_scores_gemma":[0.001024424,0.000106858446,0.008470157,0.00081597705,0.00026952202,0.00017804859,0.000090705675,0.006879278,0.0034472116,0.0031491742,0.97548455,0.00008414784],"about_ca_topic_score_codex":0.028878026,"about_ca_topic_score_gemma":0.067119196,"teacher_disagreement_score":0.99877954,"about_ca_system_score_codex":0.0017558293,"about_ca_system_score_gemma":0.002621093,"threshold_uncertainty_score":0.1459977},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020918831,0.0062649846,0.37053874,0.011709273,0.004410263,0.00022603976,0.0018964434,0.006203728,0.5778316],"genre_scores_gemma":[0.48873106,0.008087474,0.16465457,0.0029178602,0.0013433766,0.00042830623,0.0038001616,0.0014875802,0.32854974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964595,0.00006737481,0.000018035136,0.00008217453,0.00013108217,0.00005541985],"domain_scores_gemma":[0.99941134,0.00009652836,0.000019577477,0.0002593764,0.00014101055,0.00007214522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035329678,0.00046795164,0.0004722486,0.0005522783,0.001122298,0.0028224692,0.0011405553,0.0013013602,0.04466229],"category_scores_gemma":[0.0018838557,0.00025485767,0.00044133494,0.0008649152,0.00076049735,0.0031716407,0.0018943434,0.0012802943,0.019726716],"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.00011021489,0.00004296848,0.00023164676,0.00017523323,0.000025200192,0.0000973764,0.00011016801,0.0029111954,0.0058231154,0.8009951,0.063011974,0.12646575],"study_design_scores_gemma":[0.000037573533,0.000028819455,0.00023008372,0.00008620409,0.0000233987,0.000218382,0.00008691575,0.03193208,0.008657607,0.59027207,0.36839932,0.000027443597],"about_ca_topic_score_codex":0.0009654854,"about_ca_topic_score_gemma":0.0007805742,"teacher_disagreement_score":0.04466229,"about_ca_system_score_codex":0.00090994773,"about_ca_system_score_gemma":0.0008610577,"threshold_uncertainty_score":0.14941025},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11378981,0.00403344,0.8111699,0.0018014918,0.00023800213,0.00017696232,0.00092910824,0.0012527559,0.06660853],"genre_scores_gemma":[0.81175244,0.003865022,0.16531487,0.0006550659,0.0003596858,0.00092789717,0.001307538,0.0005413104,0.015276114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566334,0.0007682359,0.00017914247,0.0005348556,0.0020076125,0.00084693776],"domain_scores_gemma":[0.9660256,0.026185028,0.001214423,0.0024674758,0.0032108256,0.00089655136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027714137,0.0020019189,0.0018701089,0.0022606107,0.0017672359,0.003993517,0.0026284007,0.0019160258,0.008040259],"category_scores_gemma":[0.021723453,0.00091525225,0.0011091094,0.0017098304,0.003814503,0.007513898,0.0049235076,0.0040122974,0.001939759],"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.0006721498,0.00016776267,0.0013684671,0.00052588515,0.00009415006,0.0006401172,0.0005846526,0.24175909,0.031531967,0.68381613,0.0046747527,0.034164805],"study_design_scores_gemma":[0.0000420939,0.00015860307,0.00044555293,0.00017678541,0.00006537213,0.00042682802,0.000102557045,0.6795087,0.030588511,0.2826947,0.0056526195,0.00013765332],"about_ca_topic_score_codex":0.0017632163,"about_ca_topic_score_gemma":0.0018897753,"teacher_disagreement_score":0.008040259,"about_ca_system_score_codex":0.003552857,"about_ca_system_score_gemma":0.0027147543,"threshold_uncertainty_score":0.026897311},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046563717,0.29354626,0.05887442,0.026130056,0.008967704,0.00009181032,0.0003531679,0.00075167976,0.6066285],"genre_scores_gemma":[0.06287825,0.23190653,0.046390947,0.014515246,0.004456968,0.00018716449,0.00053682347,0.0010489274,0.63807917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923193,0.00014867651,0.000036399044,0.00013341532,0.0003932443,0.000056285047],"domain_scores_gemma":[0.99877304,0.00083469856,0.00004386337,0.00014148146,0.00016016548,0.00004682047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490651,0.00096261874,0.0006431693,0.0015251843,0.0017965253,0.003446145,0.0011177985,0.0018398409,0.024207784],"category_scores_gemma":[0.0024277177,0.00043033386,0.0005237647,0.0018886457,0.00450584,0.0061962283,0.0021649369,0.0034047605,0.009849057],"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.000014445875,0.000019073723,0.00010938488,0.00046488133,0.000008247182,0.00010256119,0.0012269379,0.001251547,0.00059435325,0.806943,0.074657485,0.11460817],"study_design_scores_gemma":[0.0000027863525,0.000011782479,0.00006961153,0.00043612006,0.0000032331104,0.00022979597,0.00015708714,0.0003155449,0.000413759,0.19336015,0.8049892,0.000011074096],"about_ca_topic_score_codex":0.0013785155,"about_ca_topic_score_gemma":0.0017794593,"teacher_disagreement_score":0.024207784,"about_ca_system_score_codex":0.002416344,"about_ca_system_score_gemma":0.0017061351,"threshold_uncertainty_score":0.08098304},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075389095,0.0002327778,0.9142596,0.00007138862,0.000037919708,0.00006388119,0.000114674476,0.0006082285,0.009222401],"genre_scores_gemma":[0.6485534,0.00020721821,0.34749752,0.000054585904,0.000023048611,0.00006280601,0.00023471117,0.00013880366,0.0032279224],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994875,0.000075753254,0.000039480514,0.0001321735,0.00019218406,0.00007294686],"domain_scores_gemma":[0.9994885,0.00013737028,0.00007497782,0.00014942494,0.00013032577,0.00001935812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036041372,0.00045129925,0.00031187845,0.00041816657,0.00032139363,0.00059256225,0.00041045962,0.00024513496,0.0015263625],"category_scores_gemma":[0.0011566817,0.00017230389,0.00058230443,0.00046312687,0.00068775646,0.00095525215,0.00052616175,0.0006757511,0.00042603156],"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.00040915856,0.00008926061,0.0010035711,0.00026336152,0.000041633535,0.00042766632,0.00029059072,0.03969258,0.54513633,0.14243196,0.0012614401,0.26895246],"study_design_scores_gemma":[0.00006108425,0.00046330344,0.0009251262,0.00003673994,0.00007511484,0.0008149297,0.00006787789,0.22774702,0.70156443,0.047684744,0.020512464,0.000047167952],"about_ca_topic_score_codex":0.0009887174,"about_ca_topic_score_gemma":0.0013130509,"teacher_disagreement_score":0.0015263625,"about_ca_system_score_codex":0.000534607,"about_ca_system_score_gemma":0.0006010377,"threshold_uncertainty_score":0.005106151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032146834,0.0014234902,0.21299262,0.004750981,0.001979828,0.00012324516,0.0019163176,0.0010717799,0.743595],"genre_scores_gemma":[0.3939656,0.002173806,0.041466862,0.0025240383,0.0017481287,0.00037324097,0.0035763572,0.0012410376,0.55293095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934393,0.0001243561,0.000027756834,0.00013055147,0.00025369463,0.00011960875],"domain_scores_gemma":[0.9993463,0.00015926234,0.000058571022,0.00017002935,0.0001777237,0.00008802913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051418017,0.00083154766,0.00065100356,0.0020578122,0.0011994536,0.0031767979,0.0010239757,0.001360908,0.058230698],"category_scores_gemma":[0.0025566407,0.0003119995,0.0007855626,0.0013087982,0.0012967946,0.0044651804,0.002629281,0.0034728684,0.012791801],"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.000009873981,0.000013182237,0.000026291922,0.000017343644,0.0000033764986,0.000013232972,0.000034517558,0.00022982042,0.00018367688,0.97949433,0.009153594,0.010820764],"study_design_scores_gemma":[0.000007023136,0.000005630143,0.00004916037,0.000010902322,0.0000036775007,0.00005414148,0.000018736528,0.00196791,0.00029701777,0.9771238,0.02045517,0.000006879268],"about_ca_topic_score_codex":0.0004787438,"about_ca_topic_score_gemma":0.0004747787,"teacher_disagreement_score":0.058230698,"about_ca_system_score_codex":0.001112166,"about_ca_system_score_gemma":0.00065488665,"threshold_uncertainty_score":0.19480109},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034258345,0.00043457217,0.97552943,0.00059463136,0.00014853328,0.000051342005,0.00011872207,0.00075280503,0.018944148],"genre_scores_gemma":[0.36909887,0.0021018689,0.5723142,0.0010438082,0.0012643107,0.0006134997,0.00089787046,0.0007445645,0.051921047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761283,0.0007380659,0.00025875657,0.00054368906,0.00059941754,0.00024724682],"domain_scores_gemma":[0.9965358,0.00218809,0.00016900712,0.0005162,0.00044674,0.00014413065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020661622,0.0007986492,0.00070923805,0.0014232018,0.001296789,0.0033802376,0.0020836073,0.0010265211,0.015924703],"category_scores_gemma":[0.0047674333,0.0008026241,0.0022562097,0.0018958037,0.0033931725,0.006133332,0.0028258332,0.0040605175,0.0037093882],"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.000022225275,0.000028808669,0.00006751169,0.00004607029,0.00001054393,0.000049396425,0.00020930119,0.008941966,0.0007682234,0.97334486,0.0012906515,0.015220437],"study_design_scores_gemma":[0.00001567898,0.00002903783,0.000025004403,0.00002019239,0.000013822722,0.000041952,0.000042852684,0.040268652,0.0009880789,0.9494238,0.009116431,0.000014460995],"about_ca_topic_score_codex":0.0027465993,"about_ca_topic_score_gemma":0.0028401506,"teacher_disagreement_score":0.015924703,"about_ca_system_score_codex":0.00203245,"about_ca_system_score_gemma":0.001514022,"threshold_uncertainty_score":0.05327338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019538352,0.016984245,0.63654673,0.005185477,0.0024871626,0.00026596483,0.0019821997,0.0024131846,0.31459674],"genre_scores_gemma":[0.46960092,0.026133161,0.24208638,0.0032856634,0.0012693626,0.000778578,0.004034028,0.0007169738,0.2520949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996044,0.000051496256,0.000021943297,0.00010401052,0.00015989206,0.00005823671],"domain_scores_gemma":[0.9997265,0.000056446625,0.000030601324,0.00007826859,0.00007882922,0.00002943647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020483573,0.00053359615,0.0005186976,0.00067677844,0.0012518014,0.0025859468,0.0012625373,0.0015269825,0.018705966],"category_scores_gemma":[0.0009542861,0.00033260713,0.00080028456,0.00077246455,0.0012334666,0.0037634554,0.0016098766,0.0013587704,0.00832443],"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.00002491626,0.000010259851,0.000054983026,0.00013610844,0.000009240539,0.0001207852,0.00006842487,0.0019417255,0.005100933,0.9660118,0.006805572,0.019715298],"study_design_scores_gemma":[0.000020821828,0.00003196743,0.00010462771,0.000091767324,0.000017445103,0.00069086335,0.00007940111,0.010724026,0.00970952,0.56512123,0.41337937,0.000028914063],"about_ca_topic_score_codex":0.0007611666,"about_ca_topic_score_gemma":0.0006488013,"teacher_disagreement_score":0.018705966,"about_ca_system_score_codex":0.0010031176,"about_ca_system_score_gemma":0.00063873833,"threshold_uncertainty_score":0.062577665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056258426,0.026565613,0.051253397,0.0022776115,0.0029956547,0.000072042276,0.00022178503,0.0008396343,0.9152117],"genre_scores_gemma":[0.010486051,0.025916234,0.024848,0.0013537934,0.001470638,0.00014612063,0.0005005873,0.0006049172,0.9346737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951386,0.0000670094,0.000016137748,0.00008904639,0.00027613042,0.000037960202],"domain_scores_gemma":[0.99976593,0.00006937893,0.000009260507,0.000068819994,0.00005397494,0.000032644395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003591142,0.0013664899,0.00067235634,0.001303888,0.0009584735,0.0035007712,0.0013212048,0.0009884466,0.06862643],"category_scores_gemma":[0.0010736448,0.0004568789,0.0004003341,0.0018111883,0.0016936735,0.0045818626,0.0025629166,0.0024332497,0.046148844],"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.000014349169,0.000029544095,0.00005009441,0.0003576805,0.000010405011,0.00003615588,0.00017312933,0.00086993526,0.001336991,0.4869243,0.22691467,0.28328273],"study_design_scores_gemma":[0.0000026683538,0.0000052874584,0.000043408978,0.0001327565,0.000002380823,0.000082175844,0.000024665216,0.0006432815,0.00047630243,0.10677768,0.8918038,0.000005571551],"about_ca_topic_score_codex":0.0008168471,"about_ca_topic_score_gemma":0.0014902608,"teacher_disagreement_score":0.06862643,"about_ca_system_score_codex":0.0015352272,"about_ca_system_score_gemma":0.0013241223,"threshold_uncertainty_score":0.22957832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00865641,0.0027045438,0.9521316,0.005585732,0.00048148798,0.00011795381,0.0001359051,0.00029666573,0.029889729],"genre_scores_gemma":[0.54936355,0.0070402836,0.40778282,0.0029806087,0.0017272382,0.0007788878,0.00033154892,0.00045702662,0.02953805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611306,0.0022913467,0.00013886658,0.00047493004,0.0008491251,0.0001326097],"domain_scores_gemma":[0.99092615,0.0071193976,0.00041806986,0.0009773795,0.00040678514,0.00015217306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030712613,0.00070403115,0.000657459,0.0014787201,0.0008421166,0.0034065521,0.0013447981,0.0019037974,0.0068856655],"category_scores_gemma":[0.020665493,0.00047927437,0.0008620655,0.0011909197,0.0074192304,0.0075386064,0.0030973488,0.0035093217,0.0013235713],"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.000007700769,0.0000065744534,0.000087109205,0.00004891703,0.0000050039707,0.000057404002,0.00011927225,0.008094035,0.00015081294,0.9817893,0.0013289871,0.0083048865],"study_design_scores_gemma":[0.000008884178,0.000013038525,0.000048889364,0.000035899928,0.0000030786637,0.000108007174,0.00004446056,0.029107213,0.00029674498,0.96128386,0.009039058,0.000010763028],"about_ca_topic_score_codex":0.0006813253,"about_ca_topic_score_gemma":0.0004765981,"teacher_disagreement_score":0.0068856655,"about_ca_system_score_codex":0.00146818,"about_ca_system_score_gemma":0.0008412395,"threshold_uncertainty_score":0.02303487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.396719,0.0009284981,0.50445044,0.0051800036,0.00020292102,0.00020910062,0.0015388426,0.0012536792,0.089517444],"genre_scores_gemma":[0.9650695,0.00039737023,0.023380117,0.00024304425,0.00014757106,0.00021784207,0.00054935913,0.00024775424,0.009747329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705815,0.0007608905,0.00015486966,0.0004299958,0.0011158041,0.00048024472],"domain_scores_gemma":[0.9712545,0.025062175,0.0006848826,0.0017703449,0.0007610452,0.00046706942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023220887,0.00064086163,0.0015681867,0.0009351675,0.0012888863,0.0042724945,0.0028031054,0.0016815381,0.008511025],"category_scores_gemma":[0.015268331,0.0007853946,0.0016971817,0.0014262905,0.0033649749,0.0072934953,0.0025482324,0.00493369,0.0007185668],"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.0002404375,0.00008433753,0.00065333385,0.00011656329,0.000027471433,0.00012835958,0.00029950935,0.076303564,0.0022724676,0.9020347,0.002291853,0.015547465],"study_design_scores_gemma":[0.000023182325,0.00001427568,0.00020857746,0.000008561328,0.000014333959,0.00004181762,0.00002814075,0.12395714,0.0013165465,0.873723,0.0006487358,0.000015721827],"about_ca_topic_score_codex":0.002011616,"about_ca_topic_score_gemma":0.0015133439,"teacher_disagreement_score":0.008511025,"about_ca_system_score_codex":0.0032419087,"about_ca_system_score_gemma":0.0021789758,"threshold_uncertainty_score":0.028472245},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024188356,0.00049553625,0.87941694,0.0003095993,0.00023222904,0.00018724783,0.0041640284,0.09080354,0.021972017],"genre_scores_gemma":[0.12090915,0.0018507491,0.70070124,0.0010247867,0.00042945417,0.0014615282,0.026312226,0.07844926,0.06886159],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981641,0.00025900875,0.00016558419,0.00034842535,0.00083398283,0.00022878943],"domain_scores_gemma":[0.9969398,0.001556537,0.00010905189,0.00065705617,0.00063439633,0.000103213606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014165848,0.0021511745,0.0016198832,0.0027140456,0.0013457411,0.0040648044,0.0036960966,0.0014630097,0.09228425],"category_scores_gemma":[0.005562176,0.0019083667,0.00276968,0.0037788043,0.0013525885,0.0048922123,0.0035389254,0.0038965882,0.0418789],"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.0008159606,0.00029882294,0.00064539944,0.0024545016,0.00015902093,0.0005100987,0.00048256567,0.011906393,0.01855174,0.3221026,0.20679775,0.4352751],"study_design_scores_gemma":[0.00045021757,0.00011917502,0.00044279816,0.0004328845,0.00013322197,0.00072251353,0.00010463076,0.08396875,0.055664238,0.3489597,0.50877553,0.00022627719],"about_ca_topic_score_codex":0.0021454326,"about_ca_topic_score_gemma":0.0030305209,"teacher_disagreement_score":0.09228425,"about_ca_system_score_codex":0.0018260176,"about_ca_system_score_gemma":0.002347957,"threshold_uncertainty_score":0.30872154},"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":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048036026,0.6123879,0.09982183,0.102945246,0.07429975,0.00025535413,0.0014481788,0.0013724007,0.10266575],"genre_scores_gemma":[0.036211547,0.5350799,0.05629501,0.05591328,0.037029963,0.0005496829,0.0029033707,0.0014792461,0.27453804],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981013,0.0004692467,0.00024016839,0.00035578874,0.00068833324,0.0001451885],"domain_scores_gemma":[0.9976707,0.0014005553,0.00013137025,0.00031096928,0.0003615,0.00012472867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025169284,0.00088418886,0.0012036212,0.0018734898,0.00088773307,0.0022129735,0.0014351173,0.0035530003,0.010225908],"category_scores_gemma":[0.004114481,0.00059354777,0.0010928815,0.0016846835,0.0020601137,0.004285208,0.0019518334,0.0060204137,0.014358623],"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.00031535645,0.0002015869,0.00027614957,0.007086242,0.000062512525,0.0015939287,0.00084705005,0.00067634805,0.08554232,0.25394112,0.26662996,0.38282743],"study_design_scores_gemma":[0.000006870967,0.00005753259,0.00012199469,0.00019005674,0.000009679909,0.00033233908,0.00003917736,0.000042290794,0.010622358,0.011747354,0.97681445,0.000015864569],"about_ca_topic_score_codex":0.0011859032,"about_ca_topic_score_gemma":0.00074635784,"teacher_disagreement_score":0.010225908,"about_ca_system_score_codex":0.0017820148,"about_ca_system_score_gemma":0.0011353024,"threshold_uncertainty_score":0.034209132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57988524,0.014716033,0.385657,0.0020089175,0.0020504436,0.00037567294,0.001682233,0.0026054424,0.011019035],"genre_scores_gemma":[0.80006194,0.004507605,0.184163,0.0010010729,0.00042090894,0.00016260978,0.0004966008,0.00007507088,0.009111297],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995084,0.000030968575,0.000022152768,0.00016819531,0.00023897739,0.00003123636],"domain_scores_gemma":[0.9996474,0.00007838437,0.00007333906,0.000029462368,0.00013800921,0.00003349689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002352569,0.00046666406,0.00039319627,0.00050021283,0.00032821356,0.00054506696,0.0014633224,0.0009246322,0.0010884404],"category_scores_gemma":[0.0006332488,0.00024273568,0.00024978849,0.0005298677,0.00035437723,0.0010932987,0.000508757,0.00051373633,0.00057269505],"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.00005332821,0.000020727059,0.00024400295,0.00011201801,0.0000075291123,0.00009782468,0.000038215097,0.00029328562,0.98867446,0.00040735374,0.00028523162,0.009766044],"study_design_scores_gemma":[0.0000094181405,0.0001572306,0.00030140017,0.0000073827737,0.000016967519,0.00031296755,0.000023602806,0.0049914466,0.99001503,0.000108716,0.004035058,0.000020772073],"about_ca_topic_score_codex":0.0006747536,"about_ca_topic_score_gemma":0.00093119807,"teacher_disagreement_score":0.0014633224,"about_ca_system_score_codex":0.0006409626,"about_ca_system_score_gemma":0.00044290317,"threshold_uncertainty_score":0.0046504736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019427529,0.0007001979,0.9765736,0.00023016118,0.000057863035,0.000058970414,0.000023881894,0.00021888551,0.002708945],"genre_scores_gemma":[0.33572435,0.0011297307,0.65831643,0.00017704432,0.000052267365,0.00022214596,0.00008934907,0.00009523848,0.00419334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994435,0.00019925552,0.000022626946,0.00009073084,0.0002001875,0.000043700682],"domain_scores_gemma":[0.9994797,0.0002710901,0.000058419006,0.00005849538,0.00011354407,0.000018748064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000823525,0.0005992833,0.00070394465,0.00114471,0.0004339021,0.00086223835,0.0011535392,0.0012593331,0.0013616801],"category_scores_gemma":[0.002596639,0.0003147118,0.0006742956,0.00085452467,0.0009020082,0.0013878834,0.0007951046,0.0009310955,0.00043379914],"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.00007991533,0.00006413703,0.0010635204,0.0001430409,0.00010103035,0.0001279977,0.00013666629,0.75652665,0.014383437,0.08304202,0.00084875064,0.14348279],"study_design_scores_gemma":[0.00002572982,0.000097996315,0.00018432105,0.000027580018,0.000032273376,0.0001774843,0.000033631957,0.95985603,0.0048020193,0.031561557,0.0031772014,0.000024193436],"about_ca_topic_score_codex":0.0011035469,"about_ca_topic_score_gemma":0.0010123164,"teacher_disagreement_score":0.0013616801,"about_ca_system_score_codex":0.00074855564,"about_ca_system_score_gemma":0.0009372726,"threshold_uncertainty_score":0.005431235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8626235,0.016991833,0.09521645,0.010960245,0.0006459016,0.00006939945,0.00039966023,0.001209166,0.01188383],"genre_scores_gemma":[0.9468551,0.008927411,0.03721077,0.0006842188,0.00020214525,0.000048934642,0.00042777543,0.00014744705,0.0054961015],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999331,0.000007248977,0.000003405705,0.000028863617,0.000015165011,0.0000121478815],"domain_scores_gemma":[0.9998117,0.000075546646,0.000024017934,0.000028988434,0.000015941381,0.00004373059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026962848,0.0003396418,0.0004804101,0.00024683695,0.00057202624,0.00097250036,0.00042685942,0.0012457252,0.0024641894],"category_scores_gemma":[0.0005231183,0.00029546092,0.00026807946,0.0002609912,0.00064365705,0.002556969,0.00043331744,0.0021635178,0.0010113954],"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.00018317619,0.00004733976,0.0006027663,0.00044583637,0.000015319845,0.00030875645,0.00028990218,0.0023014555,0.963461,0.009964371,0.0012611778,0.021118987],"study_design_scores_gemma":[0.00014695656,0.0005046687,0.017205082,0.00017529889,0.00012246837,0.0016469638,0.001009347,0.10658156,0.7202134,0.044861026,0.10740212,0.0001311105],"about_ca_topic_score_codex":0.0006715098,"about_ca_topic_score_gemma":0.00067369756,"teacher_disagreement_score":0.0024641894,"about_ca_system_score_codex":0.0004962017,"about_ca_system_score_gemma":0.0002951608,"threshold_uncertainty_score":0.008243501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040312487,0.9940388,0.0028662255,0.00017122409,0.0002824613,0.000026684163,0.000088295514,0.00003353318,0.0020897007],"genre_scores_gemma":[0.0016047403,0.99293375,0.003477586,0.00021419647,0.000118082346,0.0000487653,0.00020488574,0.0000127377,0.0013853555],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994311,0.000105041254,0.000068511865,0.00012834341,0.00022870502,0.000038220154],"domain_scores_gemma":[0.9987924,0.0007337284,0.0001118591,0.0000696703,0.0002513359,0.000040991523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015497605,0.001146651,0.0014679381,0.002587647,0.00029438318,0.0011324806,0.0013127102,0.0011345525,0.0031331524],"category_scores_gemma":[0.0021703772,0.00048534243,0.00072919996,0.0021704433,0.00072985375,0.0015420957,0.0007560505,0.0017002474,0.0037736814],"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.00008153712,0.00010983429,0.00021339543,0.034817696,0.00009629628,0.00014813333,0.000084145526,0.00060608436,0.020119725,0.009122302,0.01371575,0.92088515],"study_design_scores_gemma":[0.000012902397,0.00018533166,0.00048036457,0.0032329892,0.00016990211,0.0010192378,0.000060335067,0.00024214374,0.020143548,0.0018096726,0.9725937,0.000049920272],"about_ca_topic_score_codex":0.0007967342,"about_ca_topic_score_gemma":0.0008519848,"teacher_disagreement_score":0.0031331524,"about_ca_system_score_codex":0.00063924777,"about_ca_system_score_gemma":0.0011583886,"threshold_uncertainty_score":0.010481417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42283008,0.0005625396,0.5088347,0.008629445,0.00022149191,0.00012249326,0.0011261735,0.00083622226,0.05683684],"genre_scores_gemma":[0.97256315,0.00022063087,0.020375669,0.00027521348,0.00014931736,0.00010901416,0.0002989774,0.0001621038,0.0058459663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715257,0.00073113246,0.00018344112,0.0005489927,0.00093824626,0.00044564228],"domain_scores_gemma":[0.97499937,0.021027261,0.0007165328,0.0018982782,0.00096994004,0.0003886517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022880929,0.00042878723,0.0009420983,0.0007382333,0.0015079344,0.004879822,0.0017638853,0.001588945,0.007925301],"category_scores_gemma":[0.017111594,0.0006256904,0.0013129271,0.00091613433,0.0039078123,0.010327163,0.0021446366,0.004010488,0.00075678795],"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.00012369423,0.000041105675,0.00052390294,0.00006196457,0.000012535518,0.00010247641,0.00024705616,0.021741843,0.0017947451,0.96773326,0.0010182658,0.006599165],"study_design_scores_gemma":[0.000017349494,0.00001230092,0.00016799799,0.0000075568414,0.0000105845465,0.00005586797,0.000030180789,0.07348702,0.0016469558,0.9237992,0.00074662385,0.000018312558],"about_ca_topic_score_codex":0.0021778967,"about_ca_topic_score_gemma":0.0013856944,"teacher_disagreement_score":0.007925301,"about_ca_system_score_codex":0.0023165012,"about_ca_system_score_gemma":0.002592995,"threshold_uncertainty_score":0.026512802},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16611157,0.00048728244,0.82892317,0.00021273251,0.00012351718,0.000121506695,0.00009600538,0.0024971033,0.0014270239],"genre_scores_gemma":[0.3450641,0.00023360533,0.6483885,0.00012504235,0.000027434337,0.00014059494,0.00019400196,0.00022578011,0.005600978],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996673,0.000055726414,0.00003207352,0.000060314407,0.00015993963,0.000024736913],"domain_scores_gemma":[0.9990446,0.00025305574,0.00015425574,0.0002947777,0.00020642583,0.000046887366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039478857,0.00034220403,0.00030515803,0.00055573095,0.00033375827,0.00045855413,0.00079938053,0.00049386267,0.0009218226],"category_scores_gemma":[0.0015136098,0.00018984861,0.00019712694,0.00045349516,0.00043465436,0.00083869556,0.00064644014,0.00065292633,0.0005323612],"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.00021100369,0.000093097005,0.0006936715,0.00018385594,0.00002597396,0.00027138196,0.00020710667,0.012520871,0.8368355,0.0077662533,0.0008530862,0.14033826],"study_design_scores_gemma":[0.000020865205,0.0001648542,0.00026114946,0.000013879274,0.000012079967,0.00030922692,0.000019088882,0.09775715,0.89423925,0.0010397843,0.0061351904,0.000027488148],"about_ca_topic_score_codex":0.00046433054,"about_ca_topic_score_gemma":0.0005557744,"teacher_disagreement_score":0.0009218226,"about_ca_system_score_codex":0.00043089912,"about_ca_system_score_gemma":0.0005022326,"threshold_uncertainty_score":0.0031263828},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30891404,0.00022722753,0.6675562,0.0017250684,0.000092436734,0.00030221904,0.0011965712,0.0010099629,0.018976301],"genre_scores_gemma":[0.9022236,0.00024707615,0.08745801,0.0004342616,0.00011151263,0.00051329593,0.0012978122,0.00021624564,0.0074982396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970559,0.0009010994,0.00014230676,0.0006360587,0.00070953753,0.0005550676],"domain_scores_gemma":[0.9789201,0.011176861,0.0027146968,0.0052159047,0.0012290913,0.00074344035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012757453,0.0011235757,0.0009980538,0.000688799,0.0011283094,0.0024325347,0.0017551366,0.0015629006,0.0075811935],"category_scores_gemma":[0.017303614,0.00059508876,0.0010005349,0.0011509878,0.0024992656,0.0072626746,0.0029978184,0.0040084366,0.0013465206],"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.0005913998,0.0002359338,0.0008967023,0.00021368984,0.000030253286,0.00024371398,0.00045817683,0.09840122,0.012900562,0.8526699,0.0046065734,0.028751861],"study_design_scores_gemma":[0.00011883561,0.00017114857,0.0003400649,0.000035383502,0.000022786338,0.00019650669,0.0001350129,0.35127008,0.010285963,0.6339865,0.0033858214,0.000051942123],"about_ca_topic_score_codex":0.0009794659,"about_ca_topic_score_gemma":0.0013150852,"teacher_disagreement_score":0.0075811935,"about_ca_system_score_codex":0.0014180419,"about_ca_system_score_gemma":0.0016973539,"threshold_uncertainty_score":0.025361657},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0560739,0.0012016871,0.44779024,0.022283623,0.000983334,0.00016117108,0.00025184324,0.0005082534,0.470746],"genre_scores_gemma":[0.84973717,0.00068680086,0.10269956,0.0041423384,0.0005950816,0.00028519722,0.00029520126,0.0002865211,0.04127212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940347,0.0023657554,0.0002368898,0.0012613914,0.0015292953,0.0005720088],"domain_scores_gemma":[0.9882224,0.0050545614,0.0007512705,0.003991496,0.001506762,0.0004735096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057801562,0.00045786487,0.0005574455,0.0010647344,0.00412048,0.004496584,0.0016960478,0.002228113,0.016887136],"category_scores_gemma":[0.027671767,0.00026204888,0.0008267723,0.00087919267,0.0092291925,0.00629685,0.005523397,0.0027801106,0.0021941701],"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.000009303563,0.000008653666,0.0004396956,0.000018050829,0.0000047003555,0.000016439071,0.00034961625,0.00095963554,0.0001168693,0.984174,0.001704012,0.012199047],"study_design_scores_gemma":[0.0000099032195,0.00001239295,0.0003164453,0.000034882614,0.00000795413,0.00008987232,0.00020449335,0.005743344,0.00039045874,0.95775604,0.035422772,0.000011362329],"about_ca_topic_score_codex":0.0016284836,"about_ca_topic_score_gemma":0.001405385,"teacher_disagreement_score":0.016887136,"about_ca_system_score_codex":0.0022804239,"about_ca_system_score_gemma":0.002138602,"threshold_uncertainty_score":0.056493044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9658691,0.00014507599,0.030686991,0.00020245374,0.00008104612,0.000031364412,0.00007659182,0.000365365,0.0025419171],"genre_scores_gemma":[0.980451,0.00010340979,0.016422061,0.000056025954,0.00000849842,0.000013304044,0.000061315026,0.00007083668,0.0028135066],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998901,0.0000050706244,0.000009075023,0.000034845292,0.000031627125,0.000029364624],"domain_scores_gemma":[0.99979633,0.000038148133,0.00007115552,0.000042810305,0.000020048854,0.0000315064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013714354,0.00026591672,0.0001976462,0.0001964183,0.00021026145,0.0008450594,0.00070276053,0.00042413393,0.0018134337],"category_scores_gemma":[0.00045061938,0.0002104189,0.00019505719,0.00014363589,0.00036458953,0.00057338184,0.00056601566,0.00066980167,0.00036672395],"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.00003990246,0.000017698912,0.00030247323,0.0000108703225,0.0000036959589,0.000044767934,0.000012432781,0.00027378713,0.9938618,0.00096320105,0.000024448922,0.0044449177],"study_design_scores_gemma":[0.00000958399,0.000056051726,0.00072043156,0.0000017566241,0.000014023626,0.00007924676,0.000021746207,0.0037602328,0.9941327,0.00037266247,0.00082704454,0.000004558314],"about_ca_topic_score_codex":0.00038187686,"about_ca_topic_score_gemma":0.0009131317,"teacher_disagreement_score":0.0018134337,"about_ca_system_score_codex":0.00030377804,"about_ca_system_score_gemma":0.00026099366,"threshold_uncertainty_score":0.0060665607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05169961,0.00022003293,0.91655535,0.00087817485,0.00017017167,0.000119381606,0.00070946565,0.0020049163,0.027642993],"genre_scores_gemma":[0.722253,0.00032504633,0.24820226,0.00075936376,0.00021416161,0.00045466574,0.001146792,0.00084173825,0.025802922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979513,0.00036665038,0.00015016351,0.000456774,0.0006704302,0.00040469092],"domain_scores_gemma":[0.99852633,0.00029100184,0.000121575045,0.00036573995,0.0004382898,0.00025713048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016641627,0.0005370426,0.000717867,0.0017305764,0.0017844655,0.003394021,0.002174128,0.0015759562,0.0060407617],"category_scores_gemma":[0.0022452124,0.0005351382,0.0017653989,0.0014601364,0.0045167445,0.0065712305,0.00437221,0.003452042,0.0016019142],"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.000021002943,0.000012270774,0.00011025786,0.0000145695285,0.0000027812587,0.00006468522,0.00019894548,0.0011282611,0.00073441863,0.9959507,0.00022130545,0.001540819],"study_design_scores_gemma":[0.000033028344,0.000059134814,0.00019122771,0.000020698553,0.000017751716,0.00015170076,0.0001610764,0.026018087,0.0019071121,0.9546085,0.016791664,0.000039960258],"about_ca_topic_score_codex":0.0041929577,"about_ca_topic_score_gemma":0.0024478328,"teacher_disagreement_score":0.0060407617,"about_ca_system_score_codex":0.0026455629,"about_ca_system_score_gemma":0.0018012903,"threshold_uncertainty_score":0.0202083},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011078608,0.00014001381,0.98495126,0.00018964111,0.00005031252,0.000086975524,0.00008741425,0.0006163734,0.0027994218],"genre_scores_gemma":[0.09727454,0.00012399368,0.9000403,0.00006482282,0.000034039327,0.0002116839,0.00016083894,0.00009046604,0.0019992606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931955,0.00020494613,0.000046379333,0.00015315483,0.00019627078,0.00007974413],"domain_scores_gemma":[0.9980001,0.0013444081,0.0001345635,0.000121436125,0.0003312888,0.0000681514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012308711,0.00078902417,0.00070768007,0.00206982,0.0008456934,0.0014477136,0.0015485723,0.001709338,0.006806684],"category_scores_gemma":[0.0065587447,0.00041588195,0.0005847365,0.0016918194,0.0011377594,0.0017115386,0.0011333202,0.00087894395,0.0010826879],"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.0003062253,0.00012466939,0.0010126462,0.00026665913,0.00005994197,0.00012649721,0.0001746759,0.60685587,0.007858275,0.08370183,0.0036470373,0.2958656],"study_design_scores_gemma":[0.000082240884,0.000053849006,0.00015999058,0.000034369226,0.000012123024,0.000058707454,0.000029384775,0.9456152,0.003725701,0.047599565,0.0026134092,0.000015463735],"about_ca_topic_score_codex":0.0041071298,"about_ca_topic_score_gemma":0.0032082389,"teacher_disagreement_score":0.006806684,"about_ca_system_score_codex":0.0018895009,"about_ca_system_score_gemma":0.0024260692,"threshold_uncertainty_score":0.022770584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9186594,0.0010714695,0.060719855,0.003285896,0.0001591545,0.000055673183,0.00013089195,0.00039519314,0.015522435],"genre_scores_gemma":[0.9904727,0.00026815338,0.0076492247,0.00020629482,0.000028863204,0.00002494479,0.000048168855,0.00004969723,0.0012521044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995346,0.0001447041,0.000027689071,0.00014647323,0.000089212976,0.00005732436],"domain_scores_gemma":[0.996899,0.0016593469,0.00045597192,0.0003065857,0.00040169162,0.00027736646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000931576,0.00018551208,0.0004101471,0.0004047484,0.00056349725,0.0014385545,0.00070490496,0.0010322542,0.0024842727],"category_scores_gemma":[0.011023626,0.0002553821,0.00030822642,0.0003142048,0.0012595274,0.0020314946,0.00051798095,0.00059960125,0.00037633354],"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.00036364875,0.00034599254,0.1212573,0.00090969563,0.00045048704,0.0020442111,0.003185954,0.18721323,0.09627376,0.40388975,0.007353961,0.17671211],"study_design_scores_gemma":[0.00007942213,0.0002874421,0.021700919,0.0001622048,0.00013746464,0.0013435745,0.0018735519,0.6570477,0.021895552,0.2781722,0.017153842,0.00014609986],"about_ca_topic_score_codex":0.0012453496,"about_ca_topic_score_gemma":0.0012219802,"teacher_disagreement_score":0.0024842727,"about_ca_system_score_codex":0.0009487568,"about_ca_system_score_gemma":0.0004913531,"threshold_uncertainty_score":0.008310676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31230497,0.0044795917,0.6003104,0.005835233,0.0009295176,0.00021459797,0.0016610901,0.0011972184,0.07306734],"genre_scores_gemma":[0.89606833,0.0026987,0.07079265,0.0011981749,0.001074907,0.0003583825,0.0011935015,0.0008116134,0.025803644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949655,0.0013609587,0.00033977322,0.00074901216,0.0016841631,0.0009005447],"domain_scores_gemma":[0.9519426,0.038508303,0.0025110883,0.0039018157,0.0021826336,0.00095348695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033735859,0.0018968524,0.0018538118,0.0034233842,0.0020828599,0.003410409,0.0025954698,0.0034300718,0.008477713],"category_scores_gemma":[0.037479166,0.00103507,0.001413931,0.0033559292,0.0052988552,0.0069929236,0.005826875,0.003651546,0.0016277651],"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.0005474903,0.000049734717,0.0006651982,0.00022251537,0.00003611087,0.0003193157,0.00043087272,0.03815203,0.002113642,0.924426,0.0050698095,0.027967293],"study_design_scores_gemma":[0.000048936494,0.00002611313,0.00012429895,0.00007283572,0.000016654107,0.00017102502,0.00005461781,0.03699439,0.001340132,0.95953935,0.0015750291,0.000036628047],"about_ca_topic_score_codex":0.0021810627,"about_ca_topic_score_gemma":0.0025722685,"teacher_disagreement_score":0.008477713,"about_ca_system_score_codex":0.0028487972,"about_ca_system_score_gemma":0.0025708156,"threshold_uncertainty_score":0.028360784},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03986192,0.14117339,0.37285244,0.054501127,0.012060934,0.00015351945,0.00072310586,0.0033785752,0.3752949],"genre_scores_gemma":[0.7584061,0.06085884,0.124029264,0.0072270907,0.019699836,0.0004260992,0.000991171,0.0010493997,0.027312133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997799,0.0011589176,0.000100609366,0.0002519932,0.0004904724,0.00019900453],"domain_scores_gemma":[0.98538685,0.01028588,0.00044213692,0.002477284,0.00083131815,0.0005764829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007256925,0.0015928017,0.0023902182,0.002112819,0.0019221042,0.0047751837,0.0037248232,0.0027644115,0.013887457],"category_scores_gemma":[0.018639714,0.0009496919,0.0012016646,0.0019832472,0.010253029,0.00901673,0.0052265255,0.0067931004,0.0028582637],"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.00009232503,0.000028699544,0.00021367175,0.0003561045,0.000021255322,0.00009144578,0.00011458128,0.0018503658,0.0003285996,0.9600653,0.0052055856,0.031632055],"study_design_scores_gemma":[0.000023718556,0.000020221245,0.000091285445,0.00008169348,0.000008834404,0.00007436246,0.000024779558,0.0049381466,0.00045140745,0.9763509,0.0179135,0.000021163974],"about_ca_topic_score_codex":0.00044731266,"about_ca_topic_score_gemma":0.00037775654,"teacher_disagreement_score":0.013887457,"about_ca_system_score_codex":0.0024855635,"about_ca_system_score_gemma":0.00082488765,"threshold_uncertainty_score":0.046458185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09229119,0.0014240294,0.88588184,0.0005757831,0.0004617114,0.000096552365,0.00068338774,0.014306694,0.004278912],"genre_scores_gemma":[0.82773936,0.0005526169,0.1632201,0.0004219632,0.000077303,0.00010985723,0.0012261756,0.00022145238,0.0064311554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981624,0.000025197784,0.000012630081,0.000065399916,0.00004964642,0.00003081717],"domain_scores_gemma":[0.99974686,0.00006249838,0.000027454571,0.000041091505,0.00009919013,0.000023011107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005248242,0.0008067925,0.00052099477,0.00041605183,0.00026426304,0.0005491679,0.0014564215,0.0008457993,0.0024336537],"category_scores_gemma":[0.0010065602,0.0002833061,0.000645025,0.0005993359,0.00031579737,0.0012257139,0.00081185007,0.0012021215,0.0010147657],"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.00028822417,0.00023582349,0.0027542636,0.00024518932,0.00020658573,0.00038401954,0.00009151149,0.452726,0.05490925,0.0051288963,0.012879105,0.47015116],"study_design_scores_gemma":[0.0000040354053,0.000041127347,0.00023441916,0.00000482277,0.000012641931,0.00002798563,0.0000046401888,0.9928509,0.0049256077,0.0011676042,0.0007199186,0.0000062839804],"about_ca_topic_score_codex":0.0062510595,"about_ca_topic_score_gemma":0.00817974,"teacher_disagreement_score":0.0062510595,"about_ca_system_score_codex":0.00061246526,"about_ca_system_score_gemma":0.0007141134,"threshold_uncertainty_score":0.012429357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010388127,0.0005477215,0.015919052,0.00022733136,0.0002624633,0.00020089129,0.92724764,0.041753307,0.0034535455],"genre_scores_gemma":[0.0030122963,0.000057857873,0.013442587,0.000056243487,0.000009381605,0.00021287373,0.9809667,0.0016267479,0.0006152766],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976793,0.00045494942,0.00020823858,0.0010409433,0.0004031086,0.00021354799],"domain_scores_gemma":[0.99781454,0.0006118524,0.00015563486,0.00089940766,0.0003852865,0.00013329583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033553566,0.004806259,0.002008032,0.0027926764,0.002308681,0.0027180433,0.004520007,0.0022594656,0.026327128],"category_scores_gemma":[0.007932777,0.0017138909,0.003224738,0.0036075567,0.00068575435,0.002003564,0.0027859493,0.0024518357,0.030100401],"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.0012058652,0.00018029311,0.0038607013,0.0025452224,0.0010093183,0.00032085198,0.00023534306,0.010994186,0.008364845,0.003661471,0.94078594,0.026836017],"study_design_scores_gemma":[0.0029531927,0.00032792182,0.0128543405,0.0004585881,0.00066103286,0.00066077284,0.0002749599,0.06163499,0.026241777,0.018286897,0.87540865,0.00023680791],"about_ca_topic_score_codex":0.010338974,"about_ca_topic_score_gemma":0.02512595,"teacher_disagreement_score":0.026327128,"about_ca_system_score_codex":0.0014415695,"about_ca_system_score_gemma":0.0025071513,"threshold_uncertainty_score":0.088073015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010388127,0.0005477215,0.015919052,0.00022733136,0.0002624633,0.00020089129,0.92724764,0.041753307,0.0034535455],"genre_scores_gemma":[0.0030122963,0.000057857873,0.013442587,0.000056243487,0.000009381605,0.00021287373,0.9809667,0.0016267479,0.0006152766],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976793,0.00045494942,0.00020823858,0.0010409433,0.0004031086,0.00021354799],"domain_scores_gemma":[0.99781454,0.0006118524,0.00015563486,0.00089940766,0.0003852865,0.00013329583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033553566,0.004806259,0.002008032,0.0027926764,0.002308681,0.0027180433,0.004520007,0.0022594656,0.026327128],"category_scores_gemma":[0.007932777,0.0017138909,0.003224738,0.0036075567,0.00068575435,0.002003564,0.0027859493,0.0024518357,0.030100401],"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.0012058652,0.00018029311,0.0038607013,0.0025452224,0.0010093183,0.00032085198,0.00023534306,0.010994186,0.008364845,0.003661471,0.94078594,0.026836017],"study_design_scores_gemma":[0.0029531927,0.00032792182,0.0128543405,0.0004585881,0.00066103286,0.00066077284,0.0002749599,0.06163499,0.026241777,0.018286897,0.87540865,0.00023680791],"about_ca_topic_score_codex":0.010338974,"about_ca_topic_score_gemma":0.02512595,"teacher_disagreement_score":0.026327128,"about_ca_system_score_codex":0.0014415695,"about_ca_system_score_gemma":0.0025071513,"threshold_uncertainty_score":0.088073015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04420649,0.00040085154,0.94419765,0.0005252016,0.00008907025,0.00012966568,0.00005388974,0.00038001876,0.010017075],"genre_scores_gemma":[0.7399321,0.00085197284,0.25400248,0.00021594913,0.00015155655,0.00023286689,0.0001023442,0.00015046091,0.004360296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996906,0.001172036,0.00022117449,0.0003023362,0.0010312317,0.00036731292],"domain_scores_gemma":[0.9934575,0.0028621396,0.0005848012,0.0023410558,0.0004990953,0.00025548245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004609848,0.00053786335,0.00067094044,0.0009860797,0.0010312068,0.0023544412,0.0012011611,0.0008256119,0.00342093],"category_scores_gemma":[0.009406398,0.00042174352,0.0007197779,0.00091977365,0.0032638917,0.0073729344,0.004020786,0.0024270352,0.0011666723],"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.00016428067,0.000045694334,0.00020354304,0.000087691,0.00001566321,0.000098886216,0.0003767797,0.018817483,0.015823605,0.9428666,0.0007120086,0.020787627],"study_design_scores_gemma":[0.00008192958,0.00032194812,0.00013670012,0.000079543184,0.000041895648,0.00042282126,0.00017643927,0.31033817,0.037348498,0.63426924,0.016704226,0.00007866462],"about_ca_topic_score_codex":0.00038605256,"about_ca_topic_score_gemma":0.0003118862,"teacher_disagreement_score":0.004609848,"about_ca_system_score_codex":0.0009061555,"about_ca_system_score_gemma":0.0012501308,"threshold_uncertainty_score":0.024379551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010580965,0.000018111878,0.0001600684,0.000023322544,0.000019446077,0.000011317231,0.9987676,0.0005817545,0.0003126306],"genre_scores_gemma":[0.00034372293,0.000024903673,0.00058533234,0.000050816616,0.0000038422154,0.000082946244,0.9979347,0.00043673808,0.0005370677],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815696,0.0002503562,0.00021248368,0.0006265236,0.00044371936,0.00030989104],"domain_scores_gemma":[0.99517906,0.0014444122,0.00029192163,0.0011098207,0.0015894953,0.00038532884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025484858,0.0029943474,0.0018752911,0.0040590195,0.0025008472,0.0026705882,0.004037092,0.002379134,0.14092085],"category_scores_gemma":[0.007894336,0.0015349619,0.0018278483,0.0066231843,0.0007301136,0.0015799572,0.002329033,0.002714921,0.103835605],"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.00026641274,0.000036892467,0.0012799037,0.001229942,0.00009557158,0.00004429947,0.000078774516,0.0006484906,0.0014014392,0.00089738646,0.9908641,0.00315667],"study_design_scores_gemma":[0.0004303079,0.000036911813,0.006620203,0.00030574526,0.000081846214,0.00006362505,0.00008401775,0.0005669868,0.0029558698,0.0025021154,0.98625654,0.0000958611],"about_ca_topic_score_codex":0.07480951,"about_ca_topic_score_gemma":0.1161385,"teacher_disagreement_score":0.14092085,"about_ca_system_score_codex":0.0037865778,"about_ca_system_score_gemma":0.0071131364,"threshold_uncertainty_score":0.4714272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038703278,0.000049307182,0.00008794475,0.000033200875,0.00001883213,0.0000100155185,0.99797136,0.0006127384,0.00082964206],"genre_scores_gemma":[0.00067049894,0.000052902007,0.00030786908,0.000044875047,0.000003338294,0.000040234598,0.9981293,0.00016438987,0.00058675837],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995328,0.000037083613,0.00003107839,0.00016221107,0.00012248562,0.0001143665],"domain_scores_gemma":[0.9990544,0.00021194357,0.00008293389,0.00031744305,0.0002105828,0.00012280856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075133966,0.0016763413,0.0011117979,0.0024118505,0.00087966403,0.0018437157,0.0018820121,0.0014861801,0.08107916],"category_scores_gemma":[0.0014366726,0.00063913176,0.00081668084,0.0038870363,0.00043343398,0.0009941903,0.001595587,0.0017323071,0.07588363],"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.00020275058,0.000048791506,0.0017253689,0.0010581017,0.000061009567,0.000057618556,0.00004115924,0.0003037207,0.0029217156,0.00073606474,0.98847735,0.0043664365],"study_design_scores_gemma":[0.00031505202,0.000033248194,0.015365212,0.00020766909,0.00005526491,0.00016250403,0.000096780146,0.0003245455,0.0033886908,0.0011567475,0.97882324,0.000071204166],"about_ca_topic_score_codex":0.030611325,"about_ca_topic_score_gemma":0.06781772,"teacher_disagreement_score":0.08107916,"about_ca_system_score_codex":0.0014481428,"about_ca_system_score_gemma":0.0018231319,"threshold_uncertainty_score":0.27123678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003785348,0.00020493387,0.0008294426,0.000059872917,0.000105369756,0.00006286553,0.9922591,0.0049450663,0.0011547897],"genre_scores_gemma":[0.00073486293,0.000083308136,0.0016302046,0.000060616683,0.000011949208,0.00014293482,0.9961746,0.0002544915,0.00090700336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982632,0.00018847798,0.00014326129,0.0007478944,0.00040027173,0.00025690344],"domain_scores_gemma":[0.9980964,0.0005335937,0.00010370663,0.0006652873,0.00043650795,0.00016442584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010630398,0.008068393,0.0025727944,0.004460771,0.0012715571,0.0026294335,0.004098993,0.004358631,0.14029506],"category_scores_gemma":[0.006484886,0.0013575422,0.0030863758,0.005261693,0.0008069844,0.0017463845,0.002377037,0.0028025683,0.20202707],"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.00012601113,0.00006443056,0.00065033423,0.0005175367,0.000033151184,0.000027931035,0.000011523343,0.0009057448,0.00032929468,0.00024704981,0.986791,0.0102960495],"study_design_scores_gemma":[0.0007976423,0.00014067726,0.004304737,0.0005095299,0.00011259646,0.0003746167,0.0001397598,0.010256138,0.0045193844,0.0053776815,0.9733296,0.00013765378],"about_ca_topic_score_codex":0.021713898,"about_ca_topic_score_gemma":0.04766397,"teacher_disagreement_score":0.14029506,"about_ca_system_score_codex":0.0013945657,"about_ca_system_score_gemma":0.0023270727,"threshold_uncertainty_score":0.4693337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040603077,0.000049162347,0.0000913503,0.00003318227,0.00001917553,0.000010200172,0.9978613,0.0006332876,0.00089623505],"genre_scores_gemma":[0.0007634939,0.00005980685,0.00034878607,0.00004426748,0.0000034074203,0.0000418959,0.9978696,0.00017526653,0.0006935427],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995702,0.000035374775,0.000028314827,0.00014338279,0.00011344276,0.000109273846],"domain_scores_gemma":[0.9990716,0.00019997604,0.000078803794,0.00030989083,0.00022178159,0.00011792995],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007060159,0.0016039448,0.0010838355,0.002502988,0.0008601872,0.0017104628,0.00183796,0.0013885795,0.0865045],"category_scores_gemma":[0.0013883865,0.0006241207,0.00084314315,0.0040113125,0.00043677425,0.0009848347,0.0015393384,0.0016706828,0.07648954],"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.0001987127,0.000047070833,0.0018454998,0.0010774601,0.00006568704,0.000053038817,0.00004212949,0.0003422659,0.0029079316,0.0007338721,0.9880121,0.00467426],"study_design_scores_gemma":[0.00028710163,0.000033150194,0.016514707,0.00021520254,0.000056770685,0.00014570571,0.00010332564,0.00032526112,0.0035216406,0.0012277019,0.97749555,0.00007374569],"about_ca_topic_score_codex":0.038260892,"about_ca_topic_score_gemma":0.08358897,"teacher_disagreement_score":0.9134955,"about_ca_system_score_codex":0.001596685,"about_ca_system_score_gemma":0.00197908,"threshold_uncertainty_score":0.28938633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20171599,0.0062681306,0.6848909,0.0054417686,0.001036908,0.0001847025,0.0006287732,0.0005633116,0.09926948],"genre_scores_gemma":[0.8736197,0.005642131,0.07648678,0.0017223182,0.0012642114,0.00036069594,0.00057545886,0.00035226782,0.03997656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700874,0.000797557,0.00019433587,0.0003546649,0.0011430471,0.0005017457],"domain_scores_gemma":[0.9860405,0.010429456,0.0009905857,0.001247426,0.0009765783,0.00031556597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027672867,0.0020620585,0.0012862191,0.0030545623,0.0016624809,0.0027917512,0.0016360515,0.0026386883,0.0061830143],"category_scores_gemma":[0.018915921,0.0009018166,0.0011646814,0.0029550032,0.0052920184,0.006423058,0.0044245347,0.003320799,0.0013178568],"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.00021586465,0.00002200969,0.00018686376,0.00010172637,0.000014394291,0.00012640048,0.00025000508,0.020693636,0.0016472985,0.9549404,0.0023158751,0.019485613],"study_design_scores_gemma":[0.000033809465,0.00004307565,0.00007674862,0.00008183269,0.000013863684,0.00015666561,0.000046785386,0.029185485,0.0015357325,0.96599114,0.0027997321,0.00003518999],"about_ca_topic_score_codex":0.0014242098,"about_ca_topic_score_gemma":0.00171728,"teacher_disagreement_score":0.0061830143,"about_ca_system_score_codex":0.0031888266,"about_ca_system_score_gemma":0.0021253321,"threshold_uncertainty_score":0.023136735},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035114795,0.00017511084,0.96154004,0.00022930335,0.000033260872,0.00005745714,0.00011279222,0.000782704,0.001954576],"genre_scores_gemma":[0.54653805,0.0003061279,0.44781134,0.00032096187,0.000064897235,0.00030801995,0.00081314053,0.00042085603,0.0034165839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991416,0.0003302852,0.000038489117,0.0002446143,0.00014921959,0.00009583317],"domain_scores_gemma":[0.994947,0.003480806,0.0003716914,0.0004925877,0.0004505898,0.00025731316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016926111,0.0009315752,0.0010593114,0.0013573671,0.00067078794,0.00085823104,0.0018932924,0.001331755,0.003539976],"category_scores_gemma":[0.0097218165,0.0007352466,0.001067468,0.00076381763,0.0017305722,0.0021138901,0.0018946067,0.0021957671,0.00056747417],"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.00008808367,0.00008231155,0.0027296797,0.0001034046,0.000068770336,0.00017064509,0.00017704137,0.8797103,0.0018016695,0.038735136,0.0021484706,0.07418445],"study_design_scores_gemma":[0.000016421154,0.000023341794,0.00012144983,0.000012167281,0.000011044258,0.000026971158,0.000017220238,0.9646806,0.00050961267,0.033698004,0.00087605976,0.000007113619],"about_ca_topic_score_codex":0.0034083934,"about_ca_topic_score_gemma":0.0044547976,"teacher_disagreement_score":0.003539976,"about_ca_system_score_codex":0.0011643176,"about_ca_system_score_gemma":0.001224203,"threshold_uncertainty_score":0.01184243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7285833,0.00038876076,0.23132977,0.00052568637,0.00008101241,0.00007979706,0.00043730668,0.00039661725,0.038177695],"genre_scores_gemma":[0.9764845,0.00023732494,0.018784218,0.0001356564,0.000091183414,0.0000894138,0.00031412486,0.00013611864,0.0037274624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986772,0.00030974753,0.00007872328,0.00023754536,0.00038437254,0.00031243634],"domain_scores_gemma":[0.99068075,0.0053875367,0.0012397658,0.0007858516,0.0012887284,0.00061743706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085679657,0.0004629446,0.00051728357,0.0015078016,0.0011514995,0.0014945164,0.0006094458,0.0008081202,0.0028210296],"category_scores_gemma":[0.0060628415,0.00026111215,0.00066069927,0.0009723883,0.0022410504,0.0020100598,0.0012176897,0.0014907377,0.00042643587],"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.00020781963,0.000039992723,0.0015966607,0.000098909244,0.000013905106,0.00028946853,0.00029715037,0.017490974,0.009582417,0.9574618,0.001094635,0.011826337],"study_design_scores_gemma":[0.00007407013,0.00024285921,0.0015506663,0.00007638713,0.000037693033,0.001098452,0.00026127248,0.14852285,0.021876449,0.81908464,0.0070454655,0.00012908565],"about_ca_topic_score_codex":0.0007074529,"about_ca_topic_score_gemma":0.00039270552,"teacher_disagreement_score":0.0028210296,"about_ca_system_score_codex":0.00093489845,"about_ca_system_score_gemma":0.00084395055,"threshold_uncertainty_score":0.009437263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004231012,0.0000493468,0.99421644,0.000107482054,0.000017308223,0.0000334423,0.000047787205,0.0006551654,0.000642052],"genre_scores_gemma":[0.30700073,0.00022813653,0.6870825,0.00039185327,0.000065858454,0.0004448455,0.0006502886,0.000796479,0.0033392732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993993,0.00022275961,0.000024957993,0.00016169118,0.00013813755,0.00005330225],"domain_scores_gemma":[0.9982413,0.0012032908,0.000083417464,0.0002203825,0.00017950853,0.00007218243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009470738,0.001190491,0.0007805289,0.0007432541,0.00049564225,0.00077673735,0.0017323534,0.0011400969,0.0038541057],"category_scores_gemma":[0.006002048,0.00059732655,0.0009865034,0.0006743833,0.0011549416,0.0019895013,0.0018389734,0.0023709824,0.0009964021],"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.00007847878,0.000087986664,0.00045444837,0.00014430135,0.000028826185,0.00009564625,0.00013919408,0.8839341,0.00764709,0.027537256,0.0027314061,0.0771212],"study_design_scores_gemma":[0.000007516617,0.000020863152,0.000032928692,0.000003960824,0.0000038092076,0.0000100100315,0.000013626031,0.97972065,0.00084432214,0.01855666,0.0007810875,0.000004521924],"about_ca_topic_score_codex":0.002841742,"about_ca_topic_score_gemma":0.005112907,"teacher_disagreement_score":0.0038541057,"about_ca_system_score_codex":0.0008891323,"about_ca_system_score_gemma":0.0017512044,"threshold_uncertainty_score":0.0128932595},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24378768,0.00056039565,0.74437463,0.0007728797,0.00007201842,0.00013302689,0.0001017449,0.0006319455,0.0095656],"genre_scores_gemma":[0.8515305,0.0003291276,0.14625384,0.00018300026,0.00004252269,0.00019237924,0.000114350994,0.00020268765,0.0011516806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971105,0.0015338181,0.00013479918,0.00052383286,0.00043905713,0.00025791445],"domain_scores_gemma":[0.98198193,0.013539929,0.00097171613,0.0022092115,0.0008493997,0.0004478003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008646188,0.00071208796,0.00095507875,0.0007515634,0.0007908018,0.0021293955,0.002158991,0.0015555426,0.0018745192],"category_scores_gemma":[0.05201419,0.0006640494,0.0008202775,0.0006156388,0.002670385,0.0031532883,0.0019172209,0.0022545722,0.00043567855],"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.00040455957,0.000204126,0.004946423,0.00019481304,0.0000810493,0.00016039684,0.0003507732,0.5303784,0.0059843054,0.42667747,0.001252577,0.029365161],"study_design_scores_gemma":[0.000039555176,0.00007819588,0.00034813237,0.000024340341,0.000016353415,0.0000638117,0.000033708788,0.87170374,0.0023348653,0.12463521,0.00069574104,0.000026346337],"about_ca_topic_score_codex":0.0012560843,"about_ca_topic_score_gemma":0.0007395666,"teacher_disagreement_score":0.008646188,"about_ca_system_score_codex":0.0014059339,"about_ca_system_score_gemma":0.001613082,"threshold_uncertainty_score":0.04572594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11515588,0.0005769471,0.8748188,0.0006022405,0.00007393217,0.000046283,0.000043205426,0.0002729527,0.00840976],"genre_scores_gemma":[0.8887467,0.0004032382,0.106928654,0.000119719785,0.000031954285,0.000072580064,0.000056796893,0.000025342659,0.0036150434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998442,0.00004690171,0.000006823043,0.000028222827,0.00005781005,0.000016068141],"domain_scores_gemma":[0.9992681,0.0005060652,0.000059300954,0.000044679626,0.00010271988,0.000019173121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036436215,0.00021325343,0.00020078983,0.00025238327,0.00023591347,0.0003861168,0.00032590466,0.00034872975,0.0010124018],"category_scores_gemma":[0.002070881,0.00011687564,0.00016881526,0.00019094258,0.0006178237,0.00063870824,0.00038394346,0.00050848065,0.00019098191],"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.00016702757,0.000076699995,0.0021123237,0.00018229359,0.000031631145,0.0001966625,0.00012769106,0.7224138,0.030424876,0.14754762,0.0014101887,0.0953092],"study_design_scores_gemma":[0.0000042308075,0.000023280276,0.0001298608,0.0000056901936,0.0000022271602,0.000019076737,0.000007923086,0.9846991,0.0034518698,0.011083004,0.0005700133,0.0000038066464],"about_ca_topic_score_codex":0.0009476773,"about_ca_topic_score_gemma":0.0010715383,"teacher_disagreement_score":0.0010124018,"about_ca_system_score_codex":0.00048194916,"about_ca_system_score_gemma":0.00042501808,"threshold_uncertainty_score":0.003496766},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23729526,0.0015404491,0.72493094,0.01071175,0.0003947559,0.00054887554,0.0010341209,0.001046714,0.022497207],"genre_scores_gemma":[0.8240908,0.0009586912,0.1614901,0.0015638686,0.00060243567,0.00043676203,0.0010263885,0.0003380022,0.009493103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98883456,0.004149091,0.0008096383,0.0030701214,0.0015060859,0.0016305245],"domain_scores_gemma":[0.9210916,0.07154088,0.0023088262,0.0021853733,0.0018230848,0.0010502009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010059337,0.0010548065,0.0017240398,0.001301416,0.0030769946,0.005211424,0.0028028334,0.0032788415,0.005899265],"category_scores_gemma":[0.039314814,0.000980478,0.0034172921,0.0017262108,0.0072568078,0.0101818675,0.00401923,0.005916381,0.0005576135],"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.00079090294,0.00023734897,0.0023370052,0.000431285,0.00014174459,0.00084011565,0.0012427744,0.10455793,0.0038955754,0.8513842,0.004006397,0.030134587],"study_design_scores_gemma":[0.000100503494,0.000076221615,0.00029179855,0.00004640182,0.00006559069,0.00023684763,0.0002586003,0.12782826,0.0034839606,0.8647468,0.0028196957,0.0000453092],"about_ca_topic_score_codex":0.003923679,"about_ca_topic_score_gemma":0.0033208572,"teacher_disagreement_score":0.010059337,"about_ca_system_score_codex":0.0044788495,"about_ca_system_score_gemma":0.0036848355,"threshold_uncertainty_score":0.05319953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7694186,0.00092164427,0.22255604,0.00036903235,0.0002487838,0.00008702612,0.0003270256,0.0016979284,0.004373979],"genre_scores_gemma":[0.87203175,0.0003122752,0.12140895,0.00014620976,0.000036060883,0.000053780797,0.00035979418,0.00018066105,0.0054705143],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997297,0.00004925571,0.000015739737,0.00005692833,0.000116117946,0.000032285192],"domain_scores_gemma":[0.9994103,0.00012861729,0.00019848063,0.00012354727,0.00008742443,0.00005161693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037872794,0.00023130412,0.00022195982,0.00041582424,0.00014989228,0.0006159137,0.00037134223,0.00058185006,0.0010731596],"category_scores_gemma":[0.0008472573,0.00020655459,0.00017830428,0.00043731584,0.0004468492,0.0008113358,0.0007361521,0.00057861157,0.000577726],"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.000057521254,0.000021515923,0.00024581555,0.000048336413,0.0000039737083,0.00008271283,0.000043654993,0.0010863022,0.98215884,0.002836804,0.00024188064,0.013172689],"study_design_scores_gemma":[0.0000072909634,0.000055509452,0.00017980965,0.000003808647,0.000003011061,0.000088925095,0.000011589997,0.007901993,0.9877652,0.000339147,0.0036341937,0.000009483868],"about_ca_topic_score_codex":0.00013222416,"about_ca_topic_score_gemma":0.00020946746,"teacher_disagreement_score":0.0010731596,"about_ca_system_score_codex":0.00035449734,"about_ca_system_score_gemma":0.00021576541,"threshold_uncertainty_score":0.0035900474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7373142,0.002308295,0.24889599,0.00048150728,0.00022782655,0.00026907068,0.0006106509,0.0035433222,0.0063491324],"genre_scores_gemma":[0.9098302,0.0008966872,0.08324422,0.00016367526,0.000020840193,0.00018279243,0.0005257831,0.00019116186,0.0049446793],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906033,0.00010233649,0.00011780767,0.00029301015,0.00031523392,0.000111263114],"domain_scores_gemma":[0.9992199,0.00015072193,0.00025677224,0.00021276572,0.000108534936,0.000051244373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061905023,0.0004823876,0.00041485322,0.0003799961,0.00043105258,0.0007130763,0.00072391116,0.0005489141,0.0010326682],"category_scores_gemma":[0.0012108842,0.00031472498,0.0004163226,0.00025200692,0.0006517569,0.0006694143,0.00071720465,0.0007329939,0.0005814496],"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.000070071415,0.000029848876,0.0004484714,0.00011252275,0.000014355026,0.00007716977,0.00005614605,0.00096936594,0.9857466,0.0015534442,0.0002556329,0.010666433],"study_design_scores_gemma":[0.0000033084564,0.000055741788,0.00015910175,0.000004016012,0.000004895848,0.00008902493,0.000010184118,0.0024526212,0.9949026,0.00012595468,0.0021837908,0.000008839015],"about_ca_topic_score_codex":0.0006264673,"about_ca_topic_score_gemma":0.0009633872,"teacher_disagreement_score":0.0010326682,"about_ca_system_score_codex":0.00057695754,"about_ca_system_score_gemma":0.0005130092,"threshold_uncertainty_score":0.0041861534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017599091,0.0003109419,0.97735256,0.00014085072,0.00008506979,0.000068198446,0.00011215621,0.0006872144,0.0036439337],"genre_scores_gemma":[0.31815204,0.0004431803,0.6756028,0.00018024164,0.000044325574,0.000121223005,0.00041595314,0.00013031451,0.004909839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950635,0.00010675851,0.000028644907,0.000090249814,0.00020328685,0.00006479568],"domain_scores_gemma":[0.99922025,0.00023878914,0.000051998682,0.00013220418,0.00032539308,0.000031281903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051398587,0.0007020684,0.0006983099,0.0005771412,0.00055066514,0.00064467965,0.0010958007,0.00070159184,0.0014423172],"category_scores_gemma":[0.00249308,0.00021591606,0.00028306176,0.0012833365,0.0004734895,0.0008515209,0.00070079364,0.00059511996,0.0005202569],"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.0003646827,0.00007573821,0.0017137333,0.0002053035,0.0000772443,0.00036635308,0.0001550565,0.45605716,0.06259369,0.13468672,0.0064843385,0.33721992],"study_design_scores_gemma":[0.000025335272,0.00005215309,0.00017179371,0.000009768438,0.00001201284,0.00022357117,0.000008687682,0.9720233,0.016823782,0.007949536,0.0026726688,0.000027375629],"about_ca_topic_score_codex":0.0067570694,"about_ca_topic_score_gemma":0.008587945,"teacher_disagreement_score":0.0067570694,"about_ca_system_score_codex":0.00076266914,"about_ca_system_score_gemma":0.0026058694,"threshold_uncertainty_score":0.013435483},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090238005,0.001325924,0.8844963,0.0004520816,0.00024541095,0.00012685853,0.00007652486,0.0005801477,0.022458712],"genre_scores_gemma":[0.7021225,0.0010413927,0.28571332,0.00022940352,0.00015217115,0.00011650689,0.00009250223,0.00003268082,0.010499479],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985874,0.000036296147,0.000009234256,0.000023755427,0.000055242872,0.000016869233],"domain_scores_gemma":[0.999853,0.000031113083,0.000028590039,0.000017105987,0.000057345358,0.000012818905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020811257,0.00043369763,0.0002178294,0.0004158092,0.00030994523,0.0005917783,0.0006839888,0.0003675997,0.00261188],"category_scores_gemma":[0.00039046703,0.00011718343,0.00025000577,0.0004242587,0.00024366712,0.0006888342,0.0003940642,0.00028361392,0.00077974796],"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.00065032986,0.00020605935,0.0018993402,0.00042212024,0.00013229437,0.00068621634,0.0002212026,0.072291106,0.41668317,0.10250232,0.004639326,0.39966655],"study_design_scores_gemma":[0.00011263367,0.0022466758,0.00086985406,0.00013972749,0.00012687704,0.0018557468,0.00011185951,0.73437816,0.17773396,0.018961279,0.06338006,0.000083036924],"about_ca_topic_score_codex":0.00015727812,"about_ca_topic_score_gemma":0.00034896322,"teacher_disagreement_score":0.00261188,"about_ca_system_score_codex":0.00028340632,"about_ca_system_score_gemma":0.00035526042,"threshold_uncertainty_score":0.008737624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36326098,0.0009950227,0.56976444,0.00036400845,0.0001992103,0.0003036211,0.0016418456,0.0008344463,0.062636375],"genre_scores_gemma":[0.6647092,0.0005178367,0.32213816,0.00015582745,0.000040359,0.00026799773,0.0021689245,0.00018855177,0.0098131085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995627,0.00008824827,0.000043587515,0.00008897502,0.00013151913,0.00008489035],"domain_scores_gemma":[0.99931645,0.000335154,0.00008364456,0.00010665845,0.00011152835,0.00004657288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034682365,0.00055908656,0.0005868185,0.0010713899,0.0005546945,0.0012523493,0.00058867614,0.0005566574,0.007744646],"category_scores_gemma":[0.0022483233,0.00022377176,0.0007081648,0.0012181185,0.00094917597,0.0014651769,0.0009169805,0.00056901446,0.00088811084],"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.00043512552,0.00019499274,0.0063435957,0.00089602947,0.000053164415,0.00047161855,0.00034269676,0.20552766,0.027355725,0.48518145,0.010652881,0.26254505],"study_design_scores_gemma":[0.000117330084,0.0001975724,0.0017163538,0.00014351228,0.000028147595,0.00045926165,0.00025192543,0.51307225,0.015675513,0.44808638,0.020191124,0.000060679075],"about_ca_topic_score_codex":0.0017292235,"about_ca_topic_score_gemma":0.0025483721,"teacher_disagreement_score":0.007744646,"about_ca_system_score_codex":0.00050427776,"about_ca_system_score_gemma":0.00071530126,"threshold_uncertainty_score":0.02590841},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0139044775,0.008016137,0.51046354,0.0018941336,0.0016834342,0.00012518856,0.0006957437,0.0032928546,0.4599245],"genre_scores_gemma":[0.40922216,0.0073519084,0.19689558,0.0016039527,0.0009247947,0.00045952655,0.0019655635,0.0021530653,0.37942356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930537,0.00016453491,0.00004514525,0.000192756,0.00021227256,0.00007990592],"domain_scores_gemma":[0.9987112,0.00048028116,0.00003110889,0.0005870786,0.0001446475,0.00004568457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064515375,0.0009681397,0.0010229879,0.0009731709,0.0014071856,0.0027358178,0.0015465181,0.0010775359,0.023759326],"category_scores_gemma":[0.0028397646,0.00065070833,0.0011772672,0.0010848524,0.0028603927,0.004059598,0.0021014402,0.0025913613,0.0078168465],"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.000057427478,0.000014703739,0.0000541524,0.00009170428,0.000013002004,0.000047027876,0.00018231817,0.0067759613,0.0016371052,0.9152074,0.016903106,0.059016023],"study_design_scores_gemma":[0.000009871015,0.000016298207,0.000041010986,0.000038991024,0.000011132457,0.0000703165,0.000028067261,0.013501328,0.0012233364,0.8993061,0.08573941,0.000014077819],"about_ca_topic_score_codex":0.0014182958,"about_ca_topic_score_gemma":0.0013760764,"teacher_disagreement_score":0.023759326,"about_ca_system_score_codex":0.0012853189,"about_ca_system_score_gemma":0.00079700106,"threshold_uncertainty_score":0.07948291},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014781144,0.38786408,0.1126948,0.2869687,0.10748613,0.000075617485,0.00057612424,0.0007141688,0.088839285],"genre_scores_gemma":[0.37650752,0.20978935,0.05669283,0.059201762,0.180902,0.00023411469,0.0005253849,0.0012580638,0.11488891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978873,0.0007578439,0.00013878015,0.00050435914,0.0005813703,0.00013031346],"domain_scores_gemma":[0.9951315,0.0030456085,0.00017555575,0.00029191075,0.0009518743,0.00040353704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034100504,0.001786063,0.0019316383,0.0022122525,0.00226989,0.0048353076,0.0011225952,0.001969146,0.0038402446],"category_scores_gemma":[0.012141507,0.00068371807,0.00057749584,0.0021851738,0.007360775,0.011147403,0.0027303228,0.008320719,0.0021281152],"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.00030294663,0.00008146384,0.0002920216,0.00036227633,0.000071228525,0.00011885088,0.0011573368,0.002577315,0.0013625781,0.6979771,0.24765815,0.04803873],"study_design_scores_gemma":[0.00007133572,0.00013526407,0.00025566245,0.00029870303,0.000033844986,0.00022798887,0.00031178232,0.003965518,0.0020850925,0.46942803,0.5230505,0.0001364571],"about_ca_topic_score_codex":0.0016999162,"about_ca_topic_score_gemma":0.0012170903,"teacher_disagreement_score":0.0048353076,"about_ca_system_score_codex":0.0022038405,"about_ca_system_score_gemma":0.001584105,"threshold_uncertainty_score":0.018034339},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074076615,0.0005384974,0.88931906,0.00060636306,0.0002092106,0.00028067167,0.009249933,0.022054954,0.0036647571],"genre_scores_gemma":[0.21815221,0.00018331643,0.7517268,0.00019796599,0.00009704049,0.0003266364,0.022086877,0.0053350665,0.001894154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748397,0.00088616915,0.00017191832,0.0006766769,0.0006064785,0.00017476859],"domain_scores_gemma":[0.9924368,0.003332755,0.00028683714,0.00323241,0.0005440005,0.0001670893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040386184,0.0013059978,0.0016186144,0.0029472485,0.0012991651,0.0024236282,0.003182812,0.0017175571,0.012938309],"category_scores_gemma":[0.017027892,0.0015974453,0.002409643,0.00332197,0.0011523163,0.0035186552,0.0044949283,0.0025659062,0.0031323093],"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.0026198863,0.00035956595,0.008584401,0.001502484,0.0010794203,0.0011533301,0.0016910235,0.06928128,0.031174248,0.07768367,0.056311168,0.7485596],"study_design_scores_gemma":[0.00069576583,0.00039690244,0.004929096,0.00027982172,0.00050600764,0.0013333884,0.0006407462,0.5560573,0.04159861,0.34875676,0.04466258,0.00014293067],"about_ca_topic_score_codex":0.0006158973,"about_ca_topic_score_gemma":0.0015270101,"teacher_disagreement_score":0.012938309,"about_ca_system_score_codex":0.00054822705,"about_ca_system_score_gemma":0.0012972011,"threshold_uncertainty_score":0.043282986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006009031,0.00016561942,0.990319,0.00016239886,0.000042519543,0.000022202787,0.000058985654,0.00024007935,0.0029801393],"genre_scores_gemma":[0.6511144,0.000680599,0.33848596,0.0004556474,0.000105399915,0.00021931663,0.00031853904,0.00012556565,0.008494606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967074,0.00007528672,0.000013751075,0.00006267363,0.00012708252,0.00005056179],"domain_scores_gemma":[0.9995142,0.00020016024,0.000046350604,0.00005845078,0.00015155486,0.000029227607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688908,0.00059973303,0.000405979,0.00036614004,0.00033460508,0.0006447045,0.0011896584,0.0007850859,0.0027907912],"category_scores_gemma":[0.0015116343,0.00022500256,0.00035172503,0.0005199708,0.0007296452,0.001467857,0.0010237796,0.001170946,0.00078657764],"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.00028669165,0.00012867544,0.00079573336,0.00020644478,0.000063024905,0.00029451406,0.00015245812,0.5861725,0.03941311,0.16444474,0.0071537644,0.20088837],"study_design_scores_gemma":[0.000007778511,0.000036697646,0.000041304764,0.000008809989,0.00000750576,0.000055823602,0.0000068141194,0.98642236,0.0035646819,0.008192926,0.0016454362,0.00000993724],"about_ca_topic_score_codex":0.0026809243,"about_ca_topic_score_gemma":0.003967198,"teacher_disagreement_score":0.0027907912,"about_ca_system_score_codex":0.0005853134,"about_ca_system_score_gemma":0.0009908142,"threshold_uncertainty_score":0.009336114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57174456,0.0028199647,0.3182632,0.0016245592,0.00018165063,0.00012683663,0.0010681159,0.0003597151,0.10381144],"genre_scores_gemma":[0.9811467,0.00090182654,0.014825966,0.00011571475,0.000070466296,0.000063893145,0.00021840486,0.000060895207,0.0025962177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988809,0.00023941892,0.000045718007,0.0001079753,0.00047090082,0.00025499676],"domain_scores_gemma":[0.9886326,0.008543967,0.00047926424,0.00059834623,0.0015444002,0.00020143169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012295968,0.00057512894,0.00041189793,0.0019946909,0.0005070258,0.0011729007,0.0007647911,0.00068478164,0.004659832],"category_scores_gemma":[0.011255158,0.00026599586,0.0003531254,0.0009209364,0.0021072377,0.0014765742,0.0012644598,0.00077348435,0.000630726],"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.00016381423,0.000053752454,0.0009474084,0.0002436262,0.00002349774,0.0003318594,0.0001862692,0.12942055,0.022697678,0.8170612,0.00228827,0.026582107],"study_design_scores_gemma":[0.00003980957,0.00007836626,0.0007501703,0.00022374891,0.000029895544,0.00077036425,0.00008235349,0.35241544,0.044597227,0.59608597,0.0048467284,0.00007991693],"about_ca_topic_score_codex":0.00097103755,"about_ca_topic_score_gemma":0.0005908039,"teacher_disagreement_score":0.004659832,"about_ca_system_score_codex":0.001283231,"about_ca_system_score_gemma":0.0010285974,"threshold_uncertainty_score":0.015588701},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28072986,0.0025736662,0.6971003,0.00544848,0.00026524108,0.00027214419,0.0013194699,0.0010223433,0.011268527],"genre_scores_gemma":[0.9286494,0.00070016243,0.06710467,0.0008242231,0.00020099668,0.00024768893,0.00048719428,0.0001880747,0.0015975756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934662,0.0030392767,0.00041240745,0.0017623971,0.0009958037,0.00032400808],"domain_scores_gemma":[0.85168695,0.12619622,0.008634389,0.0096350955,0.003030557,0.0008167932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016538806,0.0007777954,0.0012222356,0.004177159,0.0019790113,0.003383695,0.0012280312,0.0011227187,0.008434357],"category_scores_gemma":[0.11301217,0.00083426386,0.0016179434,0.004023758,0.0063236733,0.0092966175,0.003288136,0.0032209316,0.0005424967],"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.00060738105,0.0001759542,0.15921742,0.00081354036,0.0007936394,0.0012442557,0.0021462375,0.028744016,0.0035509048,0.6090764,0.005342617,0.18828768],"study_design_scores_gemma":[0.000079631776,0.000068045476,0.021505361,0.000058742844,0.00014298852,0.00039247156,0.00034515487,0.09363612,0.0019159659,0.8775343,0.004246338,0.000074937525],"about_ca_topic_score_codex":0.003981527,"about_ca_topic_score_gemma":0.002951684,"teacher_disagreement_score":0.016538806,"about_ca_system_score_codex":0.0018593533,"about_ca_system_score_gemma":0.0015491114,"threshold_uncertainty_score":0.08746666},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019353714,0.0012981775,0.9676936,0.002306165,0.00011505724,0.00004041756,0.00015782111,0.00034248378,0.008692547],"genre_scores_gemma":[0.52817947,0.0017038485,0.45878685,0.00085422455,0.00059526245,0.0001836831,0.0005952159,0.00019040988,0.008911064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964994,0.001801735,0.00020760075,0.0005559086,0.00075865176,0.00017661962],"domain_scores_gemma":[0.97118855,0.025687393,0.0006635849,0.0011319048,0.0010510192,0.00027758264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006378799,0.00056029484,0.0010558873,0.0022043262,0.0017517356,0.0040822616,0.0033115018,0.0016728897,0.0069919038],"category_scores_gemma":[0.03911548,0.000895736,0.0018646945,0.0017290653,0.004267884,0.01155694,0.0033532975,0.004104821,0.0009365001],"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.000035097346,0.000035725196,0.0005519174,0.00009559975,0.000032431213,0.000033814,0.00017733262,0.020247437,0.00021714736,0.95471674,0.0014806363,0.02237622],"study_design_scores_gemma":[0.0000059559516,0.0000024307326,0.00004546396,0.00001579344,0.00000752165,0.000013161536,0.00001877337,0.07628335,0.00024892637,0.9224554,0.0008965598,0.000006595115],"about_ca_topic_score_codex":0.0030564899,"about_ca_topic_score_gemma":0.0052697505,"teacher_disagreement_score":0.0069919038,"about_ca_system_score_codex":0.0032606344,"about_ca_system_score_gemma":0.0019600033,"threshold_uncertainty_score":0.03373474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005319004,0.00018280302,0.9905918,0.00011225388,0.000108949804,0.00006670004,0.00008472236,0.001613534,0.0019203129],"genre_scores_gemma":[0.19983311,0.00038451614,0.7938498,0.00018117446,0.00016322949,0.00035164854,0.00073245197,0.0004419237,0.004062141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991629,0.00015354084,0.00006855635,0.00017193987,0.0003266806,0.000116330135],"domain_scores_gemma":[0.9991903,0.00009993197,0.000053326585,0.0002668204,0.00030276782,0.000086809065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073915126,0.0011580989,0.0008860264,0.0011026296,0.0012127461,0.001507216,0.001604242,0.0004910792,0.0043943264],"category_scores_gemma":[0.002065703,0.0004104099,0.00082679995,0.001976437,0.0007002652,0.0017783204,0.0018890764,0.0012236101,0.001950214],"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.0006302281,0.0002941031,0.0024928823,0.00042775477,0.00019464204,0.00050896686,0.00037563418,0.21766277,0.06104092,0.09494103,0.046893217,0.5745379],"study_design_scores_gemma":[0.000059786962,0.000066226625,0.00023406338,0.000012518532,0.000024289477,0.00012373753,0.00006044195,0.96284145,0.012359408,0.013846693,0.010334154,0.000037267047],"about_ca_topic_score_codex":0.004633702,"about_ca_topic_score_gemma":0.0063114776,"teacher_disagreement_score":0.004633702,"about_ca_system_score_codex":0.00080418895,"about_ca_system_score_gemma":0.0020347086,"threshold_uncertainty_score":0.014700472},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75597256,0.0022933949,0.22652884,0.00060024037,0.00021375192,0.00040232527,0.00033413523,0.0009823366,0.012672477],"genre_scores_gemma":[0.9119604,0.0020972905,0.0824597,0.00019836769,0.000014728667,0.00018863288,0.00022341653,0.00007704901,0.002780444],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999087,0.000010828816,0.0000074167665,0.000024830017,0.000022294469,0.000025954641],"domain_scores_gemma":[0.9999049,0.00002709672,0.000024614314,0.0000092954015,0.000017434664,0.000016754637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022377964,0.0005035098,0.00044505822,0.00020244825,0.00017958773,0.00063647504,0.00055173266,0.00043055398,0.0010926079],"category_scores_gemma":[0.00042583607,0.00024340428,0.00023144201,0.00017476866,0.00030419714,0.0005893978,0.00049457356,0.0005275056,0.00044134838],"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.00018256674,0.00021230792,0.00080929295,0.00057246874,0.000039113598,0.00037241657,0.00007240428,0.0390158,0.90912205,0.02064322,0.00043896926,0.028519405],"study_design_scores_gemma":[0.00007511601,0.00076289417,0.00039334822,0.0000362781,0.00003041669,0.00020764934,0.00011239124,0.09147611,0.8881422,0.0042297696,0.014498101,0.00003574442],"about_ca_topic_score_codex":0.00026175522,"about_ca_topic_score_gemma":0.00079796836,"teacher_disagreement_score":0.0010926079,"about_ca_system_score_codex":0.00035019132,"about_ca_system_score_gemma":0.00045224064,"threshold_uncertainty_score":0.0036551356},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04238786,0.00049808156,0.943926,0.00020153393,0.00010884182,0.0001297241,0.00015489603,0.0053701624,0.0072228163],"genre_scores_gemma":[0.35315263,0.00021035432,0.640655,0.00013541816,0.00003427661,0.00015225285,0.0003636521,0.00049067405,0.0048057707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965215,0.000064022766,0.000024401785,0.000082743594,0.00012952987,0.000047142956],"domain_scores_gemma":[0.9994184,0.00013212301,0.000092648,0.0002192561,0.00010435656,0.000033148965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034287135,0.0008975228,0.00042747677,0.0005425724,0.00047482143,0.0007024616,0.0015619039,0.0008013551,0.004555625],"category_scores_gemma":[0.0014402968,0.00032271573,0.00043653717,0.00050165656,0.00037286137,0.0006548851,0.0008898671,0.0006255437,0.0014649308],"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.00021858512,0.00010277298,0.001328234,0.00030785328,0.00006152513,0.0002771702,0.00022332207,0.5471445,0.07102682,0.014188449,0.011298789,0.353822],"study_design_scores_gemma":[0.00003482657,0.00017406429,0.0003952509,0.000023492808,0.00002039281,0.00025798543,0.00007401353,0.9567556,0.020558802,0.0069757286,0.014704138,0.000025679383],"about_ca_topic_score_codex":0.0018363888,"about_ca_topic_score_gemma":0.00470953,"teacher_disagreement_score":0.004555625,"about_ca_system_score_codex":0.00048732306,"about_ca_system_score_gemma":0.0010430302,"threshold_uncertainty_score":0.015240014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07717795,0.0009218698,0.90475833,0.00032529185,0.00016845304,0.0001805921,0.00012079876,0.0017399957,0.014606751],"genre_scores_gemma":[0.80033845,0.00038567366,0.19235003,0.00027440372,0.00006856306,0.000095568044,0.00015838162,0.00006038943,0.006268537],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997832,0.00003159788,0.000018595552,0.000043871907,0.00008368123,0.000039119594],"domain_scores_gemma":[0.99983823,0.000030198958,0.000028709726,0.000045637826,0.000049012044,0.000008243599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020324279,0.0003213235,0.00028462618,0.00034693378,0.00030891685,0.0004645324,0.0008030499,0.00036187473,0.0024572683],"category_scores_gemma":[0.00038068646,0.00013450425,0.00035781474,0.0003339556,0.00021419796,0.0010157581,0.00034111892,0.000401981,0.000491919],"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.0006712974,0.00016039201,0.0011289803,0.0004749508,0.000105800944,0.0007053985,0.00023068688,0.029957565,0.537553,0.09546154,0.007556733,0.3259937],"study_design_scores_gemma":[0.00021511012,0.0017844596,0.0013924701,0.0000815711,0.0001942869,0.002448896,0.000069893664,0.47072443,0.45032492,0.013553672,0.05912085,0.00008942605],"about_ca_topic_score_codex":0.00037558159,"about_ca_topic_score_gemma":0.0006612408,"teacher_disagreement_score":0.0024572683,"about_ca_system_score_codex":0.0004149268,"about_ca_system_score_gemma":0.00043845165,"threshold_uncertainty_score":0.008220375},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023354445,0.0027258627,0.94028735,0.022107707,0.00033435095,0.000075486496,0.00035110023,0.0031221248,0.007641635],"genre_scores_gemma":[0.5752925,0.0038877595,0.4021875,0.00788286,0.00082530273,0.00021319758,0.0012368284,0.00073385675,0.007740284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975007,0.0012544274,0.00007731895,0.00042067489,0.00047153543,0.00027543525],"domain_scores_gemma":[0.9923453,0.004216523,0.0002534726,0.0018656623,0.0008812361,0.0004378891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005425345,0.0011844948,0.0012027605,0.0006195684,0.0009509542,0.0039851763,0.0033740683,0.0028017035,0.003414927],"category_scores_gemma":[0.015817523,0.0008677594,0.00084434747,0.00085381255,0.0023185993,0.010974462,0.005437668,0.007106656,0.0025325287],"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.0005976079,0.0002852399,0.0056054746,0.00043965573,0.00022272521,0.0008536444,0.0013898738,0.23508702,0.013905101,0.28328297,0.045923702,0.41240698],"study_design_scores_gemma":[0.000027092956,0.00007963495,0.00031547248,0.00006938951,0.000029513589,0.00016874532,0.00033135284,0.7742261,0.0036987315,0.19867635,0.022339655,0.00003791116],"about_ca_topic_score_codex":0.004576453,"about_ca_topic_score_gemma":0.0076417974,"teacher_disagreement_score":0.005425345,"about_ca_system_score_codex":0.001369008,"about_ca_system_score_gemma":0.0021123346,"threshold_uncertainty_score":0.028692305},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08025459,0.0010283387,0.7597779,0.00056715833,0.0003945058,0.0004771331,0.0042958288,0.14716834,0.0060361885],"genre_scores_gemma":[0.22937918,0.0005077967,0.74384236,0.0006020536,0.00006980824,0.00068040064,0.007241267,0.004731586,0.012945513],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994099,0.00007104863,0.000046359113,0.00019731646,0.00021245761,0.00006300409],"domain_scores_gemma":[0.999292,0.00020734321,0.00008876264,0.00020333128,0.0001486965,0.000059875598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008316268,0.00077965506,0.0005812559,0.00075019454,0.00055976294,0.00095867034,0.0021336724,0.0008343335,0.009400935],"category_scores_gemma":[0.0018657838,0.0006280979,0.00031384375,0.00088337116,0.00050060183,0.001419476,0.0011349536,0.0009609711,0.0034115857],"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.0030369712,0.0002492988,0.005195262,0.0007307983,0.00014680477,0.0005838335,0.0006535795,0.012836036,0.49795195,0.011861312,0.05046297,0.41629127],"study_design_scores_gemma":[0.00019677119,0.0007278632,0.0020005973,0.0000685005,0.000071978895,0.00086429267,0.00010938772,0.1475732,0.6942189,0.0050553796,0.148862,0.00025107653],"about_ca_topic_score_codex":0.0015575843,"about_ca_topic_score_gemma":0.0020393857,"teacher_disagreement_score":0.009400935,"about_ca_system_score_codex":0.00077907386,"about_ca_system_score_gemma":0.0011529794,"threshold_uncertainty_score":0.03144926},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116521195,0.00019681512,0.8734502,0.00019901017,0.00006234163,0.00006031477,0.00014461808,0.0012343439,0.00813118],"genre_scores_gemma":[0.65413195,0.0002550561,0.3371137,0.0001490295,0.00005667116,0.00008943992,0.000599185,0.00020159558,0.0074032536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993907,0.00015674398,0.000036607937,0.00008646488,0.00023742666,0.00009205227],"domain_scores_gemma":[0.9985983,0.00058034016,0.00010881358,0.0003420745,0.00031377588,0.00005668955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047993456,0.0005372618,0.0005440014,0.0004718283,0.00042489736,0.00055686245,0.0005206076,0.0004995429,0.0014726649],"category_scores_gemma":[0.0025337348,0.0002116917,0.00046461786,0.0006004757,0.00054132106,0.0008309278,0.0011325236,0.00080287614,0.0008840498],"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.00057289936,0.00011213407,0.0024895438,0.00019098255,0.000068270216,0.00049043115,0.0002830309,0.3807421,0.13928314,0.09677359,0.0042601656,0.37473372],"study_design_scores_gemma":[0.000029931372,0.0001412247,0.00027561837,0.000011880992,0.000020524403,0.00021284512,0.00003757287,0.8971193,0.07652461,0.021270435,0.004333295,0.000022744458],"about_ca_topic_score_codex":0.0014838644,"about_ca_topic_score_gemma":0.002891141,"teacher_disagreement_score":0.0014838644,"about_ca_system_score_codex":0.00045854147,"about_ca_system_score_gemma":0.0012081187,"threshold_uncertainty_score":0.0049265027},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007824214,0.056960545,0.16262716,0.22832274,0.08916197,0.00033217296,0.0084532285,0.003703054,0.4426149],"genre_scores_gemma":[0.2508235,0.085034356,0.10363486,0.06033181,0.098495655,0.0014763421,0.014650787,0.0034083712,0.3821444],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977925,0.0005116626,0.00014545729,0.0002837511,0.001008331,0.00025833762],"domain_scores_gemma":[0.99197406,0.0044160546,0.00038933766,0.0010877488,0.0015547173,0.0005781187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025529212,0.0014263918,0.0013279287,0.0018764506,0.00232691,0.0064812554,0.0018649377,0.0034646103,0.037911683],"category_scores_gemma":[0.008579062,0.00095429295,0.0009780402,0.0022903734,0.0028299193,0.0055699595,0.0019459272,0.010176179,0.0161949],"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.00010856408,0.000057508856,0.00023487286,0.0003482732,0.00004800716,0.00009161266,0.000036051224,0.0020594457,0.0008900799,0.13293391,0.80891097,0.054280695],"study_design_scores_gemma":[0.000079571604,0.000097173666,0.00078234595,0.0002581436,0.00004776348,0.00030711704,0.000059503465,0.01673257,0.002609458,0.14843427,0.8305097,0.00008238948],"about_ca_topic_score_codex":0.0065585175,"about_ca_topic_score_gemma":0.00866218,"teacher_disagreement_score":0.037911683,"about_ca_system_score_codex":0.0039395755,"about_ca_system_score_gemma":0.0024980025,"threshold_uncertainty_score":0.12682724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08736334,0.0007336479,0.88282293,0.0060647144,0.00020052781,0.00025503818,0.0004035046,0.0007069974,0.02144924],"genre_scores_gemma":[0.77460885,0.00090785767,0.20870788,0.00085685006,0.0004025059,0.0007560731,0.00058719056,0.0004488757,0.012723861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99046296,0.0037283604,0.00056868896,0.0021660132,0.0019548023,0.0011192465],"domain_scores_gemma":[0.93843114,0.041886255,0.003850164,0.013125678,0.0017705812,0.0009360792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005666589,0.00083751325,0.0013336933,0.0010592005,0.0020284518,0.0042725005,0.0038310222,0.0028713548,0.0095596835],"category_scores_gemma":[0.044457376,0.0007909348,0.0015177586,0.0021763172,0.0055234027,0.021118222,0.0056343246,0.005627263,0.0009521622],"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.000093631395,0.000060251183,0.00024881848,0.00011470263,0.000014234699,0.000037707603,0.0002109674,0.020370368,0.0009864019,0.9585621,0.0012399212,0.01806095],"study_design_scores_gemma":[0.000033044456,0.00004590355,0.0001262021,0.000030364623,0.000017125658,0.00007506184,0.00008975547,0.07193373,0.0016449358,0.9217115,0.004267331,0.000025089153],"about_ca_topic_score_codex":0.0010350478,"about_ca_topic_score_gemma":0.00086405274,"teacher_disagreement_score":0.0095596835,"about_ca_system_score_codex":0.0042426363,"about_ca_system_score_gemma":0.0021541354,"threshold_uncertainty_score":0.031980336},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14505933,0.00079047825,0.82246584,0.0010234613,0.00021875704,0.00022236624,0.00018147792,0.00029390087,0.029744338],"genre_scores_gemma":[0.8417663,0.00077622494,0.14936183,0.00030351404,0.00019643173,0.00031167944,0.00016157124,0.00004690329,0.0070754313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792236,0.00072852673,0.00018031785,0.00035903038,0.0005631976,0.00024661084],"domain_scores_gemma":[0.9978834,0.0009925956,0.0002494733,0.0006041242,0.00015297394,0.00011750314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022732995,0.00051827653,0.00072605396,0.00092773844,0.0012346538,0.002033074,0.001128904,0.0011431751,0.0024256273],"category_scores_gemma":[0.0043483526,0.00033581723,0.00079124724,0.0010168779,0.0027911563,0.005553218,0.0020949515,0.0016434932,0.00072710606],"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.000037443213,0.000008936946,0.00008066304,0.00001957224,0.000003949132,0.000060637372,0.00014430475,0.003113707,0.0017241181,0.9872098,0.00024119296,0.0073557533],"study_design_scores_gemma":[0.00003778711,0.00008511162,0.00010663087,0.000026021424,0.000010805888,0.00017116226,0.000062378356,0.044254504,0.006663731,0.9413545,0.007193474,0.000033904045],"about_ca_topic_score_codex":0.0003946988,"about_ca_topic_score_gemma":0.0002738044,"teacher_disagreement_score":0.0024256273,"about_ca_system_score_codex":0.0012612874,"about_ca_system_score_gemma":0.0010091378,"threshold_uncertainty_score":0.012022555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0728909,0.0052574542,0.8557718,0.008716663,0.00035493184,0.00023223051,0.0009338545,0.0007140196,0.05512816],"genre_scores_gemma":[0.75108194,0.008012196,0.20316306,0.0024116768,0.0019030679,0.0010758243,0.00113191,0.0012907257,0.029929629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991288,0.0041140066,0.00035520986,0.0014201201,0.0016999401,0.001122836],"domain_scores_gemma":[0.943281,0.04590601,0.0025812197,0.0050903074,0.0018896535,0.0012517929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076446873,0.0016333868,0.0023100334,0.002341843,0.0014711987,0.008289195,0.0058415583,0.0032552935,0.016966227],"category_scores_gemma":[0.047616635,0.0011616434,0.001738573,0.0036149449,0.004773699,0.017995594,0.0043286504,0.0046144845,0.0022319474],"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.00022409137,0.00013206687,0.00052210846,0.0003089817,0.000052285857,0.00013540957,0.0001556931,0.0823712,0.0019030517,0.8867414,0.0053459774,0.022107765],"study_design_scores_gemma":[0.000048536393,0.00010572194,0.00023806411,0.00007540763,0.00003233492,0.00021254807,0.00008581758,0.32687184,0.0019099341,0.6641736,0.006202872,0.00004333953],"about_ca_topic_score_codex":0.0011458833,"about_ca_topic_score_gemma":0.000625872,"teacher_disagreement_score":0.016966227,"about_ca_system_score_codex":0.0050932416,"about_ca_system_score_gemma":0.0022079686,"threshold_uncertainty_score":0.05675769},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046789153,0.00013134247,0.9757252,0.00071006763,0.00016698729,0.00013662915,0.0005975834,0.0035463013,0.014306949],"genre_scores_gemma":[0.26176316,0.0005610303,0.7138744,0.001614859,0.00026131544,0.00061047566,0.0025500234,0.0048330384,0.0139317205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99155253,0.0029143274,0.00068033097,0.0014298616,0.0027953354,0.0006275275],"domain_scores_gemma":[0.98182535,0.008524004,0.000665264,0.006254639,0.0024942227,0.00023652296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004530005,0.0014818952,0.0010257115,0.0013470311,0.0019612089,0.004401659,0.0037699866,0.0023119058,0.016092852],"category_scores_gemma":[0.025943633,0.0011928396,0.0023069144,0.0016044703,0.005276777,0.008420929,0.0072506755,0.00444514,0.0051736133],"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.0001197893,0.000048803606,0.00051266333,0.00026734074,0.00004373634,0.0002929183,0.0006380387,0.015641486,0.0073450343,0.90135026,0.009461174,0.06427879],"study_design_scores_gemma":[0.00005536763,0.000033848715,0.000080457845,0.00009662623,0.000051104238,0.00024711277,0.00013056646,0.10013396,0.021421134,0.8210635,0.056618165,0.00006802584],"about_ca_topic_score_codex":0.0037722262,"about_ca_topic_score_gemma":0.0054205875,"teacher_disagreement_score":0.016092852,"about_ca_system_score_codex":0.00218758,"about_ca_system_score_gemma":0.005867794,"threshold_uncertainty_score":0.053835988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026516214,0.9437547,0.014901716,0.001164613,0.0010559539,0.000024054918,0.00009066836,0.0002174434,0.036139216],"genre_scores_gemma":[0.012818524,0.91996753,0.016323367,0.0012810745,0.00092951517,0.000044275424,0.00032342604,0.00008699608,0.048225164],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997124,0.000033865315,0.000017463639,0.000056285266,0.00014667641,0.00003323403],"domain_scores_gemma":[0.99967194,0.00022157503,0.00002625442,0.0000129302925,0.000040672094,0.000026688322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005435997,0.00074818806,0.0006492689,0.00092400913,0.00029027014,0.002234421,0.0011670275,0.0008681291,0.009705405],"category_scores_gemma":[0.0007123133,0.0003507819,0.0003719697,0.0022329055,0.0008956229,0.0031998355,0.0011046471,0.0019503847,0.005353928],"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.00014739396,0.00015361271,0.00010780333,0.005267707,0.000025568617,0.0002916094,0.00017845031,0.0014349391,0.04747522,0.05950656,0.024027409,0.86138374],"study_design_scores_gemma":[0.000018071038,0.00018505889,0.00018055216,0.0005789856,0.000028571916,0.0010144463,0.00006870925,0.0012160187,0.022956582,0.015580727,0.9581413,0.000030903037],"about_ca_topic_score_codex":0.00047812954,"about_ca_topic_score_gemma":0.0010379307,"teacher_disagreement_score":0.009705405,"about_ca_system_score_codex":0.00090613915,"about_ca_system_score_gemma":0.0006595096,"threshold_uncertainty_score":0.032467782},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021998653,0.12793893,0.16972618,0.14439508,0.29377326,0.00038447152,0.0014179092,0.0022326899,0.23813285],"genre_scores_gemma":[0.2450166,0.113038905,0.06775275,0.037797134,0.14103562,0.0008291827,0.0016078771,0.0018565108,0.39106536],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.00010687131,0.000024189096,0.000086204425,0.00015133909,0.00007135716],"domain_scores_gemma":[0.999356,0.00025389376,0.000032836135,0.000032038068,0.00022567269,0.0000995322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007075469,0.0008115685,0.00045930306,0.00065204734,0.0006187547,0.0015444967,0.0011724879,0.0015972211,0.014208561],"category_scores_gemma":[0.0021644197,0.00024190282,0.0006478069,0.00050815917,0.0008848234,0.0015934183,0.0008538841,0.0026418387,0.0061817984],"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.00023707772,0.000059797203,0.000541097,0.00058969343,0.000053826087,0.00035302856,0.00014806587,0.0064070993,0.005048425,0.05635788,0.8334857,0.09671825],"study_design_scores_gemma":[0.000038657552,0.00014236741,0.00043268132,0.00021291095,0.00004388603,0.00045680255,0.00012116282,0.024636846,0.006010569,0.032879703,0.9349444,0.00008013018],"about_ca_topic_score_codex":0.0016236858,"about_ca_topic_score_gemma":0.0021680994,"teacher_disagreement_score":0.014208561,"about_ca_system_score_codex":0.0009741627,"about_ca_system_score_gemma":0.0006410351,"threshold_uncertainty_score":0.04753238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41243705,0.00083474425,0.5550763,0.0010591461,0.00017193581,0.00020287372,0.0029804313,0.0040905946,0.023146939],"genre_scores_gemma":[0.7013596,0.0004485707,0.28364545,0.00020044456,0.000089862115,0.00013608596,0.004659858,0.0011937089,0.008266383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986345,0.00012902058,0.00012014073,0.00048073917,0.00039846826,0.00023713232],"domain_scores_gemma":[0.9960193,0.0028202662,0.00024352127,0.00041794195,0.00029897664,0.00019999196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086301763,0.0009393373,0.0012070115,0.0012271333,0.0010330244,0.004631017,0.0017452212,0.0011416749,0.009025148],"category_scores_gemma":[0.0065120757,0.0011243605,0.0022124157,0.0020198182,0.002194472,0.010405741,0.002803392,0.0026442746,0.001467124],"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.0011491649,0.00044103566,0.0036457467,0.001927085,0.00022305288,0.000758456,0.003478247,0.052829508,0.04174568,0.7089381,0.011064499,0.17379943],"study_design_scores_gemma":[0.00006136534,0.00009408163,0.00051570183,0.000116313546,0.00009065085,0.0002817835,0.00091719994,0.043492433,0.018589592,0.9269551,0.008818526,0.000067381734],"about_ca_topic_score_codex":0.0012965809,"about_ca_topic_score_gemma":0.0029542502,"teacher_disagreement_score":0.009025148,"about_ca_system_score_codex":0.0011049802,"about_ca_system_score_gemma":0.0009173501,"threshold_uncertainty_score":0.030192137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02203863,0.01639498,0.5301301,0.0055879313,0.0033026037,0.00008321112,0.000249819,0.0014414234,0.4207712],"genre_scores_gemma":[0.4335951,0.031281006,0.2871826,0.0019959041,0.001823764,0.0002866559,0.0006234655,0.00097459985,0.24223693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985564,0.000025496323,0.0000074150717,0.000027322327,0.000061267754,0.000022835999],"domain_scores_gemma":[0.9998067,0.00009520842,0.000006084045,0.00004832992,0.00003075085,0.000012995558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026584827,0.00053006475,0.0005891004,0.0004265487,0.0007098006,0.0015032558,0.0010522377,0.0008339754,0.008135941],"category_scores_gemma":[0.0007304563,0.00028252442,0.0004921638,0.0008539806,0.0017532911,0.004587083,0.0009846822,0.0018885469,0.002737097],"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.000017903443,0.000009723802,0.000022313092,0.00006822391,0.0000056631416,0.000041029416,0.00007153726,0.0024071485,0.0016905332,0.946445,0.0068094884,0.042411406],"study_design_scores_gemma":[0.0000048223937,0.000008576587,0.000039562507,0.000036639445,0.00000517395,0.0000923915,0.000018610266,0.012534096,0.0025403402,0.93949455,0.045216225,0.000008927822],"about_ca_topic_score_codex":0.0005588316,"about_ca_topic_score_gemma":0.00049693725,"teacher_disagreement_score":0.008135941,"about_ca_system_score_codex":0.0007768391,"about_ca_system_score_gemma":0.00041948853,"threshold_uncertainty_score":0.027217448},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017539504,0.119312726,0.016862238,0.017286446,0.04091155,0.000116909665,0.0021516068,0.0008170204,0.8007875],"genre_scores_gemma":[0.01417147,0.07972947,0.0083973035,0.0025393222,0.023026284,0.00015320105,0.0016546078,0.0006828525,0.8696455],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995321,0.000052521453,0.000016929756,0.000108503955,0.00025552267,0.00003455779],"domain_scores_gemma":[0.99901354,0.00034055504,0.00005406193,0.00007915887,0.00033124688,0.00018148994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006157309,0.001636028,0.0011324438,0.0019227574,0.0011004133,0.0034536612,0.0007061132,0.0007942508,0.101658575],"category_scores_gemma":[0.0019309729,0.0005964945,0.000749839,0.00342854,0.0011286626,0.0032413874,0.0014704026,0.0033387518,0.035918523],"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.000020981717,0.000033763146,0.00016918629,0.00020926513,0.000011254216,0.00002471463,0.00006844367,0.0005519881,0.00038882182,0.041592028,0.90177035,0.055159133],"study_design_scores_gemma":[0.000004554972,0.000014572407,0.0007095596,0.00019066174,0.000009055689,0.000116865056,0.000048838847,0.00053141254,0.00016382002,0.023541253,0.9746617,0.0000078095745],"about_ca_topic_score_codex":0.0015790354,"about_ca_topic_score_gemma":0.0049917176,"teacher_disagreement_score":0.101658575,"about_ca_system_score_codex":0.002810153,"about_ca_system_score_gemma":0.0024537398,"threshold_uncertainty_score":0.3400818},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09830366,0.00066115125,0.89423794,0.0004329275,0.00015105055,0.00015592882,0.00009792474,0.00039896922,0.0055603944],"genre_scores_gemma":[0.8635657,0.000545759,0.13261357,0.00010346709,0.00006601156,0.00015591674,0.00008696541,0.00004202049,0.002820716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870276,0.0003485565,0.000051408704,0.00015035858,0.00059292425,0.00015397502],"domain_scores_gemma":[0.9977276,0.00095533096,0.00031877137,0.00064333243,0.00028139228,0.000073605835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000990681,0.00042852163,0.0005008887,0.00057314715,0.00065664685,0.0007099292,0.000800349,0.00077091844,0.0009909581],"category_scores_gemma":[0.0023593365,0.0002724542,0.00038657975,0.00061848346,0.0015998945,0.0014380716,0.0011545048,0.0010325345,0.00043970539],"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.0008535291,0.00014904632,0.0014381898,0.00045237088,0.000094782896,0.00075375015,0.0003966507,0.16769868,0.2396493,0.4843887,0.0018824831,0.10224249],"study_design_scores_gemma":[0.00013933115,0.00044838103,0.00065594376,0.00006103651,0.000078479614,0.001150405,0.000049222417,0.7394773,0.19734956,0.050833467,0.009624442,0.000132466],"about_ca_topic_score_codex":0.0004646234,"about_ca_topic_score_gemma":0.0005128938,"teacher_disagreement_score":0.0009909581,"about_ca_system_score_codex":0.00057439954,"about_ca_system_score_gemma":0.0011627825,"threshold_uncertainty_score":0.0052392483},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07856002,0.14475954,0.5899815,0.009712318,0.0061139325,0.00016041516,0.0018945263,0.0030869374,0.16573088],"genre_scores_gemma":[0.21030033,0.094194606,0.47916907,0.0014965195,0.0036353236,0.00024499773,0.005719243,0.0019063806,0.20333356],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997631,0.000046018944,0.000016695512,0.00006149124,0.000100072444,0.0000125897495],"domain_scores_gemma":[0.99916553,0.0005187352,0.00004037309,0.000114733186,0.000111994734,0.000048660193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007664239,0.00038450627,0.0003979474,0.0009939546,0.0003381151,0.0017155479,0.00070202356,0.00051999633,0.009490149],"category_scores_gemma":[0.0017197971,0.0004985774,0.00045590333,0.001495263,0.000892613,0.00138161,0.0004479448,0.0010524683,0.0027315551],"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.00012317054,0.000068047055,0.0029895555,0.00048341366,0.000061713465,0.00017023635,0.00020550097,0.023067942,0.025463145,0.12013022,0.02481325,0.8024238],"study_design_scores_gemma":[0.000043381635,0.00015061631,0.00550429,0.0006347289,0.000080431804,0.0007073896,0.0001733304,0.042139508,0.02487192,0.21664493,0.70896333,0.00008608704],"about_ca_topic_score_codex":0.0009065238,"about_ca_topic_score_gemma":0.0017842394,"teacher_disagreement_score":0.009490149,"about_ca_system_score_codex":0.0007114412,"about_ca_system_score_gemma":0.0004159545,"threshold_uncertainty_score":0.03174776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.552717,0.4205049,0.010044439,0.0019487137,0.00018782078,0.000029019664,0.0004111664,0.00006976895,0.014087165],"genre_scores_gemma":[0.88950837,0.09917503,0.0030696434,0.00039694124,0.00021792029,0.000013965551,0.00040344254,0.000024841498,0.0071899705],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997584,0.000060733604,0.000014644995,0.000059902457,0.000056895988,0.00004944987],"domain_scores_gemma":[0.99989104,0.000021492655,0.000025438037,0.000007808853,0.000028615923,0.000025674472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039682837,0.00032565618,0.00041275306,0.00079548394,0.00029511604,0.0010931023,0.0003140925,0.0005899843,0.0010130936],"category_scores_gemma":[0.0001648432,0.00018760806,0.00032658115,0.000610277,0.00059788814,0.00073503534,0.0003377121,0.0003073906,0.0003668096],"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.00075044663,0.00005400946,0.011549196,0.0009929223,0.000040502247,0.0014262442,0.0008278268,0.0005660653,0.92849946,0.004922082,0.000303651,0.05006758],"study_design_scores_gemma":[0.00009070457,0.002839434,0.33765393,0.0006627079,0.00047850652,0.01339554,0.004868542,0.009968996,0.37738383,0.00968333,0.24281895,0.00015547156],"about_ca_topic_score_codex":0.006402586,"about_ca_topic_score_gemma":0.0041267485,"teacher_disagreement_score":0.006402586,"about_ca_system_score_codex":0.0008682408,"about_ca_system_score_gemma":0.00049713906,"threshold_uncertainty_score":0.012730658},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016429232,0.0001465184,0.0017622346,0.00009895172,0.00006096669,0.00008009213,0.9915673,0.0034588552,0.0011822359],"genre_scores_gemma":[0.0013605149,0.000060675247,0.0025477635,0.00007150048,0.0000068943327,0.000306243,0.9949608,0.00028593538,0.0003997332],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985683,0.00019794269,0.00012054384,0.00043210093,0.00050128455,0.00017978802],"domain_scores_gemma":[0.9982673,0.0006072494,0.0001458789,0.00041353545,0.00041345682,0.00015253623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012700061,0.004064366,0.0027244373,0.0024578504,0.0016505679,0.0020440551,0.0049921745,0.0034433817,0.041673087],"category_scores_gemma":[0.0038967398,0.0009318658,0.0023788717,0.00415248,0.0007550821,0.0010771721,0.0017158182,0.003301418,0.04652193],"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.0004976368,0.0002745742,0.0020489045,0.0030853976,0.00022289669,0.00015301198,0.000052163177,0.0072281742,0.00904531,0.0023646369,0.9669804,0.008046941],"study_design_scores_gemma":[0.0016734301,0.0002739343,0.009875998,0.0005020843,0.0003052256,0.00033628123,0.00013199383,0.026043478,0.026261384,0.011345402,0.9230515,0.00019925306],"about_ca_topic_score_codex":0.010058444,"about_ca_topic_score_gemma":0.013572443,"teacher_disagreement_score":0.041673087,"about_ca_system_score_codex":0.0017123064,"about_ca_system_score_gemma":0.0032560441,"threshold_uncertainty_score":0.13941038},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016429232,0.0001465184,0.0017622346,0.00009895172,0.00006096669,0.00008009213,0.9915673,0.0034588552,0.0011822359],"genre_scores_gemma":[0.0013605149,0.000060675247,0.0025477635,0.00007150048,0.0000068943327,0.000306243,0.9949608,0.00028593538,0.0003997332],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985683,0.00019794269,0.00012054384,0.00043210093,0.00050128455,0.00017978802],"domain_scores_gemma":[0.9982673,0.0006072494,0.0001458789,0.00041353545,0.00041345682,0.00015253623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012700061,0.004064366,0.0027244373,0.0024578504,0.0016505679,0.0020440551,0.0049921745,0.0034433817,0.041673087],"category_scores_gemma":[0.0038967398,0.0009318658,0.0023788717,0.00415248,0.0007550821,0.0010771721,0.0017158182,0.003301418,0.04652193],"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.0004976368,0.0002745742,0.0020489045,0.0030853976,0.00022289669,0.00015301198,0.000052163177,0.0072281742,0.00904531,0.0023646369,0.9669804,0.008046941],"study_design_scores_gemma":[0.0016734301,0.0002739343,0.009875998,0.0005020843,0.0003052256,0.00033628123,0.00013199383,0.026043478,0.026261384,0.011345402,0.9230515,0.00019925306],"about_ca_topic_score_codex":0.010058444,"about_ca_topic_score_gemma":0.013572443,"teacher_disagreement_score":0.041673087,"about_ca_system_score_codex":0.0017123064,"about_ca_system_score_gemma":0.0032560441,"threshold_uncertainty_score":0.13941038},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026170157,0.048872445,0.049230922,0.016262691,0.014717422,0.00020572233,0.0028671334,0.0031422237,0.8620844],"genre_scores_gemma":[0.02558726,0.022735758,0.019634863,0.0022834723,0.0029658177,0.0002451506,0.0035031128,0.0021975734,0.92084706],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985806,0.00020198153,0.00005959328,0.00027002586,0.00070869236,0.00017918121],"domain_scores_gemma":[0.99922204,0.00022800568,0.000037517664,0.00015109268,0.0002472065,0.00011420573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015451293,0.0011444559,0.00070043403,0.0012998843,0.001972912,0.0054805665,0.00090959057,0.0015938288,0.0988236],"category_scores_gemma":[0.002488947,0.0007894484,0.0007382594,0.0019819923,0.0010747997,0.0067708,0.0021925557,0.0037771822,0.063236594],"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.00005892297,0.00004534676,0.00015302356,0.0002353231,0.000010610135,0.00005602686,0.00022659266,0.0006270748,0.0011416706,0.29013336,0.59712803,0.11018405],"study_design_scores_gemma":[0.000004550769,0.000015966423,0.00015689676,0.00012363214,0.0000034004433,0.00008253028,0.000052502888,0.00092574523,0.0008407547,0.033913516,0.96386904,0.0000116003885],"about_ca_topic_score_codex":0.0031557966,"about_ca_topic_score_gemma":0.0030579127,"teacher_disagreement_score":0.0988236,"about_ca_system_score_codex":0.0036221123,"about_ca_system_score_gemma":0.002636477,"threshold_uncertainty_score":0.33059788},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081283273,0.00071102544,0.24796031,0.0013969819,0.00093865785,0.002134808,0.12012748,0.6015125,0.024405377],"genre_scores_gemma":[0.0031335521,0.00075635005,0.28463402,0.0025940577,0.00032802377,0.008788918,0.18522646,0.46471193,0.04982672],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937443,0.0015542194,0.0012638872,0.0009987288,0.0019768758,0.00046193984],"domain_scores_gemma":[0.97704405,0.006550017,0.0016061544,0.005227824,0.007836855,0.0017350835],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007222865,0.004345868,0.0029218132,0.005229573,0.0017385903,0.004321593,0.007651734,0.0032900886,0.30269215],"category_scores_gemma":[0.03349806,0.004776412,0.0027285952,0.004197699,0.0013912985,0.0031438041,0.004457687,0.007096583,0.56426936],"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.00010489031,0.000038693226,0.00016588834,0.0007063017,0.000047048958,0.00009659078,0.0001009182,0.00044167123,0.0023390078,0.0017325,0.9679155,0.026310949],"study_design_scores_gemma":[0.0002875284,0.000073605195,0.0009793267,0.000510053,0.000055082026,0.00049637025,0.00005719704,0.0026526381,0.009839925,0.010681005,0.97421086,0.00015634377],"about_ca_topic_score_codex":0.0036300577,"about_ca_topic_score_gemma":0.005101679,"teacher_disagreement_score":0.9927771,"about_ca_system_score_codex":0.0013775483,"about_ca_system_score_gemma":0.004733131,"threshold_uncertainty_score":0.99462503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094399955,0.000057626617,0.000037814232,0.00004559614,0.000019809962,0.000004881195,0.9980718,0.00017219245,0.0014957618],"genre_scores_gemma":[0.00033121984,0.00006134839,0.00013708237,0.00003383759,0.000004406031,0.000028885474,0.9979475,0.000079957004,0.0013757607],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991411,0.00013246089,0.000094731455,0.00029813792,0.00019941268,0.0001341947],"domain_scores_gemma":[0.998816,0.00026348865,0.00015525208,0.0003128832,0.00028938512,0.00016299817],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071919226,0.0014249982,0.00091988925,0.002831369,0.0007924425,0.002524166,0.0017094852,0.0012967576,0.11709007],"category_scores_gemma":[0.003954074,0.00050149066,0.0007765882,0.0051985784,0.000401822,0.001557608,0.0018429294,0.0014689141,0.17267068],"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.00007036263,0.000008599778,0.00055992266,0.00055356004,0.000012889646,0.000021119584,0.000026679838,0.00008685155,0.00011258155,0.0008328454,0.9953479,0.0023667489],"study_design_scores_gemma":[0.0000555719,0.000005714922,0.0019439324,0.00015214937,0.000008081659,0.000029382973,0.000052087307,0.00006477686,0.00015338407,0.00044190412,0.99708384,0.000009191606],"about_ca_topic_score_codex":0.018346235,"about_ca_topic_score_gemma":0.033821736,"teacher_disagreement_score":0.88290995,"about_ca_system_score_codex":0.001304785,"about_ca_system_score_gemma":0.0023056737,"threshold_uncertainty_score":0.39170533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75060254,0.0049865665,0.0031149457,0.00047485472,0.00033762018,0.00033433808,0.0020485846,0.00063648965,0.23746403],"genre_scores_gemma":[0.9706873,0.0013877738,0.002744449,0.00039342084,0.00014974111,0.00007594933,0.000829216,0.000031353935,0.0237009],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99989784,0.000013633985,0.0000064408655,0.000033735076,0.000034155233,0.000014120537],"domain_scores_gemma":[0.99988294,0.00002084001,0.000042697924,0.000009134155,0.000021181522,0.000023151008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010204255,0.00051289645,0.00021878794,0.0010170393,0.0010819966,0.00021415876,0.0002726925,0.00020723675,0.01061724],"category_scores_gemma":[0.00017784872,0.00016177486,0.00011346146,0.000514253,0.0004264174,0.0004084409,0.0006295074,0.0002552986,0.003733309],"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.0013465066,0.00034553194,0.10540566,0.0008691868,0.00010506349,0.0025456909,0.0034819404,0.0006583201,0.07584802,0.0053386106,0.02641384,0.7776417],"study_design_scores_gemma":[0.00016033751,0.0007995242,0.77460855,0.00022873316,0.00014544754,0.0059886905,0.0022819382,0.0009404382,0.0066387234,0.002093735,0.2060676,0.000046293168],"about_ca_topic_score_codex":0.0060091554,"about_ca_topic_score_gemma":0.017988274,"teacher_disagreement_score":0.01061724,"about_ca_system_score_codex":0.00034946142,"about_ca_system_score_gemma":0.00021584815,"threshold_uncertainty_score":0.03551817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7826701,0.0006703702,0.18401434,0.000823895,0.00035934895,0.000534895,0.003950619,0.016663734,0.010312767],"genre_scores_gemma":[0.8934997,0.0001576948,0.09767278,0.00023995762,0.000040653427,0.00045743314,0.0010071071,0.00078401115,0.0061405753],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995024,0.000080449245,0.000019192436,0.00017500788,0.00016077816,0.00006216956],"domain_scores_gemma":[0.999577,0.0001112714,0.000047911533,0.00014398959,0.000053603184,0.00006622001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035491886,0.00042446036,0.00042152606,0.00061437767,0.0008328334,0.0006124583,0.0013320061,0.0007998862,0.012568438],"category_scores_gemma":[0.00045786708,0.00035769164,0.00019171846,0.000765122,0.0005786099,0.0005564515,0.001049848,0.0006367465,0.0029708233],"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.0005262393,0.00010525659,0.0007259083,0.00014717053,0.000034625762,0.000111766516,0.00012609619,0.0008135255,0.96805704,0.00388548,0.0036979844,0.021768883],"study_design_scores_gemma":[0.0001983662,0.0005921104,0.0021006183,0.000017738705,0.000026974234,0.0002726638,0.00004068826,0.01931741,0.9529959,0.0014012265,0.022957195,0.00007918368],"about_ca_topic_score_codex":0.00064343965,"about_ca_topic_score_gemma":0.0011707972,"teacher_disagreement_score":0.012568438,"about_ca_system_score_codex":0.0006340451,"about_ca_system_score_gemma":0.00057107455,"threshold_uncertainty_score":0.042045653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005870953,0.000060598653,0.000043380944,0.000038552032,0.00001587114,0.000006150878,0.9987658,0.0003470522,0.0006639833],"genre_scores_gemma":[0.00021529471,0.000050211496,0.00019989286,0.000054579275,0.0000065580975,0.000037992973,0.9986551,0.00012499292,0.0006553775],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835867,0.0002774866,0.00016097966,0.00065921014,0.00030276753,0.00024085728],"domain_scores_gemma":[0.99703133,0.00091361714,0.00026850254,0.0007419626,0.00065357506,0.0003910502],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014905921,0.0028941557,0.0026101153,0.004844637,0.0017941113,0.004538145,0.004134836,0.0036812343,0.22967091],"category_scores_gemma":[0.008386748,0.001146035,0.0013897404,0.008533774,0.00071313925,0.002345713,0.003303909,0.0019787617,0.31908795],"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.000119216,0.000021596421,0.00067194295,0.0011777569,0.000041927087,0.000023730749,0.00003493534,0.00016067481,0.00023124997,0.0005430515,0.9952335,0.0017405422],"study_design_scores_gemma":[0.0003713673,0.000028382961,0.0027063782,0.00031056104,0.000051695453,0.00006202501,0.00007330852,0.00019733948,0.00037630572,0.0010470597,0.9947432,0.00003239217],"about_ca_topic_score_codex":0.016082678,"about_ca_topic_score_gemma":0.029520381,"teacher_disagreement_score":0.7703291,"about_ca_system_score_codex":0.0016880159,"about_ca_system_score_gemma":0.0035510932,"threshold_uncertainty_score":0.76832575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018448256,0.00036871395,0.00025518524,0.0012687042,0.0021658912,0.000047325775,0.0023939377,0.00019446731,0.9914609],"genre_scores_gemma":[0.007364717,0.00026870478,0.00021462195,0.00024990353,0.0001243534,0.000019147552,0.0014541144,0.000119847864,0.99018466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997341,0.000025250054,0.000007190242,0.000049919876,0.000075487915,0.000108145985],"domain_scores_gemma":[0.99963,0.000014441631,0.000014140362,0.000028483524,0.00016017164,0.00015279515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024138326,0.0007230462,0.00023041134,0.0009527194,0.004578308,0.0016097265,0.000481593,0.00061555486,0.6162243],"category_scores_gemma":[0.0008366873,0.0002077432,0.00023419276,0.0010208299,0.00043302323,0.0011995392,0.0021528455,0.0015285108,0.31033477],"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.000030351892,0.0000111038335,0.00047379296,0.000035198776,0.0000014690597,0.00011730408,0.0005614453,0.000019184496,0.00019015708,0.0052088406,0.9580366,0.035314437],"study_design_scores_gemma":[0.0000017767732,0.0000047458307,0.00093255274,0.000030496049,5.653193e-7,0.000027082135,0.0005625941,0.000005660646,0.000029919696,0.00010137043,0.9983016,0.0000016287088],"about_ca_topic_score_codex":0.05944111,"about_ca_topic_score_gemma":0.19370621,"teacher_disagreement_score":0.6162243,"about_ca_system_score_codex":0.0010876672,"about_ca_system_score_gemma":0.0013284879,"threshold_uncertainty_score":0.5474094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9995128,0.00008919793,0.00022485624,0.000011856545,9.3591996e-7,0.0000026422724,0.000050631777,0.0000042232296,0.00010278394],"genre_scores_gemma":[0.99968386,0.000039463834,0.00016450245,0.000006104382,0.0000033102335,0.000003697336,0.000056665078,9.591189e-7,0.00004147687],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99993587,0.000012110414,0.0000064220835,0.000024116152,0.000010573171,0.000010886786],"domain_scores_gemma":[0.99987674,0.00003358391,0.00005757891,0.0000055272244,0.000007955992,0.000018623152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117477335,0.00025116955,0.0001886188,0.00046260332,0.00012004475,0.00016768952,0.00010784163,0.00024248216,0.0015720144],"category_scores_gemma":[0.00058505876,0.0000867837,0.00010686729,0.00018891359,0.00021541596,0.00017089803,0.00016427941,0.00010945639,0.000059572656],"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.0028397024,0.00017570039,0.7547562,0.0001346791,0.0003367544,0.009019221,0.0007422872,0.001015628,0.19642231,0.00038544225,0.00040381847,0.033768274],"study_design_scores_gemma":[0.000015945143,0.00019146249,0.99152184,0.0000039916386,0.000032947515,0.004828896,0.000091726215,0.00065408763,0.0023424083,0.00020934518,0.00010157301,0.0000058577402],"about_ca_topic_score_codex":0.0014065492,"about_ca_topic_score_gemma":0.0011271756,"teacher_disagreement_score":0.0015720144,"about_ca_system_score_codex":0.000120437915,"about_ca_system_score_gemma":0.0000938757,"threshold_uncertainty_score":0.005258918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50240004,0.0039115455,0.22152637,0.0025805258,0.001796899,0.0011195496,0.010708369,0.0129604945,0.24299625],"genre_scores_gemma":[0.7674341,0.0020089634,0.135735,0.0007416359,0.0003584932,0.0008744847,0.0051400093,0.0006963444,0.087010905],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994479,0.000054561122,0.000015119956,0.0001243797,0.00025868477,0.00009933064],"domain_scores_gemma":[0.9996136,0.000046815334,0.000049456805,0.00015410237,0.00006776919,0.00006832573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006198348,0.00037580705,0.00040416638,0.0005145565,0.00091495714,0.00057694217,0.0012648616,0.000556915,0.012897129],"category_scores_gemma":[0.00035276517,0.00033175177,0.00020104481,0.0006367077,0.00049540773,0.0007758163,0.0017154246,0.0013539484,0.0041143056],"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.00084673736,0.00007814527,0.0019563586,0.00030992707,0.000032094158,0.0002692218,0.00032956048,0.0008424563,0.83847326,0.083719864,0.015799461,0.05734302],"study_design_scores_gemma":[0.0002190744,0.0008772876,0.006913681,0.00007280676,0.000057414847,0.0014341172,0.00010425457,0.0062920973,0.60739064,0.0062517435,0.3703053,0.00008162364],"about_ca_topic_score_codex":0.0003948665,"about_ca_topic_score_gemma":0.0003354304,"teacher_disagreement_score":0.012897129,"about_ca_system_score_codex":0.0004899853,"about_ca_system_score_gemma":0.0008347402,"threshold_uncertainty_score":0.04314524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007744349,0.000036205434,0.00023695886,0.00012532776,0.000026121155,0.00011573579,0.99809057,0.00009436221,0.0005002639],"genre_scores_gemma":[0.041557368,0.00036758036,0.00683674,0.0012927321,0.00032017616,0.006652724,0.9281781,0.0006137497,0.0141809285],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9989454,0.00019080564,0.00024331582,0.00029050716,0.00016996359,0.00016005903],"domain_scores_gemma":[0.9773885,0.015950162,0.0024275132,0.0016284571,0.0020023661,0.0006028364],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001669728,0.0012077822,0.0014690267,0.0018501916,0.0012661779,0.0015979185,0.0019146823,0.0014785187,0.78959095],"category_scores_gemma":[0.034545083,0.0006504541,0.0015207821,0.0037640815,0.00029123397,0.0015441468,0.00090758386,0.001061801,0.061537176],"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.0017328088,0.0002644218,0.021780064,0.008215008,0.00041470476,0.00026094745,0.00017024539,0.00072180986,0.0002976532,0.00094471377,0.9507891,0.014408496],"study_design_scores_gemma":[0.03225128,0.0020523616,0.3623234,0.01850888,0.0024343592,0.0039889044,0.0016944382,0.0065239407,0.0022206998,0.01870065,0.5486657,0.00063542364],"about_ca_topic_score_codex":0.008792101,"about_ca_topic_score_gemma":0.013605788,"teacher_disagreement_score":0.78959095,"about_ca_system_score_codex":0.0009237622,"about_ca_system_score_gemma":0.0017198945,"threshold_uncertainty_score":0.30012292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006564998,0.000032307227,0.0000648461,0.00006063298,0.0000171086,0.000012528693,0.9988219,0.00012307259,0.0002111068],"genre_scores_gemma":[0.0035666144,0.000041991014,0.00055976486,0.00007328792,0.0000126238465,0.00024930568,0.99435836,0.00007813267,0.0010599772],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882585,0.00022072175,0.00017946023,0.00041082693,0.00022536398,0.0001377093],"domain_scores_gemma":[0.99305785,0.0020594546,0.0009618158,0.0020218096,0.0013742654,0.0005247003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026272573,0.0014304135,0.0013725719,0.001864029,0.000875027,0.0017135174,0.0031131166,0.0021294774,0.04711455],"category_scores_gemma":[0.016807066,0.00079145643,0.0012382217,0.003916801,0.00046482918,0.00070927286,0.0012811042,0.0013634436,0.027749738],"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.00037534337,0.0000788372,0.011503381,0.001329028,0.00027412665,0.00005332103,0.00009102161,0.0009748835,0.00032902512,0.00046288117,0.9807138,0.003814231],"study_design_scores_gemma":[0.003551313,0.00012740878,0.09779196,0.000732055,0.0005535968,0.00018735236,0.0002863872,0.0025479775,0.0009160816,0.0027532622,0.8904243,0.00012834134],"about_ca_topic_score_codex":0.0530114,"about_ca_topic_score_gemma":0.07920791,"teacher_disagreement_score":0.0530114,"about_ca_system_score_codex":0.0012571878,"about_ca_system_score_gemma":0.0028455036,"threshold_uncertainty_score":0.15761387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9995141,0.00019696834,0.000032111417,0.000014029442,0.0000024980473,0.0000028920927,0.00011345316,0.0000015499593,0.00012241758],"genre_scores_gemma":[0.9995728,0.000063167914,0.00007223172,0.000012019277,0.000006805525,0.0000031706152,0.00013330323,4.983444e-7,0.00013596338],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998115,0.00003674601,0.000025847883,0.000051655777,0.000035651068,0.000038614704],"domain_scores_gemma":[0.9993181,0.00009586748,0.0003792012,0.00003562186,0.00008438712,0.000086884036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028625442,0.0003114372,0.0002908627,0.0005074418,0.00022558082,0.00041105188,0.00017661693,0.00029556095,0.0010109469],"category_scores_gemma":[0.0014244622,0.00012220466,0.00023109339,0.0004058176,0.000121691846,0.0002375141,0.00024079526,0.00029446092,0.00017390825],"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.00034629868,0.00004679035,0.9971439,0.000011659565,0.000053345117,0.0001238126,0.000046453817,0.00002161787,0.0009952484,0.000010577367,0.00003725247,0.0011630324],"study_design_scores_gemma":[0.0000053832455,0.00013189972,0.9990338,0.0000025248,0.000023697941,0.00033413194,0.000068799374,0.00012244968,0.0001833193,0.000024596015,0.000067149376,0.0000022532577],"about_ca_topic_score_codex":0.0015086756,"about_ca_topic_score_gemma":0.0015939114,"teacher_disagreement_score":0.0015086756,"about_ca_system_score_codex":0.00015180024,"about_ca_system_score_gemma":0.00017181825,"threshold_uncertainty_score":0.0033819675},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85891616,0.0022401763,0.00058379216,0.0011621355,0.00008841263,0.00008099855,0.017251752,0.00028550506,0.11939115],"genre_scores_gemma":[0.75802946,0.001910638,0.0012265561,0.0004915922,0.000016159876,0.00005805774,0.007124287,0.00010222866,0.23104098],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996762,0.000024072027,0.000017737755,0.000059368977,0.00009982907,0.00012271378],"domain_scores_gemma":[0.99905413,0.00007767798,0.00007400092,0.00006095992,0.0004512377,0.00028198602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002636593,0.00024550615,0.00020807743,0.0018833114,0.003123714,0.0010271912,0.000817745,0.00040198732,0.013658974],"category_scores_gemma":[0.00091043767,0.00019782397,0.00012884435,0.004671335,0.0005880559,0.00040457517,0.0012642419,0.00044117236,0.0014250138],"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.00047300043,0.00013593872,0.5058945,0.0006004428,0.00011383395,0.0030548715,0.010092779,0.001597032,0.0030953148,0.00399666,0.11965372,0.3512919],"study_design_scores_gemma":[0.000011004782,0.00001305688,0.9243784,0.00013151989,0.00001973396,0.0001675775,0.006846384,0.0006732233,0.00038527406,0.00022623964,0.06712297,0.000024678486],"about_ca_topic_score_codex":0.98390085,"about_ca_topic_score_gemma":0.9968081,"teacher_disagreement_score":0.016099155,"about_ca_system_score_codex":0.008659625,"about_ca_system_score_gemma":0.011595515,"threshold_uncertainty_score":0.06283033},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003566903,0.01601143,0.0025731677,0.036974695,0.117822856,0.00017397206,0.0026196484,0.0022659115,0.8179914],"genre_scores_gemma":[0.0037724846,0.0023475569,0.0005786319,0.0010721533,0.003927107,0.000025669815,0.00037807052,0.00056850584,0.98732984],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978551,0.00021093023,0.000092388815,0.00035379373,0.0012358293,0.00025186365],"domain_scores_gemma":[0.9956388,0.00037133475,0.00015156128,0.00045259017,0.0018688184,0.0015169852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017532746,0.0009069938,0.0006784254,0.0038834247,0.0053643724,0.009924056,0.0007703486,0.0019579737,0.26250064],"category_scores_gemma":[0.0066922833,0.00057533896,0.00041128727,0.0026765843,0.0018400844,0.0050852406,0.0047264555,0.0027210242,0.13788697],"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.000024813187,0.00001076588,0.00014420696,0.000041119332,0.000001911292,0.00009359817,0.00014251306,0.00002071962,0.00015834262,0.010551686,0.95359194,0.035218354],"study_design_scores_gemma":[9.2933595e-7,0.000003099675,0.00011374861,0.000019388624,3.9759394e-7,0.0000350926,0.00003331521,0.0000061904675,0.00005495542,0.00032803882,0.9994017,0.0000030826916],"about_ca_topic_score_codex":0.009712493,"about_ca_topic_score_gemma":0.025251137,"teacher_disagreement_score":0.9902875,"about_ca_system_score_codex":0.004142174,"about_ca_system_score_gemma":0.00595812,"threshold_uncertainty_score":0.87815213},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004300501,0.0064104055,0.0007439587,0.024011945,0.026158124,0.00042289897,0.099039614,0.0015931078,0.8373194],"genre_scores_gemma":[0.0031966956,0.00088075077,0.00021433056,0.0005289234,0.00028279115,0.000039320214,0.0064959647,0.0001459951,0.9882152],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979742,0.000089466856,0.00008242702,0.00014572097,0.0011287894,0.000579376],"domain_scores_gemma":[0.99264514,0.00020264811,0.00019969461,0.0004225669,0.0042362586,0.0022935933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018606925,0.0007914135,0.0010596804,0.0040493887,0.0059883003,0.010574918,0.0019025982,0.0028626104,0.28206334],"category_scores_gemma":[0.005900246,0.00061299524,0.0005607559,0.0068131885,0.0010391354,0.0016896694,0.0020041123,0.0028155057,0.12382955],"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.00004084774,0.000011603265,0.00028911448,0.000049296315,0.0000021649748,0.000022286078,0.000032643275,0.000048401977,0.00007913333,0.001732326,0.98794776,0.009744497],"study_design_scores_gemma":[0.00000475761,0.0000042011193,0.0031362372,0.000041992713,0.0000022624686,0.000008225534,0.00009290192,0.000040945535,0.00008275029,0.00021637374,0.99635977,0.000009501687],"about_ca_topic_score_codex":0.7822066,"about_ca_topic_score_gemma":0.89244515,"teacher_disagreement_score":0.28206334,"about_ca_system_score_codex":0.02264359,"about_ca_system_score_gemma":0.04732719,"threshold_uncertainty_score":0.9435959},"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":"other","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03268485,0.00078460854,0.023345217,0.02484765,0.00509135,0.03462146,0.2615549,0.024836859,0.5922331],"genre_scores_gemma":[0.09024853,0.00216455,0.07705785,0.020187203,0.0014961881,0.10018168,0.13940044,0.0034479473,0.5658156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987563,0.0004953024,0.00009573448,0.00013174694,0.00025581155,0.00026501744],"domain_scores_gemma":[0.99413884,0.002310431,0.00024335815,0.00067277206,0.0012407273,0.0013940268],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030652566,0.00064493367,0.0004685299,0.001020934,0.001195602,0.0011910808,0.0014780964,0.0011840392,0.62085336],"category_scores_gemma":[0.011558242,0.00051547104,0.0005116106,0.0010922342,0.00039622487,0.0019477125,0.0034561125,0.0017838106,0.22667743],"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.00015110994,0.00037114968,0.0004853145,0.00050517236,0.0000025486006,0.00003251487,0.00021809901,0.00015352252,0.00015503,0.000711998,0.8715118,0.12570187],"study_design_scores_gemma":[0.00032991706,0.0003197904,0.0073956507,0.0005816111,0.000005281364,0.00004463256,0.0008225183,0.00027227594,0.0005067615,0.0022970208,0.98739725,0.0000272421],"about_ca_topic_score_codex":0.003183314,"about_ca_topic_score_gemma":0.0068883295,"teacher_disagreement_score":0.62085336,"about_ca_system_score_codex":0.0013280205,"about_ca_system_score_gemma":0.0042370623,"threshold_uncertainty_score":0.54080665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077364486,0.000028976872,0.000042387714,0.000042908356,0.00001849844,0.0000071049967,0.99844605,0.0005341096,0.0008026461],"genre_scores_gemma":[0.0003084763,0.000033865424,0.00013186266,0.000045470195,0.0000067157375,0.000036311096,0.9982741,0.0001499872,0.0010132472],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901915,0.0001348981,0.000095631,0.00032683113,0.00021689168,0.00020666698],"domain_scores_gemma":[0.9980805,0.00043988426,0.0001435734,0.0005989967,0.0004137622,0.0003231536],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010766945,0.002087884,0.001346967,0.003559873,0.0008218298,0.0033758504,0.0025829107,0.001622464,0.2374447],"category_scores_gemma":[0.004908903,0.00081620435,0.0011911892,0.004938233,0.0005211828,0.0014419189,0.0024793749,0.0013904314,0.27506828],"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.00006819855,0.000013490987,0.0002996021,0.00032589678,0.000016167322,0.000012027913,0.000009025085,0.00010214769,0.000116528565,0.0003415001,0.99729425,0.0014011668],"study_design_scores_gemma":[0.00032759632,0.000022637409,0.0026217145,0.000119734876,0.000023723123,0.000046057427,0.000049197286,0.00029535353,0.0006189515,0.00081742747,0.99503326,0.000024330813],"about_ca_topic_score_codex":0.014975582,"about_ca_topic_score_gemma":0.01830765,"teacher_disagreement_score":0.7625553,"about_ca_system_score_codex":0.0013833651,"about_ca_system_score_gemma":0.0021557608,"threshold_uncertainty_score":0.79433167},"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":"other","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068980284,0.051157355,0.016270665,0.14082228,0.010796803,0.00019285065,0.040142592,0.0017263857,0.6699108],"genre_scores_gemma":[0.2849583,0.04901558,0.014873657,0.01052566,0.0029985786,0.0003119237,0.036581047,0.0016109035,0.59912443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946885,0.0013912359,0.00037881042,0.00065945386,0.002540206,0.00034165764],"domain_scores_gemma":[0.97540164,0.012116537,0.0023308452,0.001488014,0.007792626,0.00087027246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031601184,0.00039394514,0.00048959826,0.010200525,0.0053429725,0.008639627,0.0008904066,0.0017505093,0.035899777],"category_scores_gemma":[0.032396354,0.00036931792,0.00024668896,0.031416807,0.0029364328,0.0067902952,0.0028102347,0.0019270502,0.010880413],"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.00014505888,0.000024935955,0.007845467,0.00097415835,0.00002675189,0.00078553637,0.021953953,0.0004382873,0.0014669244,0.31531626,0.52176404,0.12925869],"study_design_scores_gemma":[0.000004490041,0.0000047439266,0.0022625187,0.00025575925,0.000005550053,0.000095808246,0.0013930249,0.00006593727,0.00036181626,0.0044232244,0.9911083,0.0000188025],"about_ca_topic_score_codex":0.09960869,"about_ca_topic_score_gemma":0.12559958,"teacher_disagreement_score":0.09960869,"about_ca_system_score_codex":0.006625993,"about_ca_system_score_gemma":0.010554018,"threshold_uncertainty_score":0.19805783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007600157,0.00035709108,0.0012945402,0.00581506,0.0033715602,0.0015567042,0.1443231,0.0040297494,0.8384923],"genre_scores_gemma":[0.0018551723,0.0003825348,0.00070746266,0.002203369,0.00063805346,0.0008576495,0.04706609,0.0011653559,0.9451243],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812716,0.00024231678,0.00015446855,0.00028929036,0.0009273046,0.0002595238],"domain_scores_gemma":[0.98930526,0.0021153567,0.0003069915,0.0012816406,0.0055585485,0.0014321445],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021262264,0.00087238423,0.0011431446,0.0036061548,0.0028580544,0.0031412109,0.0018257145,0.0020224613,0.9324514],"category_scores_gemma":[0.013701698,0.0006701787,0.00047681283,0.00469012,0.00038881743,0.0023412292,0.0019197591,0.0017142833,0.85559773],"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.000015237368,0.000010916586,0.00006880866,0.000030805728,3.291933e-7,0.000011799828,0.000014296637,0.0000054402417,0.000024703364,0.0002856618,0.9911322,0.008399821],"study_design_scores_gemma":[0.000014627321,0.000011542277,0.000618205,0.00004199393,8.5910364e-7,0.000030273186,0.00007475006,0.000018766348,0.000045333232,0.0002640372,0.9988758,0.0000037706914],"about_ca_topic_score_codex":0.00925452,"about_ca_topic_score_gemma":0.010721914,"teacher_disagreement_score":0.9324514,"about_ca_system_score_codex":0.0021011003,"about_ca_system_score_gemma":0.004121791,"threshold_uncertainty_score":0.096349835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003750663,0.000027768396,0.00004003854,0.000030437848,0.000010260246,0.000005420477,0.9989968,0.0003929542,0.00045885897],"genre_scores_gemma":[0.0001419852,0.000031154843,0.00018316429,0.00004148229,0.000002807805,0.00003746873,0.9991148,0.00012269587,0.00032430948],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890804,0.00014566035,0.00013590859,0.0003927762,0.00024224308,0.00017539706],"domain_scores_gemma":[0.9976343,0.0006552994,0.00020594402,0.00059288274,0.0006061523,0.0003053229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010400603,0.0022076871,0.0017037067,0.0046642614,0.000999844,0.00255263,0.003059589,0.0021889275,0.14636742],"category_scores_gemma":[0.006378434,0.0009051274,0.0011823823,0.008993606,0.00044836005,0.002209404,0.0026033623,0.001998964,0.20434308],"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.000035709196,0.000011297848,0.00036762052,0.000580417,0.000017927769,0.000014514377,0.000017554208,0.00014711771,0.00011684945,0.0003277449,0.9969638,0.0013994735],"study_design_scores_gemma":[0.00010896406,0.000010312315,0.0018628173,0.00022609596,0.000018077699,0.000038191483,0.0000613024,0.00023707922,0.00023280965,0.00092290796,0.9962613,0.000020108902],"about_ca_topic_score_codex":0.023707911,"about_ca_topic_score_gemma":0.042273585,"teacher_disagreement_score":0.14636742,"about_ca_system_score_codex":0.0017928735,"about_ca_system_score_gemma":0.0024475965,"threshold_uncertainty_score":0.4896478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028872531,0.000025495548,0.000047134843,0.000036392325,0.000011141134,0.0000064149094,0.9985598,0.000534545,0.00075031834],"genre_scores_gemma":[0.00012621748,0.000037463054,0.00022687337,0.000049506347,0.0000033172246,0.000050118917,0.9987978,0.00021176954,0.00049695064],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989491,0.0001264302,0.00013315426,0.0003727243,0.00023658868,0.0001820503],"domain_scores_gemma":[0.9976012,0.0006148627,0.00019027668,0.0006318618,0.00067722064,0.00028447804],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001051699,0.002415512,0.002033275,0.005368732,0.0012721095,0.0032149253,0.003593799,0.0025337986,0.19445015],"category_scores_gemma":[0.0069310265,0.001189762,0.0013560266,0.00992044,0.000496816,0.003051491,0.0030827688,0.0024527072,0.29458264],"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.000032274726,0.0000108525555,0.0002802856,0.00053155626,0.0000128408265,0.000014859085,0.000019502973,0.00009722951,0.00008683638,0.00035591918,0.99699616,0.0015617252],"study_design_scores_gemma":[0.00007315673,0.0000065850413,0.0011862846,0.00019658693,0.000011813283,0.000034146604,0.000057999365,0.00015616669,0.00016758841,0.00078977324,0.9973037,0.00001616581],"about_ca_topic_score_codex":0.020563686,"about_ca_topic_score_gemma":0.0314065,"teacher_disagreement_score":0.80554986,"about_ca_system_score_codex":0.0021024144,"about_ca_system_score_gemma":0.0026580011,"threshold_uncertainty_score":0.65050054},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032870646,0.001746079,0.6373719,0.010802057,0.007958964,0.00040522337,0.006962695,0.22202012,0.10944599],"genre_scores_gemma":[0.06472997,0.0031350935,0.29892096,0.005744102,0.005197486,0.0010677672,0.014405148,0.35464913,0.25215036],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99119616,0.002704774,0.00058548397,0.001631914,0.0030605367,0.0008210829],"domain_scores_gemma":[0.98905736,0.0033021988,0.00037055791,0.0036361204,0.0027845437,0.00084922893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010249739,0.0020401157,0.0014552895,0.0016597923,0.0023237616,0.010052535,0.0040469393,0.0031890753,0.19001864],"category_scores_gemma":[0.02672278,0.0013619647,0.0015409654,0.0024632954,0.003000629,0.009804779,0.0059829694,0.005990912,0.19673291],"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.00093780813,0.00007409492,0.000744132,0.0005007399,0.000043768065,0.00030957896,0.0009103229,0.00078473537,0.0046713566,0.107146084,0.63456404,0.24931331],"study_design_scores_gemma":[0.00006240843,0.000033564433,0.000336635,0.00012921392,0.000011703652,0.00029622103,0.000093160495,0.003196854,0.0060406066,0.013532414,0.9762039,0.000063221574],"about_ca_topic_score_codex":0.007784462,"about_ca_topic_score_gemma":0.0036300418,"teacher_disagreement_score":0.19001864,"about_ca_system_score_codex":0.0020728991,"about_ca_system_score_gemma":0.004164743,"threshold_uncertainty_score":0.63567567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012633558,0.0015425408,0.012863668,0.003322637,0.006231974,0.001389265,0.0048257257,0.03872156,0.9298394],"genre_scores_gemma":[0.00487863,0.002010619,0.014039644,0.00290421,0.00175613,0.00055383856,0.0054803723,0.016894247,0.95148236],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986467,0.00007009951,0.00007776295,0.00009441641,0.0009994835,0.00011155314],"domain_scores_gemma":[0.9957594,0.0007238891,0.00013972085,0.00054173946,0.002035453,0.00079986517],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008376988,0.0012244589,0.00091241027,0.0033749796,0.0014546397,0.007585461,0.001473567,0.001837444,0.7704186],"category_scores_gemma":[0.009663027,0.0009385451,0.0008721664,0.0019598326,0.0004400675,0.0052521406,0.0029123821,0.0026277294,0.72872585],"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.000016895225,0.000046991416,0.00006034921,0.00011853105,0.0000028064926,0.00007855372,0.00003930277,0.00009301382,0.0006213447,0.0008927483,0.91022223,0.08780723],"study_design_scores_gemma":[0.000010736989,0.00002359149,0.00037220374,0.00007407773,0.0000021012493,0.00017974428,0.00006997885,0.000106188185,0.00041455837,0.00063699577,0.99808925,0.000020577765],"about_ca_topic_score_codex":0.0015709656,"about_ca_topic_score_gemma":0.0023991845,"teacher_disagreement_score":0.22958142,"about_ca_system_score_codex":0.00052425294,"about_ca_system_score_gemma":0.0008428109,"threshold_uncertainty_score":0.32747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031978718,0.0010080094,0.0013384656,0.0005504001,0.001340491,0.00016096787,0.0031708716,0.0049155653,0.9871954],"genre_scores_gemma":[0.0009819766,0.00047442876,0.00046504042,0.00019598223,0.00015827698,0.00004906906,0.0013014909,0.0011739873,0.9951998],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991436,0.000051334173,0.000040719664,0.00015187709,0.00049568445,0.00011669923],"domain_scores_gemma":[0.9979424,0.0002702058,0.000084502724,0.00031551812,0.0009937432,0.00039369418],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006426898,0.0017413335,0.001266647,0.00295033,0.0019464375,0.0057868464,0.0017838208,0.0021363106,0.9383463],"category_scores_gemma":[0.0035974225,0.0009997964,0.00068650045,0.0022699232,0.0007557008,0.0053663366,0.0027120938,0.0018413487,0.90774137],"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.00005359024,0.000029771305,0.00004741615,0.00015098108,0.0000018640598,0.000053394855,0.00003303942,0.000063077445,0.00040930707,0.0021600258,0.9234714,0.07352612],"study_design_scores_gemma":[0.000008564879,0.000014817186,0.00013916437,0.00005878727,0.0000014928877,0.00007332657,0.00003780725,0.00003977977,0.00020119813,0.00047258436,0.99894637,0.0000061618075],"about_ca_topic_score_codex":0.004744227,"about_ca_topic_score_gemma":0.008564398,"teacher_disagreement_score":0.061653674,"about_ca_system_score_codex":0.0015305381,"about_ca_system_score_gemma":0.0017168934,"threshold_uncertainty_score":0.08794147},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082009725,0.0015637543,0.6111287,0.0008666841,0.00019989254,0.00060156465,0.089013055,0.21062715,0.0039894986],"genre_scores_gemma":[0.276479,0.0008593585,0.5090959,0.0003185017,0.00010018368,0.000940451,0.20440236,0.0055552847,0.0022489165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807525,0.00053039455,0.00015341172,0.00058068323,0.00049571344,0.0001645739],"domain_scores_gemma":[0.99489355,0.0023886424,0.00028384043,0.0016928315,0.00060048007,0.00014068082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017249731,0.0027938625,0.001017789,0.0035259458,0.0005880068,0.002253619,0.003302281,0.0012959784,0.0026431673],"category_scores_gemma":[0.011402062,0.00089437363,0.0021530176,0.0026540186,0.00064883806,0.0032443102,0.0021735788,0.0020006772,0.0030821108],"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.0015692059,0.0012781618,0.032904834,0.0033467324,0.00070987793,0.00082302914,0.00091482187,0.3226263,0.02392548,0.020600736,0.20352149,0.38777936],"study_design_scores_gemma":[0.0000947537,0.00009069337,0.0017851928,0.000070272545,0.000049769762,0.00010067258,0.00008633752,0.95770305,0.0057776347,0.019249326,0.014959193,0.00003307751],"about_ca_topic_score_codex":0.009128393,"about_ca_topic_score_gemma":0.015932964,"teacher_disagreement_score":0.009128393,"about_ca_system_score_codex":0.0010744286,"about_ca_system_score_gemma":0.0023502423,"threshold_uncertainty_score":0.018150508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091918354,0.00208947,0.014841995,0.0012644252,0.003875314,0.000588133,0.0058393017,0.01239219,0.95819],"genre_scores_gemma":[0.0016394462,0.00083271606,0.0027613163,0.00040445113,0.00023749874,0.00012640003,0.001890975,0.0027747382,0.98933244],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989945,0.000045257664,0.00004410282,0.00014314274,0.00067468174,0.00009841181],"domain_scores_gemma":[0.997242,0.0004513469,0.00008240253,0.0003522921,0.001407052,0.00046498523],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009009002,0.0018561302,0.0013260406,0.0032922204,0.0019224423,0.0049416935,0.0023006706,0.002341687,0.88596666],"category_scores_gemma":[0.0045038494,0.0012687698,0.0011780766,0.0022702115,0.0006672846,0.0048017935,0.0025345627,0.0031030288,0.8483315],"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.00012456339,0.00006221708,0.000053689488,0.00047739537,0.00000604526,0.0001243513,0.000064723354,0.00012148483,0.0067599826,0.0033536982,0.85318094,0.13567095],"study_design_scores_gemma":[0.000013963444,0.000028090373,0.00012348536,0.00004207597,0.0000031016368,0.00014522905,0.000029041044,0.00008388165,0.0017765629,0.00049482804,0.99724764,0.00001203924],"about_ca_topic_score_codex":0.0018774066,"about_ca_topic_score_gemma":0.0044229636,"teacher_disagreement_score":0.11403334,"about_ca_system_score_codex":0.0010937705,"about_ca_system_score_gemma":0.0016893486,"threshold_uncertainty_score":0.16265464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021710801,0.00027348744,0.00045011638,0.0007521565,0.0016882432,0.00013869547,0.0033553569,0.0018722762,0.9912526],"genre_scores_gemma":[0.0006410292,0.0001681685,0.00019577667,0.00031218855,0.0002124159,0.00005516087,0.0011665073,0.00097148697,0.9962773],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900347,0.00007980274,0.000046169458,0.00012751602,0.0005747244,0.00016832148],"domain_scores_gemma":[0.9980281,0.00024722543,0.00008074865,0.0002637299,0.000905482,0.00047466808],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00089211477,0.0011566111,0.0008890769,0.0022745458,0.003130224,0.0059878835,0.0012362577,0.0017876738,0.9274065],"category_scores_gemma":[0.004235222,0.00077838707,0.0007367079,0.0018871257,0.00051702105,0.0039535463,0.0043357154,0.0023863283,0.8885105],"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.000014044393,0.000011978429,0.000031961245,0.000033292363,7.57395e-7,0.000013868479,0.000024047422,0.000010116713,0.000084374435,0.0012139055,0.9814031,0.01715848],"study_design_scores_gemma":[0.0000040315394,0.0000051863985,0.00013627972,0.000027656293,6.712751e-7,0.000015721815,0.00003286541,0.000010606448,0.00007331729,0.0002107242,0.99947923,0.0000036406886],"about_ca_topic_score_codex":0.0055327713,"about_ca_topic_score_gemma":0.012333776,"teacher_disagreement_score":0.07259351,"about_ca_system_score_codex":0.0016386759,"about_ca_system_score_gemma":0.0014067254,"threshold_uncertainty_score":0.103545845},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054761925,0.0003121154,0.00054155296,0.00077515637,0.0012595741,0.00012380959,0.0041343705,0.0026004098,0.9897054],"genre_scores_gemma":[0.0015552456,0.0003751067,0.00047017186,0.00036006156,0.00012469041,0.00004849371,0.0016188074,0.001464107,0.9939833],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997998,0.000012782016,0.0000047680164,0.000032004617,0.00009248857,0.00005821355],"domain_scores_gemma":[0.9994382,0.000039226292,0.000012791939,0.000050516395,0.00021745829,0.00024187265],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029443536,0.00066791766,0.00034958855,0.0006340043,0.0019170118,0.0029689274,0.0006725589,0.0009844946,0.8885762],"category_scores_gemma":[0.0010646634,0.00036129475,0.00049241184,0.00058859645,0.0003435465,0.0020582813,0.0020952127,0.001132883,0.71855396],"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.000020846504,0.000010011624,0.00004967331,0.00007221009,0.0000013146453,0.000018028024,0.00007637161,0.000008602096,0.00034936724,0.0006264001,0.9760835,0.022683686],"study_design_scores_gemma":[0.0000049653177,0.000006486422,0.00043815453,0.000048892027,0.000001867206,0.000025893238,0.000107143984,0.000013284635,0.00018948947,0.00009249434,0.99906725,0.00000410576],"about_ca_topic_score_codex":0.02019211,"about_ca_topic_score_gemma":0.07533763,"teacher_disagreement_score":0.11142379,"about_ca_system_score_codex":0.0010130907,"about_ca_system_score_gemma":0.001010118,"threshold_uncertainty_score":0.1589325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040485,0.000037512524,0.000020408395,0.00009131644,0.00001951858,0.000013220126,0.99910516,0.00004905866,0.0006233405],"genre_scores_gemma":[0.000573481,0.00020230308,0.00034491488,0.000117446936,0.0000131330335,0.00012533259,0.9957818,0.00009092082,0.0027507525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99613756,0.00028067257,0.00047474224,0.0005099547,0.0017200273,0.0008769374],"domain_scores_gemma":[0.96713823,0.0012152235,0.0010645039,0.001061474,0.027972762,0.0015477322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023537378,0.002476822,0.002793634,0.008028739,0.0031229316,0.004673677,0.0054884963,0.0015210529,0.08694385],"category_scores_gemma":[0.019118197,0.0018484639,0.0021793926,0.0391091,0.00058532343,0.0024799777,0.002434609,0.0032940751,0.055739384],"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.000023677649,0.000005621688,0.0009597299,0.00024493565,0.000018761366,0.000005942773,0.00002099647,0.00009216974,0.000007929363,0.00032495928,0.9967686,0.0015266665],"study_design_scores_gemma":[0.00016746939,0.000011948055,0.024279824,0.0009875005,0.0000666718,0.000026692927,0.00041115258,0.000428401,0.0001567456,0.00074399717,0.97262955,0.000090108486],"about_ca_topic_score_codex":0.9921795,"about_ca_topic_score_gemma":0.9899663,"teacher_disagreement_score":0.08694385,"about_ca_system_score_codex":0.046625815,"about_ca_system_score_gemma":0.112762935,"threshold_uncertainty_score":0.33829558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99377406,0.0006157735,0.0015235032,0.0011339464,0.000016207634,0.0000091495185,0.0005591879,0.000023173052,0.0023449732],"genre_scores_gemma":[0.9988213,0.0003125625,0.00011643129,0.000032334854,0.000010889846,0.0000033157023,0.00034170088,0.0000037588354,0.000357695],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923,0.00030804492,0.000081442064,0.00013692974,0.00011584471,0.00012766213],"domain_scores_gemma":[0.9877175,0.007906408,0.0027152204,0.0006462473,0.0005911182,0.00042351426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089469,0.00036547624,0.00044657922,0.0007842279,0.0004460183,0.0015631104,0.00060887303,0.0007558041,0.00325394],"category_scores_gemma":[0.011895221,0.00026163046,0.0007884011,0.001305774,0.00059510325,0.0012854536,0.00086826313,0.0011034013,0.000572214],"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.00041893675,0.00014663197,0.95101655,0.00007431413,0.00054370216,0.00043206417,0.00036359276,0.02957777,0.00038871297,0.0036549498,0.0014657847,0.011917042],"study_design_scores_gemma":[0.00007893154,0.0003907881,0.7012088,0.00010711362,0.0005889724,0.00021748041,0.0019847115,0.28103456,0.0008461325,0.009676975,0.0037498253,0.000115771276],"about_ca_topic_score_codex":0.040199663,"about_ca_topic_score_gemma":0.025073476,"teacher_disagreement_score":0.040199663,"about_ca_system_score_codex":0.0008113076,"about_ca_system_score_gemma":0.00068123505,"threshold_uncertainty_score":0.07993138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.914682,0.0011253981,0.07619254,0.0005180955,0.00014270876,0.00005787705,0.00051562133,0.0003465472,0.006419154],"genre_scores_gemma":[0.99598193,0.00015293721,0.002257464,0.000012107567,0.00000864624,0.00002181427,0.00012420195,0.0000046688183,0.0014362826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982363,0.000046503865,0.000014570608,0.00005796365,0.000030803996,0.000026586991],"domain_scores_gemma":[0.9997247,0.000093837705,0.000033432327,0.000010762369,0.00012049656,0.000016777212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055543496,0.00064094464,0.0004972547,0.00053375924,0.0002796945,0.0008068541,0.00091524917,0.0006808197,0.0011156922],"category_scores_gemma":[0.0009839062,0.00027581427,0.00048772042,0.00043568187,0.00026729365,0.00079288316,0.0003605091,0.0005838664,0.00012589715],"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.00007470241,0.000035325746,0.0037515566,0.00003874117,0.000029334595,0.00006628431,0.000019120069,0.98746955,0.0006092825,0.00044256763,0.00024859185,0.007214855],"study_design_scores_gemma":[0.0000021962585,0.000012747137,0.000544685,0.0000023671623,0.0000048207107,0.0000031342825,0.0000061188616,0.9991829,0.00012068316,0.00008012962,0.00003770586,0.000002566604],"about_ca_topic_score_codex":0.039025977,"about_ca_topic_score_gemma":0.021175109,"teacher_disagreement_score":0.039025977,"about_ca_system_score_codex":0.0011345721,"about_ca_system_score_gemma":0.000853841,"threshold_uncertainty_score":0.07759762},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001960194,0.009859929,0.01046314,0.012747369,0.0030172374,0.002326981,0.6755679,0.003989783,0.28006735],"genre_scores_gemma":[0.011562546,0.014915861,0.028073845,0.0053305617,0.0013501171,0.0031070434,0.7335716,0.0012747938,0.20081368],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974571,0.00026086994,0.0002080989,0.00030441745,0.0016413854,0.00012819184],"domain_scores_gemma":[0.9932596,0.0005155744,0.00038135322,0.00025696566,0.0054021077,0.00018432712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030967249,0.0010140844,0.0004719545,0.004091871,0.000695251,0.0018945372,0.0018327292,0.001092841,0.07596621],"category_scores_gemma":[0.005108191,0.0005016228,0.0004772152,0.0036836574,0.00027481784,0.0017237886,0.0010348867,0.0015659006,0.071262],"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.000017043383,0.00002400957,0.0009073089,0.00018927197,0.000004091781,0.000013635239,0.00002366018,0.00013554732,0.0001391536,0.00058043795,0.94596624,0.051999617],"study_design_scores_gemma":[0.000008580574,0.000014498408,0.006239811,0.0003820946,0.000006505235,0.00003420848,0.000054239175,0.00011581158,0.0002110956,0.0005093791,0.99241126,0.0000125813085],"about_ca_topic_score_codex":0.085914515,"about_ca_topic_score_gemma":0.06428509,"teacher_disagreement_score":0.085914515,"about_ca_system_score_codex":0.0033086417,"about_ca_system_score_gemma":0.005683657,"threshold_uncertainty_score":0.25413227},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036738035,0.99430484,0.00041023482,0.00017887262,0.00017908495,0.0004399066,0.00057539216,0.000019908352,0.00021797868],"genre_scores_gemma":[0.13851584,0.85336214,0.003109815,0.00108656,0.00028175116,0.0022080962,0.0010831602,0.000029714796,0.00032282958],"study_design_codex":"systematic_review","study_design_gemma":"meta_analysis","domain_scores_codex":[0.9846399,0.007022623,0.0046808,0.0014879821,0.0017181874,0.0004504599],"domain_scores_gemma":[0.97633034,0.017056495,0.0036801996,0.0006967287,0.0019622517,0.00027389196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0157591,0.0027488256,0.019600427,0.008349365,0.0009654321,0.0035950935,0.002157192,0.0023095214,0.0035754966],"category_scores_gemma":[0.04223689,0.0015454855,0.039139915,0.008288497,0.00085207005,0.001980973,0.0017233544,0.00187594,0.00027547235],"study_design_candidate":"meta_analysis","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.00094412785,0.00002862052,0.0036411334,0.55169666,0.43296003,0.00014920063,0.0000862929,0.00029936936,0.00016792137,0.00012793927,0.00059782463,0.009300908],"study_design_scores_gemma":[0.00034306836,0.00014583263,0.0036261964,0.047366098,0.94637007,0.000096764896,0.000044723558,0.00010649469,0.00008745565,0.00013829414,0.0016555265,0.000019427185],"about_ca_topic_score_codex":0.011473598,"about_ca_topic_score_gemma":0.026073966,"teacher_disagreement_score":0.019600427,"about_ca_system_score_codex":0.0035041277,"about_ca_system_score_gemma":0.0067641456,"threshold_uncertainty_score":0.08334309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95682085,0.0003149318,0.040438063,0.00022538111,0.000101588,0.0004522857,0.00047219946,0.00052282424,0.00065182766],"genre_scores_gemma":[0.9778832,0.0000790628,0.019985536,0.0002024573,0.000042722255,0.00043936112,0.0008221689,0.000085182895,0.00046031675],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9939122,0.0024439415,0.00048109522,0.0022009439,0.00069756765,0.00026438304],"domain_scores_gemma":[0.95607644,0.028470768,0.0021650495,0.008577375,0.003931186,0.00077921234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013707421,0.0011566916,0.0009113338,0.00062924024,0.0005104457,0.0009781949,0.0013868528,0.0016296618,0.0012051625],"category_scores_gemma":[0.051912945,0.00053524587,0.0015917305,0.00039039503,0.0014152835,0.0010304644,0.0017291609,0.0019907732,0.00065693265],"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.015139227,0.006054565,0.3234458,0.001413201,0.0037761051,0.00085685094,0.002604259,0.24142152,0.11294153,0.0018067558,0.0068382267,0.28370202],"study_design_scores_gemma":[0.0011137659,0.021981034,0.18367589,0.00016856623,0.0019568268,0.0011322733,0.00090153754,0.67450327,0.1049617,0.0048779487,0.0044275513,0.0002997047],"about_ca_topic_score_codex":0.0037408238,"about_ca_topic_score_gemma":0.0021255033,"teacher_disagreement_score":0.013707421,"about_ca_system_score_codex":0.0006825748,"about_ca_system_score_gemma":0.0008598886,"threshold_uncertainty_score":0.0724926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9322308,0.0012841622,0.015268822,0.00052821886,0.0002263311,0.00009040194,0.030299725,0.0019181279,0.018153436],"genre_scores_gemma":[0.900423,0.0011033595,0.014372697,0.00085038185,0.00006346562,0.00036270052,0.013715721,0.0012238768,0.067884795],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998078,0.0000058561445,0.000009350009,0.00005575976,0.00006655423,0.000054879376],"domain_scores_gemma":[0.99971765,0.00004618423,0.00004489535,0.000029612585,0.00007692018,0.00008474481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013438104,0.00028300588,0.0002789821,0.0005978471,0.0003102024,0.0004060473,0.00038421003,0.00062151067,0.010992084],"category_scores_gemma":[0.00017869865,0.00021148271,0.0003937533,0.0003243842,0.00017726378,0.0002982859,0.00036036616,0.001043639,0.0027368965],"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.00012784828,0.000027401224,0.00061090104,0.000052704883,0.000008594454,0.000051322353,0.00003466847,0.00008835604,0.9930606,0.00009502363,0.0012338769,0.004608718],"study_design_scores_gemma":[0.000035132503,0.00031042198,0.103248484,0.00004430272,0.000050752107,0.0003789051,0.000194447,0.0020074036,0.8854071,0.00020458798,0.008086705,0.00003170575],"about_ca_topic_score_codex":0.0036217184,"about_ca_topic_score_gemma":0.009029213,"teacher_disagreement_score":0.010992084,"about_ca_system_score_codex":0.0005601785,"about_ca_system_score_gemma":0.00020392297,"threshold_uncertainty_score":0.03677219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003371734,0.00014776383,0.0022358396,0.00010532032,0.000035841535,0.000059682512,0.98994714,0.0051522455,0.001979103],"genre_scores_gemma":[0.0008768968,0.00014500189,0.006211657,0.000071022034,0.00001248039,0.00046247855,0.98781013,0.001960713,0.0024495733],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867105,0.00023557554,0.000164475,0.0005099649,0.00028344218,0.0001354742],"domain_scores_gemma":[0.99594903,0.0016036594,0.00031980517,0.0012282773,0.00064754003,0.00025157613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021872718,0.0024403054,0.0018207706,0.004653882,0.0012249133,0.0032605738,0.0039098435,0.002183964,0.19319147],"category_scores_gemma":[0.01058551,0.0012356979,0.001977139,0.0057826256,0.00066893786,0.0017289114,0.0024300388,0.0027515655,0.21118219],"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.000071937335,0.000025885169,0.00078582496,0.0006299455,0.00003968663,0.00006052337,0.000048996353,0.0005606165,0.00027933062,0.0013086246,0.98709655,0.009092188],"study_design_scores_gemma":[0.0002635574,0.000022953678,0.002710096,0.00035344463,0.000046218265,0.00022625773,0.00004747095,0.00159237,0.001083015,0.0064776717,0.98713857,0.000038411556],"about_ca_topic_score_codex":0.011725766,"about_ca_topic_score_gemma":0.04292846,"teacher_disagreement_score":0.19319147,"about_ca_system_score_codex":0.0014778022,"about_ca_system_score_gemma":0.0036846916,"threshold_uncertainty_score":0.6462898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856281,0.0013869127,0.0009547737,0.0021435227,0.0001347804,0.000029820449,0.00013116581,0.000029839512,0.009561105],"genre_scores_gemma":[0.98973083,0.0010311744,0.0006957445,0.0005309702,0.00002933349,0.000034566263,0.000097366545,0.00001872519,0.007831318],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9991134,0.00029418155,0.00002973373,0.00013353098,0.00019389363,0.00023526017],"domain_scores_gemma":[0.99843746,0.00036391287,0.00024604658,0.00007345016,0.0005170854,0.00036205637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011070083,0.00035772336,0.00042125612,0.0003714536,0.0024157865,0.002815001,0.0006096302,0.0010338087,0.0054148575],"category_scores_gemma":[0.0039253808,0.0002979843,0.0004012507,0.00026187804,0.0019512855,0.0010133547,0.0016833977,0.0015646904,0.0008502825],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008773363,0.0005925512,0.38954502,0.0008414376,0.00023860291,0.003946002,0.4458262,0.0006879442,0.018286554,0.0034020862,0.010755484,0.12500079],"study_design_scores_gemma":[0.00002733111,0.0008738302,0.66988164,0.0007011824,0.00018604465,0.001731042,0.27381092,0.0010370986,0.0024603175,0.001686845,0.047433216,0.00017052956],"about_ca_topic_score_codex":0.122265235,"about_ca_topic_score_gemma":0.20843963,"teacher_disagreement_score":0.122265235,"about_ca_system_score_codex":0.0019550966,"about_ca_system_score_gemma":0.0026281732,"threshold_uncertainty_score":0.24310714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9993556,0.00012043094,0.00022057697,0.000023171811,0.000008443557,0.00000938449,0.000058739886,0.000009914493,0.00019365437],"genre_scores_gemma":[0.9929981,0.00075617287,0.0008817368,0.00006947239,0.0000104649735,0.000063003085,0.00022286146,0.000016996717,0.0049812286],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998629,0.000009932211,0.000009487374,0.000044496566,0.000023946455,0.00004916198],"domain_scores_gemma":[0.9997141,0.000029716559,0.000113783506,0.000035720557,0.00003461733,0.00007214471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015067584,0.00042092378,0.0003427289,0.00034994452,0.00014645768,0.00023091608,0.0002496968,0.00024985662,0.0019108414],"category_scores_gemma":[0.00018560284,0.0002849865,0.0003223683,0.00015177244,0.0003876483,0.00028694543,0.00030535506,0.00070716906,0.0002701748],"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.001306626,0.00019863145,0.0010787136,0.000044936904,0.0000123330665,0.000050888437,0.000058918067,0.000037249385,0.99279624,0.000035464887,0.000021737818,0.0043583056],"study_design_scores_gemma":[0.00013684644,0.012212983,0.13894196,0.000037684524,0.00011205344,0.00018443138,0.00042055384,0.00048588697,0.8461136,0.00013482562,0.0011932022,0.000025925798],"about_ca_topic_score_codex":0.0016944758,"about_ca_topic_score_gemma":0.0031527786,"teacher_disagreement_score":0.0019108414,"about_ca_system_score_codex":0.0002512639,"about_ca_system_score_gemma":0.00024352872,"threshold_uncertainty_score":0.0063923597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37040633,0.0010105498,0.45356506,0.022617223,0.0004310846,0.0018449723,0.000117001546,0.0007245719,0.14928328],"genre_scores_gemma":[0.9112872,0.000320945,0.08395242,0.0005711269,0.00003358069,0.0005192137,0.000044415803,0.00009513645,0.0031759727],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.95840234,0.0351474,0.0007623721,0.0026346876,0.001602867,0.0014503875],"domain_scores_gemma":[0.9590581,0.027835319,0.002064422,0.0067058634,0.0021144154,0.0022218812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04568686,0.0008022051,0.00054192665,0.0025665043,0.008497408,0.013383118,0.0024078658,0.0019632753,0.004298753],"category_scores_gemma":[0.04127535,0.00072771433,0.0008746706,0.00207656,0.025804564,0.012580902,0.020223377,0.00319823,0.00092800456],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013729125,0.00060034846,0.013802426,0.0010883048,0.00010085736,0.00091286155,0.5589685,0.004547754,0.0037620205,0.17673533,0.004330844,0.23501356],"study_design_scores_gemma":[0.00016224015,0.0005246039,0.0052256067,0.0014073097,0.00010295253,0.00045040052,0.44599313,0.008485812,0.0050570997,0.36800423,0.164434,0.00015267622],"about_ca_topic_score_codex":0.0014280744,"about_ca_topic_score_gemma":0.0031033151,"teacher_disagreement_score":0.04568686,"about_ca_system_score_codex":0.0038242547,"about_ca_system_score_gemma":0.009504311,"threshold_uncertainty_score":0.2416181},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002259128,0.026970118,0.0061886236,0.011203233,0.013164013,0.000072272516,0.013496156,0.0016978035,0.9249485],"genre_scores_gemma":[0.0036738666,0.0048976387,0.0016089688,0.0006881064,0.00029662394,0.00003175733,0.003309365,0.0010529297,0.9844407],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993268,0.000051838746,0.000033215227,0.00009769353,0.00040091493,0.00008959144],"domain_scores_gemma":[0.99961215,0.00008096417,0.000031174783,0.000043914122,0.000131557,0.000100250654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008203841,0.0006592394,0.0005407311,0.0011815751,0.00090996106,0.007489433,0.0010724969,0.0015745455,0.22035314],"category_scores_gemma":[0.0017586815,0.00041190244,0.0004399507,0.002293299,0.0006331876,0.0034678911,0.0021288828,0.0022166248,0.15321489],"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.000055681012,0.000024565214,0.00015244097,0.00016708711,0.0000043530213,0.000051553372,0.00014966882,0.00030206912,0.0007371751,0.02878133,0.8660153,0.10355869],"study_design_scores_gemma":[0.000002015001,0.0000022799097,0.00009663656,0.000048581165,0.0000013265358,0.000022960441,0.000019145677,0.00004792871,0.00021257398,0.0010809625,0.9984622,0.0000034077045],"about_ca_topic_score_codex":0.024529276,"about_ca_topic_score_gemma":0.0411725,"teacher_disagreement_score":0.22035314,"about_ca_system_score_codex":0.0033523396,"about_ca_system_score_gemma":0.004585448,"threshold_uncertainty_score":0.7371547},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7663533,0.0103534665,0.19584817,0.0010436691,0.00048566668,0.00037072256,0.0012061321,0.0016458161,0.022693167],"genre_scores_gemma":[0.80685955,0.0063679907,0.1580006,0.0005940646,0.000085660366,0.00025480878,0.0006214941,0.00006290747,0.027152846],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984884,0.000012774674,0.000010386161,0.000041853677,0.00007501658,0.000011194735],"domain_scores_gemma":[0.9999306,0.000019889583,0.00001791686,0.000004525596,0.000020576132,0.000006486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002011006,0.00035132354,0.00016181929,0.00031398862,0.00015298816,0.00027450544,0.00035880247,0.00028334284,0.0014730021],"category_scores_gemma":[0.00019061133,0.00012866767,0.00012709781,0.00018699016,0.00016181466,0.0004018101,0.0003316417,0.00024197524,0.000561387],"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.000018507943,0.000012097888,0.00028542647,0.00007774616,0.0000021581047,0.00003318087,0.000014406277,0.00013916494,0.9889094,0.0004274217,0.0002103112,0.0098702675],"study_design_scores_gemma":[0.000004129569,0.00007495321,0.0009767774,0.000008936387,0.0000058863016,0.00013384671,0.000015675025,0.0028770699,0.9886875,0.000085902495,0.0071212105,0.000008108724],"about_ca_topic_score_codex":0.00029156235,"about_ca_topic_score_gemma":0.0006920307,"teacher_disagreement_score":0.0014730021,"about_ca_system_score_codex":0.00027349367,"about_ca_system_score_gemma":0.00021227765,"threshold_uncertainty_score":0.004927695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7925751,0.17212483,0.0012891665,0.012709912,0.0006382997,0.0004728335,0.0024916322,0.000023430526,0.01767474],"genre_scores_gemma":[0.9752221,0.021720218,0.0013555384,0.0005247689,0.00017893781,0.00011185731,0.0005005477,0.000006095073,0.00037988817],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99792176,0.0012363839,0.0001808561,0.000055697215,0.0005040871,0.000101288184],"domain_scores_gemma":[0.9926426,0.003987842,0.0012307425,0.00012523273,0.0014276605,0.00058589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043895203,0.00022233515,0.00054785196,0.000600565,0.00021142121,0.001252897,0.0003784627,0.0003918475,0.0026516744],"category_scores_gemma":[0.017830016,0.00007899727,0.00071668165,0.00092406286,0.00021956427,0.00067500636,0.0005668535,0.00063396443,0.00016187577],"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.017114526,0.0015007136,0.16556898,0.007219412,0.0040317597,0.0002489431,0.0004880849,0.003647463,0.00063038827,0.004533111,0.01146325,0.78355336],"study_design_scores_gemma":[0.0026421302,0.024623306,0.8422221,0.018280735,0.010539593,0.0011533011,0.0033172544,0.010271975,0.0028765558,0.009871573,0.0739618,0.00023964132],"about_ca_topic_score_codex":0.004324372,"about_ca_topic_score_gemma":0.0066191196,"teacher_disagreement_score":0.0043895203,"about_ca_system_score_codex":0.002609964,"about_ca_system_score_gemma":0.0018114047,"threshold_uncertainty_score":0.02321428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00731668,0.00081157486,0.0007336853,0.047528487,0.010018798,0.00024138333,0.002638249,0.0011037111,0.9296074],"genre_scores_gemma":[0.01761174,0.0002759233,0.00024858062,0.020950252,0.0008910678,0.00013934576,0.00090538186,0.00070623093,0.9582715],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973852,0.00031067428,0.000052829055,0.00021611442,0.0009846082,0.0010505735],"domain_scores_gemma":[0.997693,0.00026656137,0.000085193096,0.00022936049,0.00070176006,0.0010241377],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001561666,0.00051066006,0.0004589383,0.0007677111,0.01635314,0.008191473,0.0012083851,0.0062576025,0.23056903],"category_scores_gemma":[0.0081362985,0.00045854013,0.00041701156,0.0010502812,0.0018357699,0.0047519533,0.0059836563,0.008507027,0.08426571],"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.000021175947,0.00001146866,0.00016066046,0.000016453088,9.395788e-7,0.00015509025,0.0013220222,0.0000073560873,0.00006231886,0.007154316,0.98635745,0.0047309063],"study_design_scores_gemma":[0.000002228887,0.000004425714,0.00027018346,0.00002323431,5.6933425e-7,0.000053850003,0.0013530441,0.000009540336,0.00006286338,0.00033132627,0.9978846,0.0000041754906],"about_ca_topic_score_codex":0.058721147,"about_ca_topic_score_gemma":0.18487228,"teacher_disagreement_score":0.769431,"about_ca_system_score_codex":0.0045537115,"about_ca_system_score_gemma":0.0045214724,"threshold_uncertainty_score":0.77133024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952219,0.00058986223,0.00044963777,0.00001854892,0.000008604662,0.0000129771115,0.00030380828,0.000014755313,0.0033798625],"genre_scores_gemma":[0.987777,0.00047802928,0.0008944571,0.000028745148,0.0000050854123,0.000031652762,0.0004127092,0.000026269054,0.010346054],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99983954,0.000006258323,0.0000046030477,0.00007498584,0.000045942477,0.000028625369],"domain_scores_gemma":[0.99970585,0.00003882482,0.000067992645,0.000016501761,0.00012241164,0.00004837055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020426973,0.00036039707,0.0003025794,0.0011903929,0.0017356401,0.0010294621,0.00047326027,0.00039749435,0.0017074391],"category_scores_gemma":[0.00035101202,0.0003644149,0.00032308826,0.0009139712,0.0009179678,0.00038475488,0.00048603947,0.0004927527,0.0003337191],"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.0005529181,0.000051249222,0.51827884,0.000503245,0.00027435017,0.0009811954,0.010719278,0.0027952283,0.40526247,0.00090890774,0.00050647056,0.05916593],"study_design_scores_gemma":[0.0000026756468,0.00004294095,0.9915959,0.000021281043,0.000026108066,0.00010737147,0.00094299205,0.00024460797,0.0027490936,0.00003070444,0.004225586,0.000010767031],"about_ca_topic_score_codex":0.2589923,"about_ca_topic_score_gemma":0.69146806,"teacher_disagreement_score":0.7410077,"about_ca_system_score_codex":0.002572294,"about_ca_system_score_gemma":0.001233419,"threshold_uncertainty_score":0.5149696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9987539,0.0003160579,0.000014197569,0.00012219445,0.000005250641,0.0000060145935,0.00006345317,0.0000015651805,0.0007173588],"genre_scores_gemma":[0.99915636,0.00023166607,0.000021879874,0.000056655706,0.0000066239472,0.000004412643,0.000059562222,4.1196955e-7,0.00046235992],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996586,0.000032748278,0.000026041436,0.000027143267,0.00014701427,0.000108337656],"domain_scores_gemma":[0.9986242,0.00021229788,0.0004855521,0.000034207733,0.00018171602,0.0004620912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006184846,0.00012670043,0.0003139159,0.0008886021,0.00029596587,0.0007375059,0.00024039931,0.00054681697,0.0039651],"category_scores_gemma":[0.0018809501,0.00014689012,0.0002833169,0.00042574253,0.00023712964,0.00035250076,0.00037734752,0.00042005454,0.00046974243],"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.00003727285,0.00016069926,0.99286675,0.00003151707,0.000014919531,0.0000754526,0.00067188946,0.000022197752,0.00030665973,0.000017423446,0.0001819142,0.0056132367],"study_design_scores_gemma":[0.0000057181974,0.00030326663,0.9972065,0.000034702294,0.000019011624,0.00027808698,0.0012252029,0.00007320242,0.00012002626,0.00001970286,0.00071022625,0.000004339254],"about_ca_topic_score_codex":0.005548725,"about_ca_topic_score_gemma":0.0053070653,"teacher_disagreement_score":0.005548725,"about_ca_system_score_codex":0.00036653923,"about_ca_system_score_gemma":0.0006111638,"threshold_uncertainty_score":0.013264596},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00591503,0.0027004234,0.0014401138,0.0066947946,0.003067067,0.00013404728,0.0016801812,0.00028562383,0.9780828],"genre_scores_gemma":[0.013204153,0.00081740174,0.00040826396,0.0012666023,0.00017182359,0.000044208657,0.0005865023,0.000066400695,0.9834346],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986303,0.00016217068,0.00006548227,0.00033079594,0.00046046896,0.00035077505],"domain_scores_gemma":[0.99891007,0.00011911479,0.000047251717,0.00013292854,0.00051613565,0.0002745157],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010742735,0.00070037064,0.00039129445,0.0014660326,0.005548988,0.0054871766,0.00087414024,0.0023041614,0.22070505],"category_scores_gemma":[0.0031245158,0.00034243934,0.000554643,0.0013393448,0.0013692525,0.0019868398,0.0028767379,0.0026722269,0.0934959],"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.00022735402,0.000091726346,0.0028764303,0.00026432422,0.000012549628,0.0006039641,0.0043607634,0.00019826321,0.0012295085,0.2837354,0.5333204,0.17307931],"study_design_scores_gemma":[0.0000029736136,0.000008096991,0.000662733,0.000034788667,0.0000013142783,0.00004183316,0.00026783423,0.0000193581,0.0001490314,0.0011935902,0.9976151,0.0000033652136],"about_ca_topic_score_codex":0.04462396,"about_ca_topic_score_gemma":0.07896463,"teacher_disagreement_score":0.77929497,"about_ca_system_score_codex":0.006380909,"about_ca_system_score_gemma":0.00824036,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036113273,0.018265927,0.70896775,0.041572087,0.0017562342,0.00013536144,0.0011891336,0.0015527126,0.1904475],"genre_scores_gemma":[0.45398363,0.015361872,0.27723292,0.0018282273,0.0016463934,0.0003814543,0.0010466017,0.00157016,0.2469488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808925,0.0005123574,0.00010619537,0.00042330506,0.00060017477,0.00026869314],"domain_scores_gemma":[0.99108094,0.005878425,0.0004749017,0.0010585429,0.0011853536,0.00032176985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034442295,0.0010833462,0.0013268479,0.001750032,0.0043648453,0.00841897,0.002208003,0.0044326833,0.033000246],"category_scores_gemma":[0.027337475,0.000826421,0.001273178,0.0028934758,0.0042718877,0.011039492,0.0033280381,0.0048000733,0.003104997],"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.00008909045,0.000025245567,0.0004236682,0.00015836777,0.000023419449,0.00013806483,0.00045559334,0.013341475,0.00061688176,0.90168923,0.02294865,0.060090322],"study_design_scores_gemma":[0.000055239834,0.000026578575,0.0006979743,0.00015807373,0.000038065984,0.00027115832,0.00046561807,0.057726007,0.0019082903,0.84874976,0.08984874,0.000054506625],"about_ca_topic_score_codex":0.05148342,"about_ca_topic_score_gemma":0.04709285,"teacher_disagreement_score":0.05148342,"about_ca_system_score_codex":0.00767994,"about_ca_system_score_gemma":0.005324518,"threshold_uncertainty_score":0.11039686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984309,0.00022068813,0.0003079633,0.001655825,0.000036915804,0.000042090836,0.00004211087,0.000014313846,0.013371122],"genre_scores_gemma":[0.98646325,0.00024397529,0.00034534154,0.0001950416,0.000008586831,0.000016351014,0.000042166263,0.000012886822,0.012672496],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.999238,0.00013742129,0.000019963174,0.00006048206,0.00009732602,0.00044673574],"domain_scores_gemma":[0.99924386,0.00009706481,0.00009210241,0.00004797195,0.00008536174,0.00043365962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010563723,0.00046455188,0.00032824892,0.0011184962,0.022167487,0.0021237512,0.0023993044,0.0025185654,0.010645025],"category_scores_gemma":[0.0014865403,0.000354484,0.00034431313,0.0020087261,0.004708864,0.0016162482,0.0037055148,0.0021541456,0.00040380014],"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.00016543397,0.0003843606,0.12458662,0.00028110982,0.000055680954,0.07614119,0.6883358,0.0013790708,0.0026901593,0.038950473,0.011157936,0.05587219],"study_design_scores_gemma":[0.0000063911566,0.00012137777,0.05673657,0.00014610185,0.000026270221,0.003997533,0.87155104,0.000754008,0.0005795251,0.0015786481,0.06447312,0.000029490131],"about_ca_topic_score_codex":0.12083938,"about_ca_topic_score_gemma":0.31546786,"teacher_disagreement_score":0.12083938,"about_ca_system_score_codex":0.008757769,"about_ca_system_score_gemma":0.013086031,"threshold_uncertainty_score":0.24027205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96547645,0.027506607,0.001978541,0.0012481465,0.00016470044,0.000070013244,0.00027546752,0.00017466485,0.0031053869],"genre_scores_gemma":[0.99555814,0.0027114565,0.0006853527,0.00019573612,0.000033960263,0.000022804079,0.000110567715,0.0000071833388,0.0006748064],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997576,0.00006651675,0.00001941774,0.000043394255,0.00003628728,0.00007687251],"domain_scores_gemma":[0.9997465,0.00002788781,0.00007091264,0.000022902857,0.000032238535,0.00009955353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043938617,0.0003315393,0.00029316903,0.00024232178,0.00019406823,0.00041618454,0.00022317514,0.00064376596,0.0007310225],"category_scores_gemma":[0.0002862192,0.000084193794,0.000207784,0.00006692355,0.00032335203,0.00028439728,0.00029518304,0.00043709,0.00016463915],"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.00067632244,0.000066025044,0.002708903,0.0002178464,0.000013566264,0.00030788901,0.00007974743,0.00009488711,0.9824654,0.00051600375,0.00037481438,0.012478471],"study_design_scores_gemma":[0.00022833345,0.00648268,0.21860234,0.00045690846,0.00017177015,0.0068951226,0.0006848773,0.002814098,0.7274456,0.0011173125,0.035022333,0.00007863041],"about_ca_topic_score_codex":0.00030024315,"about_ca_topic_score_gemma":0.00030238557,"teacher_disagreement_score":0.0007310225,"about_ca_system_score_codex":0.00022002659,"about_ca_system_score_gemma":0.00016064764,"threshold_uncertainty_score":0.002445519},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20100941,0.03806668,0.44497716,0.0040284186,0.002189549,0.0008346707,0.0039839703,0.0026918703,0.30221826],"genre_scores_gemma":[0.6323435,0.01824702,0.2772584,0.00024178598,0.000289476,0.0007179996,0.001968818,0.0007031983,0.06822978],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879825,0.00013586256,0.00006654978,0.00023742896,0.0006489582,0.00011298248],"domain_scores_gemma":[0.9993637,0.000110222456,0.0001064304,0.00011272283,0.0002476732,0.000059288643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013382196,0.0004169577,0.00052225246,0.0016889982,0.0010661219,0.0024586106,0.0005267318,0.0008249395,0.014071783],"category_scores_gemma":[0.001596869,0.00086240977,0.000414803,0.0018880096,0.0010143177,0.0010423795,0.00090962613,0.0010701587,0.006814573],"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.0003384063,0.00017175164,0.0059734806,0.0017270214,0.00007209602,0.0016595026,0.0014598889,0.005519753,0.38627005,0.14381653,0.013790198,0.43920127],"study_design_scores_gemma":[0.00007028272,0.00022222893,0.0076899435,0.0002524091,0.00010488505,0.001274201,0.000801867,0.0046978323,0.24491747,0.023762042,0.7160403,0.00016649987],"about_ca_topic_score_codex":0.004048935,"about_ca_topic_score_gemma":0.00938914,"teacher_disagreement_score":0.014071783,"about_ca_system_score_codex":0.0010134856,"about_ca_system_score_gemma":0.002782192,"threshold_uncertainty_score":0.047074854},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028740114,0.0029221918,0.00049054454,0.0040627257,0.0010670279,0.00011392339,0.6790828,0.0017642224,0.28175643],"genre_scores_gemma":[0.18375546,0.008460504,0.00465353,0.001976716,0.00049111596,0.00028590782,0.5815402,0.00076582213,0.21807075],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9999418,0.0000037548607,0.0000032939795,0.000012028441,0.000025540625,0.000013536391],"domain_scores_gemma":[0.9998092,0.0000073256388,0.000026590256,0.0000111192585,0.00011392942,0.000031821884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007879226,0.00065207033,0.00017402701,0.0014250876,0.00046788718,0.0010183462,0.00024770523,0.0003438657,0.065491326],"category_scores_gemma":[0.00023785447,0.00015353035,0.00015798892,0.0033892149,0.00013316581,0.00051232794,0.0006332099,0.0005907172,0.01894355],"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.00002092884,0.000022062066,0.01636391,0.00013461412,0.000014332544,0.00005972144,0.00006168705,0.00023722574,0.00014513134,0.0003878377,0.9483816,0.034170836],"study_design_scores_gemma":[0.000034480458,0.000017837698,0.1860147,0.00020774337,0.000021268495,0.000092128175,0.0007022645,0.00061522337,0.00016542287,0.000342637,0.81177175,0.000014514191],"about_ca_topic_score_codex":0.24479747,"about_ca_topic_score_gemma":0.25357616,"teacher_disagreement_score":0.24479747,"about_ca_system_score_codex":0.0008241016,"about_ca_system_score_gemma":0.0014061749,"threshold_uncertainty_score":0.48674518},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9425203,0.0017632314,0.012599193,0.00047027285,0.00046656016,0.0000731424,0.00033929673,0.00061345904,0.041154593],"genre_scores_gemma":[0.96402687,0.0004330948,0.0056081144,0.00011823548,0.00003301297,0.000018234085,0.00029732366,0.00012086368,0.029344263],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999043,0.000004892055,0.000003883765,0.000017958539,0.000049163875,0.000019808722],"domain_scores_gemma":[0.9999534,0.000008341939,0.0000063558678,0.000011751529,0.00001633025,0.0000038246785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007951263,0.00016048811,0.0001826912,0.00016111461,0.00018904352,0.0002826656,0.00035185833,0.00030747062,0.004355857],"category_scores_gemma":[0.00018832656,0.00012294638,0.00022441379,0.00013202976,0.00011544192,0.00026549114,0.00021660312,0.00028448,0.001379934],"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.000072045164,0.000013648144,0.00012605684,0.0000705801,0.0000058110363,0.00009139634,0.000036476013,0.0001317192,0.9899413,0.00027872753,0.0008559696,0.008376364],"study_design_scores_gemma":[0.000009329738,0.00011289947,0.000958526,0.0000027198173,0.000007697706,0.00013846789,0.000026849653,0.0009098678,0.99054587,0.00009866829,0.007185388,0.00000363652],"about_ca_topic_score_codex":0.00030898547,"about_ca_topic_score_gemma":0.0006941612,"teacher_disagreement_score":0.004355857,"about_ca_system_score_codex":0.00015885827,"about_ca_system_score_gemma":0.00008096787,"threshold_uncertainty_score":0.014571786},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14263147,0.004141448,0.18892734,0.013270599,0.0006325194,0.00040710456,0.00012308902,0.00022000371,0.64964646],"genre_scores_gemma":[0.9540293,0.0013519955,0.023442434,0.00087479997,0.000073438445,0.00029637892,0.00006736816,0.00016212324,0.019702248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864711,0.010644898,0.00020485916,0.0009762137,0.00094033935,0.00076264306],"domain_scores_gemma":[0.9882359,0.008608053,0.0008276369,0.0013356688,0.0004987702,0.00049394066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01156181,0.00088834437,0.00055469584,0.002420111,0.009804232,0.016154366,0.002231061,0.002622572,0.008632005],"category_scores_gemma":[0.014122925,0.0005713282,0.0012848147,0.0019431231,0.04773392,0.018835241,0.011748564,0.0039629326,0.0009372629],"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.000044221317,0.00005692704,0.0010954154,0.00026508942,0.0000140604025,0.00042099808,0.28026795,0.0006764349,0.0005159832,0.6979566,0.0018740592,0.016812203],"study_design_scores_gemma":[0.000033540644,0.000066440065,0.00092748035,0.000639509,0.00003064045,0.0005161066,0.28101942,0.0022743163,0.0013488583,0.46265578,0.25044253,0.00004545083],"about_ca_topic_score_codex":0.0027532668,"about_ca_topic_score_gemma":0.003522645,"teacher_disagreement_score":0.016154366,"about_ca_system_score_codex":0.004330967,"about_ca_system_score_gemma":0.0035806547,"threshold_uncertainty_score":0.061145425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043723625,0.023798555,0.018444479,0.022662735,0.08466079,0.0013282888,0.018416218,0.0059767384,0.8203398],"genre_scores_gemma":[0.009052433,0.019110298,0.008435887,0.0021032074,0.01572342,0.0002672627,0.017518751,0.0032650428,0.92452365],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971312,0.00027516182,0.00022861939,0.0002542822,0.0018691714,0.00024154228],"domain_scores_gemma":[0.99200296,0.0015159921,0.00042493577,0.0006308086,0.0037691107,0.0016563018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034659277,0.0012835298,0.0015150973,0.0069342963,0.0021008633,0.0084981425,0.0015710553,0.0015957989,0.16175148],"category_scores_gemma":[0.0062818774,0.00060793775,0.00050939264,0.009707124,0.0015393059,0.0042131245,0.0018384438,0.0022746744,0.1310964],"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.00003547583,0.00006323395,0.0004380104,0.00013253096,0.0000049864443,0.000038250975,0.00004879514,0.00015955276,0.000580674,0.0029375,0.93075013,0.06481086],"study_design_scores_gemma":[0.0000066831535,0.00001829305,0.0013072981,0.00011779605,0.0000061017818,0.00007078963,0.00005455289,0.00027432712,0.0006620703,0.00087378663,0.9965971,0.000011193029],"about_ca_topic_score_codex":0.02318798,"about_ca_topic_score_gemma":0.047868777,"teacher_disagreement_score":0.16175148,"about_ca_system_score_codex":0.0046601766,"about_ca_system_score_gemma":0.008630789,"threshold_uncertainty_score":0.5411126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009425129,0.00037511208,0.0007314526,0.0012650873,0.0015955778,0.0001717362,0.016098475,0.004365858,0.97445405],"genre_scores_gemma":[0.0045562875,0.0006836071,0.0009085497,0.0010575482,0.00048483323,0.00014953276,0.0136878835,0.0028872495,0.97558457],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996164,0.00003526037,0.000016639451,0.000043504304,0.0001764849,0.00011169139],"domain_scores_gemma":[0.9986135,0.00019747762,0.00004768488,0.0001555579,0.00048534828,0.00050035724],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052490074,0.0007817638,0.00049365463,0.0015131703,0.0020846366,0.0053734905,0.0006131817,0.0013115647,0.85468626],"category_scores_gemma":[0.0025071644,0.00042245715,0.0005171825,0.0020331077,0.0005781066,0.0038167269,0.0027427399,0.0017276997,0.818711],"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.000028738064,0.000014891946,0.00012194014,0.00007923923,0.0000011071457,0.000041459294,0.00010847557,0.000018535697,0.00028526108,0.00076681195,0.97784996,0.020683521],"study_design_scores_gemma":[0.0000086209375,0.000011333024,0.0007504178,0.000060671868,0.0000018256382,0.00005378158,0.00022253886,0.00003444477,0.00031638684,0.00022814951,0.9983032,0.00000864939],"about_ca_topic_score_codex":0.007098492,"about_ca_topic_score_gemma":0.017613463,"teacher_disagreement_score":0.14531374,"about_ca_system_score_codex":0.0012119625,"about_ca_system_score_gemma":0.0012525378,"threshold_uncertainty_score":0.20727235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023037351,0.035472162,0.015714012,0.019282151,0.011254175,0.00009906318,0.0035139509,0.0021797123,0.91018105],"genre_scores_gemma":[0.0342349,0.03558926,0.014521896,0.002374321,0.004414154,0.00017657771,0.0030996075,0.003431139,0.9021582],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995486,0.00013093474,0.000024952535,0.00007206594,0.0001524657,0.00007093756],"domain_scores_gemma":[0.999428,0.00017791391,0.00003286388,0.00008290407,0.00013346809,0.00014488267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437054,0.0007350725,0.00037740901,0.0031512803,0.0018891987,0.0048054135,0.00061783363,0.001134892,0.14921254],"category_scores_gemma":[0.0018060044,0.0003254039,0.0002931651,0.0035108344,0.001353479,0.0045382553,0.002116771,0.0016377394,0.054214474],"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.00003558175,0.000019972027,0.00015894497,0.00027582314,0.0000023859554,0.00006127442,0.00052340684,0.000091064,0.0003558204,0.20425878,0.65634257,0.13787442],"study_design_scores_gemma":[0.0000014099525,0.0000014837487,0.00008186487,0.000051272145,4.909505e-7,0.000026156526,0.000036859292,0.000020875072,0.00005503086,0.003932447,0.9957897,0.0000022799434],"about_ca_topic_score_codex":0.0033543252,"about_ca_topic_score_gemma":0.0073179584,"teacher_disagreement_score":0.14921254,"about_ca_system_score_codex":0.001699214,"about_ca_system_score_gemma":0.0013302795,"threshold_uncertainty_score":0.49916565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934471,0.0007298925,0.00014320514,0.00012453856,0.0000101656215,0.0000060605967,0.0025932472,0.000018672014,0.0029270458],"genre_scores_gemma":[0.9935183,0.0010106615,0.00056706835,0.00006805758,0.0000095992455,0.0000071470904,0.0025432752,0.000011409064,0.002264383],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992657,0.0000034745533,0.000006750942,0.000023170927,0.000024755886,0.000015217936],"domain_scores_gemma":[0.9999242,0.000006275439,0.000022585604,0.0000035234432,0.000032002677,0.0000115080165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009769509,0.00014687065,0.00019757365,0.00044376444,0.00026646414,0.0008203775,0.00016483064,0.00019733887,0.0007792651],"category_scores_gemma":[0.00015286333,0.00015001166,0.00029700945,0.0007806032,0.00011868788,0.0001870877,0.0003852983,0.00021729564,0.0002331563],"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.0001592674,0.000033441742,0.87339795,0.00024854604,0.00015442881,0.00022226808,0.00095858047,0.0018666838,0.08984874,0.00046658728,0.0009422972,0.03170121],"study_design_scores_gemma":[0.0000054860006,0.000031531476,0.9910555,0.00002896075,0.000033509816,0.000036356807,0.00039361068,0.0009639086,0.0019150919,0.00007540672,0.0054501574,0.000010453488],"about_ca_topic_score_codex":0.10997353,"about_ca_topic_score_gemma":0.17133047,"teacher_disagreement_score":0.10997353,"about_ca_system_score_codex":0.0012832833,"about_ca_system_score_gemma":0.00075660617,"threshold_uncertainty_score":0.21866679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99738437,0.0006925424,0.000077017066,0.0001780337,0.000019249217,0.000013781954,0.00025545724,0.0000025225504,0.0013770926],"genre_scores_gemma":[0.99901783,0.00030486353,0.00016400762,0.000033927037,0.000021122183,0.000010205529,0.00023137585,0.0000010658246,0.00021566416],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997609,0.00005917142,0.000037431008,0.000038118702,0.000054712353,0.00004963241],"domain_scores_gemma":[0.99953353,0.00007455366,0.00018500647,0.000022696418,0.00008758719,0.000096563366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029975548,0.00025150838,0.00028412705,0.00062345335,0.00029389662,0.0004904318,0.0001788843,0.00022465935,0.001298293],"category_scores_gemma":[0.0015221802,0.000114316696,0.00033704808,0.0005830592,0.00020597088,0.00014778462,0.00045781664,0.0004868066,0.00012610499],"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.00004962559,0.000022457289,0.99781966,0.000012689614,0.000019062758,0.00004109816,0.000030953302,0.000027587394,0.000083406085,0.000020375568,0.00016237285,0.0017106556],"study_design_scores_gemma":[0.000005514127,0.000033249875,0.9991584,0.000019313342,0.000017693686,0.00015489114,0.00009931503,0.0001933213,0.00003202993,0.000020290556,0.00026404468,0.0000018926255],"about_ca_topic_score_codex":0.014299384,"about_ca_topic_score_gemma":0.024726793,"teacher_disagreement_score":0.014299384,"about_ca_system_score_codex":0.000353966,"about_ca_system_score_gemma":0.0006512115,"threshold_uncertainty_score":0.02843231},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047337506,0.00043072688,0.0017463674,0.00066599896,0.00033458942,0.000378717,0.62230664,0.0017984828,0.3676047],"genre_scores_gemma":[0.014059347,0.0008807048,0.004548379,0.0002514098,0.00008251689,0.0006101791,0.42896098,0.00064433523,0.5499621],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998716,0.000009751973,0.00000583224,0.000035802106,0.000049759336,0.000027214453],"domain_scores_gemma":[0.99941444,0.000026469721,0.00004187641,0.00003806169,0.00041557045,0.00006370524],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015441711,0.0007750493,0.00018331937,0.0025001455,0.00089501246,0.0008993745,0.00081094314,0.00031788164,0.32099205],"category_scores_gemma":[0.0011092902,0.000324327,0.00014524121,0.0055921013,0.00020918903,0.0006335289,0.0004892694,0.00066629867,0.1340228],"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.000016733316,0.000011483367,0.000914919,0.00006796274,0.0000012989974,0.000019083276,0.000052856496,0.000105662046,0.000094338655,0.0006283593,0.985294,0.012793268],"study_design_scores_gemma":[0.000019920417,0.000010084938,0.024364317,0.000073674666,0.00000338399,0.000049738697,0.00028437062,0.00021459155,0.00015495915,0.00024341956,0.9745744,0.000007118759],"about_ca_topic_score_codex":0.2602453,"about_ca_topic_score_gemma":0.34135503,"teacher_disagreement_score":0.67900795,"about_ca_system_score_codex":0.0017268108,"about_ca_system_score_gemma":0.0037827578,"threshold_uncertainty_score":0.9685224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94505036,0.000071215545,0.050195754,0.000023836981,0.000007821688,0.000042700547,0.0020116607,0.000581954,0.0020148086],"genre_scores_gemma":[0.97806966,0.000034751763,0.019143108,0.000013132493,0.000005789326,0.000028284958,0.0023045675,0.00004693643,0.0003537684],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993886,0.00012287963,0.000022084178,0.00020098854,0.00020076113,0.00006477969],"domain_scores_gemma":[0.998615,0.0003868691,0.00034921392,0.00025771136,0.00022093921,0.00017022282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318999,0.0005279653,0.0002802163,0.0012430956,0.00032553883,0.00074008055,0.00051194086,0.00039022794,0.0017246207],"category_scores_gemma":[0.0023781871,0.00020953218,0.00046126958,0.001407394,0.0001687348,0.000294136,0.00042763655,0.00022481343,0.00044395824],"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.0026126413,0.00030867927,0.65705925,0.00012437189,0.0004992472,0.0008314458,0.00024901092,0.064222835,0.17027748,0.004861839,0.0017190161,0.09723414],"study_design_scores_gemma":[0.00018858809,0.0007096078,0.46497497,0.000023289875,0.00027193187,0.0019426293,0.00012367773,0.31599852,0.20889464,0.0029207703,0.0038246622,0.00012668253],"about_ca_topic_score_codex":0.004853745,"about_ca_topic_score_gemma":0.0055850977,"teacher_disagreement_score":0.004853745,"about_ca_system_score_codex":0.0006731193,"about_ca_system_score_gemma":0.00035368264,"threshold_uncertainty_score":0.009651005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7762296,0.0009490087,0.21648,0.00023959858,0.00008302794,0.00011916546,0.00014784162,0.00062145723,0.0051302994],"genre_scores_gemma":[0.9335649,0.00041102612,0.06253242,0.000052845346,0.000007735917,0.00014423262,0.000088410896,0.000057324356,0.003141146],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978226,0.00002867195,0.000010564915,0.00007972196,0.00006942706,0.000029320383],"domain_scores_gemma":[0.99978477,0.000121479505,0.000033716402,0.00001960389,0.00002557695,0.000014835237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030271788,0.0004911066,0.0003399777,0.00021342104,0.00019755651,0.00055003463,0.00047755992,0.00044202292,0.0009207824],"category_scores_gemma":[0.00069687894,0.0002489905,0.00029824747,0.0002332468,0.00033504912,0.00035167873,0.0004345462,0.00034325256,0.0003027863],"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.00019980907,0.000045480283,0.001182014,0.00021240053,0.000024656674,0.00006620435,0.000103090446,0.05607254,0.9197186,0.001907228,0.00013764066,0.020330355],"study_design_scores_gemma":[0.000028464165,0.0002875407,0.0011766271,0.00000839253,0.000022807628,0.000047232777,0.000038681184,0.21933088,0.77514267,0.0005108094,0.0033761926,0.00002975762],"about_ca_topic_score_codex":0.00085818645,"about_ca_topic_score_gemma":0.001374364,"teacher_disagreement_score":0.0009207824,"about_ca_system_score_codex":0.00071297307,"about_ca_system_score_gemma":0.00037015468,"threshold_uncertainty_score":0.0051730275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019128395,0.0011933394,0.00049249805,0.09243733,0.003058113,0.00012240603,0.003751122,0.0010531483,0.8959791],"genre_scores_gemma":[0.012860802,0.0017154539,0.000661018,0.01699253,0.00029956832,0.000047746526,0.0011177713,0.00054125447,0.9657638],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983057,0.00008082712,0.00002956453,0.00008049366,0.00090640254,0.00059716095],"domain_scores_gemma":[0.99149734,0.00043139665,0.00016660159,0.00014206672,0.0039283233,0.0038341524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010733375,0.00057003606,0.00034122638,0.0013386569,0.012154742,0.0052914266,0.000968966,0.0028359569,0.22421022],"category_scores_gemma":[0.006119912,0.00035840675,0.00028150404,0.0015850359,0.0025020514,0.0015979307,0.0018411146,0.0027559025,0.0715694],"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.0000040076443,0.000007033447,0.000528828,0.000012134652,5.1208303e-7,0.000032560005,0.00014525458,0.0000119567685,0.000033733642,0.0010036101,0.9870689,0.01115158],"study_design_scores_gemma":[0.0000031150414,0.0000037858224,0.0021964682,0.00005336313,0.0000018972839,0.0000335908,0.0010794802,0.000024956089,0.000047885333,0.00019192405,0.9963521,0.0000115448565],"about_ca_topic_score_codex":0.95085865,"about_ca_topic_score_gemma":0.9858423,"teacher_disagreement_score":0.22421022,"about_ca_system_score_codex":0.017699966,"about_ca_system_score_gemma":0.07648163,"threshold_uncertainty_score":0.75005794},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012636847,0.0011846644,0.0013599327,0.022475049,0.011635449,0.0000681412,0.00083565374,0.001170328,0.9600072],"genre_scores_gemma":[0.0011714762,0.000105896295,0.00014463627,0.0008607305,0.00011857437,0.00000458329,0.00009027469,0.0000705028,0.99743336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949765,0.00003708598,0.000009527721,0.000121905985,0.0001871643,0.00014665652],"domain_scores_gemma":[0.99839056,0.000053058608,0.000028227683,0.00006370653,0.0005199737,0.00094455323],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005730087,0.0006122187,0.00048459403,0.0008933631,0.0035014746,0.003482979,0.0008996809,0.0017306217,0.64478874],"category_scores_gemma":[0.0013208908,0.000356554,0.00030001337,0.0006747414,0.0007045345,0.0016055087,0.0027556128,0.0023513641,0.34501335],"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.000021082666,0.000019908994,0.00015676193,0.000016047232,8.4974323e-7,0.00006233733,0.00002357043,0.000026162219,0.00011942708,0.0055041504,0.9592981,0.034751628],"study_design_scores_gemma":[0.000003141388,0.0000050503586,0.00010674783,0.000008135608,6.1337073e-7,0.00003259903,0.000046229237,0.00003364189,0.00006572141,0.00045743736,0.9992386,0.000002162063],"about_ca_topic_score_codex":0.012033762,"about_ca_topic_score_gemma":0.056829616,"teacher_disagreement_score":0.64478874,"about_ca_system_score_codex":0.0023665156,"about_ca_system_score_gemma":0.0048197326,"threshold_uncertainty_score":0.5066657},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33125862,0.0011481927,0.4323633,0.008629482,0.00016026385,0.0042167865,0.0017447451,0.00041999522,0.22005859],"genre_scores_gemma":[0.6771461,0.0005739888,0.29582107,0.0005118105,0.00001628436,0.0022981174,0.0009679666,0.00014808886,0.022516582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99001944,0.007982041,0.00030276045,0.00057232165,0.0006484614,0.00047500306],"domain_scores_gemma":[0.97172177,0.021740843,0.0011094039,0.0024753613,0.002478248,0.00047439407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012903772,0.00062334316,0.00037667988,0.005257208,0.0058885696,0.008666362,0.0025957897,0.0015069403,0.006053249],"category_scores_gemma":[0.021371013,0.0005080836,0.00042232426,0.0053679175,0.0071028383,0.005019992,0.0042564967,0.0020255183,0.00046162636],"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.00006511504,0.0002858795,0.014633501,0.0004412752,0.000032613036,0.0015692433,0.26219025,0.0041228277,0.0009002529,0.5535748,0.010248797,0.1519354],"study_design_scores_gemma":[0.00003326791,0.00007473018,0.009459858,0.001216422,0.00005730817,0.0007927394,0.6559334,0.016995598,0.0030367717,0.12726107,0.18507004,0.00006882662],"about_ca_topic_score_codex":0.08675083,"about_ca_topic_score_gemma":0.18495667,"teacher_disagreement_score":0.08675083,"about_ca_system_score_codex":0.010346666,"about_ca_system_score_gemma":0.015021645,"threshold_uncertainty_score":0.17249179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52565676,0.08279278,0.00042920507,0.077113815,0.0020109664,0.00012751506,0.017327351,0.00008040541,0.29446116],"genre_scores_gemma":[0.8586726,0.042154733,0.0007769042,0.0031270776,0.00043500817,0.00005150121,0.0026081407,0.000026948712,0.09214702],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99954885,0.00003399635,0.00002233956,0.000028440498,0.00013149361,0.00023491266],"domain_scores_gemma":[0.99923635,0.00007397377,0.000072857205,0.000016106873,0.00030938262,0.00029135324],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00046870543,0.00022026063,0.00019110067,0.0026135885,0.005499371,0.0014002982,0.0005155841,0.0006600784,0.009242871],"category_scores_gemma":[0.0015342487,0.00015307835,0.00017641463,0.0058918954,0.002268891,0.0009118689,0.00082465773,0.0011875887,0.00044695844],"study_design_candidate":"qualitative","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.00039348623,0.00014885768,0.2587187,0.0014395202,0.00012280671,0.003139675,0.14631823,0.000674916,0.0011566649,0.08222519,0.23446593,0.27119604],"study_design_scores_gemma":[0.000014486531,0.000029842136,0.44634563,0.0004296012,0.000038666796,0.0004704073,0.033977855,0.00008509605,0.00016110597,0.001283885,0.51710826,0.00005514045],"about_ca_topic_score_codex":0.9922144,"about_ca_topic_score_gemma":0.9978048,"teacher_disagreement_score":0.99450064,"about_ca_system_score_codex":0.031541213,"about_ca_system_score_gemma":0.05962195,"threshold_uncertainty_score":0.22884858},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15267174,0.0070369737,0.0010064131,0.06730653,0.002298209,0.000020252206,0.00012242365,0.00013120858,0.7694063],"genre_scores_gemma":[0.9228421,0.0017058972,0.00014108398,0.0051821694,0.00029293136,0.000022800805,0.000031675263,0.00008262493,0.069698654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988084,0.00046604036,0.0000136424505,0.000114734736,0.00021536945,0.00038177441],"domain_scores_gemma":[0.99914527,0.00034946733,0.000074653806,0.000069023015,0.000116329196,0.00024517128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086400745,0.0006081536,0.00024602682,0.0011998449,0.01649089,0.01101355,0.001099041,0.001992011,0.0056098956],"category_scores_gemma":[0.0017675337,0.00028259016,0.00021516636,0.0014987284,0.026707362,0.0044425996,0.0049819034,0.0054816864,0.0005940984],"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.00007376013,0.000040712894,0.0011304257,0.00007529186,0.000010408796,0.00073145825,0.25963655,0.00013416645,0.00042005477,0.6776071,0.05027368,0.009866315],"study_design_scores_gemma":[0.000011428983,0.000021888876,0.0024294315,0.000119793054,0.000011500642,0.0002700016,0.17579389,0.00010589822,0.0003671237,0.020930393,0.7998866,0.00005207353],"about_ca_topic_score_codex":0.0803447,"about_ca_topic_score_gemma":0.13952579,"teacher_disagreement_score":0.0803447,"about_ca_system_score_codex":0.01169893,"about_ca_system_score_gemma":0.004549529,"threshold_uncertainty_score":0.1597541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837826,0.0019062556,0.00009567957,0.003405142,0.000058735815,0.000100683355,0.0008484589,0.0000039437623,0.009798372],"genre_scores_gemma":[0.99067533,0.0042593987,0.00021701715,0.0018307857,0.00001842578,0.00007427035,0.00046215917,0.000013918806,0.0024486708],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9965257,0.00075787335,0.00014652881,0.0002942704,0.0007786723,0.0014970202],"domain_scores_gemma":[0.9925168,0.0011646561,0.00096558355,0.00029126235,0.0029431495,0.0021185502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028347864,0.00037968613,0.00057834416,0.0020043945,0.018037092,0.0049155643,0.0017119249,0.00086331286,0.0045713466],"category_scores_gemma":[0.00888097,0.00052708515,0.00048550928,0.004793078,0.003898539,0.0015465432,0.0054412694,0.0019846098,0.00032662723],"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.0001653166,0.00019880435,0.50091004,0.00042179358,0.00010043726,0.0011651977,0.45005995,0.00005593322,0.00044187,0.0027065407,0.009643746,0.03413042],"study_design_scores_gemma":[0.000018365745,0.000046155226,0.28352568,0.0007831639,0.00004888395,0.00028643885,0.69831383,0.000100951605,0.00015826095,0.0002871322,0.01636934,0.00006176494],"about_ca_topic_score_codex":0.98493296,"about_ca_topic_score_gemma":0.9914784,"teacher_disagreement_score":0.02716564,"about_ca_system_score_codex":0.02716564,"about_ca_system_score_gemma":0.0737669,"threshold_uncertainty_score":0.19710141},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038648841,0.003956217,0.00078047864,0.0683429,0.034089785,0.00039336737,0.004835415,0.0019002648,0.8818368],"genre_scores_gemma":[0.0019331004,0.00061359175,0.00011595384,0.004751043,0.0013341045,0.00003451594,0.00089179474,0.00012655735,0.99019927],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995552,0.0000371753,0.000016139276,0.000038724014,0.00027444426,0.000078376244],"domain_scores_gemma":[0.99811137,0.00028269153,0.00007670363,0.00006991262,0.000981155,0.00047814852],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008049341,0.00043321232,0.00032375794,0.00093626045,0.0023421538,0.004159312,0.0005390566,0.0026475477,0.40348834],"category_scores_gemma":[0.0033338857,0.0003179944,0.00026720422,0.0008287489,0.00027391067,0.0016424865,0.00085873576,0.002154612,0.22289811],"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.000012792833,0.000018152778,0.000060657912,0.000010842619,3.878006e-7,0.000015054735,0.00002057656,0.0000031185286,0.00004526362,0.00018258729,0.9937663,0.0058642603],"study_design_scores_gemma":[0.0000077669965,0.00001785286,0.0008850577,0.000034035806,0.0000012608901,0.000017316379,0.00012452439,0.000014403588,0.00005348725,0.0001428577,0.9986981,0.0000032954972],"about_ca_topic_score_codex":0.0076270117,"about_ca_topic_score_gemma":0.027782595,"teacher_disagreement_score":0.40348834,"about_ca_system_score_codex":0.0010125311,"about_ca_system_score_gemma":0.0017883435,"threshold_uncertainty_score":0.8508515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947661,0.0013845806,0.000060376584,0.0012714159,0.000041995616,0.000019406514,0.000033147437,0.0000032360417,0.0024196845],"genre_scores_gemma":[0.99532336,0.0016672747,0.0000630986,0.00060275086,0.000024312112,0.000031271302,0.000040523373,0.0000095045025,0.002238066],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9980546,0.0011290764,0.00007376955,0.00012821556,0.00017135373,0.00044306964],"domain_scores_gemma":[0.99688846,0.0016447465,0.0005160636,0.000104325634,0.00031119457,0.00053508667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027462244,0.00053663406,0.00091876066,0.0018548656,0.018049154,0.0069903876,0.0019610808,0.0023486027,0.002082076],"category_scores_gemma":[0.00671227,0.00084121036,0.00029433996,0.0026467268,0.014010903,0.0056060688,0.0052438984,0.0054064696,0.0003401745],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000430404,0.0000067999767,0.0014863363,0.000014966378,0.0000014994687,0.00021663468,0.9974577,0.000002208242,0.00004563728,0.00015324708,0.00014552641,0.00046508072],"study_design_scores_gemma":[5.801072e-7,0.00001232833,0.0027176507,0.000034114746,0.0000014149085,0.0000768123,0.9948323,0.0000033850117,0.000025478887,0.000028414617,0.0022644368,0.000003003763],"about_ca_topic_score_codex":0.10269171,"about_ca_topic_score_gemma":0.24316137,"teacher_disagreement_score":0.10269171,"about_ca_system_score_codex":0.0070028407,"about_ca_system_score_gemma":0.004185784,"threshold_uncertainty_score":0.20418793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959506,0.002174583,0.00048973935,0.00012621681,0.000025912474,0.000016473925,0.00047507018,0.000007613902,0.00073383324],"genre_scores_gemma":[0.9959927,0.0007421032,0.0004041602,0.00008290729,0.000027734814,0.000040110543,0.00048513678,0.000009697176,0.0022154022],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980726,0.00053880573,0.00010095139,0.0006448414,0.000371946,0.00027089237],"domain_scores_gemma":[0.99660516,0.0014339975,0.00082191534,0.00023310642,0.00062952,0.0002762769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014945164,0.0004093756,0.0007143745,0.0010504134,0.00077869865,0.0015497177,0.00049775856,0.0011249037,0.003552857],"category_scores_gemma":[0.0037714858,0.00035698083,0.0012292151,0.0012798255,0.0005309152,0.0005072221,0.00056457944,0.0008369285,0.00041900232],"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.00027222128,0.000058361384,0.9909843,0.00007155661,0.00033152226,0.00018799336,0.00058045716,0.00006441075,0.0031971273,0.00009814557,0.00012442678,0.0040293783],"study_design_scores_gemma":[0.0000031329384,0.00012664216,0.99810493,0.000017279837,0.00009971904,0.00018592253,0.00034582824,0.000134143,0.00027945515,0.0000485329,0.00064964045,0.0000046964997],"about_ca_topic_score_codex":0.028596163,"about_ca_topic_score_gemma":0.021723798,"teacher_disagreement_score":0.028596163,"about_ca_system_score_codex":0.0008434231,"about_ca_system_score_gemma":0.0009658061,"threshold_uncertainty_score":0.056859434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02679049,0.0662132,0.11554066,0.042744882,0.0007284289,0.00004646939,0.00018649102,0.00020311946,0.7475463],"genre_scores_gemma":[0.839988,0.026899878,0.026700705,0.004734914,0.0014133261,0.0002654652,0.00019382124,0.00025075203,0.09955317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966793,0.001753968,0.00009158942,0.00057874207,0.0006315524,0.00026496215],"domain_scores_gemma":[0.9965779,0.0023943756,0.00022766077,0.00035610114,0.0003062564,0.00013774207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035293668,0.0009648412,0.00076858874,0.002880903,0.0029966745,0.008130802,0.0012789335,0.0030587222,0.0139838485],"category_scores_gemma":[0.0060620164,0.0005170026,0.0011945969,0.0024080307,0.021520598,0.017874092,0.003564163,0.0052306894,0.0015627288],"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.000006242239,0.0000032865787,0.000042456413,0.000027182601,0.0000022732684,0.000014438099,0.00072671403,0.00009598995,0.000048437898,0.9964077,0.0006568599,0.00196837],"study_design_scores_gemma":[0.000008665165,0.000014264359,0.0003544127,0.000108993016,0.000008048971,0.000054172786,0.00081401,0.00061816425,0.0001843487,0.93566406,0.062160026,0.000010801985],"about_ca_topic_score_codex":0.0077409823,"about_ca_topic_score_gemma":0.0052279485,"teacher_disagreement_score":0.0139838485,"about_ca_system_score_codex":0.011078877,"about_ca_system_score_gemma":0.0027529646,"threshold_uncertainty_score":0.0803833},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047019628,0.000025142543,0.0001551195,0.00012505017,0.00003592961,0.0000821976,0.99762625,0.00015034211,0.0013298346],"genre_scores_gemma":[0.028950756,0.0003445073,0.0057785525,0.0012502624,0.0002248386,0.0034936198,0.93410444,0.0010473486,0.024805628],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.9994429,0.0001206064,0.00010708638,0.00011632101,0.00010609184,0.000107035434],"domain_scores_gemma":[0.9709354,0.024532253,0.0011091289,0.0007617064,0.0021173195,0.0005441373],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010587843,0.0012105124,0.0011859981,0.0022038827,0.0011092975,0.0016075553,0.0017125601,0.001349737,0.9202193],"category_scores_gemma":[0.034498077,0.00056615216,0.0011892153,0.0028026416,0.00022781882,0.0017433141,0.0010594865,0.00095447066,0.15473823],"study_design_candidate":"qualitative","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.00060910534,0.00013584924,0.004845116,0.0033161456,0.00007465964,0.00008992953,0.00012337642,0.00040846976,0.00006680459,0.00064684486,0.97812927,0.011554363],"study_design_scores_gemma":[0.013838642,0.0008022293,0.14333403,0.015287721,0.00072371366,0.0019441623,0.0029738494,0.0051582376,0.001026323,0.031787686,0.7826514,0.0004721],"about_ca_topic_score_codex":0.013533257,"about_ca_topic_score_gemma":0.019692162,"teacher_disagreement_score":0.9202193,"about_ca_system_score_codex":0.0010528613,"about_ca_system_score_gemma":0.001541457,"threshold_uncertainty_score":0.113797426},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004934124,0.011412237,0.023206128,0.10027938,0.068545,0.0015271107,0.09120615,0.006625358,0.6922645],"genre_scores_gemma":[0.03424604,0.0086331535,0.023815667,0.03590827,0.009633468,0.0024559004,0.07690867,0.0062418142,0.802157],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98792356,0.0027446256,0.00088705984,0.002046979,0.0053386595,0.0010592126],"domain_scores_gemma":[0.9655731,0.0051575075,0.0014516885,0.004166079,0.01997914,0.0036724657],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008505458,0.0015677856,0.0013938487,0.004526835,0.0036268441,0.008670062,0.0038713692,0.0032675082,0.4681506],"category_scores_gemma":[0.051813904,0.00053468114,0.0013781401,0.0045084376,0.0013801608,0.005815985,0.006745223,0.0040971227,0.32205603],"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.00008385762,0.000025700509,0.0007090642,0.00036866436,0.00001566612,0.00020161955,0.00065257854,0.000116459094,0.0001817528,0.01462874,0.9369567,0.046059225],"study_design_scores_gemma":[0.000009509596,0.000010858644,0.00043988458,0.0003064697,0.000006716044,0.00012411531,0.0004799127,0.000056978515,0.00008621997,0.003148571,0.9953194,0.000011420313],"about_ca_topic_score_codex":0.006252001,"about_ca_topic_score_gemma":0.006471563,"teacher_disagreement_score":0.5318494,"about_ca_system_score_codex":0.005158676,"about_ca_system_score_gemma":0.009745069,"threshold_uncertainty_score":0.75861865},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089790975,0.00218157,0.0023571926,0.00438295,0.0020638376,0.00012034803,0.0027757753,0.001154869,0.9840656],"genre_scores_gemma":[0.0039628665,0.00129484,0.0013549428,0.0010827819,0.00018050663,0.00005981561,0.0016089292,0.00046198853,0.9899933],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99729985,0.00023326802,0.00019471768,0.0007905411,0.0012044304,0.0002771931],"domain_scores_gemma":[0.99746907,0.00030092386,0.000116650175,0.00061114377,0.0012182535,0.00028406517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014274971,0.0013393046,0.0008257208,0.0029100967,0.0033411537,0.007984761,0.00207312,0.0036663848,0.6384407],"category_scores_gemma":[0.0053461865,0.0007630199,0.0007437553,0.0028184673,0.00166615,0.0063692355,0.0042078705,0.0028900427,0.49357533],"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.00008271225,0.00004315317,0.00054654316,0.00024676204,0.000008683903,0.0002372157,0.0004909691,0.00015325968,0.0004894469,0.080601715,0.732983,0.18411651],"study_design_scores_gemma":[0.0000032721102,0.000007543311,0.00017482755,0.000086430606,0.0000017967926,0.000092360155,0.000074882184,0.000042055,0.000132135,0.0023312296,0.9970481,0.000005486389],"about_ca_topic_score_codex":0.01280373,"about_ca_topic_score_gemma":0.018744461,"teacher_disagreement_score":0.36155927,"about_ca_system_score_codex":0.0040188693,"about_ca_system_score_gemma":0.005223705,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005060813,0.003776407,0.00032332184,0.036935903,0.016486034,0.00034999024,0.013119298,0.0004679534,0.9234802],"genre_scores_gemma":[0.0023436153,0.00077218836,0.00012317042,0.00093754614,0.0003420507,0.000042397056,0.0012573206,0.00006545295,0.9941163],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944156,0.000070584,0.000019738247,0.000064723725,0.0002240335,0.00017938616],"domain_scores_gemma":[0.9981907,0.000041636413,0.000041591014,0.000039728988,0.00081472506,0.00087150245],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010601332,0.0009980049,0.00034855524,0.0009329102,0.004618794,0.0031504163,0.0007817392,0.0012717636,0.46871117],"category_scores_gemma":[0.0016900357,0.00040931863,0.0002628348,0.0010831945,0.0003367847,0.00085667084,0.0015458895,0.0013564405,0.2554804],"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.000010526582,0.000015028342,0.00034496922,0.000017825132,5.595162e-7,0.000018096378,0.000059729806,0.00000977704,0.000043543674,0.00027152713,0.9905059,0.0087024635],"study_design_scores_gemma":[0.0000028722802,0.000006173182,0.0029072955,0.00004056396,7.3650835e-7,0.000010174664,0.00045367956,0.000011790407,0.00002592973,0.000054326512,0.9964837,0.0000028205964],"about_ca_topic_score_codex":0.139495,"about_ca_topic_score_gemma":0.49114034,"teacher_disagreement_score":0.53128886,"about_ca_system_score_codex":0.0045923335,"about_ca_system_score_gemma":0.010833543,"threshold_uncertainty_score":0.75781906},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005926109,0.0027688234,0.0010067172,0.057678826,0.04345853,0.0010299281,0.004424152,0.00077896414,0.882928],"genre_scores_gemma":[0.004519291,0.0003738558,0.00024076398,0.0022760134,0.00081822946,0.000044975593,0.0004797646,0.00009854058,0.9911486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986093,0.00014407357,0.00006632685,0.00028809725,0.00059077196,0.00030140262],"domain_scores_gemma":[0.9937171,0.00037513053,0.00011782283,0.00028425662,0.0039680446,0.0015375928],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012777147,0.0006744983,0.0006761792,0.00097011233,0.0049539995,0.005388527,0.0011617735,0.0036011382,0.71543497],"category_scores_gemma":[0.006624132,0.00030243056,0.00048003063,0.00061488524,0.0010807352,0.0013472494,0.0026366047,0.002021298,0.3440093],"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.000071824514,0.000024936297,0.00055483455,0.00010108605,0.000003458763,0.00023925552,0.00019586437,0.000039089544,0.00043154033,0.0019629083,0.9752618,0.021113504],"study_design_scores_gemma":[0.000009819816,0.000015884461,0.0010861775,0.000074208634,0.0000023115379,0.00007050519,0.0003204809,0.000038273723,0.0001387376,0.00023613928,0.998002,0.000005456879],"about_ca_topic_score_codex":0.03783162,"about_ca_topic_score_gemma":0.09382597,"teacher_disagreement_score":0.28456503,"about_ca_system_score_codex":0.0045719086,"about_ca_system_score_gemma":0.0089419475,"threshold_uncertainty_score":0.40589744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67742807,0.00042239472,0.12957563,0.0078109126,0.000044775163,0.0003125663,0.000043391374,0.0000939688,0.18426844],"genre_scores_gemma":[0.9936807,0.00007440477,0.0039758347,0.00009088833,0.000010935756,0.000042896998,0.0000073691576,0.000008076635,0.002108823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9939393,0.002731786,0.0002122056,0.00037835637,0.0014011962,0.0013371743],"domain_scores_gemma":[0.994911,0.0019748376,0.0011089394,0.000639261,0.00064029667,0.00072558405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053087617,0.0004087817,0.00043764073,0.0019165119,0.0031398959,0.010804522,0.0010831052,0.0016641462,0.0039596986],"category_scores_gemma":[0.009217963,0.00051267946,0.00043592346,0.0018534263,0.014322348,0.010714694,0.005689901,0.0014249004,0.00027620423],"study_design_candidate":"qualitative","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.00007429741,0.0000678548,0.016072385,0.00003953831,0.000014902212,0.00035517348,0.018285207,0.003472942,0.0011736223,0.93448645,0.00057889597,0.025378853],"study_design_scores_gemma":[0.00019027053,0.0001864534,0.03545442,0.00027991825,0.00010013212,0.0005170363,0.05487856,0.054027848,0.0017480741,0.82986504,0.022619035,0.00013319391],"about_ca_topic_score_codex":0.04148817,"about_ca_topic_score_gemma":0.03747085,"teacher_disagreement_score":0.04148817,"about_ca_system_score_codex":0.0071775313,"about_ca_system_score_gemma":0.0075029894,"threshold_uncertainty_score":0.082493365},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050185278,0.000464569,0.0064504896,0.0017475819,0.0009407021,0.0012508375,0.44184417,0.0012865061,0.4958299],"genre_scores_gemma":[0.1539765,0.00096575875,0.012371893,0.0030045293,0.00040179864,0.0019799555,0.533662,0.00064979924,0.29298773],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856037,0.00020628428,0.00020642989,0.00039775495,0.00044293457,0.0001862129],"domain_scores_gemma":[0.9979693,0.00029922277,0.00018167203,0.00040189974,0.0010035845,0.00014428128],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012004274,0.0006681758,0.0004970403,0.0021588,0.0010115679,0.0015534925,0.0008985324,0.00064739794,0.31027013],"category_scores_gemma":[0.0036803058,0.0002475081,0.00034118802,0.0020731387,0.00035871027,0.0013190743,0.001317469,0.00064763986,0.1956188],"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.0013143558,0.0005741228,0.08527408,0.00058019557,0.00008836221,0.00040788975,0.0012411057,0.0006686741,0.001768153,0.022923373,0.5546193,0.33054045],"study_design_scores_gemma":[0.00006491602,0.00016981653,0.040960878,0.00013833478,0.000024231218,0.00026918596,0.00070793804,0.0005668941,0.0007468995,0.003537249,0.95277536,0.000038201924],"about_ca_topic_score_codex":0.007701023,"about_ca_topic_score_gemma":0.008369678,"teacher_disagreement_score":0.68972987,"about_ca_system_score_codex":0.00070403685,"about_ca_system_score_gemma":0.00075242016,"threshold_uncertainty_score":0},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063199006,0.6612367,0.004608882,0.21565063,0.0040185545,0.00013066502,0.013967395,0.00037641934,0.03681177],"genre_scores_gemma":[0.31375465,0.63399535,0.019078791,0.009838324,0.0045791348,0.00038564426,0.012165369,0.00012993685,0.0060727755],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998066,0.0006359712,0.00024262496,0.000188963,0.00069154607,0.000174984],"domain_scores_gemma":[0.99496704,0.0012144672,0.00081290014,0.00022461647,0.0021987502,0.0005821348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052805347,0.00040059048,0.0005397785,0.0049432926,0.00072322466,0.0029457326,0.00067752536,0.00073670445,0.002315581],"category_scores_gemma":[0.0066423365,0.00026118834,0.00027040284,0.00979947,0.0012018656,0.0019475919,0.0015011537,0.0011967745,0.0003364748],"study_design_candidate":"observational","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.000093284456,0.000050102575,0.24423982,0.0035279046,0.00024891685,0.00033581973,0.0034904296,0.0009319487,0.0010805038,0.021803057,0.22129145,0.50290674],"study_design_scores_gemma":[0.000011372482,0.000049472936,0.5752063,0.0041976683,0.00013481485,0.00067908166,0.006085867,0.00066711975,0.00021337288,0.009481743,0.40321237,0.000060892045],"about_ca_topic_score_codex":0.15958,"about_ca_topic_score_gemma":0.22983938,"teacher_disagreement_score":0.84042,"about_ca_system_score_codex":0.0051606125,"about_ca_system_score_gemma":0.013830004,"threshold_uncertainty_score":0.3173023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51369923,0.055799752,0.0007248465,0.15040925,0.00890327,0.0004485444,0.008003768,0.00020298768,0.26180834],"genre_scores_gemma":[0.8789973,0.03616799,0.0013784845,0.024541631,0.005659882,0.00014646257,0.003519026,0.00007648733,0.04951278],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.998468,0.00029950793,0.00014957048,0.000110386325,0.00074704585,0.00022548615],"domain_scores_gemma":[0.99072534,0.0017078221,0.0009917452,0.00056762487,0.0051735207,0.0008339906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261029,0.00012343789,0.00018430823,0.00065105106,0.0008888697,0.0009878475,0.0008910788,0.00078485627,0.010178493],"category_scores_gemma":[0.012325565,0.00013375605,0.00012187788,0.0008439276,0.0006749462,0.00030618644,0.00028979563,0.00039140225,0.001062691],"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.00048155972,0.00017202657,0.37193662,0.0012056631,0.000072137926,0.0060643717,0.0031065738,0.00013382605,0.0016491124,0.0014609101,0.40354073,0.21017645],"study_design_scores_gemma":[0.000121431665,0.000394643,0.32143533,0.001346734,0.000082186794,0.009826294,0.0045248093,0.00019137781,0.0017123148,0.00031634732,0.66002,0.000028489318],"about_ca_topic_score_codex":0.40722364,"about_ca_topic_score_gemma":0.49126682,"teacher_disagreement_score":0.40722364,"about_ca_system_score_codex":0.0064821895,"about_ca_system_score_gemma":0.007671583,"threshold_uncertainty_score":0.8097067},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055850178,0.028837832,0.0024416104,0.199114,0.0028481276,0.00012527006,0.0027302927,0.00022472958,0.707828],"genre_scores_gemma":[0.34227356,0.0138940895,0.0032813926,0.0074393516,0.0006001721,0.00014039388,0.00072764675,0.00015273338,0.6314907],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905616,0.00028114827,0.00001444163,0.000121450954,0.00019045228,0.00033641665],"domain_scores_gemma":[0.9976699,0.00035002886,0.00013428864,0.0000963927,0.0005181411,0.0012311725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019438408,0.00033772868,0.0002753059,0.00067747507,0.004973396,0.0039085713,0.00063409976,0.0009890712,0.057811126],"category_scores_gemma":[0.0033867757,0.00018917173,0.00016800335,0.0009355788,0.0017990986,0.0013118739,0.002329363,0.001047002,0.002597752],"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.00022603311,0.00008649308,0.01726684,0.00029333096,0.000019888419,0.0005301917,0.0112850135,0.00038697838,0.0013638355,0.22495344,0.46988633,0.27370167],"study_design_scores_gemma":[0.000011833798,0.000012742512,0.011901531,0.0001964946,0.00000455366,0.00005526782,0.0033589792,0.00009289851,0.00024327957,0.0027889772,0.9813219,0.000011526236],"about_ca_topic_score_codex":0.61731935,"about_ca_topic_score_gemma":0.77086115,"teacher_disagreement_score":0.61731935,"about_ca_system_score_codex":0.018158453,"about_ca_system_score_gemma":0.031995572,"threshold_uncertainty_score":0.7698687},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022796309,0.0030901583,0.00037792852,0.8610651,0.07373245,0.00029943488,0.019810515,0.00065782794,0.03868689],"genre_scores_gemma":[0.015619076,0.004765207,0.0019141226,0.5344267,0.039551545,0.00057357777,0.012703945,0.00061049877,0.3898354],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99842215,0.00017143546,0.00010469741,0.00016570884,0.0008611701,0.0002748908],"domain_scores_gemma":[0.9734754,0.004951408,0.0005842737,0.0006649486,0.017862132,0.002461844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026002168,0.0005713546,0.0007706423,0.0011823096,0.0026640364,0.00213671,0.0028435315,0.00659439,0.15055865],"category_scores_gemma":[0.027803699,0.00037695147,0.0010225207,0.0020558282,0.000955192,0.0017006706,0.0014370024,0.0038512656,0.048702],"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.000009314448,0.0000036740817,0.00040257417,0.000028076625,0.0000015639481,0.000040065544,0.000033336542,0.000008560242,0.000014476928,0.00006889787,0.99699533,0.002394263],"study_design_scores_gemma":[0.000037319405,0.000013039244,0.006469244,0.00020655412,0.000011874358,0.00005441128,0.000701732,0.00007169874,0.00005843505,0.00025208975,0.9920838,0.000039759958],"about_ca_topic_score_codex":0.6361383,"about_ca_topic_score_gemma":0.71205294,"teacher_disagreement_score":0.36386168,"about_ca_system_score_codex":0.007612786,"about_ca_system_score_gemma":0.0154747935,"threshold_uncertainty_score":0.73200905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99680614,0.00014505682,0.00012604581,0.000026004625,0.000004979739,0.000026025316,0.00086548185,0.0000044410713,0.0019958748],"genre_scores_gemma":[0.9922489,0.00037642175,0.000809895,0.00009045563,0.000013327593,0.000028056927,0.0037797021,0.000008784906,0.0026444187],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99976736,0.000011441358,0.000010094902,0.000050043855,0.00009061962,0.000070439746],"domain_scores_gemma":[0.99950314,0.000035793284,0.000099694116,0.000018684064,0.0002381748,0.000104434606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019881123,0.00024122957,0.00017146245,0.0009135111,0.001374957,0.00054915616,0.0002051557,0.00021627582,0.0010408974],"category_scores_gemma":[0.00037041696,0.00013408232,0.000248321,0.0010336328,0.00032186066,0.00015499227,0.0002290354,0.0001796069,0.00022803809],"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.0003550821,0.000058519887,0.8916652,0.00008124419,0.00005878973,0.00063175266,0.0014791209,0.00029624224,0.09498816,0.00005015401,0.00051753,0.00981819],"study_design_scores_gemma":[0.0000031281982,0.000057066656,0.9965454,0.000006253387,0.000008415597,0.00014945712,0.00038272864,0.00014376866,0.0011832959,0.00000498312,0.0015120936,0.0000034588668],"about_ca_topic_score_codex":0.71546113,"about_ca_topic_score_gemma":0.8741427,"teacher_disagreement_score":0.28453887,"about_ca_system_score_codex":0.0041730115,"about_ca_system_score_gemma":0.0037987153,"threshold_uncertainty_score":0.5724291},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007891789,0.0025319292,0.004837664,0.017214665,0.024313817,0.0004915845,0.012571854,0.005750684,0.9314986],"genre_scores_gemma":[0.0032122717,0.0012778863,0.0013561432,0.0027811008,0.0017206781,0.00011048705,0.007525716,0.0013250187,0.9806908],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949733,0.00036885313,0.00021263899,0.00079166977,0.0030888568,0.0005646402],"domain_scores_gemma":[0.9887439,0.00073185604,0.0003018699,0.0021892905,0.007025004,0.0010081214],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029022165,0.0012168561,0.0010627892,0.0034360723,0.0042946283,0.013014119,0.0034357796,0.0046026483,0.7121121],"category_scores_gemma":[0.015980667,0.000689814,0.0011688119,0.003842204,0.001761183,0.0055383025,0.0044328244,0.0036811277,0.58033186],"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.000042242573,0.00001966344,0.00016542248,0.000105153835,0.0000053070153,0.00006520408,0.00011337791,0.000036869653,0.00038485142,0.009206384,0.94588715,0.043968342],"study_design_scores_gemma":[0.00000392885,0.0000044286676,0.00012759611,0.00003272511,0.0000017300918,0.000037260146,0.00003492118,0.000021301761,0.00010239043,0.0003806373,0.9992487,0.0000043989494],"about_ca_topic_score_codex":0.0543157,"about_ca_topic_score_gemma":0.049093887,"teacher_disagreement_score":0.28788787,"about_ca_system_score_codex":0.006939489,"about_ca_system_score_gemma":0.011283366,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024518045,0.0013096259,0.0003478954,0.0020622325,0.0023036737,0.0002756554,0.4610763,0.0014900197,0.53088945],"genre_scores_gemma":[0.0012955279,0.0026710788,0.00096509093,0.000690256,0.00026655718,0.00019061343,0.25437155,0.0007963755,0.73875284],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99408454,0.0001721883,0.0004433971,0.0004956198,0.0039548827,0.0008493684],"domain_scores_gemma":[0.9712993,0.0013719554,0.0006450664,0.002280647,0.022042364,0.002360779],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023036376,0.002075409,0.0024844678,0.026293045,0.007079579,0.011927424,0.0044574225,0.002199142,0.7290159],"category_scores_gemma":[0.019516906,0.0013603164,0.0012040696,0.053705227,0.0012091352,0.003910382,0.0024295405,0.0023794794,0.66827613],"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.000014051611,0.000007374664,0.00009451821,0.0001544984,0.0000021135722,0.000013243139,0.000024768662,0.000020458101,0.00004130337,0.0017881299,0.98649734,0.011342067],"study_design_scores_gemma":[0.0000048896422,0.0000017783307,0.00049214193,0.00006589545,0.0000027107644,0.000007052967,0.000025175832,0.000013357223,0.00003059529,0.00023057092,0.9991177,0.000008202585],"about_ca_topic_score_codex":0.78410107,"about_ca_topic_score_gemma":0.8077337,"teacher_disagreement_score":0.78410107,"about_ca_system_score_codex":0.024264771,"about_ca_system_score_gemma":0.08699493,"threshold_uncertainty_score":0.43434078},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012277423,0.0028560145,0.0010726011,0.0049454686,0.0027882217,0.00009788797,0.0077225463,0.0006812018,0.9786083],"genre_scores_gemma":[0.0022190264,0.0013235201,0.0005480119,0.00080367393,0.000060776107,0.00003614565,0.001391415,0.00025083503,0.99336654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913174,0.00009175456,0.000053374184,0.00024843763,0.00032039237,0.00015439001],"domain_scores_gemma":[0.9982665,0.00024545184,0.00009540133,0.0002677003,0.0007097923,0.00041501992],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00092904014,0.001056775,0.0006024144,0.0014910905,0.0027930746,0.0075256205,0.0010273771,0.0017019818,0.821476],"category_scores_gemma":[0.002473682,0.0005167363,0.00057510595,0.003097155,0.00097288267,0.0024232722,0.0037493405,0.002441045,0.63663596],"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.0001302317,0.00005542807,0.0010178345,0.00030569785,0.00001839549,0.00053545804,0.0004092572,0.0001621256,0.001632467,0.021139659,0.80253947,0.17205396],"study_design_scores_gemma":[0.0000051098486,0.000003903755,0.00049688725,0.000067900786,0.0000018333441,0.00007090694,0.00015359049,0.000025615313,0.00009721183,0.0004050466,0.9986675,0.0000044524713],"about_ca_topic_score_codex":0.058733243,"about_ca_topic_score_gemma":0.14427058,"teacher_disagreement_score":0.17852402,"about_ca_system_score_codex":0.00412077,"about_ca_system_score_gemma":0.010243422,"threshold_uncertainty_score":0.25464278},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24338865,0.0015808055,0.0016355963,0.0074102776,0.0005510226,0.00027092834,0.022570733,0.00068309816,0.72190887],"genre_scores_gemma":[0.34791827,0.0012405452,0.004584136,0.0022132471,0.00006244033,0.00013679998,0.0070660375,0.00020244854,0.63657606],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99939156,0.000024085974,0.000008930017,0.00007568619,0.00020308698,0.00029661634],"domain_scores_gemma":[0.9989919,0.00003125746,0.000039227103,0.0000406926,0.0006222774,0.00027470398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002721585,0.0003809235,0.00035881117,0.0017890875,0.012951226,0.0022491566,0.00081779447,0.00043499298,0.04435814],"category_scores_gemma":[0.0008060129,0.00027042732,0.00026611812,0.002364741,0.0009770218,0.0004493846,0.001591366,0.0010208202,0.0049793534],"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.00044159946,0.00015074828,0.123746224,0.00027515172,0.00007594369,0.0015292178,0.008114116,0.0010602406,0.0035218108,0.042243406,0.5893286,0.22951293],"study_design_scores_gemma":[0.000020350455,0.00001870725,0.17216149,0.00012511961,0.000022656808,0.00026322505,0.013147247,0.00044311106,0.00077986653,0.0012768909,0.8116998,0.000041625615],"about_ca_topic_score_codex":0.9917989,"about_ca_topic_score_gemma":0.9989856,"teacher_disagreement_score":0.04435814,"about_ca_system_score_codex":0.024770804,"about_ca_system_score_gemma":0.04391913,"threshold_uncertainty_score":0.17972559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96401936,0.0016503406,0.0011055575,0.0056654876,0.00011023912,0.00065135275,0.0001291172,0.00006702889,0.026601525],"genre_scores_gemma":[0.9700393,0.0023116295,0.0038764556,0.0025047779,0.000027639151,0.0003800929,0.00008498954,0.000053865217,0.020721179],"study_design_codex":"qualitative","study_design_gemma":"case_report","domain_scores_codex":[0.9954548,0.0018857623,0.000108493696,0.00034677563,0.00067149627,0.0015327045],"domain_scores_gemma":[0.9969842,0.00081432203,0.00022747897,0.00009692135,0.0004001275,0.0014769281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027025344,0.0008912728,0.00074818806,0.0019545523,0.01710744,0.003890274,0.0028648067,0.003438918,0.0032482448],"category_scores_gemma":[0.005734973,0.00081978017,0.00053218973,0.002223428,0.005265343,0.0015421639,0.0044424813,0.003143522,0.0008412007],"study_design_candidate":"case_report","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.00010697413,0.0021634928,0.021921327,0.00055252074,0.000023331932,0.030579481,0.8750666,0.00021725583,0.0013991772,0.005740263,0.00953391,0.052695688],"study_design_scores_gemma":[0.000052634154,0.0006999559,0.037099086,0.00048651692,0.000028519238,0.008563605,0.8780316,0.00026903913,0.0011982427,0.0008356478,0.07266588,0.000069228394],"about_ca_topic_score_codex":0.3403406,"about_ca_topic_score_gemma":0.70339257,"teacher_disagreement_score":0.3403406,"about_ca_system_score_codex":0.02241847,"about_ca_system_score_gemma":0.016714646,"threshold_uncertainty_score":0.6767192},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010317399,0.0010918389,0.0022059518,0.04057731,0.012815206,0.0030617935,0.013751168,0.0045695747,0.92089546],"genre_scores_gemma":[0.0022702434,0.000397929,0.0010693109,0.025744222,0.001501865,0.0013006814,0.0040086205,0.0011715089,0.9625357],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98930067,0.0013461242,0.0010122401,0.0005586294,0.006135678,0.0016466782],"domain_scores_gemma":[0.9819425,0.004890088,0.0008428779,0.0013467666,0.010138663,0.0008390932],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0118763205,0.001566369,0.0018801069,0.003461321,0.0050414493,0.00881452,0.0069458964,0.034039274,0.47212195],"category_scores_gemma":[0.031306878,0.0014971109,0.0019340698,0.0027078176,0.0017199945,0.00500662,0.0027907211,0.008812509,0.52214146],"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.000027214894,0.000065588865,0.00007942696,0.00006884958,0.000002283842,0.00006220384,0.00004433599,0.000048277172,0.00016504897,0.0025035746,0.9911231,0.0058100983],"study_design_scores_gemma":[0.000038227114,0.000033629498,0.000598237,0.00017926199,0.0000051789066,0.00003157934,0.0001112036,0.00007728071,0.000118974545,0.00084176206,0.99793756,0.000027039127],"about_ca_topic_score_codex":0.046670448,"about_ca_topic_score_gemma":0.06760639,"teacher_disagreement_score":0.47212195,"about_ca_system_score_codex":0.0058176313,"about_ca_system_score_gemma":0.012545936,"threshold_uncertainty_score":0.75295395},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033002996,0.0063358378,0.004875041,0.0044805487,0.0016293835,0.00033255987,0.005548953,0.0020188745,0.97444874],"genre_scores_gemma":[0.007172512,0.013291566,0.00454676,0.003524853,0.0015767772,0.0006146989,0.01324581,0.0017397669,0.95428705],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99600476,0.0007044024,0.0002557777,0.00089324283,0.001637487,0.00050438504],"domain_scores_gemma":[0.99574596,0.0009870691,0.00021567284,0.0010976685,0.0013400726,0.000613606],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0025463754,0.002090782,0.0019769168,0.0050006327,0.0023281323,0.012009358,0.005351128,0.004833622,0.7805401],"category_scores_gemma":[0.011039139,0.00054794864,0.0012328388,0.011830818,0.002392375,0.01070774,0.0054755993,0.0030688855,0.7866143],"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.00005411851,0.00009055991,0.0003282787,0.0011646501,0.00001052933,0.00010346784,0.00025737355,0.0001906069,0.0004082005,0.0471329,0.73190796,0.21835142],"study_design_scores_gemma":[0.0000067493575,0.000008656302,0.00016738109,0.00029319257,0.0000036284123,0.0000807708,0.0001003659,0.0000575214,0.00004413045,0.0059723705,0.9932574,0.000007745966],"about_ca_topic_score_codex":0.009863677,"about_ca_topic_score_gemma":0.00530512,"teacher_disagreement_score":0.21945989,"about_ca_system_score_codex":0.0044846237,"about_ca_system_score_gemma":0.0051758983,"threshold_uncertainty_score":0.31303287},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008154225,0.0045517213,0.012326187,0.5237084,0.10500623,0.0005349344,0.024426099,0.0031538655,0.31813827],"genre_scores_gemma":[0.038383275,0.0019739561,0.0072556706,0.0767543,0.005672035,0.00025852158,0.0066912784,0.001835248,0.8611756],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99559057,0.0012942614,0.00017150953,0.00065053336,0.0016816218,0.0006115534],"domain_scores_gemma":[0.9776462,0.0016213751,0.0006789247,0.0013704648,0.014859828,0.003823385],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005559502,0.0011379144,0.0009905617,0.0012285046,0.00418748,0.005196083,0.0019227517,0.0019587416,0.3105425],"category_scores_gemma":[0.034662385,0.00039232723,0.0007070818,0.0011744463,0.0012420688,0.0028564744,0.0038081969,0.0039856094,0.18618642],"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.000057662146,0.000011841905,0.0008955609,0.00006367601,0.000005615897,0.00016928995,0.0009369015,0.000064172295,0.00028412254,0.0082073985,0.9689398,0.02036401],"study_design_scores_gemma":[0.000008223948,0.000004638486,0.00056665717,0.00005096098,0.0000054649404,0.000104868835,0.0009496123,0.00012632983,0.0001621425,0.0017414655,0.9962626,0.000016934093],"about_ca_topic_score_codex":0.04366708,"about_ca_topic_score_gemma":0.062314637,"teacher_disagreement_score":0.68945754,"about_ca_system_score_codex":0.0062205167,"about_ca_system_score_gemma":0.009807682,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057053524,0.0011106743,0.00090825616,0.0034752993,0.0014661722,0.00048719416,0.25011513,0.003338827,0.73339313],"genre_scores_gemma":[0.028321326,0.0028046898,0.0017935572,0.0019745242,0.0007789746,0.00055821525,0.2359576,0.001071036,0.72674],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838364,0.00012346885,0.000084152045,0.00015200434,0.00096618646,0.00029062555],"domain_scores_gemma":[0.998069,0.000099995705,0.00021835491,0.00008617448,0.0013258337,0.00020073482],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070223265,0.0009480181,0.00039199638,0.0026552647,0.0005453416,0.0028262269,0.00062376424,0.00077384413,0.2796444],"category_scores_gemma":[0.0030974022,0.000410219,0.0004522654,0.003472327,0.00013770636,0.0011012933,0.0009766313,0.0013920439,0.24393038],"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.000042311312,0.000023070304,0.0011458257,0.00007571672,0.000004398487,0.000012581757,0.000010809308,0.000093434384,0.000078818055,0.0011849516,0.9654008,0.031927288],"study_design_scores_gemma":[0.000024675812,0.00003339876,0.014027865,0.00007876974,0.000005687069,0.000048743477,0.0000478947,0.0001495433,0.00019194381,0.00027949427,0.98510206,0.000009858138],"about_ca_topic_score_codex":0.029985152,"about_ca_topic_score_gemma":0.026340228,"teacher_disagreement_score":0.72035563,"about_ca_system_score_codex":0.0017247684,"about_ca_system_score_gemma":0.0025181642,"threshold_uncertainty_score":0.9355037},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034604374,0.24541765,0.0078066033,0.57986933,0.035500523,0.00018673459,0.0010661761,0.00051376974,0.09503483],"genre_scores_gemma":[0.179322,0.18038614,0.0071834377,0.08979954,0.0109713115,0.00025944327,0.0005911744,0.0007047138,0.5307822],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99738854,0.00076686067,0.00007842744,0.0004878484,0.0009768928,0.0003013915],"domain_scores_gemma":[0.99421656,0.0019982392,0.00037154678,0.000086931635,0.0016108825,0.0017158077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049792663,0.0007071256,0.0008984456,0.0016140091,0.0022910142,0.0034460449,0.00076033105,0.0023234454,0.016461851],"category_scores_gemma":[0.009073192,0.0005154039,0.00051329116,0.0006352639,0.0016661753,0.0018001007,0.00203869,0.0047364836,0.006972041],"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.0016846162,0.00047199978,0.015602348,0.00093917653,0.00011276842,0.0028467386,0.004457318,0.0005752015,0.0057865325,0.046896543,0.70652735,0.21409933],"study_design_scores_gemma":[0.00006636433,0.00018931636,0.008463728,0.00055597204,0.000035504618,0.0035333233,0.0012937795,0.00028876026,0.0041866084,0.0045958846,0.9766991,0.00009150534],"about_ca_topic_score_codex":0.015884783,"about_ca_topic_score_gemma":0.012839991,"teacher_disagreement_score":0.016461851,"about_ca_system_score_codex":0.002992913,"about_ca_system_score_gemma":0.005017409,"threshold_uncertainty_score":0.0550704},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878305,0.006410204,0.0009350833,0.023198241,0.000083475905,0.00026932196,0.00029358757,0.000024695675,0.1809549],"genre_scores_gemma":[0.9813395,0.0041934596,0.00091255235,0.0012074537,0.00002514255,0.00004047399,0.00006090404,0.000007339284,0.012213216],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952922,0.0009953504,0.000076420336,0.0002872923,0.0011082195,0.0022406548],"domain_scores_gemma":[0.99502087,0.0020424842,0.000526502,0.00013558181,0.0011721554,0.0011023586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003212779,0.0004717865,0.00037470754,0.0042965105,0.030685756,0.0067523383,0.0025263424,0.003976596,0.0049732714],"category_scores_gemma":[0.0077302945,0.00037101406,0.000361167,0.008751247,0.011046403,0.0024353154,0.0035701713,0.0027301046,0.00028872507],"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.0002317809,0.00056922226,0.10248304,0.00038755368,0.000026330259,0.015693674,0.4159961,0.0012475632,0.001320863,0.36777318,0.02724947,0.067021266],"study_design_scores_gemma":[0.00008487556,0.00013119132,0.08328633,0.0007079303,0.000078549994,0.0031524317,0.67144024,0.0026309765,0.0006352749,0.008908746,0.22882213,0.00012128297],"about_ca_topic_score_codex":0.98619694,"about_ca_topic_score_gemma":0.9937423,"teacher_disagreement_score":0.13235399,"about_ca_system_score_codex":0.13235399,"about_ca_system_score_gemma":0.1189332,"threshold_uncertainty_score":0.9602999},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057822615,0.0017539264,0.6244673,0.005056082,0.0011772385,0.00010284948,0.00047947027,0.0009565657,0.30818397],"genre_scores_gemma":[0.76241595,0.0014104646,0.114696465,0.0024387883,0.001131854,0.00017222793,0.00038055988,0.00071138266,0.11664234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957675,0.000053856456,0.000015891237,0.00011885036,0.00017930474,0.00005533711],"domain_scores_gemma":[0.9991448,0.00015583402,0.00007386971,0.00025394614,0.00025659386,0.00011505217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054845156,0.0004840929,0.0005201869,0.0008134968,0.0008571351,0.0019698997,0.0011282976,0.0014130857,0.011261018],"category_scores_gemma":[0.0024449157,0.00030613158,0.0006577464,0.00038446905,0.0026124688,0.0033789626,0.0013081533,0.0019340871,0.0031694074],"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.000009005737,0.0000104244245,0.00009477812,0.000025305264,0.0000024777448,0.000052785836,0.00005319376,0.0009399716,0.0020664874,0.9896951,0.0032165104,0.0038340308],"study_design_scores_gemma":[0.000012378808,0.000025396346,0.0004711864,0.000024940717,0.0000045713573,0.000347475,0.00004633625,0.036515754,0.0009708318,0.9487584,0.012800538,0.000022096418],"about_ca_topic_score_codex":0.00088424317,"about_ca_topic_score_gemma":0.000599773,"teacher_disagreement_score":0.011261018,"about_ca_system_score_codex":0.00086121814,"about_ca_system_score_gemma":0.00071071775,"threshold_uncertainty_score":0.037671864},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26453295,0.002254013,0.61305386,0.0010389234,0.00078492466,0.00043421157,0.0019386216,0.046133664,0.0698288],"genre_scores_gemma":[0.77215654,0.0003713207,0.19368763,0.0006543436,0.000073121846,0.00022813637,0.001884647,0.00043016157,0.03051422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978656,0.000026696778,0.000011805617,0.00003863879,0.00009331012,0.000043037893],"domain_scores_gemma":[0.99980634,0.000045598437,0.000024161183,0.000025168836,0.00008031477,0.00001843732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001503687,0.00037803376,0.00025696086,0.0003041948,0.00023669687,0.0004291146,0.0009765909,0.00035381634,0.009611681],"category_scores_gemma":[0.0005219934,0.00019852312,0.00017474033,0.00035284538,0.0001391488,0.00038483005,0.00028434955,0.0004953874,0.0032273878],"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.0018736009,0.00035363898,0.005456989,0.0007489666,0.00013707718,0.0010036516,0.0004886626,0.05973084,0.38716882,0.045577124,0.09847347,0.39898726],"study_design_scores_gemma":[0.00025922293,0.0016786507,0.0032511032,0.000102846796,0.000100566525,0.00080674887,0.000085948755,0.5239388,0.2908845,0.004053104,0.17473112,0.00010742437],"about_ca_topic_score_codex":0.002129739,"about_ca_topic_score_gemma":0.0022775722,"teacher_disagreement_score":0.009611681,"about_ca_system_score_codex":0.00067286886,"about_ca_system_score_gemma":0.0010501841,"threshold_uncertainty_score":0.03215432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10223343,0.00026970607,0.89137834,0.0002555597,0.00006994145,0.00020080793,0.00008067905,0.0012752345,0.004236371],"genre_scores_gemma":[0.29669487,0.00018045605,0.70033675,0.00011522068,0.000025536303,0.0002855404,0.0001906521,0.00017912276,0.0019918168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850804,0.00041206428,0.00008383393,0.00037024578,0.00047739016,0.0001484153],"domain_scores_gemma":[0.99588853,0.0026706043,0.00030174086,0.000344041,0.0006670261,0.00012795925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018338505,0.00095927285,0.0011890245,0.0019724541,0.0008457683,0.0013419867,0.0015670769,0.0019211126,0.0015846579],"category_scores_gemma":[0.010102553,0.00056866615,0.0010584353,0.001385821,0.0013173211,0.0015311715,0.0012396295,0.0014444297,0.0003772225],"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.0001384028,0.00021202756,0.0014233862,0.0001349512,0.00006956178,0.00013850686,0.00028323953,0.8127551,0.012735817,0.03637109,0.00139457,0.13434339],"study_design_scores_gemma":[0.000031547424,0.0001031577,0.00014182006,0.0000149965135,0.000017355296,0.0000569346,0.00003077584,0.9830835,0.0038046967,0.011418353,0.0012794547,0.000017512983],"about_ca_topic_score_codex":0.003882152,"about_ca_topic_score_gemma":0.0035639987,"teacher_disagreement_score":0.003882152,"about_ca_system_score_codex":0.0016462095,"about_ca_system_score_gemma":0.0020748985,"threshold_uncertainty_score":0.011944115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027815176,0.0013736157,0.94432044,0.002095193,0.00026559844,0.0006361776,0.0023440334,0.004161475,0.01698826],"genre_scores_gemma":[0.22777265,0.00065564126,0.7476645,0.00059492234,0.00014515458,0.0009838041,0.0058608036,0.0011197679,0.01520273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944633,0.00017839223,0.000029326357,0.00016247726,0.000084691834,0.00009874594],"domain_scores_gemma":[0.99695396,0.0022909227,0.00017729624,0.0002112319,0.00023722029,0.00012938246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011606766,0.0016088262,0.0011103024,0.002128663,0.0009704913,0.0016571908,0.0017789587,0.0019265139,0.022733526],"category_scores_gemma":[0.0059953094,0.00072994875,0.0010755786,0.0016571617,0.0008656902,0.0024576213,0.0017944905,0.0019272281,0.0030694064],"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.0003849757,0.0002870492,0.0019704767,0.00082624017,0.0001613822,0.00017685092,0.00034454148,0.59245676,0.0017405639,0.075263314,0.032880533,0.29350734],"study_design_scores_gemma":[0.00010641111,0.000058427322,0.0002593524,0.000048517977,0.000023115099,0.00003952859,0.00014749759,0.8784677,0.0003415674,0.11490735,0.00559094,0.000009658973],"about_ca_topic_score_codex":0.0066397167,"about_ca_topic_score_gemma":0.014740333,"teacher_disagreement_score":0.022733526,"about_ca_system_score_codex":0.0020564387,"about_ca_system_score_gemma":0.0026953507,"threshold_uncertainty_score":0.076051295},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2814496,0.007099158,0.3262702,0.00991395,0.0014843749,0.00021323263,0.0023400604,0.00163751,0.36959186],"genre_scores_gemma":[0.8497927,0.0039638127,0.048830118,0.001412773,0.0007557581,0.00020065071,0.0013436225,0.00044518174,0.09325543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950755,0.00012224236,0.000027531234,0.000091722395,0.000112691436,0.00013823766],"domain_scores_gemma":[0.99733114,0.0015123135,0.00027651797,0.00034681882,0.00022125192,0.0003119102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059808476,0.00037413609,0.0005580559,0.0011662174,0.0015224157,0.0017491366,0.000778672,0.00060624146,0.009215271],"category_scores_gemma":[0.003689323,0.00022503773,0.00043105276,0.0011684251,0.0011740023,0.0033031271,0.0015256875,0.0011846274,0.0015260988],"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.00012243025,0.000027010718,0.0005285248,0.00017237464,0.000012955991,0.00017516146,0.00021375196,0.0033559345,0.0016564252,0.9514705,0.013543171,0.028721808],"study_design_scores_gemma":[0.000021349662,0.000014681707,0.00030116306,0.000030338026,0.000019699315,0.00021216646,0.000096080395,0.011104299,0.0009959522,0.9658948,0.021298105,0.000011239178],"about_ca_topic_score_codex":0.0025979881,"about_ca_topic_score_gemma":0.0041391817,"teacher_disagreement_score":0.009215271,"about_ca_system_score_codex":0.0015361506,"about_ca_system_score_gemma":0.0010048322,"threshold_uncertainty_score":0.030828118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31084105,0.00044413176,0.680183,0.00015251809,0.000037122452,0.000120706056,0.0014126484,0.0023101089,0.004498689],"genre_scores_gemma":[0.83247775,0.0005507756,0.16238493,0.000030768468,0.000020821091,0.00012274181,0.0013924734,0.00036877557,0.0026509739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997873,0.000038093905,0.000012676836,0.00007363607,0.00006997794,0.000018431747],"domain_scores_gemma":[0.9983687,0.0008661725,0.00025802155,0.00023671496,0.00015779748,0.00011258408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038212724,0.00081924605,0.00057447917,0.001969164,0.0004895866,0.00096788973,0.00103511,0.0009958668,0.0028549428],"category_scores_gemma":[0.0032841724,0.00055518904,0.0005285426,0.0020330448,0.0007486031,0.0021311399,0.0008425962,0.000782895,0.00074967754],"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.0005402753,0.00017367824,0.018905485,0.00034548936,0.0001170409,0.0003547614,0.00035372152,0.64324737,0.09675708,0.04486601,0.0023354732,0.19200365],"study_design_scores_gemma":[0.0000064965975,0.000032109205,0.00094953924,0.000008173457,0.000007668855,0.0000713966,0.00003528397,0.973697,0.008958305,0.0155441025,0.0006725255,0.000017421033],"about_ca_topic_score_codex":0.0019158716,"about_ca_topic_score_gemma":0.0021640717,"teacher_disagreement_score":0.0028549428,"about_ca_system_score_codex":0.0005602463,"about_ca_system_score_gemma":0.0003769989,"threshold_uncertainty_score":0.00955075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47175124,0.0049781734,0.36623624,0.007798723,0.0007425861,0.00016544845,0.0025501472,0.0016458065,0.1441316],"genre_scores_gemma":[0.9555,0.0017421835,0.016068889,0.00084001996,0.00082312926,0.00037016967,0.0012466167,0.00034978706,0.02305911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808985,0.0006059583,0.00006135228,0.00022403091,0.00066125,0.00035739862],"domain_scores_gemma":[0.97539073,0.017626032,0.001335452,0.0020915589,0.0021474182,0.0014088271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025147232,0.00060479355,0.0012877837,0.0031059135,0.0014532135,0.002832158,0.0023266156,0.0017678493,0.013426222],"category_scores_gemma":[0.043441955,0.00066295645,0.0005686149,0.0018249708,0.0039950456,0.005561161,0.003215347,0.0025221822,0.0022096068],"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.00007584577,0.00003240159,0.00072349556,0.000097764205,0.000015487378,0.000056793986,0.00013214911,0.006742688,0.000626201,0.97770005,0.0073404633,0.006456584],"study_design_scores_gemma":[0.000026875585,0.00001955936,0.00073492056,0.00005960546,0.000010468682,0.0002237204,0.00008944324,0.05881862,0.0006172807,0.93683803,0.0025321895,0.000029322706],"about_ca_topic_score_codex":0.0020639158,"about_ca_topic_score_gemma":0.0017288531,"teacher_disagreement_score":0.013426222,"about_ca_system_score_codex":0.0020589707,"about_ca_system_score_gemma":0.0011877454,"threshold_uncertainty_score":0.04491514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084302603,0.020857079,0.22018035,0.002723888,0.0037889588,0.00012346501,0.00060620473,0.0028594956,0.7480175],"genre_scores_gemma":[0.018029997,0.022008233,0.12442665,0.0014806121,0.0023663545,0.0002718843,0.0009210442,0.0016963513,0.82879883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963737,0.000036440768,0.000014030959,0.00007605136,0.00020300002,0.000033018277],"domain_scores_gemma":[0.9997272,0.00011013537,0.000006810186,0.000060441133,0.000075882715,0.000019503575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026745832,0.0013229639,0.0008512614,0.00095191505,0.000784361,0.0018519863,0.0012521651,0.00072571286,0.07855388],"category_scores_gemma":[0.0010899864,0.0006742445,0.0006841019,0.002083307,0.0011177011,0.0027481879,0.0012400168,0.0024791711,0.042824317],"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.00003089315,0.000038643295,0.00006371707,0.00040215466,0.00001738945,0.00007953809,0.00014200174,0.0029598908,0.0016938288,0.36756432,0.2773702,0.34963742],"study_design_scores_gemma":[0.000006746695,0.000009320158,0.00007070196,0.000081236794,0.000006211874,0.00012742907,0.000013362942,0.0019702343,0.0007122533,0.16440864,0.8325844,0.000009509865],"about_ca_topic_score_codex":0.0010686585,"about_ca_topic_score_gemma":0.0018369972,"teacher_disagreement_score":0.07855388,"about_ca_system_score_codex":0.0011369789,"about_ca_system_score_gemma":0.0012794099,"threshold_uncertainty_score":0.26278895},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010352085,0.19457233,0.63039464,0.018255886,0.010572965,0.00045658596,0.0016015413,0.0035390707,0.13957168],"genre_scores_gemma":[0.017607903,0.22433548,0.63810056,0.008860779,0.01085583,0.0018110833,0.0026562822,0.002209673,0.09356239],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937716,0.0015689131,0.0006853364,0.00071407674,0.0030573248,0.00020283998],"domain_scores_gemma":[0.9825022,0.013434911,0.0004775495,0.001199261,0.0021254176,0.0002606003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046359124,0.002788218,0.0027510736,0.0040213396,0.0013322535,0.00689186,0.0034781531,0.0040787924,0.035210278],"category_scores_gemma":[0.016003417,0.0015150195,0.002202106,0.0064280084,0.0034903549,0.007089383,0.0026800463,0.008490644,0.022045316],"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.000029621717,0.00008338023,0.0004250448,0.0033211408,0.00015057574,0.00013347251,0.00037305776,0.010144918,0.0007837111,0.28007823,0.32233348,0.3821433],"study_design_scores_gemma":[0.000020114456,0.00004173229,0.00030601447,0.0010107015,0.000028664273,0.00037363716,0.00008979914,0.012254736,0.00035579,0.18106578,0.8044081,0.00004502935],"about_ca_topic_score_codex":0.0012934986,"about_ca_topic_score_gemma":0.0011854282,"teacher_disagreement_score":0.035210278,"about_ca_system_score_codex":0.0019132547,"about_ca_system_score_gemma":0.0050416095,"threshold_uncertainty_score":0.1177901},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13575116,0.0016461215,0.74969536,0.0010329315,0.00046060243,0.00027950003,0.001652901,0.0017105297,0.107770875],"genre_scores_gemma":[0.6830484,0.0013230438,0.2704406,0.0006570575,0.00043000857,0.00068609347,0.0020932904,0.00061559177,0.040705852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980623,0.0006076698,0.00015378313,0.00029981826,0.0005379186,0.00033842312],"domain_scores_gemma":[0.9951439,0.0024387327,0.00048663424,0.0011350076,0.00044316554,0.00035251444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014571574,0.00089479465,0.0010376475,0.0010589149,0.0009599448,0.0017580095,0.0011390755,0.001012958,0.013310029],"category_scores_gemma":[0.008017157,0.0005608933,0.000770342,0.0015216534,0.0009980885,0.002406391,0.002290053,0.0009832152,0.003990286],"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.00089018635,0.00019364367,0.0008898447,0.000649754,0.00010037166,0.00026170033,0.00035284372,0.043021988,0.0128939655,0.6711289,0.020667935,0.248949],"study_design_scores_gemma":[0.00020000506,0.0005501648,0.00069794484,0.00020753033,0.000104143925,0.0007647743,0.00019759257,0.089553215,0.01388891,0.83881366,0.054961324,0.00006071933],"about_ca_topic_score_codex":0.00038526047,"about_ca_topic_score_gemma":0.00077094714,"teacher_disagreement_score":0.013310029,"about_ca_system_score_codex":0.00078986865,"about_ca_system_score_gemma":0.001031627,"threshold_uncertainty_score":0.044526458},"labels":[],"label_agreement":null}]}