{"meta":{"query_hash":"000eb500a2c0","filters":{"venue":"Natural Computing"},"cohort_total":45,"direct_labels_cover":0,"predictions_cover":45,"exported":45,"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/000eb500a2c0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Natural+Computing"},"results":[{"id":"W1469133587","doi":"10.1007/s11047-015-9508-3","title":"Halting the hallmarks: a cellular automaton model of early cancer growth inhibition","year":2015,"lang":"en","type":"article","venue":"Natural Computing","topic":"Lattice Boltzmann Simulation Studies","field":"Engineering","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":"Middlesex London Health Unit; Western University","funders":"","keywords":"Cancer; Cancer cell; Cellular automaton; Medicine; Biology; Computational biology; Computer science; Algorithm; Internal medicine","score_opus":0.030396397982565684,"score_gpt":0.2577887319160594,"score_spread":0.2273923339334937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1469133587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851234,0.0018085003,0.010959069,0.000114984425,0.0003533078,0.00012893545,0.0000026462162,0.0003156845,0.0011934482],"genre_scores_gemma":[0.99747723,0.0000050982917,0.0022733584,0.000046170524,0.00014730198,0.0000028132997,0.0000025883162,0.000023851078,0.00002157966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990944,0.000029750268,0.0002732869,0.00012242686,0.0002739743,0.00020610951],"domain_scores_gemma":[0.9994102,0.00011376828,0.00008459653,0.00011486802,0.00023877643,0.000037783153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029111182,0.0001310044,0.00016984213,0.00005324488,0.000101670135,0.000031661464,0.000101927915,0.000054168282,0.0000011185624],"category_scores_gemma":[0.00007606783,0.000098682474,0.00005228147,0.00019761258,0.00003462443,0.00016134333,0.00009213218,0.0002504851,0.0000045492525],"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.0000061878263,0.000005054258,0.002459443,0.00007492939,0.000046766425,0.0000014028227,0.0037374438,0.98262644,0.007925818,0.0008670157,0.00039958773,0.0018499411],"study_design_scores_gemma":[0.00027203784,0.0000069527478,0.0011452477,0.000084671716,0.000017558295,0.0000010612629,0.00016798852,0.9905376,0.0071636215,0.00046876128,0.000015585902,0.00011892002],"about_ca_topic_score_codex":0.00008977677,"about_ca_topic_score_gemma":0.000011110954,"teacher_disagreement_score":0.012353814,"about_ca_system_score_codex":0.00009456969,"about_ca_system_score_gemma":0.00002322845,"threshold_uncertainty_score":0.40241545},"labels":[],"label_agreement":null},{"id":"W1968109124","doi":"10.1007/s11047-009-9144-x","title":"Modelling programmed frameshifting with frameshift machines","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","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":"University of Saskatchewan; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Translational frameshift; ENCODE; Computer science; Frameshift mutation; Translation (biology); Reading frame; Theory of computation; Open reading frame; Frame (networking); Computational biology; Gene; Messenger RNA; Biology; Genetics; Algorithm; Mutation","score_opus":0.01001756640748301,"score_gpt":0.24277800606892952,"score_spread":0.23276043966144652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968109124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18754105,0.0003733243,0.80887413,0.0013367417,0.000093020375,0.00019470246,2.8071696e-7,0.0007696521,0.0008171321],"genre_scores_gemma":[0.6742193,9.461426e-7,0.32526997,0.00037744394,0.000091404065,0.0000018769894,0.000005603031,0.0000070336164,0.00002641235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851894,0.00003270589,0.00023750652,0.00046544962,0.0003134878,0.0004319155],"domain_scores_gemma":[0.9991317,0.000100099955,0.00012869765,0.0004568559,0.000090900954,0.00009177868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020645268,0.00019492522,0.00018175208,0.00008487004,0.00037902576,0.00041186047,0.0007912773,0.0000688356,0.0000017182605],"category_scores_gemma":[0.000016873404,0.00015298203,0.00006611913,0.00066602393,0.000026897373,0.00033317733,0.00013023855,0.0004815267,0.000016849815],"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.000006420667,0.00009783439,0.00045759304,0.000015857162,0.000019601159,0.000027224085,0.0011863424,0.053781837,0.0007494587,0.100845866,0.00008739661,0.84272456],"study_design_scores_gemma":[0.00019805234,0.00005023858,0.0006966392,0.00004493478,0.000005106782,0.00003626037,0.000013541303,0.99403244,0.00044084206,0.003438118,0.0008101008,0.00023373988],"about_ca_topic_score_codex":0.000024762523,"about_ca_topic_score_gemma":0.000001811722,"teacher_disagreement_score":0.9402506,"about_ca_system_score_codex":0.00002767269,"about_ca_system_score_gemma":0.000034767814,"threshold_uncertainty_score":0.6238426},"labels":[],"label_agreement":null},{"id":"W1968724255","doi":"10.1007/s11047-014-9434-9","title":"3-color bounded patterned self-assembly","year":2014,"lang":"en","type":"article","venue":"Natural Computing","topic":"Advanced biosensing and bioanalysis techniques","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":"Mathematical proof; Completeness (order theory); Combinatorics; Bounded function; Theory of computation; Set (abstract data type); Tile; Mathematics; Discrete mathematics; Upper and lower bounds; NP-complete; Computer science; Algorithm; Time complexity; Geometry; Materials science","score_opus":0.00472871023997638,"score_gpt":0.2573590489517277,"score_spread":0.2526303387117513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968724255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919797,0.000114714756,0.0067311674,0.00015072052,0.00015824285,0.00007245404,8.7224817e-7,0.00016455592,0.00062755606],"genre_scores_gemma":[0.97462606,0.000008367719,0.023932595,0.0008115777,0.0004353414,8.0213044e-7,0.00004485168,0.000015409156,0.00012496782],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990454,0.000071348295,0.00017423512,0.00033783793,0.000121000565,0.0002501947],"domain_scores_gemma":[0.9994923,0.000022248394,0.00010030965,0.00024126892,0.000097002776,0.00004689517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022759766,0.00015087677,0.0001497242,0.00003718391,0.00014618276,0.000043114487,0.00016306304,0.0001267596,4.0162817e-7],"category_scores_gemma":[0.000081184866,0.00012556443,0.00010770104,0.00010150238,0.000029424127,0.0000028035483,0.00012820096,0.00014003548,0.0000048741545],"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.000022881917,0.000030756044,0.0012117353,0.000010843262,0.000051907722,0.0000017984866,0.000017014396,0.000008826755,0.9688184,0.00011131318,0.00070839113,0.029006086],"study_design_scores_gemma":[0.00035437522,0.0001986714,0.0027582555,0.000022652996,0.000029630324,0.00002649493,0.00001688097,0.014534055,0.9641625,0.00014279864,0.017412044,0.000341623],"about_ca_topic_score_codex":0.0000068438226,"about_ca_topic_score_gemma":0.0000122386455,"teacher_disagreement_score":0.028664464,"about_ca_system_score_codex":0.000019102908,"about_ca_system_score_gemma":0.000014476795,"threshold_uncertainty_score":0.51203686},"labels":[],"label_agreement":null},{"id":"W1983248889","doi":"10.1007/s11047-010-9190-4","title":"Quantum security in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Natural Computing","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":11,"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","keywords":"Computer science; Quantum cryptography; Cryptography; Wireless sensor network; Computer security; Wireless network; Field (mathematics); Computer network; Wireless; Quantum; Theoretical computer science; Quantum information; Telecommunications; Mathematics; Physics","score_opus":0.005907398961053407,"score_gpt":0.23534266853478714,"score_spread":0.22943526957373372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983248889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90028536,0.000047500766,0.09579232,0.00032592047,0.0020513248,0.00009727248,2.6390308e-7,0.000258266,0.0011417641],"genre_scores_gemma":[0.99284184,0.0000023510943,0.0063898056,0.00060987147,0.00014347785,9.098726e-7,0.0000028663644,0.0000050861545,0.0000037787277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988346,0.000048141064,0.00030095485,0.00023144946,0.00022062426,0.00036421465],"domain_scores_gemma":[0.99930036,0.0001236857,0.000111767426,0.00030842764,0.00008009854,0.00007564689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043744306,0.00013375674,0.0001498152,0.00017579402,0.00014472978,0.00019524331,0.00064724864,0.00010972589,0.000006180771],"category_scores_gemma":[0.000031968113,0.000120996534,0.000076553304,0.00077699823,0.000040158873,0.00046293097,0.00021758776,0.001015855,0.000022882832],"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.000012035532,0.00007684633,0.014993802,0.000031498465,0.000013083408,0.000033447355,0.0026733554,0.001385083,0.0016721791,0.8736911,0.000875881,0.1045417],"study_design_scores_gemma":[0.00024719443,0.000011078363,0.013329102,0.00001568014,6.75538e-7,0.000025478072,0.000042589905,0.98368263,0.0002113949,0.0016646959,0.00059708825,0.00017236809],"about_ca_topic_score_codex":0.000028234117,"about_ca_topic_score_gemma":0.000044155382,"teacher_disagreement_score":0.9822976,"about_ca_system_score_codex":0.000013139621,"about_ca_system_score_gemma":0.000021980331,"threshold_uncertainty_score":0.49340954},"labels":[],"label_agreement":null},{"id":"W1993527583","doi":"10.1007/s11047-010-9179-z","title":"A relation by palindromic subwords","year":2010,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","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":"Palindrome; Equivalence relation; Mathematics; Relation (database); Alphabet; Combinatorics; Equivalence class (music); Identity function; Idempotence; Combinatorics on words; Discrete mathematics; Pure mathematics; Word (group theory); Computer science; Genetics; Genome; Biology; Linguistics","score_opus":0.0033221391414186424,"score_gpt":0.21989578805717122,"score_spread":0.2165736489157526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993527583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92477024,0.00019963461,0.07087763,0.0004547903,0.0024297729,0.000065304586,5.066727e-7,0.00040029033,0.000801812],"genre_scores_gemma":[0.9729762,7.63085e-7,0.026382787,0.00033380554,0.00016287513,5.163123e-7,0.0000065313693,0.0000070514866,0.00012948185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991053,0.00003672811,0.00016686537,0.00027645612,0.00017904225,0.00023565452],"domain_scores_gemma":[0.9993552,0.00015291575,0.00008678049,0.00031656152,0.000037533904,0.000050994528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793995,0.00010370736,0.00010010437,0.00005038936,0.00017384351,0.00015383838,0.0006147126,0.00008293434,0.000010298088],"category_scores_gemma":[0.00006403525,0.00009123687,0.000049294125,0.00024108445,0.000025036523,0.00030779775,0.00020993482,0.00054109434,0.00005357749],"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.0000068753147,0.000058631205,0.004208725,0.000016179483,0.000022591496,0.000020933916,0.001092788,0.00007053722,0.24452034,0.20574412,0.0100348145,0.53420347],"study_design_scores_gemma":[0.00036170668,0.000024923655,0.017258015,0.000023101364,0.0000034071174,0.00008275538,0.000013478606,0.96294683,0.0066410843,0.00800477,0.0043315864,0.00030831472],"about_ca_topic_score_codex":0.000015964597,"about_ca_topic_score_gemma":0.0000033587735,"teacher_disagreement_score":0.9628763,"about_ca_system_score_codex":0.000016103253,"about_ca_system_score_gemma":0.000017851644,"threshold_uncertainty_score":0.37205315},"labels":[],"label_agreement":null},{"id":"W2001707131","doi":"10.1007/s11047-010-9193-1","title":"Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies","year":2010,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","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":"Academy of Finland","keywords":"Tile; Matching (statistics); Ribbon; Enhanced Data Rates for GSM Evolution; Dependency (UML); Process (computing); Computer science; Mathematics; Square (algebra); Topology (electrical circuits); Algorithm; Combinatorics; Geometry; Artificial intelligence","score_opus":0.012164872325349992,"score_gpt":0.26569957477120976,"score_spread":0.25353470244585974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001707131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5024728,0.00013857134,0.4955815,0.00036006546,0.0005908713,0.00027640065,0.000011712947,0.00020141406,0.00036666178],"genre_scores_gemma":[0.943895,6.393159e-7,0.055771064,0.0000753784,0.00019114079,0.000009515217,0.000023628243,0.0000083756995,0.000025255422],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987729,0.0000314784,0.0003196071,0.00036404547,0.00030433745,0.00020763444],"domain_scores_gemma":[0.99877876,0.00013989782,0.00015768241,0.0006396229,0.00019576676,0.00008828425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021394526,0.00012605601,0.0001864829,0.000084654996,0.00013905956,0.00011522511,0.00094906305,0.00008186663,0.0000056209797],"category_scores_gemma":[0.00009604484,0.000114091716,0.00006300203,0.0004577625,0.00002217247,0.0001796246,0.00032285345,0.00029092608,0.000053195254],"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.0000070392084,0.0001835817,0.0014589361,0.000060512866,0.000044394237,0.0000048252577,0.003115133,0.0013605059,0.54926956,0.20272289,0.0006124223,0.2411602],"study_design_scores_gemma":[0.0001417303,0.000027120672,0.010513679,0.000029051032,0.0000071641193,0.000009936384,0.000104310646,0.9696793,0.016885173,0.0008223833,0.0016007998,0.00017933702],"about_ca_topic_score_codex":0.00035810182,"about_ca_topic_score_gemma":0.00003029295,"teacher_disagreement_score":0.9683188,"about_ca_system_score_codex":0.000022177943,"about_ca_system_score_gemma":0.000065704255,"threshold_uncertainty_score":0.46525252},"labels":[],"label_agreement":null},{"id":"W2005962757","doi":"10.1007/s11047-007-9045-9","title":"On the universality of peptide computing","year":2007,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Turing machine; Theory of computation; Turing; Universality (dynamical systems); Super-recursive algorithm; Construct (python library); Computation; Theoretical computer science; Non-deterministic Turing machine; Universal Turing machine; Artificial intelligence; Algorithm; Programming language","score_opus":0.012729422730591775,"score_gpt":0.26377731716144015,"score_spread":0.25104789443084835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005962757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882561,0.00016935456,0.0061218757,0.00012048997,0.00025109306,0.00009913009,0.0000011629285,0.000024059484,0.004956756],"genre_scores_gemma":[0.99785364,0.0000015258581,0.0011560175,0.0006042085,0.00028829792,5.041514e-8,0.00001358364,0.0000074445666,0.00007522534],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895173,0.00008996957,0.00025260547,0.00025892546,0.00015013742,0.0002966341],"domain_scores_gemma":[0.9991624,0.00032791967,0.00016011272,0.00020852358,0.0001006488,0.00004042723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010486771,0.00013211078,0.00013450724,0.000027550062,0.00018920802,0.000013602878,0.0003027125,0.00009993671,0.0000048484508],"category_scores_gemma":[0.00034284953,0.00008321281,0.00011727968,0.00015463796,0.00010440356,0.000001447954,0.0002636572,0.00025889758,0.0000036588776],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003372187,0.00013455377,0.017532445,0.00004223932,0.000127739,0.000018017272,0.00023714545,0.0015151132,0.87682146,0.020457236,0.0020872327,0.08068958],"study_design_scores_gemma":[0.0017806191,0.0015747874,0.23038115,0.00031072597,0.000045992812,0.00006954946,0.0014939676,0.023680594,0.7264997,0.0016198155,0.011321869,0.0012212709],"about_ca_topic_score_codex":0.000014314253,"about_ca_topic_score_gemma":0.0000057725683,"teacher_disagreement_score":0.2128487,"about_ca_system_score_codex":0.000015145789,"about_ca_system_score_gemma":0.000015806232,"threshold_uncertainty_score":0.339332},"labels":[],"label_agreement":null},{"id":"W2007613090","doi":"10.1007/s11047-013-9403-8","title":"Reachability bounds for chemical reaction networks and strand displacement systems","year":2013,"lang":"en","type":"article","venue":"Natural Computing","topic":"Advanced biosensing and bioanalysis techniques","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Reachability; Theory of computation; Computer science; Sequence (biology); Displacement (psychology); Algorithm; Mathematics; Topology (electrical circuits); Theoretical computer science; Combinatorics; Biology; Genetics","score_opus":0.006002088872680025,"score_gpt":0.26049196600453944,"score_spread":0.25448987713185944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007613090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98166084,0.0006302332,0.01712052,0.000076910146,0.00012423145,0.00029876988,0.0000020398577,0.00003597466,0.00005046555],"genre_scores_gemma":[0.9961459,0.000020985317,0.0032654263,0.000052500232,0.00031816014,0.0000072454445,0.00010411334,0.000008299003,0.0000773801],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992922,0.000025439822,0.00016553092,0.00027976572,0.00006330105,0.00017379581],"domain_scores_gemma":[0.99961865,0.000027399998,0.000075413656,0.00013352,0.000103190265,0.000041830914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018174149,0.00010864829,0.00012392,0.000014846867,0.00010027439,0.000052155283,0.00004962161,0.00012170085,1.1635124e-7],"category_scores_gemma":[0.000050939783,0.00008698959,0.000055140943,0.00004017169,0.000052351043,0.000004623234,0.000051676798,0.000102705744,1.397492e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042799154,0.00001721284,0.00045271587,0.000027601769,0.000034256034,1.1942586e-7,0.000007168038,0.000052441064,0.9756363,0.000027990503,0.00053728156,0.0231641],"study_design_scores_gemma":[0.0016482187,0.0006190409,0.0055955388,0.00016163503,0.00013396429,0.00008766286,0.00035223673,0.47662672,0.50327766,0.00029358806,0.010181534,0.0010221814],"about_ca_topic_score_codex":0.00003883192,"about_ca_topic_score_gemma":0.0000036271065,"teacher_disagreement_score":0.47657427,"about_ca_system_score_codex":0.000020659885,"about_ca_system_score_gemma":0.000005943255,"threshold_uncertainty_score":0.35473326},"labels":[],"label_agreement":null},{"id":"W2013089631","doi":"10.1007/s11047-004-3591-1","title":"DNA and quantum based algorithms for VLSI circuits testing","year":2005,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Very-large-scale integration; Computer science; Algorithm; DNA computing; Theory of computation; Electronic circuit; Test vector; Parallel computing; Computer engineering; Computation; Embedded system; Engineering; Artificial intelligence","score_opus":0.03375845069028024,"score_gpt":0.28606512766318987,"score_spread":0.25230667697290965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013089631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816096,0.001133822,0.016243925,0.00022990942,0.00024075978,0.00019546323,0.0000048092547,0.00005785996,0.0002838951],"genre_scores_gemma":[0.97348577,0.0000017790057,0.024351094,0.00086639385,0.0011861272,0.0000023702364,0.00005062811,0.000014296735,0.000041534095],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989156,0.000038396352,0.00020974546,0.00040322632,0.000082777566,0.00035023247],"domain_scores_gemma":[0.99943864,0.00016161909,0.00009160149,0.00011783005,0.00012114432,0.00006914343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031401403,0.00016368467,0.00015037665,0.000028484164,0.00023916355,0.00004962871,0.00014719399,0.00013269206,0.0000012522833],"category_scores_gemma":[0.0004689346,0.00013463844,0.000070619986,0.00009425746,0.00004755229,0.0000036554127,0.00012978574,0.00014337603,0.0000016864083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015477704,0.000024901392,0.0020142233,0.000027374585,0.000015528221,0.0000013351367,0.0000148632,0.00036308888,0.54378045,0.00007525978,0.00023655043,0.45343095],"study_design_scores_gemma":[0.0014941165,0.0006243224,0.010019751,0.00008215888,0.000022903716,0.00004812007,0.000040437542,0.83322376,0.13552031,0.00014977563,0.018150548,0.00062382594],"about_ca_topic_score_codex":0.0000033377914,"about_ca_topic_score_gemma":0.0000022098154,"teacher_disagreement_score":0.83286065,"about_ca_system_score_codex":0.000012343487,"about_ca_system_score_gemma":0.000025926816,"threshold_uncertainty_score":0.54903966},"labels":[],"label_agreement":null},{"id":"W2022184750","doi":"10.1007/s11047-006-9025-5","title":"Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge","year":2006,"lang":"en","type":"article","venue":"Natural Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"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":"Theory of computation; Adaptation (eye); Ridge; Computer science; Mathematics; Statistical physics; Algorithm; Physics; Geology; Paleontology","score_opus":0.02355873132136673,"score_gpt":0.27680781757727196,"score_spread":0.25324908625590525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022184750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05377399,0.00014961364,0.9416684,0.00070545473,0.0002374414,0.00032313782,0.0000018062715,0.00018889137,0.0029512998],"genre_scores_gemma":[0.8978916,0.0000012733981,0.10165988,0.00008370234,0.00018378271,0.0000048669976,0.0000102789145,0.000010168419,0.00015446999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793875,0.00030040773,0.00025480072,0.00038780528,0.0007690572,0.0003492023],"domain_scores_gemma":[0.99841017,0.0006452051,0.00017463522,0.000362897,0.00036616335,0.0000409416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054749654,0.00017530417,0.00014785663,0.0001391422,0.00046011177,0.0004541008,0.00059003656,0.00004920827,0.000006302325],"category_scores_gemma":[0.00011487561,0.00010959593,0.00003998476,0.0008576484,0.00008010437,0.00047321426,0.00012828218,0.00044262942,0.00003879786],"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.000017990486,0.000040361265,0.00013527808,0.0000073023916,0.000015529498,0.000007973301,0.00038785915,0.51394343,0.00005546758,0.47253188,0.0003795679,0.012477368],"study_design_scores_gemma":[0.00028818767,0.000081814935,0.014443968,0.000029121968,0.0000036672911,0.000008674025,0.0001958212,0.9827935,0.00010758205,0.0017286652,0.00017050997,0.00014847345],"about_ca_topic_score_codex":0.00025352804,"about_ca_topic_score_gemma":0.000037190806,"teacher_disagreement_score":0.8441176,"about_ca_system_score_codex":0.00012136357,"about_ca_system_score_gemma":0.00014673387,"threshold_uncertainty_score":0.44691923},"labels":[],"label_agreement":null},{"id":"W2026643052","doi":"10.1007/s11047-009-9173-5","title":"Flocking based approach for data clustering","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Cluster analysis; Computer science; Particle swarm optimization; Fuzzy clustering; Correlation clustering; CURE data clustering algorithm; Data mining; Canopy clustering algorithm; Artificial intelligence; Consensus clustering; Machine learning","score_opus":0.0709870533393512,"score_gpt":0.3606660983964147,"score_spread":0.28967904505706354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026643052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071461016,0.00025706974,0.9970004,0.00052363623,0.00035751256,0.00033069582,0.0000026907676,0.000440903,0.0003724908],"genre_scores_gemma":[0.4716772,3.7453853e-7,0.5277918,0.00029087707,0.00017724876,0.0000014484681,0.000026642301,0.0000079852125,0.000026410658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780595,0.000055492583,0.0002652548,0.00081741373,0.00041475185,0.00064114854],"domain_scores_gemma":[0.99815255,0.00029288378,0.00009496393,0.0012261564,0.0001372801,0.00009613753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007515574,0.00018643896,0.00020835093,0.0001399757,0.0003859438,0.000331029,0.0030126697,0.000065218905,5.4682647e-7],"category_scores_gemma":[0.00026141573,0.00017798136,0.000058463123,0.00048111257,0.000022528517,0.00066060503,0.0012426499,0.00040504494,0.0000025300367],"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.00001405277,0.00003386739,0.000015278209,0.000045613648,0.000008041865,0.000007640487,0.00009770853,0.104177125,0.0013784551,0.0005144924,0.00019706422,0.89351064],"study_design_scores_gemma":[0.00049227226,0.000060793765,0.0001854121,0.000036879523,0.00000220189,0.000020562265,0.000009965728,0.9976449,0.0005033428,0.00021473732,0.0006046546,0.00022428729],"about_ca_topic_score_codex":0.000005524078,"about_ca_topic_score_gemma":7.802248e-7,"teacher_disagreement_score":0.8934678,"about_ca_system_score_codex":0.000094719886,"about_ca_system_score_gemma":0.000060005666,"threshold_uncertainty_score":0.7257869},"labels":[],"label_agreement":null},{"id":"W2031426449","doi":"10.1007/s11047-012-9329-6","title":"Extended Watson–Crick L systems with regular trigger languages and restricted derivation modes","year":2012,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Watson; Recursively enumerable language; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Morphism; Theory of computation; Regular language; Mathematics; Recursively enumerable set; Context (archaeology); Computer science; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Theoretical computer science; Automaton","score_opus":0.009170351526350288,"score_gpt":0.2609547408258283,"score_spread":0.25178438929947805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031426449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98987156,0.0071425103,0.0022271054,0.000053039377,0.00011516162,0.00014538053,0.0000012596898,0.00004965674,0.00039430129],"genre_scores_gemma":[0.9968473,0.000020516016,0.0022544987,0.00009554218,0.0005379139,0.0000017997806,0.00006552638,0.000012048229,0.00016486882],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990717,0.00008891743,0.00015840984,0.000247732,0.0001140606,0.0003191739],"domain_scores_gemma":[0.99958664,0.000037044418,0.0000928295,0.00013757707,0.00007533669,0.00007054477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017848608,0.00014938373,0.00014522321,0.0000330514,0.00014597115,0.00004924463,0.00009549685,0.00012733458,8.4826894e-7],"category_scores_gemma":[0.000094670744,0.00009821532,0.00003118783,0.00012258902,0.00004523396,0.000008728386,0.0001183401,0.00014200987,0.0000011778217],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016875859,0.00006997282,0.026110724,0.00007639475,0.00009218108,0.000008599021,0.00012891628,0.00034224289,0.94252974,0.0007832107,0.0005293397,0.029159937],"study_design_scores_gemma":[0.004113514,0.0017172244,0.60802865,0.00045066315,0.00016868148,0.0008896013,0.0026189692,0.07166837,0.29159248,0.0000955621,0.016272524,0.0023837737],"about_ca_topic_score_codex":0.000017433234,"about_ca_topic_score_gemma":8.824793e-7,"teacher_disagreement_score":0.65093726,"about_ca_system_score_codex":0.000011763785,"about_ca_system_score_gemma":0.000010094378,"threshold_uncertainty_score":0.40051046},"labels":[],"label_agreement":null},{"id":"W2046272485","doi":"10.1007/s11047-010-9234-9","title":"The effect of malformed tiles on tile assemblies within the kinetic tile assembly model","year":2010,"lang":"en","type":"article","venue":"Natural Computing","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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","funders":"Indian Institute of Science","keywords":"Tile; Proofreading; Computer science; Process (computing); Set (abstract data type); Biological system; Algorithm; Biology; DNA; Materials science; Programming language; Genetics","score_opus":0.006886428977592003,"score_gpt":0.23756746145589933,"score_spread":0.23068103247830732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046272485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99241775,0.0002873953,0.003347239,0.000058668338,0.0012009466,0.00021609192,0.000001587319,0.00012817963,0.002342116],"genre_scores_gemma":[0.9990352,0.000006246469,0.00063883455,0.0000281961,0.00013875523,0.000004905122,0.0000025013662,0.000025897538,0.0001194819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990293,0.000040894665,0.00025776948,0.00014518519,0.00026425207,0.00026260613],"domain_scores_gemma":[0.9987859,0.0007288152,0.0000739234,0.00033060415,0.000047357247,0.000033395645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052780216,0.00018222684,0.00017867921,0.00003808997,0.00024411804,0.00008024939,0.00044065987,0.000084662235,0.0000042080883],"category_scores_gemma":[0.00017393524,0.00009085998,0.00008562395,0.00013510256,0.000067544934,0.00005084246,0.00006999137,0.0007709821,0.000015810565],"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.000021251468,0.000006162067,0.00018007122,0.000065379114,0.00003856639,0.0000016426421,0.00038687742,0.87875104,0.06858515,0.0038419608,0.0006832604,0.047438633],"study_design_scores_gemma":[0.00007847385,0.000059850292,0.00067961623,0.000037965725,0.00000943688,0.00000629168,0.00002093158,0.88062614,0.118077576,0.00010789619,0.00019757287,0.00009825055],"about_ca_topic_score_codex":0.000014825192,"about_ca_topic_score_gemma":0.000048117166,"teacher_disagreement_score":0.04949243,"about_ca_system_score_codex":0.000016078535,"about_ca_system_score_gemma":0.000010188005,"threshold_uncertainty_score":0.37051627},"labels":[],"label_agreement":null},{"id":"W2048812146","doi":"10.1007/s11047-014-9454-5","title":"How to re-use a one-time pad safely and almost optimally even if P = NP","year":2014,"lang":"en","type":"article","venue":"Natural Computing","topic":"Quantum Information and Cryptography","field":"Computer Science","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":"Université de Montréal","funders":"","keywords":"Eavesdropping; Computer science; Key (lock); Encryption; Quantum key distribution; Channel (broadcasting); Computer network; Ciphertext; Quantum cryptography; Key encapsulation; Quantum; Adversary; Key distribution; Theoretical computer science; Computer security; Quantum information; Public-key cryptography; Physics; Quantum mechanics","score_opus":0.012307913710113725,"score_gpt":0.2228048829865899,"score_spread":0.21049696927647618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048812146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55705255,0.00009828838,0.42988953,0.009385298,0.0005110557,0.00031364145,0.0000020187686,0.0005430598,0.0022045665],"genre_scores_gemma":[0.85257566,0.0000016701713,0.14416523,0.0030298468,0.000093167386,0.0000012611276,0.0000037350667,0.0000076201195,0.00012180314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998629,0.00008381453,0.00024460058,0.0003334029,0.00034259426,0.00036659976],"domain_scores_gemma":[0.9989204,0.0002431549,0.00013213651,0.00036759168,0.00015896544,0.00017776295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044946978,0.00017956879,0.0002088571,0.00019351966,0.00027042508,0.0009886777,0.00062268815,0.00007124643,0.0000036276797],"category_scores_gemma":[0.00022159608,0.0001616893,0.00007215538,0.00055297907,0.00003455349,0.0010787912,0.00047125944,0.00026764668,0.000064596374],"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.00007272199,0.00012493976,0.0065018176,0.00014019619,0.0001462495,0.000014883688,0.011242178,0.0017976509,0.010998685,0.20923494,0.017014906,0.7427108],"study_design_scores_gemma":[0.00057307474,0.00020615019,0.037415616,0.000091585855,0.000007450442,0.000039669307,0.00004677524,0.9343167,0.0005337658,0.0007884027,0.025472466,0.0005083692],"about_ca_topic_score_codex":0.000012064279,"about_ca_topic_score_gemma":0.000002536731,"teacher_disagreement_score":0.932519,"about_ca_system_score_codex":0.000021437687,"about_ca_system_score_gemma":0.000018963097,"threshold_uncertainty_score":0.95338416},"labels":[],"label_agreement":null},{"id":"W2065715262","doi":"10.1007/s11047-013-9368-7","title":"Generation of classification trees from variable weighted features","year":2013,"lang":"en","type":"article","venue":"Natural Computing","topic":"Data Mining Algorithms and Applications","field":"Computer Science","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":"Simon Fraser University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Phylogenetic tree; Trait; Constraint (computer-aided design); Tree (set theory); Consistency (knowledge bases); Computer science; Theory of computation; Family tree; Artificial intelligence; Machine learning; Theoretical computer science; Biology; Mathematics; Combinatorics; Algorithm; Genetics; Gene","score_opus":0.03415689047719922,"score_gpt":0.2655480904786237,"score_spread":0.2313912000014245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065715262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3027301,0.00037917146,0.6943437,0.0008136738,0.00047388775,0.00019069981,0.00001094978,0.00017794849,0.0008799085],"genre_scores_gemma":[0.6214295,0.000001824499,0.3781925,0.000071313494,0.0001486965,0.0000041838207,0.00008303341,0.000003080097,0.00006581853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991825,0.000034368597,0.00020878408,0.00027563772,0.00016599969,0.00013271117],"domain_scores_gemma":[0.99918675,0.00011101951,0.00014492223,0.00036455193,0.00015829263,0.000034472374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010134212,0.00008494516,0.00010810258,0.000052046318,0.00013674499,0.00017451616,0.0005074826,0.00005272384,0.00001427049],"category_scores_gemma":[0.000029420007,0.00007234881,0.000026866814,0.0003407545,0.000019551648,0.00042926756,0.00013324799,0.00013666926,0.000027496377],"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":[7.1115994e-7,0.000050921608,0.00032911132,0.000004883851,0.000023163942,2.4885307e-7,0.00039770367,0.00012276902,0.25494424,0.070835695,0.012432673,0.66085786],"study_design_scores_gemma":[0.00010118076,0.000010919391,0.03959621,0.0000141659375,0.000003691079,0.0000015112912,0.000020328744,0.94978416,0.007995626,0.0017993818,0.0005816422,0.00009116162],"about_ca_topic_score_codex":0.0005155662,"about_ca_topic_score_gemma":0.0000073898377,"teacher_disagreement_score":0.94966143,"about_ca_system_score_codex":0.000020734837,"about_ca_system_score_gemma":0.000024683775,"threshold_uncertainty_score":0.29502988},"labels":[],"label_agreement":null},{"id":"W2068191214","doi":"10.1007/s11047-011-9293-6","title":"Programming and evolving physical self-assembling systems in three dimensions","year":2011,"lang":"en","type":"article","venue":"Natural Computing","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Computer science; Component (thermodynamics); Process (computing); Exploit; Set (abstract data type); Physical system; Engineering design process; Mechanical engineering; Engineering; Programming language","score_opus":0.02138716639666881,"score_gpt":0.23601405462435895,"score_spread":0.21462688822769013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068191214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98538053,0.0030904824,0.01019937,0.0000025152533,0.00048085378,0.00016952258,1.5074622e-7,0.0003624528,0.0003141291],"genre_scores_gemma":[0.9898011,0.0000085679585,0.010044646,0.0000039447123,0.00011442909,0.0000028640154,6.729775e-7,0.000021955866,0.0000018083871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917775,0.000017726425,0.00018990516,0.00018966311,0.00011707061,0.00030788803],"domain_scores_gemma":[0.9997,0.000070092574,0.00002671069,0.00011303041,0.00003667206,0.000053454765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001604784,0.00014104926,0.00018160953,0.00008359645,0.00008950191,0.00006079504,0.00010342552,0.00005311769,9.87967e-7],"category_scores_gemma":[0.000018423154,0.00012683046,0.000030547424,0.00019038701,0.000012041378,0.00012489286,0.00007385927,0.0003591606,0.0000045566258],"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.000022891472,0.0003476286,0.12429434,0.0015878516,0.0003216557,0.00035074685,0.038608238,0.20602168,0.0341271,0.023321092,0.000070853384,0.57092595],"study_design_scores_gemma":[0.00007646771,0.000018639988,0.00932368,0.00015982609,0.000006959938,0.00001805193,0.00015939187,0.9893338,0.0005934537,0.00011682803,0.000020029716,0.00017286686],"about_ca_topic_score_codex":0.00012430552,"about_ca_topic_score_gemma":0.000025642881,"teacher_disagreement_score":0.78331214,"about_ca_system_score_codex":0.000047667,"about_ca_system_score_gemma":0.000005302005,"threshold_uncertainty_score":0.51719964},"labels":[],"label_agreement":null},{"id":"W2069227582","doi":"10.1007/s11047-004-2638-7","title":"Biomolecular swarms – an agent-based model of the lactose operon","year":2004,"lang":"en","type":"article","venue":"Natural Computing","topic":"Gene Regulatory Network Analysis","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":"University of Calgary","funders":"","keywords":"Theory of computation; Operon; Computer science; Biochemical engineering; Computational biology; Chemistry; Biology; Engineering; Biochemistry; Algorithm","score_opus":0.011513166261984002,"score_gpt":0.24892667939046695,"score_spread":0.23741351312848294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069227582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97662216,0.0006761152,0.022341507,0.00010527652,0.000108039705,0.00009318796,0.0000024848475,0.00001248415,0.000038715945],"genre_scores_gemma":[0.99592155,0.000002695661,0.003569984,0.00032311145,0.000096861666,7.528542e-7,0.000036316982,0.000017909268,0.000030803614],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990927,0.000062386185,0.0001839542,0.00027505128,0.00018004567,0.00020584355],"domain_scores_gemma":[0.99929255,0.000003681371,0.00011092061,0.0004542811,0.00008742514,0.000051158026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001505624,0.00013454369,0.00012925033,0.000030858508,0.000119743556,0.0000146589055,0.00034723303,0.00010315411,0.0000012763862],"category_scores_gemma":[0.000023992052,0.000098822,0.00018429024,0.00017814114,0.00007170776,0.0000026960024,0.0001444131,0.00011180127,0.0000011308811],"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.0000088554925,0.000022383108,0.0003390956,0.000005073521,0.000022968283,4.354956e-7,0.000016941995,0.43194726,0.5667897,0.000025821702,0.000013451095,0.0008080188],"study_design_scores_gemma":[0.0004656029,0.000056421883,0.00090912095,0.00001833835,0.00003551032,0.0000026765954,0.000017641998,0.28998598,0.70822823,0.00006515461,0.00007053204,0.00014477712],"about_ca_topic_score_codex":0.000020920674,"about_ca_topic_score_gemma":0.000035037938,"teacher_disagreement_score":0.14196129,"about_ca_system_score_codex":0.000025147143,"about_ca_system_score_gemma":0.000093885166,"threshold_uncertainty_score":0.4029844},"labels":[],"label_agreement":null},{"id":"W2076251080","doi":"10.1007/s11047-013-9374-9","title":"Solving the parity problem in one-dimensional cellular automata","year":2013,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","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":"University of Ottawa","funders":"","keywords":"Theory of computation; Conjecture; Parity (physics); Cellular automaton; Correctness; Mathematics; RADIUS; Existential quantification; Combinatorics; Discrete mathematics; Computer science; Algorithm; Physics","score_opus":0.014755651990404803,"score_gpt":0.22995825035915582,"score_spread":0.21520259836875102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076251080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8918076,0.0007718662,0.09610461,0.0077808835,0.00042859573,0.0008709482,7.6307845e-7,0.0006690183,0.0015656847],"genre_scores_gemma":[0.93107504,9.067853e-7,0.068371035,0.0003646369,0.00009258995,0.000013275322,0.0000060979464,0.0000071630234,0.00006923264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857575,0.000085027285,0.00029058344,0.00037244457,0.00030849242,0.00036770682],"domain_scores_gemma":[0.9989909,0.00023834081,0.00010168391,0.00053914,0.00007679824,0.00005315507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043314224,0.00013264606,0.0001389406,0.000063604646,0.00034665523,0.0003100884,0.0010629531,0.000056778266,0.000013357419],"category_scores_gemma":[0.000029645926,0.00009821973,0.00005904919,0.000502263,0.000042752927,0.00037477192,0.0007625445,0.0004501937,0.00021161398],"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.000004489995,0.0006828651,0.006375078,0.00013993583,0.00007928471,0.000042210013,0.0040343693,0.007744664,0.19829085,0.24199896,0.012182272,0.52842504],"study_design_scores_gemma":[0.00017386701,0.0000072809407,0.020403417,0.000038102437,0.0000021920303,0.000011881845,0.000014038293,0.9711572,0.0020650115,0.005363146,0.0006096186,0.00015427946],"about_ca_topic_score_codex":0.00026078432,"about_ca_topic_score_gemma":0.000015215181,"teacher_disagreement_score":0.9634125,"about_ca_system_score_codex":0.00005127743,"about_ca_system_score_gemma":0.000045328907,"threshold_uncertainty_score":0.40052843},"labels":[],"label_agreement":null},{"id":"W2077823020","doi":"10.1007/s11047-013-9364-y","title":"Computing maximal Kleene closures that are embeddable in a given subword-closed language","year":2013,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Closure (psychology); Regular language; Computer science; Set (abstract data type); Property (philosophy); Characterization (materials science); Discrete mathematics; Coding (social sciences); DNA computing; Mathematics; Algorithm; Theoretical computer science; Automaton; Programming language","score_opus":0.011136271938677993,"score_gpt":0.2531903348998224,"score_spread":0.2420540629611444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077823020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954968,0.0019977388,0.00048859353,0.0003122522,0.00033247808,0.00031100135,0.0000030395397,0.00008252472,0.00097553874],"genre_scores_gemma":[0.9944284,0.000007699237,0.004048761,0.0006398392,0.00058083737,0.000002735056,0.00008355664,0.000026093448,0.00018207979],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99796873,0.00017430684,0.00036049777,0.0006051566,0.00020035838,0.0006909554],"domain_scores_gemma":[0.99922925,0.00009167317,0.00021635988,0.00026841345,0.000095712305,0.00009859849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003745962,0.0002991724,0.00033646153,0.00008162487,0.00018354703,0.000116763746,0.00041542097,0.00024788635,0.000028579889],"category_scores_gemma":[0.00018230172,0.00024378896,0.00015032271,0.00023326265,0.000071249255,0.000011536405,0.0005411,0.00046634075,0.000035374964],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107621534,0.00017512335,0.30542892,0.00010356674,0.000088069,0.0000962305,0.00045012662,0.0014854019,0.593735,0.000087027416,0.0022144094,0.09602851],"study_design_scores_gemma":[0.0025263396,0.00046247125,0.8155857,0.00037559503,0.00002235866,0.000111609246,0.0019713382,0.065341264,0.10972911,0.00029596823,0.002126277,0.0014520055],"about_ca_topic_score_codex":0.0002482296,"about_ca_topic_score_gemma":0.0000745109,"teacher_disagreement_score":0.51015675,"about_ca_system_score_codex":0.000035673223,"about_ca_system_score_gemma":0.000033060634,"threshold_uncertainty_score":0.9941426},"labels":[],"label_agreement":null},{"id":"W2092200144","doi":"10.1007/s11047-009-9135-y","title":"Representation before computation","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"Philosophy and History of Science","field":"Arts and Humanities","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 Fredericton","funders":"","keywords":"Theory of computation; Computation; Representation (politics); Computer science; Computational model; Formalism (music); Theoretical computer science; Object (grammar); Artificial intelligence; Algorithm","score_opus":0.04148601961744935,"score_gpt":0.28021842408975045,"score_spread":0.2387324044723011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092200144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.710674,0.00023396505,0.0005323695,0.002979531,0.00195934,0.000133292,0.0000016690751,0.0002980298,0.2831878],"genre_scores_gemma":[0.9972079,1.8255274e-7,0.0005129289,0.00074265414,0.0007770115,1.3567059e-7,0.000010461337,0.0000023284588,0.00074644247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945945,0.000016350494,0.000116836534,0.00013998021,0.00015225926,0.00011510046],"domain_scores_gemma":[0.9997658,0.000021584798,0.00006422234,0.000052541538,0.00007142762,0.000024385095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008875097,0.000059668444,0.00007240837,0.000056997407,0.0005240666,0.00009942505,0.00009403544,0.000014031822,0.000034754306],"category_scores_gemma":[0.000017989338,0.00005306597,0.000039233397,0.000047546444,0.000086992215,0.00027850282,0.000011547392,0.00011754005,0.000038339218],"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.0000138991145,0.000038734153,0.00007690229,0.0000074605864,0.000005871683,0.000007064479,0.04101047,0.00045541354,0.0005215886,0.60084075,0.005731292,0.35129058],"study_design_scores_gemma":[0.0015332501,0.0010827279,0.053944413,0.00021515277,0.000046218778,0.000046716406,0.004130786,0.27848235,0.00039577304,0.53352404,0.12545568,0.0011429236],"about_ca_topic_score_codex":0.000019692805,"about_ca_topic_score_gemma":0.000023924938,"teacher_disagreement_score":0.35014766,"about_ca_system_score_codex":0.000029093928,"about_ca_system_score_gemma":0.000006831546,"threshold_uncertainty_score":0.40307498},"labels":[],"label_agreement":null},{"id":"W2092820948","doi":"10.1023/b:naco.0000006770.91995.ec","title":"Algorithms for testing that sets of DNA words concatenate without secondary structure","year":2003,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Set (abstract data type); Theory of computation; Computer science; Algorithm; Nucleic acid secondary structure; Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; RNA; Genetics; Biology","score_opus":0.028398655593426917,"score_gpt":0.2862824322705501,"score_spread":0.2578837766771232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092820948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946666,0.0011021903,0.002662352,0.000021327847,0.00050623104,0.00024221053,0.000023681587,0.00003262908,0.00074280327],"genre_scores_gemma":[0.9617271,0.000002172166,0.037645783,0.00024345826,0.0002009088,0.0000013010563,0.00009116125,0.000018705881,0.000069439004],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874,0.00008369247,0.00027505576,0.00040859156,0.00011572937,0.00037691696],"domain_scores_gemma":[0.99923706,0.000121551595,0.00022412205,0.00017063881,0.00018584022,0.000060785114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031401592,0.00021158897,0.00026013117,0.000032284104,0.00016760336,0.000028027649,0.00021319774,0.00019885266,0.000005561557],"category_scores_gemma":[0.00048974255,0.00016202388,0.00011581283,0.00012867783,0.000077910605,0.000004471365,0.00012737938,0.00024326175,4.7612866e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043528613,0.000018924133,0.01400264,0.000075458796,0.00006516843,0.0000023230134,0.000048804777,0.00017112037,0.90889126,0.00010748178,0.00015940868,0.07641391],"study_design_scores_gemma":[0.0017393322,0.0005788153,0.011540379,0.00010658188,0.000037844547,0.00011071696,0.00018513307,0.011786778,0.96749705,0.00076994696,0.005005613,0.0006417966],"about_ca_topic_score_codex":0.0000042388087,"about_ca_topic_score_gemma":0.0000030520164,"teacher_disagreement_score":0.07577211,"about_ca_system_score_codex":0.000012356711,"about_ca_system_score_gemma":0.000061346866,"threshold_uncertainty_score":0.6607142},"labels":[],"label_agreement":null},{"id":"W2093152025","doi":"10.1007/s11047-010-9239-4","title":"NP-completeness of the energy barrier problem without pseudoknots and temporary arcs","year":2010,"lang":"en","type":"article","venue":"Natural Computing","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"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":"Heuristics; Theory of computation; Simple (philosophy); Computer science; Energy (signal processing); Folding (DSP implementation); Completeness (order theory); Function (biology); Theoretical computer science; Algorithm; Mathematics; Mathematical optimization; Biology; Engineering","score_opus":0.00552984760293051,"score_gpt":0.24578337015134122,"score_spread":0.2402535225484107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093152025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.998497,0.00024258604,0.00067450816,0.00010805676,0.0001206807,0.00006133113,0.0000036162728,0.000023869601,0.00026836075],"genre_scores_gemma":[0.9896604,0.00001011982,0.009736739,0.000264037,0.00016357466,6.8766167e-7,0.000014096907,0.000011566778,0.00013877153],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925834,0.000045224137,0.00018638656,0.00024970464,0.0001115944,0.00014873028],"domain_scores_gemma":[0.9994399,0.000015334914,0.00014319632,0.0002612979,0.0001054258,0.000034853856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015220023,0.00012572449,0.00014727429,0.00002717775,0.00012974904,0.000016008275,0.00017404133,0.00012009688,3.73269e-7],"category_scores_gemma":[0.000053588377,0.00007998171,0.00007972832,0.00010393114,0.00016963731,0.0000031943214,0.00023160556,0.00019518589,6.3576856e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001273595,0.000008541252,0.011589881,0.000009448666,0.0000196981,4.3555963e-7,0.000009413664,0.0000026176888,0.98000747,0.00014473635,0.00011743592,0.008077565],"study_design_scores_gemma":[0.00015899526,0.00003975387,0.0052850004,0.00002240793,0.000016692846,0.00005609046,0.00001622918,0.0010971999,0.9891123,0.00031619097,0.003715393,0.0001637429],"about_ca_topic_score_codex":0.000034907694,"about_ca_topic_score_gemma":0.000053546097,"teacher_disagreement_score":0.0091048125,"about_ca_system_score_codex":0.0000028753718,"about_ca_system_score_gemma":0.000025799278,"threshold_uncertainty_score":0.32615596},"labels":[],"label_agreement":null},{"id":"W2093351336","doi":"10.1007/s11047-009-9167-3","title":"A synthetic genetic circuit whose signal-response curve is temperature-tunable from band-detection to sigmoidal behaviour","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"Gene Regulatory Network Analysis","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":"College of Family Physicians of Canada; University of Toronto","funders":"","keywords":"Sigmoid function; Electronic circuit; Biological system; Modular design; Computer science; SIGNAL (programming language); Synthetic biology; Frequency response; Step response; Biology; Artificial intelligence; Bioinformatics; Engineering; Control engineering; Electrical engineering; Artificial neural network","score_opus":0.005791972433579648,"score_gpt":0.2280615160182967,"score_spread":0.22226954358471704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093351336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948427,0.002624838,0.0017245023,0.0002195236,0.0002491628,0.00023982617,0.000012724844,0.000053827054,0.000032880947],"genre_scores_gemma":[0.9971047,0.0000090966905,0.00074114004,0.00096701033,0.00068123965,0.000004113138,0.00004516547,0.000034040047,0.00041347276],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977695,0.000260452,0.0003523834,0.00081163953,0.0003055776,0.0005004726],"domain_scores_gemma":[0.9989382,0.000047453846,0.00012973229,0.00051940855,0.00017473247,0.00019044806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003354322,0.00032760258,0.00030329596,0.0001309209,0.00027726838,0.00012120706,0.0003278546,0.0002900968,0.000037676797],"category_scores_gemma":[0.00008611688,0.0003273736,0.0002572787,0.00039291824,0.000030687006,0.000006745552,0.00009865188,0.00031031546,0.00003313676],"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.00023364509,0.000040303472,0.0013974743,0.000002892567,0.00006793743,0.000013371118,0.00014234659,0.0036046538,0.9788992,5.6676214e-7,0.00054992066,0.015047699],"study_design_scores_gemma":[0.0005279658,0.0004895973,0.09200879,0.000051754967,0.00013203584,0.000040448645,0.00006956277,0.0049997796,0.8998195,0.000069676535,0.0011858707,0.0006050319],"about_ca_topic_score_codex":0.000054784818,"about_ca_topic_score_gemma":0.000028141425,"teacher_disagreement_score":0.090611316,"about_ca_system_score_codex":0.00007561317,"about_ca_system_score_gemma":0.00006333669,"threshold_uncertainty_score":0.9999178},"labels":[],"label_agreement":null},{"id":"W2109892450","doi":"10.1007/s11047-007-9038-8","title":"Repeated patterns in genetic programming","year":2007,"lang":"en","type":"article","venue":"Natural Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; University of Essex","keywords":"Genetic programming; Computer science; Crossover; Shuffling; Tree (set theory); Binary tree; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Programming language; Combinatorics","score_opus":0.00966252290649453,"score_gpt":0.264951589042624,"score_spread":0.25528906613612945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109892450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47474566,0.00021390387,0.5243247,0.00017461191,0.00015395881,0.00010705894,1.470021e-7,0.00014312948,0.000136846],"genre_scores_gemma":[0.784244,0.0000012548437,0.21554388,0.000088256784,0.0000889251,0.0000015192229,0.0000024337019,0.000003795452,0.000025938341],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989604,0.00002000133,0.00024735395,0.0002884208,0.00015900859,0.00032485562],"domain_scores_gemma":[0.999518,0.00008779925,0.00006445902,0.00022868298,0.000052716256,0.000048336995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003385962,0.00008459874,0.00008100033,0.00010575795,0.00012682081,0.0000614724,0.00041567,0.000040448387,0.0000013216595],"category_scores_gemma":[0.00001925286,0.00008151382,0.000033071057,0.000602893,0.000013387226,0.00012657588,0.00018432322,0.00023691777,0.000010078885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014649275,0.000057360343,0.05161092,0.000009021281,0.0000042607044,0.00005810968,0.000413021,0.00056879566,0.0005514001,0.0060595204,0.00003226847,0.94063383],"study_design_scores_gemma":[0.0001883694,0.000017244342,0.63301,0.000032142652,9.4646725e-7,0.00005052044,0.000035983412,0.36496478,0.00028280832,0.00038862857,0.00088211184,0.00014644826],"about_ca_topic_score_codex":0.00007503098,"about_ca_topic_score_gemma":0.000038521637,"teacher_disagreement_score":0.9404874,"about_ca_system_score_codex":0.000060934675,"about_ca_system_score_gemma":0.000016969498,"threshold_uncertainty_score":0.3324037},"labels":[],"label_agreement":null},{"id":"W2132853600","doi":"10.1007/s11047-009-9131-2","title":"Watson–Crick palindromes in DNA computing","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Palindrome; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Catenation; Context (archaeology); Set (abstract data type); Mathematics; Combinatorics; Watson; Theory of computation; DNA computing; Sequence (biology); Discrete mathematics; Algebra over a field; Pure mathematics; DNA; Computer science; Base pair; Genome; Algorithm; Genetics; Biology","score_opus":0.009755713941148563,"score_gpt":0.26802959689483413,"score_spread":0.2582738829536856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132853600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956164,0.0011765852,0.0008656583,0.00033507007,0.00035168862,0.0001398245,9.075222e-7,0.00006592453,0.0014479418],"genre_scores_gemma":[0.9947191,0.000010055451,0.003267147,0.0012751031,0.0005893886,2.6412033e-7,0.000054828077,0.000011053457,0.00007308762],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99827486,0.000109578425,0.00037913342,0.0005248373,0.00015553294,0.0005560833],"domain_scores_gemma":[0.99948025,0.00005385555,0.00011704912,0.00020909197,0.000064398366,0.00007535938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004116195,0.00023718923,0.00025858806,0.00007321465,0.00015856326,0.000056126493,0.0003399627,0.00019972173,0.0000044643834],"category_scores_gemma":[0.0001818214,0.0001951079,0.00012836025,0.0002687165,0.000041181833,0.0000047385483,0.00022175876,0.00037282796,0.000010731737],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009925798,0.0001733926,0.034374326,0.000025865806,0.000034707708,0.00007333833,0.0002322474,0.0016636347,0.6028205,0.00048694716,0.00087774673,0.359138],"study_design_scores_gemma":[0.0038685258,0.0019341736,0.7600059,0.00041313007,0.00003097729,0.0003281208,0.0004743697,0.07741291,0.13937376,0.0015579422,0.012159235,0.002440958],"about_ca_topic_score_codex":0.000008610288,"about_ca_topic_score_gemma":0.0000055425994,"teacher_disagreement_score":0.7256316,"about_ca_system_score_codex":0.000027445361,"about_ca_system_score_gemma":0.000023269255,"threshold_uncertainty_score":0.79562694},"labels":[],"label_agreement":null},{"id":"W2147342069","doi":"10.1007/s11047-014-9472-3","title":"Understanding self-organized regularities in healthcare services based on autonomy oriented modeling","year":2015,"lang":"en","type":"article","venue":"Natural Computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":6,"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":"Autonomy; Service (business); Computer science; Affect (linguistics); Health care; Healthcare service; Psychology; Business; Marketing","score_opus":0.171772017553253,"score_gpt":0.4010684242582836,"score_spread":0.2292964067050306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147342069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8402538,0.00032816647,0.13576914,0.01682259,0.0024754144,0.001491158,0.000008035473,0.0008354776,0.0020162542],"genre_scores_gemma":[0.96047634,0.0000030430267,0.03601186,0.0030775382,0.00023086369,0.000010729248,0.000111177345,0.000032389195,0.000046072408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733204,0.00075520045,0.0006680371,0.00035229887,0.0003430424,0.0005494098],"domain_scores_gemma":[0.99863786,0.00030090043,0.00016142447,0.00022858674,0.00048424394,0.00018701104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015356304,0.00018397873,0.00029254743,0.0002766274,0.0010075675,0.00004050126,0.00013765172,0.0002534003,0.000009447703],"category_scores_gemma":[0.00018034426,0.00017231092,0.000034195986,0.00062744727,0.000011451986,0.00018147558,0.000069590125,0.0010752145,0.000015880803],"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.00017440447,0.000084750885,0.049694657,0.0007469644,0.000014437144,0.000012290423,0.024909118,0.90100354,0.00001905605,0.02270696,0.00009081819,0.0005430268],"study_design_scores_gemma":[0.0014458598,0.000053963617,0.00038955672,0.0006954261,0.000004122257,7.4249954e-7,0.009604773,0.98718244,0.000003449511,0.00035404332,0.000098059994,0.00016757094],"about_ca_topic_score_codex":0.0012418423,"about_ca_topic_score_gemma":0.0006048218,"teacher_disagreement_score":0.12022256,"about_ca_system_score_codex":0.0021960952,"about_ca_system_score_gemma":0.0013710812,"threshold_uncertainty_score":0.77494967},"labels":[],"label_agreement":null},{"id":"W2168988021","doi":"10.1007/s11047-014-9435-8","title":"Leaderless deterministic chemical reaction networks","year":2014,"lang":"en","type":"article","venue":"Natural Computing","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"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":"Combinatorics; Computable function; Function (biology); Theory of computation; Zero (linguistics); Mathematics; Discrete mathematics; Physics; Algorithm","score_opus":0.007386190529155033,"score_gpt":0.2662505977330152,"score_spread":0.25886440720386017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168988021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96117485,0.00013569895,0.03766585,0.00006727779,0.0001930279,0.000050696606,4.3738288e-7,0.00009031858,0.0006218399],"genre_scores_gemma":[0.99227494,0.000007431487,0.0065122554,0.00030200358,0.0007582283,4.964134e-7,0.000063517095,0.000012317948,0.000068786314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925756,0.000042338073,0.0001476768,0.0002745484,0.00008110742,0.00019676264],"domain_scores_gemma":[0.9996144,0.000023729372,0.000081196806,0.00018162598,0.000060913644,0.000038133887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014875217,0.00011740981,0.00011972731,0.000023035922,0.00008603636,0.000020801002,0.00010524534,0.00013793973,1.7565188e-7],"category_scores_gemma":[0.00011641812,0.00010177216,0.000078839956,0.000077171724,0.00005350284,0.000001977722,0.000074988246,0.00017872643,0.0000013691312],"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.000019213958,0.000009996452,0.00014198449,0.00000453272,0.000012677497,9.064137e-7,0.0000035741105,0.000046117322,0.89641386,0.00003959228,0.00023492749,0.10307262],"study_design_scores_gemma":[0.0002938756,0.00012623021,0.00092487695,0.00004674602,0.000037320948,0.000085204614,0.000029344386,0.16430761,0.8280541,0.00008815497,0.005585646,0.00042089508],"about_ca_topic_score_codex":0.0000023705957,"about_ca_topic_score_gemma":0.0000024070803,"teacher_disagreement_score":0.16426149,"about_ca_system_score_codex":0.000012711043,"about_ca_system_score_gemma":0.0000060018,"threshold_uncertainty_score":0.4150148},"labels":[],"label_agreement":null},{"id":"W2183250258","doi":"10.1007/s11047-015-9521-6","title":"Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata","year":2015,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Directed percolation; Statistical physics; Cellular automaton; Phase transition; Theory of computation; Mathematics; Percolation (cognitive psychology); Critical exponent; Computer science; Physics; Algorithm; Quantum mechanics","score_opus":0.011551925867727379,"score_gpt":0.2612157051740527,"score_spread":0.2496637793063253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183250258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47654215,0.0001782884,0.5223562,0.00022331833,0.00014835045,0.00020060544,0.000012218647,0.00014343018,0.0001954403],"genre_scores_gemma":[0.9561866,2.9886323e-7,0.04356253,0.00006627025,0.000063788364,0.0000041555086,0.00009193204,0.00000935678,0.000015072673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986508,0.00007185701,0.00037753105,0.00034159655,0.00031199155,0.00024625938],"domain_scores_gemma":[0.9991522,0.000046555702,0.00014015405,0.00041118538,0.00014990914,0.00009999209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022224624,0.000149775,0.00020938263,0.00015344411,0.000083211955,0.00006749948,0.0005497567,0.00009787076,0.000015284457],"category_scores_gemma":[0.000033258173,0.00014525691,0.0000533399,0.0007597409,0.00006177132,0.00034766216,0.00013633048,0.00029487774,0.000013662556],"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.00009553834,0.0020618793,0.00035770983,0.00057130295,0.00015204013,0.00014479461,0.03577604,0.043526214,0.30217865,0.17660269,0.001681509,0.43685165],"study_design_scores_gemma":[0.0015651373,0.000074923126,0.00035487048,0.00003530838,0.0000069079297,0.00004167232,0.00015579349,0.980262,0.014117778,0.00294786,0.0002788592,0.00015890444],"about_ca_topic_score_codex":0.000026562946,"about_ca_topic_score_gemma":0.000027405658,"teacher_disagreement_score":0.93673575,"about_ca_system_score_codex":0.00009149048,"about_ca_system_score_gemma":0.00018460522,"threshold_uncertainty_score":0.5923405},"labels":[],"label_agreement":null},{"id":"W2272561321","doi":"10.1007/s11047-015-9538-x","title":"On the overlap assembly of strings and languages","year":2016,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; String (physics); Formal language; Concatenation (mathematics); Substitution (logic); Theoretical computer science; Extension (predicate logic); Catenation; Context (archaeology); Algorithm; Mathematics; Programming language; DNA; Arithmetic; Genetics; Biology","score_opus":0.008136046411732654,"score_gpt":0.2525398961503987,"score_spread":0.24440384973866602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272561321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978238,0.00042580345,0.00024737764,0.00032980286,0.000050821225,0.00004888447,0.0000016519058,0.000009670336,0.0010621921],"genre_scores_gemma":[0.9992715,0.000009577971,0.00017983638,0.0003030168,0.000119813514,2.395367e-7,0.0000018921496,0.0000039000397,0.0001102117],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951535,0.00004160812,0.00009584621,0.00015665592,0.000066324166,0.00012423906],"domain_scores_gemma":[0.9996122,0.00017389221,0.000061852326,0.00010173581,0.00003184145,0.000018483084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017552379,0.0000729769,0.00007421461,0.000010848298,0.000059341943,0.0000090232525,0.00011349635,0.000055041917,0.0000024511007],"category_scores_gemma":[0.00027992623,0.00003184756,0.000037988044,0.000035273722,0.000052641946,0.0000011743772,0.00014597939,0.000065649845,0.000001403087],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021908627,0.0000073901965,0.0035721366,0.0000045069005,0.000013119456,8.447974e-7,0.000008427409,0.0000023372195,0.9479377,0.0031564473,0.0002262749,0.045048896],"study_design_scores_gemma":[0.00065677427,0.00062177825,0.07134007,0.00016576638,0.000010061459,0.000018977382,0.00017901599,0.00043952934,0.92391133,0.00037135492,0.0020032858,0.00028202325],"about_ca_topic_score_codex":0.000003966569,"about_ca_topic_score_gemma":8.9518716e-7,"teacher_disagreement_score":0.06776793,"about_ca_system_score_codex":0.0000033231659,"about_ca_system_score_gemma":0.000005409851,"threshold_uncertainty_score":0.1298706},"labels":[],"label_agreement":null},{"id":"W2561162248","doi":"10.1007/s11047-016-9587-9","title":"Design of nucleic acid strands with long low-barrier folding pathways","year":2017,"lang":"en","type":"article","venue":"Natural Computing","topic":"Advanced biosensing and bioanalysis techniques","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":"Dillon Consulting; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleic acid; Folding (DSP implementation); Theory of computation; Biomolecule; Computer science; Computation; Scalability; Biological system; Protein folding; Sequence (biology); Chemistry; Biology; Algorithm; Biochemistry; Engineering","score_opus":0.01358274131398561,"score_gpt":0.266408005919903,"score_spread":0.25282526460591737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561162248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93820775,0.0003033151,0.06112331,0.000023356133,0.000059670216,0.00009787618,0.0000028417994,0.0000343537,0.0001475262],"genre_scores_gemma":[0.9726094,0.000019546264,0.027131988,0.000042874126,0.00013037818,4.9293476e-7,0.000014844355,0.0000166767,0.000033786775],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991457,0.000035436256,0.00017530094,0.0002890674,0.00013765717,0.00021683364],"domain_scores_gemma":[0.999126,0.000013017128,0.00026333457,0.00042037482,0.00013501776,0.000042227934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021523601,0.00015348123,0.00019038415,0.0000355524,0.00032705683,0.00005545913,0.0002747654,0.000113397036,6.2770397e-7],"category_scores_gemma":[0.00008131531,0.00011468336,0.000080665144,0.00004427674,0.00013174088,0.0000079462625,0.00012549933,0.00014417857,3.4607143e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086488624,0.000012959194,0.0015516267,0.000015756774,0.000055867873,0.000008521951,0.000021461572,0.00012082567,0.98127514,0.000012222579,0.000020207857,0.016818896],"study_design_scores_gemma":[0.0003246895,0.00018704607,0.00220177,0.00010464138,0.000028181266,0.000018836374,0.000026084557,0.0038555823,0.99301374,0.00003030524,0.000022277382,0.0001868609],"about_ca_topic_score_codex":0.000005073377,"about_ca_topic_score_gemma":0.000006073784,"teacher_disagreement_score":0.034401666,"about_ca_system_score_codex":0.000010412042,"about_ca_system_score_gemma":0.000029120618,"threshold_uncertainty_score":0.46766517},"labels":[],"label_agreement":null},{"id":"W2563293374","doi":"10.1007/s11047-016-9605-y","title":"On an integrated approach to resilient transportation systems in emergency situations","year":2017,"lang":"en","type":"article","venue":"Natural Computing","topic":"Evacuation and Crowd Dynamics","field":"Engineering","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":"University of Saskatchewan","funders":"National Natural Science Foundation of China","keywords":"Computer science; Resilience (materials science); Generality; Variable (mathematics); Service (business); Mathematical optimization; Function (biology); Particle swarm optimization; Theory of computation; Flow network; Operations research; Engineering; Mathematics; Algorithm; Business","score_opus":0.016311110532946684,"score_gpt":0.2745996637157482,"score_spread":0.2582885531828015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563293374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9527108,0.00005280927,0.043582514,0.00004388576,0.00081475155,0.0002020493,0.000005551239,0.00015121383,0.002436418],"genre_scores_gemma":[0.9981505,0.0000032228693,0.001619438,0.000012833869,0.000045674602,0.0000048861857,0.00009364339,0.000013080951,0.000056689023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993607,0.000019757494,0.00022022874,0.00013809133,0.00012745007,0.00013382033],"domain_scores_gemma":[0.99964803,0.000013061641,0.000039764553,0.00019926734,0.000053096683,0.000046785564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001508483,0.00009098249,0.00009307455,0.000099721525,0.00015264099,0.000067452616,0.00016434745,0.000051466344,0.0000026916903],"category_scores_gemma":[0.000046586076,0.0000884549,0.000021419495,0.00011677805,0.0000050456665,0.00012474364,0.000004603451,0.00020621765,0.000010496036],"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.000005055678,0.000022621543,0.0006964427,0.000024251327,0.0000047396547,8.301996e-7,0.0009811197,0.9835584,0.0006291936,0.005796895,0.00013663647,0.008143794],"study_design_scores_gemma":[0.00012513917,0.0000131460865,0.08011138,0.00003642242,0.0000024098258,3.6797178e-7,0.00023256704,0.9192083,0.000027944163,0.00008781137,0.000051104656,0.000103435836],"about_ca_topic_score_codex":0.00010110698,"about_ca_topic_score_gemma":0.00033274177,"teacher_disagreement_score":0.079414934,"about_ca_system_score_codex":0.00007788658,"about_ca_system_score_gemma":0.000006836774,"threshold_uncertainty_score":0.36070862},"labels":[],"label_agreement":null},{"id":"W2791265147","doi":"10.1007/s11047-018-9676-z","title":"Simplifying the role of signals in tile self-assembly","year":2018,"lang":"en","type":"article","venue":"Natural Computing","topic":"Advanced biosensing and bioanalysis techniques","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":"University of Waterloo; Western University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Tile; Rectangle; Theory of computation; SIGNAL (programming language); Mode (computer interface); Computer science; Turing machine; Computational complexity theory; Turing; Algorithm; Theoretical computer science; Topology (electrical circuits); Mathematics; Geometry; Combinatorics; Materials science; Programming language; Operating system","score_opus":0.00574507942632478,"score_gpt":0.276728104713421,"score_spread":0.2709830252870962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791265147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99810296,0.00061854615,0.00039084986,0.000054831577,0.000042062755,0.00006864244,9.738609e-7,0.00002863494,0.00069247006],"genre_scores_gemma":[0.99471205,0.000011128156,0.0048605544,0.00014671532,0.00023569318,4.6734763e-7,0.0000071708723,0.000007581299,0.000018645887],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932003,0.000051666775,0.00018241475,0.00018640752,0.00009071779,0.00016874728],"domain_scores_gemma":[0.9995686,0.000024186847,0.00010429324,0.00017731867,0.0001097891,0.000015833995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024658185,0.00008922349,0.00011263537,0.0000365449,0.0000834713,0.000011510769,0.00016217792,0.00007720115,4.0959296e-7],"category_scores_gemma":[0.000057398218,0.000060387814,0.00006306492,0.00017372896,0.000059081667,0.000002236469,0.00012502496,0.00011185834,9.700562e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013083928,0.0000148530025,0.001472903,0.0000032591158,0.00001709806,4.2151845e-7,0.00005453222,0.000012600301,0.9790065,0.00002441983,0.00007468862,0.019305583],"study_design_scores_gemma":[0.00008226974,0.00008194448,0.0012746551,0.000022396594,0.000007996729,0.0000058811656,0.000116324816,0.0068429303,0.98892236,0.00015410039,0.0023982977,0.0000908526],"about_ca_topic_score_codex":0.00001789068,"about_ca_topic_score_gemma":0.000028988563,"teacher_disagreement_score":0.01921473,"about_ca_system_score_codex":0.000010462376,"about_ca_system_score_gemma":0.000017355742,"threshold_uncertainty_score":0.24625435},"labels":[],"label_agreement":null},{"id":"W2941869658","doi":"10.1023/b:naco.0000006773.31625.55","title":"Unexpected universality results for three classes of P systems with symport/antiport","year":2003,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Antiporter; Symporter; Membrane computing; Universality (dynamical systems); Computer science; Computation; Theoretical computer science; Mathematics; Algorithm; Membrane; Physics; Chemistry","score_opus":0.01635541717707765,"score_gpt":0.2524889441129755,"score_spread":0.23613352693589787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941869658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867705,0.0006651335,0.010097801,0.000021878866,0.00026288838,0.0002834822,0.000013313042,0.000031206797,0.0018537806],"genre_scores_gemma":[0.99678916,0.0000032671169,0.0028472063,0.00002460339,0.00012538224,0.0000011590806,0.00010460741,0.000009779896,0.000094853065],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890316,0.00006673268,0.00030834097,0.0003527879,0.00011548229,0.00025352498],"domain_scores_gemma":[0.9991604,0.000081547514,0.00025273758,0.00020481457,0.00025667192,0.000043836502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037425346,0.00014852236,0.00021896603,0.000026514585,0.00010621301,0.000018193536,0.00015159321,0.0001296954,3.8817925e-7],"category_scores_gemma":[0.000254985,0.00010436182,0.000082382285,0.0001439995,0.00007033058,0.0000030272581,0.00005628055,0.000108669716,2.7764798e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002353352,0.0002843934,0.10641238,0.0004154324,0.0005944998,0.000031336866,0.00011190236,0.0078254165,0.8612363,0.011339359,0.0018407323,0.0075548906],"study_design_scores_gemma":[0.019861868,0.009215884,0.15135834,0.0011264762,0.0003812408,0.000477402,0.0022985933,0.07692539,0.64443165,0.00063042034,0.08945987,0.003832855],"about_ca_topic_score_codex":0.000022264905,"about_ca_topic_score_gemma":0.000020329759,"teacher_disagreement_score":0.21680464,"about_ca_system_score_codex":0.000012972607,"about_ca_system_score_gemma":0.000062650164,"threshold_uncertainty_score":0.42557514},"labels":[],"label_agreement":null},{"id":"W2946244420","doi":"10.1007/s11047-019-09739-5","title":"A class of discrete dynamical systems with properties of both cellular automata and L-systems","year":2019,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"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 Victoria; Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular automaton; Sublinear function; Dynamical systems theory; Mathematics; Ergodic theory; Algebraic number; Theory of computation; Quadratic equation; Entropy (arrow of time); Complex system; Discrete mathematics; Computer science; Pure mathematics; Algorithm","score_opus":0.008713007467321114,"score_gpt":0.2073030927396991,"score_spread":0.19859008527237798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946244420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9402823,0.0018690656,0.056813978,0.00006510979,0.0002117922,0.0004155865,0.0000030118763,0.000117406445,0.00022177261],"genre_scores_gemma":[0.9973512,0.0000020777834,0.0025022153,0.000005809355,0.00002326397,0.0000033294875,0.000004076593,0.000009454657,0.00009853476],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987971,0.000064361906,0.00032843024,0.000305631,0.00031076177,0.00019372397],"domain_scores_gemma":[0.9990845,0.000064406566,0.0002416271,0.00047210857,0.00009220676,0.000045165132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022947295,0.0001306602,0.0003051586,0.000068726586,0.000061151135,0.00009978653,0.00048074897,0.000054072054,2.994399e-7],"category_scores_gemma":[0.0000079205765,0.000089717934,0.00003716646,0.0002632291,0.000074998774,0.00018117945,0.0002911757,0.00015051181,0.0000031536906],"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.00004624089,0.00014564749,0.010453492,0.0029737132,0.00018301046,0.000012433707,0.0024382162,0.012540946,0.7868478,0.17842428,0.00007981692,0.005854415],"study_design_scores_gemma":[0.00029664903,0.00006800188,0.0013950092,0.0003421622,0.000008400654,0.000035066652,0.00010714147,0.99390996,0.0035844487,0.000011057404,0.000112442925,0.00012966247],"about_ca_topic_score_codex":0.00016604543,"about_ca_topic_score_gemma":0.0000020228372,"teacher_disagreement_score":0.981369,"about_ca_system_score_codex":0.000021055794,"about_ca_system_score_gemma":0.000040568593,"threshold_uncertainty_score":0.36585912},"labels":[],"label_agreement":null},{"id":"W2968569765","doi":"10.1007/s11047-019-09756-4","title":"Approximate majority analyses using tri-molecular chemical reaction networks","year":2019,"lang":"en","type":"article","venue":"Natural Computing","topic":"Gene Regulatory Network Analysis","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":"University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Simple (philosophy); Protocol (science); Population; Context (archaeology); Theory of computation; Binary logarithm; Computer science; Combinatorics; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Biology","score_opus":0.015566931183915866,"score_gpt":0.2939392384567327,"score_spread":0.2783723072728168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968569765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858694,0.0020810694,0.011340002,0.000016905273,0.00034002372,0.00013632483,6.6134265e-7,0.000034724206,0.00018089988],"genre_scores_gemma":[0.99577415,0.000010276207,0.003397369,0.00011249555,0.0005041376,7.389824e-7,0.000115647024,0.000027668077,0.000057512003],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855095,0.00009983595,0.00027249765,0.00050697895,0.00019988912,0.0003698593],"domain_scores_gemma":[0.9992291,0.000015660764,0.00017334239,0.0003950915,0.00011283295,0.00007397822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519807,0.00021344896,0.00026621833,0.000061860774,0.00008882262,0.00004092622,0.00020338834,0.00022545252,0.0000065851777],"category_scores_gemma":[0.000033940585,0.00020754249,0.00025509714,0.00032299195,0.00003484183,0.0000059190293,0.00020325123,0.0002705642,0.00000607005],"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.00003159438,0.000014704623,0.002147699,0.000011748527,0.00013225466,0.0000027566252,0.000004773129,0.05092305,0.94451374,0.000013802453,0.000051079747,0.0021528206],"study_design_scores_gemma":[0.00041496762,0.000030624615,0.0011286559,0.000023118559,0.00011395553,0.000040116913,0.0000251795,0.69750947,0.30006042,0.000021624573,0.00030157343,0.00033027967],"about_ca_topic_score_codex":0.00002057628,"about_ca_topic_score_gemma":0.0000016098278,"teacher_disagreement_score":0.6465864,"about_ca_system_score_codex":0.000051310988,"about_ca_system_score_gemma":0.000029872015,"threshold_uncertainty_score":0.8463337},"labels":[],"label_agreement":null},{"id":"W3164823035","doi":"10.1007/s11047-020-09802-6","title":"Correction to: A class of discrete dynamical systems with properties of both cellular automata and L-systems","year":2020,"lang":"en","type":"article","venue":"Natural Computing","topic":"Cellular Automata and Applications","field":"Computer Science","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 Victoria","funders":"","keywords":"Theory of computation; Class (philosophy); Dynamical systems theory; Automaton; Computer science; Cellular automaton; Theoretical computer science; Discrete mathematics; Mathematics; Algebra over a field; Applied mathematics; Calculus (dental); Pure mathematics; Algorithm; Artificial intelligence; Medicine; Physics","score_opus":0.013848029631338328,"score_gpt":0.217348694863998,"score_spread":0.20350066523265967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164823035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.627946,0.0007810126,0.3698268,0.00035553097,0.00043007248,0.0003816494,0.0000027685421,0.0001720434,0.000104110346],"genre_scores_gemma":[0.99715286,0.0000011791179,0.002717725,0.000027293867,0.00005157976,0.0000046707974,0.0000034738362,0.0000085730135,0.00003265929],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890685,0.00006234297,0.0003030307,0.00030322923,0.0002677395,0.00015681703],"domain_scores_gemma":[0.99933237,0.000061862025,0.00017831977,0.00024697234,0.000094244475,0.000086250155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406852,0.00011745162,0.0002544989,0.00004921922,0.00008258056,0.00010049391,0.00036374023,0.000035859368,1.3841294e-7],"category_scores_gemma":[0.000033438257,0.000086171145,0.00003113452,0.00041597584,0.000049277136,0.00013729691,0.00025928282,0.00015290121,0.0000016979835],"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.00009686052,0.00010878573,0.002674691,0.0017312692,0.00014280027,0.000016175696,0.0075052707,0.045769464,0.8990587,0.026657552,0.0011544923,0.015083917],"study_design_scores_gemma":[0.0001757057,0.000116802876,0.0007163119,0.00026282205,0.000008798939,0.000023550665,0.00015248843,0.99217427,0.0060835117,0.0000021689852,0.00016999157,0.00011356328],"about_ca_topic_score_codex":0.00019524693,"about_ca_topic_score_gemma":0.000003844301,"teacher_disagreement_score":0.9464048,"about_ca_system_score_codex":0.000021239557,"about_ca_system_score_gemma":0.00003624511,"threshold_uncertainty_score":0.35139573},"labels":[],"label_agreement":null},{"id":"W3196448279","doi":"10.1007/s11047-021-09867-x","title":"Conjugate word blending: formal model and experimental implementation by XPCR","year":2021,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Word (group theory); Conjugate; Programming language; Linguistics; Mathematics; Philosophy","score_opus":0.012563575136313117,"score_gpt":0.29963643549953817,"score_spread":0.28707286036322505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196448279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99491733,0.0027315754,0.0016800157,0.000088912086,0.00013876168,0.00006895981,0.000006217,0.000021658947,0.00034657234],"genre_scores_gemma":[0.9961304,0.000015008467,0.002777999,0.00053087634,0.00014042204,0.0000011342638,0.00025956263,0.000008346903,0.00013621712],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991241,0.00003718887,0.0001696922,0.0003081441,0.000081754,0.0002790882],"domain_scores_gemma":[0.9997446,0.00001294929,0.000061106046,0.00008132815,0.00004611432,0.000053901575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118312695,0.00012391555,0.00010554697,0.000011872176,0.00018955777,0.000054774955,0.00007554427,0.00007658216,0.000007763156],"category_scores_gemma":[0.000018564318,0.000109124456,0.00004811641,0.000051167477,0.000032068798,0.000007648758,0.00032883097,0.00011604002,0.0000010858577],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019960278,0.00001588178,0.0009763297,0.000005464038,0.000016010805,0.0000028486195,0.00004498054,0.00015180848,0.98053735,0.00012475066,0.0006906429,0.017413953],"study_design_scores_gemma":[0.0007844572,0.00012183102,0.00064207654,0.000011117637,0.000007721266,0.000043586468,0.0004800945,0.040516492,0.9548817,0.000050109225,0.0022098152,0.00025095526],"about_ca_topic_score_codex":0.000003793309,"about_ca_topic_score_gemma":0.000003403262,"teacher_disagreement_score":0.040364683,"about_ca_system_score_codex":0.0000125193055,"about_ca_system_score_gemma":0.000020788728,"threshold_uncertainty_score":0.4449966},"labels":[],"label_agreement":null},{"id":"W4210711811","doi":"10.1007/s11047-020-09832-0","title":"Preface","year":2021,"lang":"en","type":"article","venue":"Natural Computing","topic":"","field":"","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 Saskatchewan","funders":"","keywords":"Computer science","score_opus":0.013695542828149172,"score_gpt":0.28360784914812825,"score_spread":0.2699123063199791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210711811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852242,0.0020377114,0.00015771441,0.0001818051,0.00067810714,0.00004880639,0.0000023130588,0.00039649731,0.011272873],"genre_scores_gemma":[0.99067324,4.5564755e-7,0.007869893,0.00022717615,0.00023628796,1.8405872e-7,0.000015425361,0.000028884362,0.00094845257],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990648,0.000075270385,0.00013031243,0.00024004767,0.00021968219,0.0002699113],"domain_scores_gemma":[0.99945146,0.000103519735,0.000051795258,0.0001858988,0.000161814,0.00004548551],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016086746,0.00009325722,0.000110835,0.000029084349,0.00012863017,0.00006253254,0.00012377957,0.00003979143,0.000067930145],"category_scores_gemma":[0.0002711277,0.000090141766,0.000057470737,0.00040151432,0.000017958884,0.0000800994,0.00019363622,0.0003421543,0.001660764],"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.000042931533,0.00014023893,0.018314512,0.000089816596,0.0001507293,0.00058387365,0.0018189629,0.003825589,0.77546686,0.008763892,0.04195509,0.14884752],"study_design_scores_gemma":[0.0025092561,0.000047887625,0.1871326,0.00034430204,0.000065888926,0.00090065954,0.00075971446,0.33538917,0.35502124,0.00131301,0.11504425,0.0014720241],"about_ca_topic_score_codex":0.000006164318,"about_ca_topic_score_gemma":0.000007781905,"teacher_disagreement_score":0.42044562,"about_ca_system_score_codex":0.0000705392,"about_ca_system_score_gemma":0.00004522941,"threshold_uncertainty_score":0.99911654},"labels":[],"label_agreement":null},{"id":"W4295866169","doi":"10.1007/s11047-022-09920-3","title":"Is integration of mechanisms a way to enhance a nature-inspired algorithm?","year":2022,"lang":"en","type":"article","venue":"Natural Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Firefly algorithm; Computer science; Novelty; Premature convergence; Convergence (economics); Theory of computation; Particle swarm optimization; Space (punctuation); Algorithm; Artificial intelligence; Mathematical optimization; Mathematics; Psychology","score_opus":0.015484774354612912,"score_gpt":0.3239023054742745,"score_spread":0.3084175311196616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295866169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045932923,0.00020403936,0.9918208,0.0013367721,0.0012077786,0.0003633178,0.000010581099,0.00015242706,0.000311001],"genre_scores_gemma":[0.4991024,0.0000010845793,0.49976772,0.0007830818,0.000037761874,0.000009988702,0.0000063699604,0.000008710171,0.0002828561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971532,0.00025989886,0.00042874602,0.0005823982,0.0012041631,0.00037159462],"domain_scores_gemma":[0.99850863,0.00021524464,0.00020301472,0.00054004736,0.00041906166,0.00011399596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433093,0.0001689027,0.00025951266,0.00037722767,0.00038530017,0.000117857264,0.001499715,0.00006725215,0.000086170956],"category_scores_gemma":[0.00033031183,0.0001651311,0.000096225405,0.0019437613,0.000020539046,0.00020127087,0.0014804262,0.0009249722,0.00001865288],"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.000015419993,0.00009465512,0.000006709423,0.00002011479,0.000034203687,0.000021294758,0.0023961982,0.00745664,0.018002812,0.025885437,0.0017053895,0.94436115],"study_design_scores_gemma":[0.00015011053,0.00014866781,0.00018524454,0.000018157756,0.0000029147204,0.000018319355,0.000078791854,0.95252836,0.044638854,0.0014312172,0.0006238474,0.00017553673],"about_ca_topic_score_codex":0.00003408206,"about_ca_topic_score_gemma":0.000001435847,"teacher_disagreement_score":0.9450717,"about_ca_system_score_codex":0.00016890245,"about_ca_system_score_gemma":0.00008770947,"threshold_uncertainty_score":0.6733851},"labels":[],"label_agreement":null},{"id":"W4411116334","doi":"10.1007/s11047-025-10020-1","title":"Connectomes inform function: from time-varying dynamics to animal behaviour","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"Neural dynamics and brain function","field":"Neuroscience","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":"Western University","funders":"National Institute of Neurological Disorders and Stroke; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Connectome; Theory of computation; Computer science; Function (biology); Dynamics (music); Biological system; Neuroscience; Algorithm; Functional connectivity; Biology; Physics","score_opus":0.012350535242938684,"score_gpt":0.26276054804366694,"score_spread":0.2504100128007283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411116334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98951876,0.00003519762,0.0021015953,0.0010562899,0.0022256498,0.00022296104,0.000018603712,0.00028181553,0.0045391265],"genre_scores_gemma":[0.9940428,9.469288e-7,0.00043004053,0.0039684647,0.00016979204,0.0000021911499,0.000032628457,0.0000130603385,0.001340069],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986809,0.000042495063,0.00026930045,0.00044682817,0.00024504235,0.00031544289],"domain_scores_gemma":[0.9991446,0.00044771694,0.000083935294,0.00018827959,0.00006936034,0.00006611565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111749665,0.00018027263,0.00018846635,0.00017221925,0.00039462082,0.00018476872,0.0002513831,0.00008289112,0.000041250685],"category_scores_gemma":[0.00035787592,0.00016800327,0.00008293183,0.00066822954,0.000029172972,0.00020893576,0.0002863741,0.00039966908,0.000110274515],"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.0008154463,0.0001369992,0.026656957,0.00005473688,0.00005299533,0.00007160481,0.00035544173,0.0036979301,0.7325945,0.02943233,0.005195346,0.20093569],"study_design_scores_gemma":[0.00065923494,0.00021585502,0.056628752,0.00011799018,0.000035841404,0.00001420143,0.00006382844,0.9229434,0.016716283,0.0009626641,0.0012127886,0.00042916948],"about_ca_topic_score_codex":0.00006579957,"about_ca_topic_score_gemma":0.00002006624,"teacher_disagreement_score":0.9192455,"about_ca_system_score_codex":0.0001540598,"about_ca_system_score_gemma":0.000035236702,"threshold_uncertainty_score":0.68509746},"labels":[],"label_agreement":null},{"id":"W4411169467","doi":"10.1007/s11047-025-10022-z","title":"Algorithms for maximal existential and universal width","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Existentialism; Theory of computation; Computer science; Mathematics; Algorithm; Epistemology; Philosophy","score_opus":0.010669383250928591,"score_gpt":0.2648285221914973,"score_spread":0.2541591389405687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411169467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09547505,0.00080656476,0.8999428,0.00072518026,0.0014558586,0.00016243641,0.0000019180159,0.0002619166,0.0011682893],"genre_scores_gemma":[0.86205035,0.0000018064317,0.1371239,0.00036202246,0.000100242716,7.533062e-7,0.0000026531966,0.0000036821245,0.0003546034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992391,0.000026030806,0.0001228725,0.000294642,0.00008984834,0.00022749206],"domain_scores_gemma":[0.9995172,0.00019145895,0.00004504154,0.00016142233,0.00005237619,0.00003248193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021311581,0.00009911584,0.0001220455,0.00008237183,0.00022520707,0.00016205107,0.00040532651,0.00004571454,0.0000010815988],"category_scores_gemma":[0.000030074854,0.00009030244,0.000053598196,0.00020219716,0.00003921231,0.00020437442,0.00038421608,0.00012807232,0.0000013600085],"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.000013283679,0.000013962485,0.000104060724,0.00003309631,0.000026199617,0.000008170324,0.00020183335,0.000031080486,0.0008594351,0.3546723,0.0009888472,0.6430477],"study_design_scores_gemma":[0.000693666,0.00003942278,0.0019265894,0.0000521341,0.000008833927,0.000016796032,0.000049901315,0.9751585,0.00085858593,0.016762266,0.004278762,0.00015450778],"about_ca_topic_score_codex":0.000010527197,"about_ca_topic_score_gemma":9.3206904e-7,"teacher_disagreement_score":0.97512746,"about_ca_system_score_codex":0.000028077477,"about_ca_system_score_gemma":0.000030367572,"threshold_uncertainty_score":0.36824268},"labels":[],"label_agreement":null},{"id":"W4411300943","doi":"10.1007/s11047-025-10032-x","title":"On decidability of problems involving insertion operations","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"semigroups and automata theory","field":"Computer Science","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":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Theory of computation; Computer science; Mathematics; Calculus (dental); Algorithm","score_opus":0.008204423882996022,"score_gpt":0.25574242990320906,"score_spread":0.24753800602021303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411300943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82015383,0.0002887307,0.17785598,0.00035016803,0.00047556602,0.00013389245,2.7621476e-7,0.00014018163,0.0006013662],"genre_scores_gemma":[0.9841519,0.0000012847165,0.015369497,0.00041582028,0.00001876943,0.0000017376096,0.0000017384427,0.0000023382356,0.000036931815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991668,0.000078414094,0.0002419336,0.00023722477,0.00013774424,0.00013788756],"domain_scores_gemma":[0.9992236,0.00029566928,0.00004874577,0.0003066143,0.00010670834,0.00001864901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004185748,0.000080462145,0.00011879847,0.00010705426,0.00017082445,0.000079134654,0.0004497229,0.000041260446,0.0000020519842],"category_scores_gemma":[0.00024036241,0.00006812471,0.000048058708,0.0004935055,0.000026672076,0.00020219006,0.00023766755,0.00017696618,0.0000034704203],"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.0000067984074,0.000113371956,0.0020006788,0.00008626308,0.000020024185,0.0000011066561,0.0008865302,0.02170652,0.028374458,0.8110966,0.0002468245,0.13546084],"study_design_scores_gemma":[0.00016450555,0.00003116249,0.018961996,0.00018601953,0.0000021864344,0.0000010765177,0.000024112072,0.9486299,0.007758367,0.024127277,0.00003263852,0.00008076481],"about_ca_topic_score_codex":0.000039997307,"about_ca_topic_score_gemma":0.0000113068145,"teacher_disagreement_score":0.9269234,"about_ca_system_score_codex":0.000053522777,"about_ca_system_score_gemma":0.000047909172,"threshold_uncertainty_score":0.2778045},"labels":[],"label_agreement":null},{"id":"W4411330187","doi":"10.1007/s11047-025-10024-x","title":"Inductive inference of Lindenmayer systems: algorithms and computational complexity","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Theory of computation; Computer science; Algorithm; Inference; Computational complexity theory; Theoretical computer science; Artificial intelligence","score_opus":0.02763257918964659,"score_gpt":0.3179028382026179,"score_spread":0.2902702590129713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411330187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9725614,0.0014261575,0.024709785,0.00006188647,0.00031822367,0.00012668347,0.0000056737235,0.00001661486,0.00077356084],"genre_scores_gemma":[0.9926212,0.0000055380583,0.007007459,0.00013597985,0.00011527048,7.950125e-7,0.00003982741,0.0000035618648,0.000070393],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913555,0.00008646806,0.0002454381,0.00027973007,0.00009445861,0.00015834488],"domain_scores_gemma":[0.9994481,0.000108312575,0.000112548725,0.00009440584,0.00020697976,0.000029615276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020432752,0.00011892924,0.0001847899,0.00004644238,0.000113247974,0.000026916829,0.0001378641,0.00011914542,9.97942e-7],"category_scores_gemma":[0.00016258872,0.00009708813,0.000043842687,0.00013863054,0.0001585765,0.000003144871,0.000319312,0.00017736138,5.9983836e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043641427,0.00042467963,0.24175179,0.00081169803,0.00090135,0.000014483763,0.00054640573,0.02728263,0.3727562,0.0761744,0.0014090572,0.27749088],"study_design_scores_gemma":[0.0025574018,0.000723726,0.42652318,0.00058483286,0.00006667987,0.000047034697,0.0007919646,0.5303654,0.02555134,0.008646535,0.0031618774,0.0009800062],"about_ca_topic_score_codex":0.000034197714,"about_ca_topic_score_gemma":0.0000023913985,"teacher_disagreement_score":0.5030828,"about_ca_system_score_codex":0.000010558141,"about_ca_system_score_gemma":0.000041993328,"threshold_uncertainty_score":0.3959139},"labels":[],"label_agreement":null},{"id":"W4414807081","doi":"10.1007/s11047-025-10053-6","title":"A multipartite approach for the self-assembly of DNA graph structures","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"Advanced biosensing and bioanalysis techniques","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"; Università Degli Studi di Modena e Reggio Emila","keywords":"Multipartite; Theory of computation; Graph; Line graph; Graph theory; Complement graph; Graph property; Upper and lower bounds","score_opus":0.007652141324352391,"score_gpt":0.28384319910675637,"score_spread":0.276191057782404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414807081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8810712,0.0018009696,0.11623935,0.00013480832,0.00013960399,0.0003272537,0.0000066036473,0.00006413447,0.00021609085],"genre_scores_gemma":[0.9201697,0.000020988711,0.07945699,0.0001719829,0.00008641611,0.0000027040965,0.000030275833,0.0000056169292,0.00005533679],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937415,0.000028138413,0.00016717982,0.00021651037,0.00006743527,0.00014656913],"domain_scores_gemma":[0.9994968,0.000054441767,0.00009656413,0.00020915057,0.00013061332,0.000012389732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016483739,0.00010434051,0.00012849331,0.000041762563,0.0001431567,0.000015149838,0.0001787095,0.00008822808,3.951102e-8],"category_scores_gemma":[0.00007987916,0.00006551766,0.00014941259,0.0001683411,0.000049944894,0.000001495213,0.00009416294,0.00009080358,2.1987988e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005694525,0.000026519836,0.00033981926,0.000047734513,0.00019567632,1.1575828e-7,0.000022765022,0.00026533587,0.97633886,0.0005238861,0.0007566309,0.021425707],"study_design_scores_gemma":[0.00023149398,0.000044421387,0.0012799344,0.00001328448,0.000063988104,0.0000023373398,0.000064042884,0.023981959,0.97238976,0.00018317866,0.0016444526,0.00010116673],"about_ca_topic_score_codex":0.0000057481934,"about_ca_topic_score_gemma":0.000004228792,"teacher_disagreement_score":0.0390985,"about_ca_system_score_codex":0.0000072752173,"about_ca_system_score_gemma":0.000021990505,"threshold_uncertainty_score":0.26717326},"labels":[],"label_agreement":null},{"id":"W571300759","doi":"10.1007/s11047-015-9502-9","title":"Pseudo-inversion: closure properties and decidability","year":2015,"lang":"en","type":"article","venue":"Natural Computing","topic":"Algorithms and Data Compression","field":"Computer Science","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","funders":"","keywords":"Decidability; Nondeterministic algorithm; Inversion (geology); Context-free language; Iterated function; Computer science; Regular language; Formal language; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Automaton; Rule-based machine translation; Artificial intelligence","score_opus":0.04490257803118486,"score_gpt":0.25005473572062437,"score_spread":0.2051521576894395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W571300759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9326764,0.0018343197,0.06270368,0.00087253423,0.0010873048,0.00015298293,8.490688e-7,0.0002759136,0.00039602225],"genre_scores_gemma":[0.9179614,0.000002746962,0.08160036,0.00023164868,0.0001510391,6.121592e-7,0.0000017859958,0.000003957327,0.000046457426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988759,0.00007647663,0.00016006223,0.0003678093,0.00030211714,0.0002175968],"domain_scores_gemma":[0.9992393,0.000059401227,0.0000611226,0.0003467572,0.00015189327,0.00014150229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040608074,0.0001200866,0.00013794008,0.000039976432,0.00020087442,0.00019813259,0.00049744715,0.000056660967,0.0000010627799],"category_scores_gemma":[0.00012733761,0.0000849985,0.000029643314,0.00019389113,0.000052053667,0.0005755968,0.0010770321,0.0002328026,0.000013331658],"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.00008250624,0.00013728492,0.035112552,0.00011800654,0.00003936143,0.0000763161,0.0052871443,0.0005304534,0.002854027,0.010314058,0.02465542,0.9207929],"study_design_scores_gemma":[0.00048741224,0.000073028736,0.007981049,0.00006359043,0.0000032821713,0.000056451947,0.00010637172,0.9846503,0.0010196951,0.00144558,0.003888374,0.00022484134],"about_ca_topic_score_codex":0.000044428296,"about_ca_topic_score_gemma":0.0000024895533,"teacher_disagreement_score":0.9841199,"about_ca_system_score_codex":0.000041228544,"about_ca_system_score_gemma":0.00005473102,"threshold_uncertainty_score":0.34661382},"labels":[],"label_agreement":null}]}