{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80420387,0.00072884536,0.15452555,0.0047227717,0.00039133235,0.00006399344,0.00058732886,0.00042403283,0.03435227],"genre_scores_gemma":[0.9881109,0.00015284162,0.005780981,0.00012769409,0.00002268235,0.000042512864,0.0000627515,0.00003285785,0.0056667603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984765,0.000046002126,0.0000057988677,0.000027848931,0.00002735478,0.00004526557],"domain_scores_gemma":[0.99915934,0.00050298625,0.00007531605,0.00006630139,0.00008446782,0.00011165449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033806628,0.00034633023,0.00084724964,0.00041154985,0.0006778399,0.0013525557,0.0016006152,0.0016028739,0.0034544098],"category_scores_gemma":[0.0021297724,0.00031911384,0.0007875549,0.00041522,0.0015720999,0.0010255607,0.0007688078,0.0012520136,0.0002770387],"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.00011433401,0.00005658001,0.0010894752,0.00003605875,0.000025995683,0.0001763899,0.00013981416,0.8551162,0.002249357,0.1374761,0.0010902985,0.0024293324],"study_design_scores_gemma":[0.000026686805,0.000014257959,0.00009859247,0.0000025628044,0.000007993445,0.000010605544,0.000019874911,0.97926795,0.00023036278,0.020034729,0.0002788307,0.000007513674],"about_ca_topic_score_codex":0.018367102,"about_ca_topic_score_gemma":0.011260965,"teacher_disagreement_score":0.018367102,"about_ca_system_score_codex":0.0014499603,"about_ca_system_score_gemma":0.0015897895,"threshold_uncertainty_score":0.03652042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06151771,0.00019969525,0.9290573,0.00013229017,0.00012480935,0.00005298345,0.00014000798,0.00075694453,0.008018171],"genre_scores_gemma":[0.7888184,0.00026489783,0.2031951,0.00006426308,0.00005357167,0.00015179385,0.00031142792,0.00023865204,0.0069018593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948126,0.00015638188,0.000033253866,0.0001524518,0.00009106273,0.00008569707],"domain_scores_gemma":[0.999231,0.0003637106,0.00007681458,0.00015221302,0.0001299906,0.000046326244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907458,0.00057005597,0.00052110525,0.00054501323,0.0006728018,0.0013864469,0.0013177934,0.0010068705,0.004764823],"category_scores_gemma":[0.0025661392,0.00041848302,0.001038962,0.00056244095,0.0016382283,0.0018513824,0.00095509057,0.0007793174,0.0006754118],"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.00015849798,0.0000482741,0.0005958456,0.00012325942,0.000033190645,0.00035285906,0.00040198717,0.31032917,0.012611192,0.64389026,0.0011780069,0.030277383],"study_design_scores_gemma":[0.000025756177,0.000052395088,0.00014427729,0.000019004532,0.00002074402,0.000076518976,0.00008308742,0.6236662,0.008796059,0.3601359,0.006954749,0.000025259744],"about_ca_topic_score_codex":0.003730602,"about_ca_topic_score_gemma":0.0038693564,"teacher_disagreement_score":0.004764823,"about_ca_system_score_codex":0.001090566,"about_ca_system_score_gemma":0.0007443527,"threshold_uncertainty_score":0.015939951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65120953,0.0005384963,0.24695997,0.00038898378,0.00031557545,0.00008561023,0.00038191953,0.002500786,0.09761906],"genre_scores_gemma":[0.9209184,0.00015119997,0.05921023,0.00018391272,0.000014020133,0.00008733509,0.00020098231,0.00020971148,0.019024223],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988484,0.000011459115,0.0000041858157,0.000026152418,0.000043109743,0.000030152938],"domain_scores_gemma":[0.99991775,0.000014755339,0.000011140294,0.000020518843,0.000014496437,0.000021319991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005927419,0.00029264233,0.00018071955,0.00024184908,0.00029897745,0.0005994136,0.00043023913,0.00040306692,0.004692033],"category_scores_gemma":[0.0001305814,0.00023126754,0.00021454932,0.00013940965,0.0003815841,0.00023713507,0.00054659916,0.00027454548,0.0012243079],"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.00014599724,0.00007273758,0.00045869654,0.00011558257,0.000015917336,0.00048602925,0.00012665652,0.019285196,0.8736539,0.08024364,0.0025389397,0.02285667],"study_design_scores_gemma":[0.0000735124,0.0001963457,0.0016523176,0.00003013857,0.000020718084,0.00063030655,0.000093230185,0.31300545,0.628731,0.0334083,0.02207791,0.0000808089],"about_ca_topic_score_codex":0.00045120847,"about_ca_topic_score_gemma":0.0008353024,"teacher_disagreement_score":0.004692033,"about_ca_system_score_codex":0.0003332108,"about_ca_system_score_gemma":0.00020728535,"threshold_uncertainty_score":0.015696466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.164522,0.017496198,0.7359989,0.01656207,0.0011772555,0.00011755631,0.00022213117,0.0002159321,0.06368792],"genre_scores_gemma":[0.95863235,0.0050638495,0.027440814,0.00037186127,0.00049776054,0.00007809107,0.000051675772,0.000028437822,0.007835134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992791,0.00029135877,0.000027340604,0.000084127816,0.00024289043,0.000075114745],"domain_scores_gemma":[0.9984067,0.0009938353,0.00014668028,0.00020370445,0.00017267361,0.000076499324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012225972,0.00020706787,0.00060948124,0.0005861938,0.0008615317,0.0015628767,0.0006461029,0.0010625948,0.002168152],"category_scores_gemma":[0.003556054,0.00025945244,0.00026190974,0.0008372419,0.002874397,0.0036654477,0.0011389154,0.0014190403,0.00020644354],"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.000032559994,0.0000193182,0.00014239956,0.00006368144,0.000007882442,0.000027953307,0.00008131561,0.019611122,0.0012224748,0.9673982,0.0015917505,0.009801218],"study_design_scores_gemma":[0.000010309992,0.000012163592,0.00012260237,0.00001664449,0.000004069086,0.000030228746,0.000039211904,0.11085693,0.00045492896,0.88482124,0.0036215282,0.000010028741],"about_ca_topic_score_codex":0.001063523,"about_ca_topic_score_gemma":0.000656737,"teacher_disagreement_score":0.002168152,"about_ca_system_score_codex":0.0013306095,"about_ca_system_score_gemma":0.0007430005,"threshold_uncertainty_score":0.009654343},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25800613,0.0030556417,0.53421915,0.0041493042,0.0018498838,0.00022271252,0.0006651365,0.0018930943,0.19593897],"genre_scores_gemma":[0.82582945,0.0009955302,0.1157466,0.0011047372,0.00094005786,0.00024215986,0.0004990705,0.0006649817,0.053977333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983455,0.00043394853,0.00016575411,0.00062450074,0.00023581923,0.00019447546],"domain_scores_gemma":[0.99725205,0.0014881565,0.00016879167,0.0005449514,0.0003279159,0.00021815702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009309274,0.000595629,0.0009224245,0.0017909058,0.0039574895,0.0048410133,0.0009828134,0.0016626449,0.01079742],"category_scores_gemma":[0.0031058767,0.00091487466,0.0014160696,0.0020943796,0.003848793,0.012091912,0.002879632,0.0026574414,0.0034296983],"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.000042061038,0.000017340732,0.00008963451,0.000032125055,0.000005653692,0.00009748774,0.00058553036,0.00009236681,0.0017729567,0.9896708,0.00097395235,0.0066201477],"study_design_scores_gemma":[0.0000183061,0.000032428336,0.00009967524,0.000018231183,0.000018177001,0.00032454095,0.00023911898,0.0011035317,0.002097391,0.9752465,0.020784056,0.00001803104],"about_ca_topic_score_codex":0.00068463315,"about_ca_topic_score_gemma":0.0007111229,"teacher_disagreement_score":0.01079742,"about_ca_system_score_codex":0.0009804579,"about_ca_system_score_gemma":0.00074044213,"threshold_uncertainty_score":0.03612095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0880636,0.00044900159,0.88656217,0.0008212368,0.00012873298,0.00005246643,0.00024791982,0.00048451006,0.023190336],"genre_scores_gemma":[0.7425047,0.00070293323,0.24012025,0.00045255743,0.0002388822,0.00014336084,0.00066267635,0.00053365174,0.014641002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993316,0.00019848223,0.00004392739,0.00018199637,0.00015840644,0.00008557587],"domain_scores_gemma":[0.9973072,0.0011785991,0.00015901061,0.0009317273,0.0002905432,0.00013301757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611437,0.0003115572,0.0011322502,0.0006893783,0.001315223,0.0016693574,0.0015500992,0.00088813953,0.0059792357],"category_scores_gemma":[0.0049084043,0.0005724713,0.0015304798,0.00078389276,0.0029063893,0.0041052536,0.0027711673,0.0021806518,0.0007707723],"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.00003720529,0.00002240737,0.00035317946,0.00007080646,0.000014824498,0.00006979552,0.00032008323,0.032038253,0.0015601745,0.94462806,0.0022500113,0.018635174],"study_design_scores_gemma":[0.000010336741,0.000018125982,0.00016880786,0.000011736969,0.00001179713,0.000043807668,0.000069759335,0.10488269,0.0010625191,0.888786,0.004922365,0.000011963644],"about_ca_topic_score_codex":0.0035207742,"about_ca_topic_score_gemma":0.0047934926,"teacher_disagreement_score":0.0059792357,"about_ca_system_score_codex":0.0009908656,"about_ca_system_score_gemma":0.0007553491,"threshold_uncertainty_score":0.020002544},"labels":[],"label_agreement":null},{"id":"W2005962757","doi":"10.1007/s11047-007-9045-9","title":"On the universality of peptide computing","year":2007,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Turing machine; Theory of computation; Turing; Universality (dynamical systems); Super-recursive algorithm; Construct (python library); Computation; Theoretical computer science; Non-deterministic Turing machine; Universal Turing machine; Artificial intelligence; Algorithm; Programming language","score_opus":0.012729422730591775,"score_gpt":0.26377731716144015,"score_spread":0.25104789443084835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005962757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16538903,0.023482215,0.57480824,0.024795815,0.0021327862,0.000090861286,0.0003046964,0.00071223604,0.20828405],"genre_scores_gemma":[0.93863416,0.005283317,0.04424171,0.0021398158,0.0018605781,0.00008678785,0.00011232145,0.00017706644,0.007464212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983491,0.0004731884,0.00009654428,0.0004145696,0.0004116401,0.0002549529],"domain_scores_gemma":[0.98817635,0.008776549,0.0002943887,0.0018122923,0.0006274399,0.0003130072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003033458,0.0004715048,0.0010920662,0.0012882333,0.0019831047,0.0027651424,0.0016301406,0.0015593895,0.0036349038],"category_scores_gemma":[0.012449859,0.00055639347,0.00095417426,0.0009951873,0.014259033,0.011714074,0.0031495509,0.004107832,0.0004339501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012859802,0.000007084013,0.00008331129,0.00003063227,0.000004505304,0.000025943324,0.00007391023,0.0015950755,0.00020545252,0.99393773,0.00047700107,0.0035465192],"study_design_scores_gemma":[0.0000031511884,0.0000041182934,0.000040243074,0.000008605661,0.0000017437103,0.000016386415,0.000008112963,0.0024211735,0.000120205965,0.9959859,0.0013860324,0.0000042053784],"about_ca_topic_score_codex":0.0011183715,"about_ca_topic_score_gemma":0.0007054224,"teacher_disagreement_score":0.0036349038,"about_ca_system_score_codex":0.0016201856,"about_ca_system_score_gemma":0.0007882276,"threshold_uncertainty_score":0.01604265},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06844439,0.0044698203,0.8773872,0.0033767126,0.0001863866,0.00013683767,0.0014951946,0.0014975035,0.043005895],"genre_scores_gemma":[0.8492911,0.0042311847,0.12811393,0.00083332136,0.00037415588,0.00046463072,0.0023894352,0.00051151606,0.01379066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969772,0.0006411001,0.0001524093,0.0006926691,0.0010224896,0.00051423034],"domain_scores_gemma":[0.9729435,0.023072721,0.0012446917,0.0008621407,0.0011347431,0.000742051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026597234,0.0016516289,0.001185185,0.0025161577,0.0013781886,0.0034133564,0.0023364883,0.0019220975,0.009672546],"category_scores_gemma":[0.018164808,0.00072953076,0.0018410307,0.0022932028,0.003376415,0.0076012393,0.0033315117,0.0051615722,0.0009843047],"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.00021235087,0.00008297369,0.0007593257,0.0005131631,0.00008332728,0.00020917392,0.00032419918,0.31658387,0.0035635938,0.6511799,0.0031407303,0.023347395],"study_design_scores_gemma":[0.000018428287,0.000035170448,0.00018124226,0.000058109,0.000031308107,0.000059632024,0.000039136143,0.3726069,0.0012029841,0.62361073,0.0021359979,0.000020431371],"about_ca_topic_score_codex":0.0052512884,"about_ca_topic_score_gemma":0.0044864654,"teacher_disagreement_score":0.009672546,"about_ca_system_score_codex":0.003909823,"about_ca_system_score_gemma":0.0018824663,"threshold_uncertainty_score":0.03235793},"labels":[],"label_agreement":null},{"id":"W2013089631","doi":"10.1007/s11047-004-3591-1","title":"DNA and quantum based algorithms for VLSI circuits testing","year":2005,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Very-large-scale integration; Computer science; Algorithm; DNA computing; Theory of computation; Electronic circuit; Test vector; Parallel computing; Computer engineering; Computation; Embedded system; Engineering; Artificial intelligence","score_opus":0.03375845069028024,"score_gpt":0.28606512766318987,"score_spread":0.25230667697290965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013089631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033560183,0.0039992863,0.93207633,0.0034411538,0.00049525825,0.00008721925,0.0001620961,0.0004710453,0.025707362],"genre_scores_gemma":[0.58204275,0.0022464667,0.39412034,0.00083041866,0.0005635331,0.00022678234,0.00023010795,0.00014677526,0.019592822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990221,0.00037273217,0.00004284669,0.0001364859,0.0003506559,0.000075198775],"domain_scores_gemma":[0.9976864,0.0016046667,0.00010551775,0.0003038414,0.00023821372,0.000061404964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000919795,0.00045259343,0.00064070034,0.0009642439,0.0006304326,0.001469715,0.0015039358,0.0013824677,0.005975208],"category_scores_gemma":[0.0066295587,0.00026439686,0.0005145577,0.001157467,0.0025972407,0.0034228163,0.0010644576,0.0014635175,0.000580887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010162479,0.00003200466,0.00021531312,0.000091321774,0.000017649236,0.000035307916,0.00006528913,0.031932786,0.002491985,0.8803328,0.0030134174,0.08167046],"study_design_scores_gemma":[0.00002092722,0.000022594728,0.00012492789,0.000018270428,0.0000070378874,0.000034431563,0.000017036928,0.09919946,0.0013784056,0.89360833,0.0055564772,0.000012108904],"about_ca_topic_score_codex":0.0015578141,"about_ca_topic_score_gemma":0.0019132976,"teacher_disagreement_score":0.005975208,"about_ca_system_score_codex":0.0016954246,"about_ca_system_score_gemma":0.00085634814,"threshold_uncertainty_score":0.019989073},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06272367,0.00035704594,0.9304913,0.0004016424,0.00007555106,0.000046269448,0.000019438494,0.00012819035,0.005756929],"genre_scores_gemma":[0.8052862,0.00029687365,0.18378715,0.00023223169,0.00008238375,0.00018124779,0.00004454377,0.000121229714,0.009968101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996736,0.00015139236,0.00001395524,0.000044146647,0.00008618291,0.00003081424],"domain_scores_gemma":[0.9990969,0.00051739434,0.00007886068,0.000091434806,0.00015510198,0.000060401184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012865014,0.00047386516,0.00088466407,0.00058281416,0.00043758505,0.0008579571,0.001314036,0.0015414233,0.001291163],"category_scores_gemma":[0.004122089,0.0005430823,0.0006812013,0.0004988665,0.0011424783,0.001068776,0.0014292274,0.0010570463,0.0002657786],"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.00006628791,0.000039776744,0.0004574415,0.00003616454,0.00004904667,0.00006580423,0.000086230604,0.92811346,0.002385881,0.047361143,0.00055013836,0.020788664],"study_design_scores_gemma":[0.0000066892026,0.000012813252,0.000037471873,0.000002399111,0.0000033181825,0.000006020377,0.0000034678017,0.9957218,0.00011282681,0.0039467146,0.00014283104,0.0000036023719],"about_ca_topic_score_codex":0.002386771,"about_ca_topic_score_gemma":0.0016287512,"teacher_disagreement_score":0.002386771,"about_ca_system_score_codex":0.0007432856,"about_ca_system_score_gemma":0.0006213099,"threshold_uncertainty_score":0.006803751},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00535459,0.00025483462,0.9931467,0.00008780608,0.000059758462,0.00008611967,0.000043765947,0.00017581737,0.00079045567],"genre_scores_gemma":[0.14284004,0.00049369206,0.8498669,0.00019248945,0.00012402183,0.0003451483,0.00043781367,0.00011881843,0.005581049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985745,0.00038511338,0.00009481851,0.000320956,0.0005300054,0.000094586765],"domain_scores_gemma":[0.99815613,0.0006617058,0.00012893984,0.00034974687,0.00061384536,0.00008956667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016999834,0.00070724153,0.0015098765,0.00391337,0.0020142635,0.0011439295,0.0023856848,0.0015614615,0.0025963676],"category_scores_gemma":[0.0051820865,0.0004705577,0.0014782266,0.0028821607,0.0010950749,0.0019310713,0.0016972359,0.0015010893,0.0007621138],"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.0003485145,0.00025724724,0.0028946844,0.0005285127,0.00041065767,0.0002556814,0.00085031026,0.2502554,0.021317448,0.12179348,0.010850624,0.5902375],"study_design_scores_gemma":[0.00002142241,0.00011235207,0.0010906358,0.000038338934,0.00005364423,0.00025486597,0.00012404259,0.9450967,0.003612828,0.043320447,0.0062374496,0.00003732292],"about_ca_topic_score_codex":0.0069892886,"about_ca_topic_score_gemma":0.0071506756,"teacher_disagreement_score":0.0069892886,"about_ca_system_score_codex":0.0013336696,"about_ca_system_score_gemma":0.0010245362,"threshold_uncertainty_score":0.01389724},"labels":[],"label_agreement":null},{"id":"W2031426449","doi":"10.1007/s11047-012-9329-6","title":"Extended Watson–Crick L systems with regular trigger languages and restricted derivation modes","year":2012,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Watson; Recursively enumerable language; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Morphism; Theory of computation; Regular language; Mathematics; Recursively enumerable set; Context (archaeology); Computer science; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Theoretical computer science; Automaton","score_opus":0.009170351526350288,"score_gpt":0.2609547408258283,"score_spread":0.25178438929947805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031426449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18048388,0.00020413676,0.76838815,0.00064365304,0.0001610476,0.00016963894,0.00042044642,0.003455844,0.0460732],"genre_scores_gemma":[0.87008274,0.00010063991,0.11275147,0.00029103356,0.00005081675,0.00022646142,0.000305245,0.000719072,0.015472531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859935,0.000421411,0.00013456216,0.00032688328,0.00029116665,0.00022664557],"domain_scores_gemma":[0.9969458,0.0010950961,0.00023037357,0.001038228,0.00045548202,0.00023502464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012935847,0.00050406245,0.0005865088,0.000725089,0.000994685,0.0026412772,0.002071357,0.0012921484,0.010508639],"category_scores_gemma":[0.0052262996,0.0006357142,0.0007775775,0.0006942787,0.0023272708,0.0037499731,0.0025296563,0.0017416269,0.0024759963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017920986,0.00006554946,0.00035252408,0.000067266286,0.000016081534,0.00042455035,0.0003842161,0.012484037,0.010536245,0.961711,0.0011582059,0.0126210805],"study_design_scores_gemma":[0.00008053852,0.00005866202,0.00009701774,0.000016450593,0.000014843472,0.000212605,0.00011304446,0.11517833,0.015262137,0.86248904,0.00640621,0.00007105162],"about_ca_topic_score_codex":0.00088026526,"about_ca_topic_score_gemma":0.0007740536,"teacher_disagreement_score":0.010508639,"about_ca_system_score_codex":0.0009799723,"about_ca_system_score_gemma":0.0012022662,"threshold_uncertainty_score":0.03515488},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7534558,0.0005837477,0.20651919,0.0011047806,0.0004261926,0.00006298384,0.00014047264,0.0004483415,0.03725851],"genre_scores_gemma":[0.99112797,0.00012899896,0.005075104,0.00007085183,0.000022034925,0.000023720284,0.00003487045,0.000079992846,0.003436528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955684,0.00013360285,0.00001886246,0.000057581405,0.0001272912,0.00010586186],"domain_scores_gemma":[0.9974446,0.0012219197,0.00044938366,0.00037137212,0.00024088818,0.00027182946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094259036,0.0007043775,0.00079654163,0.0005491059,0.00093101576,0.0015490339,0.0013284127,0.001544685,0.0042604753],"category_scores_gemma":[0.0062365937,0.00081252493,0.00079557486,0.00039292776,0.002490887,0.0020489546,0.0014740132,0.0010101801,0.00040184442],"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.00014553517,0.000040264622,0.0003806233,0.000039997525,0.000012509482,0.00019259438,0.000057796,0.9658808,0.0063730464,0.024742043,0.0002913207,0.0018434857],"study_design_scores_gemma":[0.00002075964,0.00005066726,0.0003714825,0.000004515394,0.000011361825,0.000035851965,0.000032071057,0.98807317,0.0016702961,0.009543801,0.00016982571,0.000016218262],"about_ca_topic_score_codex":0.0033444674,"about_ca_topic_score_gemma":0.002237821,"teacher_disagreement_score":0.0042604753,"about_ca_system_score_codex":0.0007691826,"about_ca_system_score_gemma":0.00065586664,"threshold_uncertainty_score":0.014252722},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1429344,0.0009291627,0.79990715,0.0078374455,0.00094353745,0.00043994846,0.00069710304,0.0077660778,0.038545106],"genre_scores_gemma":[0.59010696,0.0004545324,0.38665223,0.0006423139,0.00015456443,0.0002567016,0.00053792057,0.0012377282,0.019957],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973304,0.0006647014,0.00019896153,0.0007132772,0.0005077653,0.0005849188],"domain_scores_gemma":[0.99490416,0.0015435297,0.00017765723,0.002806609,0.00040466132,0.0001633569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012339543,0.0011015026,0.0013086762,0.0004326457,0.0015490451,0.0028571386,0.0017607848,0.0019821678,0.011338327],"category_scores_gemma":[0.008763823,0.00078226347,0.0013026051,0.000762381,0.0016553829,0.009987143,0.0024130992,0.0028045012,0.006136742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029417807,0.0007062978,0.0034315565,0.00093919167,0.0003395806,0.0006123636,0.00079054007,0.07263241,0.051366813,0.13473009,0.04600732,0.68550193],"study_design_scores_gemma":[0.0004654241,0.00036203372,0.00084035675,0.00015039928,0.00026995325,0.0013485138,0.0011369924,0.32249227,0.074461766,0.5688168,0.029472593,0.00018296478],"about_ca_topic_score_codex":0.0011912413,"about_ca_topic_score_gemma":0.0019218534,"teacher_disagreement_score":0.011338327,"about_ca_system_score_codex":0.00081791676,"about_ca_system_score_gemma":0.0037521897,"threshold_uncertainty_score":0.03793049},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06635781,0.00023120022,0.92665374,0.0003393436,0.00012195254,0.0002403827,0.0008682926,0.0029882279,0.0021990577],"genre_scores_gemma":[0.35731837,0.00017088327,0.6348016,0.00012235371,0.00006400341,0.00031518086,0.004166872,0.00031872964,0.00272191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952257,0.0000856712,0.000037541115,0.00012525299,0.00016998978,0.00005896957],"domain_scores_gemma":[0.9980627,0.0009761859,0.000100873774,0.00024445012,0.00055902015,0.000056715802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006987719,0.00049371395,0.0007142615,0.001312465,0.00050292216,0.00080847484,0.0011587925,0.00087906956,0.002793476],"category_scores_gemma":[0.0043445453,0.0003672015,0.0010237391,0.0011814305,0.00026959353,0.0010720335,0.0008318321,0.0012030641,0.0012500153],"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.00033529228,0.0002531684,0.004956946,0.00026867262,0.00010096076,0.00047236285,0.00025483474,0.088514715,0.025668873,0.012577263,0.017299524,0.8492974],"study_design_scores_gemma":[0.000034824945,0.00008857363,0.0010296237,0.000031843145,0.000054653003,0.00015880022,0.000068008914,0.9541559,0.008707437,0.031639256,0.0040181284,0.000012967393],"about_ca_topic_score_codex":0.0011877347,"about_ca_topic_score_gemma":0.0024608043,"teacher_disagreement_score":0.002793476,"about_ca_system_score_codex":0.00044020658,"about_ca_system_score_gemma":0.00097360916,"threshold_uncertainty_score":0.009345055},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27212167,0.00030957797,0.71617687,0.00042007148,0.00007060208,0.00006496829,0.000028692772,0.00029118848,0.01051647],"genre_scores_gemma":[0.8086615,0.00021794872,0.18678224,0.00007652033,0.000023837692,0.00014672684,0.0000393698,0.00008306765,0.0039688684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998778,0.00004070003,0.000007799841,0.000021448635,0.00003689492,0.000015344298],"domain_scores_gemma":[0.9995204,0.00030204694,0.000052981748,0.000040295705,0.000048795857,0.00003542392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044022987,0.00028644386,0.00041171286,0.00030376966,0.00054702256,0.0007338036,0.00072866917,0.0005228362,0.0014437601],"category_scores_gemma":[0.0013637512,0.00030333005,0.00044272587,0.0003325662,0.0015065955,0.00071604503,0.0007835365,0.0005549177,0.000102049744],"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.000030504194,0.000043320073,0.00053448306,0.00007625405,0.000020786169,0.0000815726,0.00025823095,0.85317475,0.0058634644,0.11921535,0.0005414124,0.020159815],"study_design_scores_gemma":[0.000016558191,0.000021166235,0.00011393609,0.00000459102,0.000003930583,0.000015400437,0.000036044283,0.9562603,0.0006746703,0.042055503,0.0007922388,0.0000055568407],"about_ca_topic_score_codex":0.001628634,"about_ca_topic_score_gemma":0.0020937019,"teacher_disagreement_score":0.001628634,"about_ca_system_score_codex":0.00047841034,"about_ca_system_score_gemma":0.00034690386,"threshold_uncertainty_score":0.0048298836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4088552,0.0008276937,0.55936,0.0024032157,0.00021866694,0.000101571575,0.00042541465,0.00045511263,0.027353145],"genre_scores_gemma":[0.9485736,0.0003789146,0.043712325,0.0000846967,0.000040187384,0.00011792089,0.00010863112,0.000043496333,0.006940295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998678,0.00005525881,0.0000055868372,0.000026499009,0.000030472318,0.000014321232],"domain_scores_gemma":[0.99974304,0.00013307568,0.000040092375,0.000017535185,0.000027138261,0.000039137725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023916776,0.00033216982,0.00057383836,0.00031025862,0.000530939,0.0009897377,0.0011081051,0.001088304,0.002012109],"category_scores_gemma":[0.0007827705,0.00027893158,0.0005562927,0.00039862838,0.0010249878,0.00081687426,0.000634751,0.00056592585,0.00022171532],"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.000046629608,0.000029548533,0.00043944654,0.000024608637,0.000020511794,0.00010245984,0.00005351834,0.9495673,0.002592768,0.044724774,0.0003249953,0.0020733532],"study_design_scores_gemma":[0.000012156139,0.00000882431,0.00006375433,0.0000012266544,0.0000033562847,0.000008590016,0.0000069411576,0.9922401,0.0001371599,0.0071395063,0.00037534823,0.000002993851],"about_ca_topic_score_codex":0.0083776,"about_ca_topic_score_gemma":0.003379404,"teacher_disagreement_score":0.0083776,"about_ca_system_score_codex":0.0006720748,"about_ca_system_score_gemma":0.00070637907,"threshold_uncertainty_score":0.01665771},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39271107,0.00035352656,0.58341384,0.0017604661,0.00022314797,0.0000553132,0.00017936269,0.00046721884,0.020836042],"genre_scores_gemma":[0.9348655,0.00014686892,0.061057676,0.00014002653,0.000036171466,0.00005682929,0.0001258474,0.000069500195,0.0035015084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.0001315651,0.000022835087,0.00007312673,0.00006520191,0.000065981694],"domain_scores_gemma":[0.9972487,0.0021745113,0.000102301055,0.00022883808,0.00016485654,0.000080659425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000582239,0.00032620307,0.00091729424,0.00032121077,0.0006512738,0.0015125918,0.0011393857,0.0013572786,0.003374939],"category_scores_gemma":[0.0059968526,0.00029990185,0.0006269861,0.0003371636,0.0013546841,0.0019639537,0.0014297379,0.001229236,0.0002861515],"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.0002039004,0.00009287657,0.0020708214,0.00030953393,0.000040950603,0.00032048728,0.00033351572,0.39536747,0.0063924757,0.5344819,0.0028805537,0.057505544],"study_design_scores_gemma":[0.00003355939,0.000026006493,0.00010687817,0.000010171301,0.0000105409945,0.000042548734,0.00006526911,0.6838639,0.0018075047,0.31327546,0.0007464933,0.000011744939],"about_ca_topic_score_codex":0.0022809727,"about_ca_topic_score_gemma":0.0019679414,"teacher_disagreement_score":0.003374939,"about_ca_system_score_codex":0.0005346761,"about_ca_system_score_gemma":0.0007879643,"threshold_uncertainty_score":0.011290252},"labels":[],"label_agreement":null},{"id":"W2077823020","doi":"10.1007/s11047-013-9364-y","title":"Computing maximal Kleene closures that are embeddable in a given subword-closed language","year":2013,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Closure (psychology); Regular language; Computer science; Set (abstract data type); Property (philosophy); Characterization (materials science); Discrete mathematics; Coding (social sciences); DNA computing; Mathematics; Algorithm; Theoretical computer science; Automaton; Programming language","score_opus":0.011136271938677993,"score_gpt":0.2531903348998224,"score_spread":0.2420540629611444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077823020","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5813738,0.0005460904,0.39475578,0.0011893624,0.00016968507,0.00015076752,0.0016295017,0.0031791974,0.017005889],"genre_scores_gemma":[0.8283541,0.00027070587,0.16115412,0.00021434762,0.00010140555,0.00009769949,0.0027868398,0.00079237676,0.006228272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826294,0.00018122653,0.0001736572,0.00059523416,0.00045133417,0.00033560116],"domain_scores_gemma":[0.99498886,0.0033336945,0.0003488516,0.0004955793,0.00051950535,0.0003135366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011001287,0.0008284091,0.0011062124,0.001227049,0.0010952188,0.0051107393,0.0013321362,0.0011965516,0.0068626083],"category_scores_gemma":[0.007740821,0.0009115057,0.0019767305,0.0016845537,0.0021460075,0.010974375,0.0026598298,0.0023229646,0.0012715384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017180066,0.00059876544,0.005882139,0.001637944,0.0002448011,0.0012304906,0.0055649932,0.027029708,0.06530769,0.74895465,0.0072266795,0.13460413],"study_design_scores_gemma":[0.00007916403,0.00013832941,0.0006413696,0.000109221146,0.0001260566,0.00038074475,0.0013010453,0.030596431,0.02836626,0.9306186,0.0075652506,0.000077552715],"about_ca_topic_score_codex":0.0011188788,"about_ca_topic_score_gemma":0.002188947,"teacher_disagreement_score":0.0068626083,"about_ca_system_score_codex":0.0010641807,"about_ca_system_score_gemma":0.0010088183,"threshold_uncertainty_score":0.022957742},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005175241,0.008450187,0.5524719,0.02757637,0.0041704862,0.00007280939,0.0007981671,0.0016746095,0.39961022],"genre_scores_gemma":[0.4782501,0.007852509,0.16264871,0.0073744985,0.004686929,0.00032815532,0.0017491097,0.0028839842,0.334226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981488,0.00068449316,0.0001037188,0.0005254609,0.00038044556,0.00015704788],"domain_scores_gemma":[0.9979044,0.0008451011,0.000060438277,0.0008575528,0.00027224122,0.000060257793],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010870725,0.0008461084,0.00080504845,0.0011672553,0.0021730897,0.0057831244,0.0012145609,0.0021687567,0.04316406],"category_scores_gemma":[0.0050749546,0.0007495918,0.0010608066,0.0017972976,0.007278461,0.0133849755,0.0025782161,0.005090184,0.011996924],"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.0000050270596,0.0000024600276,0.0000135489545,0.00002343102,0.0000019828772,0.0000050888157,0.000071957715,0.00014347397,0.000054245404,0.98768324,0.0045189573,0.0074766553],"study_design_scores_gemma":[0.0000035227022,0.0000035830767,0.000017699624,0.000023950353,0.0000049395558,0.000019375013,0.000021564869,0.0007973902,0.00023289458,0.94033444,0.058535825,0.000004775197],"about_ca_topic_score_codex":0.0044037635,"about_ca_topic_score_gemma":0.0028336628,"teacher_disagreement_score":0.99782693,"about_ca_system_score_codex":0.0028589936,"about_ca_system_score_gemma":0.0016847557,"threshold_uncertainty_score":0.1443981},"labels":[],"label_agreement":null},{"id":"W2092820948","doi":"10.1023/b:naco.0000006770.91995.ec","title":"Algorithms for testing that sets of DNA words concatenate without secondary structure","year":2003,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Set (abstract data type); Theory of computation; Computer science; Algorithm; Nucleic acid secondary structure; Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; RNA; Genetics; Biology","score_opus":0.028398655593426917,"score_gpt":0.2862824322705501,"score_spread":0.2578837766771232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092820948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25705525,0.00037739045,0.71815467,0.0018313106,0.00024816615,0.00092540006,0.0023581428,0.010957444,0.008092275],"genre_scores_gemma":[0.45518485,0.000124204,0.53309965,0.00077707577,0.00016807862,0.0011747591,0.0058340933,0.0004929375,0.0031443338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99381423,0.001720815,0.00072560925,0.0020035289,0.0013278608,0.0004079655],"domain_scores_gemma":[0.9325448,0.0562123,0.002239935,0.0048351,0.0032550853,0.0009128163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058332263,0.001942707,0.0012938449,0.002031161,0.0014844786,0.002486986,0.004092928,0.004335195,0.007320127],"category_scores_gemma":[0.038732115,0.0008050707,0.0022160185,0.0019378951,0.0026332026,0.007594242,0.0031783958,0.002126618,0.0020983028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030100786,0.0016217664,0.04239597,0.0008977585,0.0006629525,0.000450204,0.00060625724,0.11057404,0.020709878,0.038705327,0.016364733,0.7640011],"study_design_scores_gemma":[0.00050892774,0.00072710123,0.003387698,0.000117675205,0.00023297158,0.000693963,0.00048223324,0.84338516,0.027076244,0.11933318,0.003984986,0.000069880676],"about_ca_topic_score_codex":0.0014941045,"about_ca_topic_score_gemma":0.0022328822,"teacher_disagreement_score":0.007320127,"about_ca_system_score_codex":0.0011592342,"about_ca_system_score_gemma":0.003129848,"threshold_uncertainty_score":0.030849397},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24171872,0.0021475754,0.6671362,0.014586772,0.00054303743,0.0007454868,0.006949199,0.001667255,0.064505674],"genre_scores_gemma":[0.756529,0.0014016028,0.21143802,0.001745828,0.00039157222,0.0009831195,0.0046859467,0.00092794315,0.021896984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967109,0.0011690703,0.00017620804,0.00074300845,0.00058842567,0.00061239453],"domain_scores_gemma":[0.97313356,0.02326894,0.0008080715,0.0013053128,0.0008646825,0.00061930466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541608,0.0013481625,0.0027124637,0.0010494426,0.002249577,0.0042058886,0.0044370415,0.00410447,0.014600721],"category_scores_gemma":[0.019998765,0.0016382617,0.0030244673,0.0022325995,0.0036189728,0.008821535,0.0034296776,0.0064035025,0.0012312176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090794533,0.00039780702,0.0012851555,0.0013783643,0.00022810033,0.00067851937,0.00061262795,0.64523494,0.0024936898,0.2934233,0.021875879,0.03148364],"study_design_scores_gemma":[0.00019991667,0.00006628669,0.00030727248,0.00008495339,0.00005670861,0.00025356823,0.00020643881,0.33247396,0.001293243,0.6609784,0.004039749,0.000039547333],"about_ca_topic_score_codex":0.0061908597,"about_ca_topic_score_gemma":0.004975695,"teacher_disagreement_score":0.014600721,"about_ca_system_score_codex":0.0022982364,"about_ca_system_score_gemma":0.0029717912,"threshold_uncertainty_score":0.048844278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7811238,0.00017417734,0.2097009,0.00071864127,0.00023641154,0.0000690812,0.00027795025,0.0020293903,0.005669647],"genre_scores_gemma":[0.96872205,0.000051052142,0.029138774,0.00010427378,0.000009004058,0.000027969518,0.00005855519,0.00006261043,0.0018257343],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999136,0.000015088057,0.0000046824002,0.00002969832,0.000026134845,0.000010876208],"domain_scores_gemma":[0.99980634,0.00007144747,0.000038769667,0.000023811972,0.000025366964,0.000034352248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010611604,0.00018313489,0.0001352907,0.00013390587,0.00012701542,0.000255183,0.00034274618,0.00030590664,0.0012054185],"category_scores_gemma":[0.00067618303,0.000098061806,0.00013435914,0.00012484667,0.00027680848,0.00020305025,0.00016471719,0.0002752925,0.00016382859],"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.00015034656,0.000054725806,0.00039236987,0.0000847503,0.000015855585,0.00011824449,0.00003390997,0.013783156,0.9626468,0.012552423,0.00035547902,0.009812063],"study_design_scores_gemma":[0.000066479275,0.00036155892,0.0012964301,0.000012991759,0.000032388783,0.00040042153,0.000015348804,0.27164197,0.7147541,0.0059837685,0.0054002474,0.00003424541],"about_ca_topic_score_codex":0.00026407844,"about_ca_topic_score_gemma":0.00023175955,"teacher_disagreement_score":0.0012054185,"about_ca_system_score_codex":0.0002449917,"about_ca_system_score_gemma":0.0001887296,"threshold_uncertainty_score":0.0040324926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0829298,0.0022428003,0.8860911,0.0014068667,0.00029923202,0.000053339674,0.00004094042,0.00022863736,0.026707165],"genre_scores_gemma":[0.7196604,0.001306016,0.25683948,0.0003978124,0.0002836445,0.00018589837,0.00009175085,0.00022445233,0.021010516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907756,0.0004401944,0.000040153245,0.00016065894,0.00022692069,0.000054549386],"domain_scores_gemma":[0.9969699,0.0021224888,0.00017749565,0.00042462713,0.00021528528,0.000090336405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010580452,0.00027755872,0.0005918248,0.000652731,0.00060483674,0.0012726494,0.0012277523,0.0014470821,0.003617412],"category_scores_gemma":[0.009708064,0.0004135049,0.00047917338,0.0014508408,0.0024983115,0.0027409457,0.001271221,0.001992594,0.00045823096],"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.000037020436,0.000033440778,0.00079033634,0.00008327025,0.000034419743,0.00018253336,0.00038033424,0.047298178,0.0009273553,0.884747,0.0012466054,0.0642394],"study_design_scores_gemma":[0.000010857256,0.000017413597,0.00013332223,0.000015908363,0.000010109474,0.00009688685,0.00003605491,0.06597924,0.00029645508,0.93091697,0.002479486,0.0000072153025],"about_ca_topic_score_codex":0.0012317725,"about_ca_topic_score_gemma":0.0011573402,"teacher_disagreement_score":0.003617412,"about_ca_system_score_codex":0.00063309737,"about_ca_system_score_gemma":0.00041391427,"threshold_uncertainty_score":0.012101412},"labels":[],"label_agreement":null},{"id":"W2132853600","doi":"10.1007/s11047-009-9131-2","title":"Watson–Crick palindromes in DNA computing","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Palindrome; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Catenation; Context (archaeology); Set (abstract data type); Mathematics; Combinatorics; Watson; Theory of computation; DNA computing; Sequence (biology); Discrete mathematics; Algebra over a field; Pure mathematics; DNA; Computer science; Base pair; Genome; Algorithm; Genetics; Biology","score_opus":0.009755713941148563,"score_gpt":0.26802959689483413,"score_spread":0.2582738829536856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132853600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19265693,0.037574217,0.55238795,0.008200251,0.0025631513,0.00015186111,0.0002649658,0.0008715566,0.2053291],"genre_scores_gemma":[0.8620683,0.0061651138,0.1131674,0.0005505192,0.00069353235,0.00012119996,0.000105915315,0.00014021494,0.01698781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953556,0.00015549749,0.00003517071,0.000084443076,0.00014581456,0.000043507178],"domain_scores_gemma":[0.999185,0.00048349964,0.000060016504,0.00012679408,0.00010062737,0.000043932047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050705165,0.0002930019,0.00051394204,0.0007102509,0.000934784,0.0016144479,0.0010105574,0.0010449014,0.0029457621],"category_scores_gemma":[0.003255399,0.00038044955,0.00022512488,0.0012390993,0.002501273,0.0028101797,0.00058998034,0.001712908,0.00068659335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028083114,0.000013556505,0.00006232015,0.000063656174,0.0000026873267,0.000081093116,0.000100919606,0.0038494316,0.0015454127,0.9778845,0.00085453305,0.015513844],"study_design_scores_gemma":[0.000008091985,0.000014706339,0.000042094547,0.00002368349,0.0000035572,0.00010762728,0.000044836514,0.014142227,0.002423082,0.97240305,0.010775484,0.00001164002],"about_ca_topic_score_codex":0.0012655581,"about_ca_topic_score_gemma":0.0007608562,"teacher_disagreement_score":0.0029457621,"about_ca_system_score_codex":0.0007828041,"about_ca_system_score_gemma":0.0005303207,"threshold_uncertainty_score":0.0098544955},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6265086,0.00019561042,0.36385423,0.001161561,0.000030910476,0.00010559398,0.00032961776,0.00016132853,0.0076525705],"genre_scores_gemma":[0.98432285,0.000088107816,0.014857756,0.000033125805,0.000011476503,0.000049334765,0.00009478632,0.00001836187,0.0005241761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993401,0.0002451092,0.000039825707,0.00014110164,0.00010329914,0.00013056627],"domain_scores_gemma":[0.9972988,0.0014745325,0.00055348943,0.00023531399,0.00018573889,0.00025219182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010590325,0.00038848122,0.00040562637,0.0007446894,0.0004833639,0.0013334329,0.00084613665,0.000506689,0.0009750633],"category_scores_gemma":[0.004418691,0.0003220399,0.0007536422,0.00075455266,0.0013349017,0.0017802743,0.0008763966,0.0007653076,0.00009625457],"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.000037621638,0.000084003885,0.018285261,0.000030234563,0.000053902026,0.00009697323,0.00065488304,0.90881175,0.0007987915,0.065986,0.00033215882,0.0048284647],"study_design_scores_gemma":[0.0000038090614,0.0000119046845,0.0023204102,0.0000033357294,0.000005567829,0.000010226009,0.00014518609,0.97496223,0.00006296479,0.022178965,0.00028979164,0.000005591967],"about_ca_topic_score_codex":0.03239637,"about_ca_topic_score_gemma":0.020066407,"teacher_disagreement_score":0.03239637,"about_ca_system_score_codex":0.0022404129,"about_ca_system_score_gemma":0.001956161,"threshold_uncertainty_score":0.06441563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13666336,0.00043898437,0.84301686,0.0014423251,0.00019397642,0.00013962113,0.00054932974,0.0006776773,0.01687792],"genre_scores_gemma":[0.9518855,0.00037209503,0.030002292,0.00022258257,0.00006163007,0.00023926537,0.00017537597,0.000058253318,0.016982986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991309,0.00025235894,0.000034008335,0.000270237,0.00018678185,0.00012563953],"domain_scores_gemma":[0.99464524,0.0038826303,0.00053648534,0.00034613066,0.00034104008,0.00024842413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009988729,0.00063977164,0.0012320123,0.0006490153,0.00071642146,0.0014074999,0.0020167055,0.0017654108,0.00553433],"category_scores_gemma":[0.0054081315,0.0006001539,0.000658276,0.0006187977,0.0018172805,0.0016296819,0.0015002063,0.0013083951,0.00065472623],"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.000145673,0.00006152192,0.00060157053,0.00011073026,0.000039357466,0.0001825945,0.00008627193,0.77693534,0.0032413744,0.20718613,0.0011368479,0.0102727],"study_design_scores_gemma":[0.000026336353,0.000025104118,0.000075197844,0.0000034812872,0.0000076151655,0.00002605287,0.000009193461,0.94861495,0.0005656087,0.050123826,0.00051280484,0.000009714944],"about_ca_topic_score_codex":0.0023378814,"about_ca_topic_score_gemma":0.0020696663,"teacher_disagreement_score":0.00553433,"about_ca_system_score_codex":0.0014463168,"about_ca_system_score_gemma":0.0011457305,"threshold_uncertainty_score":0.018514156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6370847,0.00043834504,0.35798997,0.0005722126,0.00010872557,0.00003009294,0.000113430375,0.0006463237,0.003016115],"genre_scores_gemma":[0.9921685,0.00007061594,0.006697587,0.00003409622,0.000016552862,0.000017100505,0.000050270668,0.000042202108,0.000903094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998412,0.00005890792,0.0000055703135,0.00003187539,0.000029220917,0.000033180866],"domain_scores_gemma":[0.9956375,0.0033419875,0.00031365425,0.00017437454,0.00030945538,0.00022307906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009492872,0.00030796614,0.00077097793,0.0007100195,0.0005633219,0.0009724786,0.00090622116,0.0010245709,0.0018398646],"category_scores_gemma":[0.0068425043,0.00037419779,0.00035740787,0.00033582348,0.0011350055,0.0011851591,0.0007625816,0.001376958,0.00020110693],"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.00018458541,0.00008942156,0.004578273,0.00007438583,0.000033687393,0.000109172135,0.00017660663,0.90643203,0.004480063,0.07411906,0.00076424965,0.008958435],"study_design_scores_gemma":[0.0000021583571,0.00000459399,0.00009732302,0.0000017589842,0.0000013883986,0.000002788597,0.000003357005,0.9957295,0.00015337745,0.003981298,0.000020586323,0.0000018163892],"about_ca_topic_score_codex":0.0038210538,"about_ca_topic_score_gemma":0.004272738,"teacher_disagreement_score":0.0038210538,"about_ca_system_score_codex":0.0008042391,"about_ca_system_score_gemma":0.0007110199,"threshold_uncertainty_score":0.0075976253},"labels":[],"label_agreement":null},{"id":"W2272561321","doi":"10.1007/s11047-015-9538-x","title":"On the overlap assembly of strings and languages","year":2016,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; String (physics); Formal language; Concatenation (mathematics); Substitution (logic); Theoretical computer science; Extension (predicate logic); Catenation; Context (archaeology); Algorithm; Mathematics; Programming language; DNA; Arithmetic; Genetics; Biology","score_opus":0.008136046411732654,"score_gpt":0.2525398961503987,"score_spread":0.24440384973866602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272561321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17192963,0.001145477,0.7441522,0.0019829876,0.000301811,0.00008686373,0.00024446993,0.0007147209,0.07944186],"genre_scores_gemma":[0.7810902,0.00091472606,0.18105711,0.00061730377,0.00038987742,0.0002581761,0.0010038759,0.00088489644,0.033783816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983845,0.0005092906,0.00009727803,0.00029217813,0.0004969051,0.00021992908],"domain_scores_gemma":[0.9938775,0.0039975387,0.00032941566,0.0008206948,0.0006053129,0.000369643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013426809,0.0005422085,0.0008901835,0.001640333,0.0022088974,0.002390838,0.0013586611,0.0012231668,0.008469668],"category_scores_gemma":[0.011692194,0.0007668673,0.00097028527,0.0015467972,0.003491143,0.006791161,0.0044787433,0.0020885507,0.0013131596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005992397,0.00001710296,0.00034963764,0.000046972782,0.0000071089207,0.00010924957,0.00036657997,0.005868452,0.00097152416,0.9757608,0.0013729313,0.015069722],"study_design_scores_gemma":[0.000009394282,0.000019253695,0.0002443935,0.000027900915,0.000006533196,0.00009939146,0.00013021399,0.051496215,0.0009614182,0.9414002,0.0055930256,0.000011971274],"about_ca_topic_score_codex":0.002587882,"about_ca_topic_score_gemma":0.002608925,"teacher_disagreement_score":0.008469668,"about_ca_system_score_codex":0.0008968598,"about_ca_system_score_gemma":0.00070193957,"threshold_uncertainty_score":0.028333843},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7679483,0.0017101936,0.21555462,0.0006023956,0.00019869731,0.00019598838,0.00018760184,0.0006677384,0.0129345255],"genre_scores_gemma":[0.88554573,0.00088914036,0.10936022,0.00010912754,0.000021814209,0.00031636847,0.00016038708,0.00009252688,0.0035046192],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998455,0.000034857698,0.00001335853,0.000035068762,0.00004102011,0.000030177125],"domain_scores_gemma":[0.9995436,0.00011134539,0.00010512163,0.000070279,0.00006207479,0.00010756249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485549,0.0003914564,0.00043213402,0.0003252677,0.0005091912,0.0006493807,0.00059744954,0.0005388835,0.0019012903],"category_scores_gemma":[0.00086569553,0.00038359847,0.00028980308,0.00030457933,0.0005392434,0.0007603517,0.0006665228,0.00074418925,0.00081590464],"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.00038309893,0.00026619053,0.0009728223,0.0006011605,0.000050852457,0.00039123112,0.00020214394,0.21453047,0.6547645,0.09551471,0.0011172944,0.031205477],"study_design_scores_gemma":[0.00019227409,0.0010932398,0.0003280608,0.000060798448,0.000045930774,0.00020416745,0.00009624975,0.44614947,0.4993496,0.030191036,0.022198616,0.00009046372],"about_ca_topic_score_codex":0.0002350623,"about_ca_topic_score_gemma":0.00040332004,"teacher_disagreement_score":0.0019012903,"about_ca_system_score_codex":0.0006347274,"about_ca_system_score_gemma":0.00072217366,"threshold_uncertainty_score":0.0063604712},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011557483,0.00028763624,0.9741711,0.00070221355,0.00014540873,0.00010065467,0.00006805584,0.00040658176,0.012560896],"genre_scores_gemma":[0.43038255,0.0009793241,0.553848,0.00039146355,0.00018906269,0.00025779838,0.00033062766,0.00024719228,0.01337398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917847,0.00019303944,0.000057428344,0.00017890915,0.0002754361,0.000116755175],"domain_scores_gemma":[0.99943525,0.00016327976,0.000032427724,0.00014700694,0.0001455861,0.00007647501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087443314,0.0007404439,0.0007066372,0.00087939086,0.0010789118,0.0026606647,0.0017667582,0.0009411891,0.008383461],"category_scores_gemma":[0.0022229343,0.00041493628,0.0011940013,0.0008085273,0.0009878837,0.004248987,0.0039912886,0.0017507384,0.00089672225],"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.000246416,0.0003946026,0.0020621829,0.00029828877,0.00023337953,0.00043430593,0.0008296106,0.35159793,0.011038419,0.44704556,0.0075593265,0.17825985],"study_design_scores_gemma":[0.000019634872,0.00011193275,0.00041814346,0.00006553752,0.0000836701,0.00008352635,0.00029206296,0.858857,0.002163513,0.12060207,0.017282002,0.000020985779],"about_ca_topic_score_codex":0.0041835154,"about_ca_topic_score_gemma":0.006021692,"teacher_disagreement_score":0.008383461,"about_ca_system_score_codex":0.00082055194,"about_ca_system_score_gemma":0.0012215851,"threshold_uncertainty_score":0.028045416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22938322,0.00048033678,0.74153423,0.0006333637,0.00030859266,0.00006751017,0.00008095358,0.0013774196,0.026134353],"genre_scores_gemma":[0.89730823,0.0002464273,0.09707045,0.00020607492,0.00004445773,0.000065204455,0.00006168113,0.0002942446,0.0047031483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996542,0.00008580194,0.000020593505,0.00006641106,0.00010620457,0.00006681804],"domain_scores_gemma":[0.9991025,0.00042509433,0.000058435282,0.00030478468,0.00006179075,0.000047436108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044884582,0.0004999518,0.00035808657,0.00023786195,0.00041190267,0.000985234,0.00081234495,0.0006051671,0.003401274],"category_scores_gemma":[0.002563474,0.00026708044,0.0003482311,0.00024794837,0.0010268302,0.0014589513,0.0012502933,0.0010881091,0.0009537702],"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.00075023423,0.00017308623,0.0010800118,0.00037094846,0.000028338423,0.0003684723,0.0004423348,0.113957286,0.39427018,0.41210195,0.001779915,0.07467731],"study_design_scores_gemma":[0.00010441197,0.00042994742,0.000383558,0.00005277271,0.000036232712,0.00022080228,0.00014382794,0.610515,0.24631949,0.12759274,0.014155693,0.000045579945],"about_ca_topic_score_codex":0.0003694593,"about_ca_topic_score_gemma":0.0007279526,"teacher_disagreement_score":0.003401274,"about_ca_system_score_codex":0.00030036425,"about_ca_system_score_gemma":0.00042543194,"threshold_uncertainty_score":0.0113784075},"labels":[],"label_agreement":null},{"id":"W2941869658","doi":"10.1023/b:naco.0000006773.31625.55","title":"Unexpected universality results for three classes of P systems with symport/antiport","year":2003,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Antiporter; Symporter; Membrane computing; Universality (dynamical systems); Computer science; Computation; Theoretical computer science; Mathematics; Algorithm; Membrane; Physics; Chemistry","score_opus":0.01635541717707765,"score_gpt":0.2524889441129755,"score_spread":0.23613352693589787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941869658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82731986,0.0017228203,0.11852334,0.0019800984,0.00037149852,0.00012720718,0.0006188717,0.0022623886,0.047073927],"genre_scores_gemma":[0.98955905,0.0002081831,0.008623373,0.0001670461,0.00015024985,0.00006440423,0.00015164881,0.00010493112,0.00097106065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990212,0.00011022651,0.00007937667,0.00030751358,0.00021287767,0.00026888427],"domain_scores_gemma":[0.99654096,0.0013173966,0.00046407513,0.0010153642,0.00022498937,0.00043723837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010177492,0.0006853473,0.0009992165,0.0017348487,0.0022235666,0.0036243482,0.001569413,0.0021348943,0.0038845981],"category_scores_gemma":[0.0053288196,0.0006782409,0.0012607198,0.0009770176,0.0047970447,0.004177334,0.002788026,0.0020429601,0.00036094134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095082745,0.000057360416,0.0022415135,0.000121107485,0.000030568594,0.00042434366,0.0003889409,0.0014655257,0.010134748,0.9761563,0.0019258865,0.006958519],"study_design_scores_gemma":[0.00005030296,0.000051245366,0.0018634928,0.000018048015,0.000038801998,0.0010615741,0.00013467805,0.019218583,0.0051330137,0.96942645,0.0029526593,0.00005126781],"about_ca_topic_score_codex":0.0004643436,"about_ca_topic_score_gemma":0.00039199827,"teacher_disagreement_score":0.0038845981,"about_ca_system_score_codex":0.0009787444,"about_ca_system_score_gemma":0.0005847039,"threshold_uncertainty_score":0.012995243},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3178045,0.001716475,0.588518,0.0018550389,0.00020871178,0.0002325774,0.0014312392,0.0010420096,0.08719139],"genre_scores_gemma":[0.9379882,0.00061941764,0.04877149,0.00035178056,0.00022142388,0.00023191329,0.00057759415,0.000061706356,0.011176387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968505,0.000055138808,0.000021026297,0.00010711498,0.000080254955,0.000051539224],"domain_scores_gemma":[0.9987256,0.00054157147,0.00022953459,0.00016632579,0.00021040131,0.00012652445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026898374,0.00038613463,0.00072209386,0.0008057038,0.001128123,0.0023147836,0.00056358316,0.0007946543,0.0036446238],"category_scores_gemma":[0.0020022257,0.0001867838,0.00067077484,0.0007783314,0.0011883678,0.001471374,0.0010202918,0.0008654374,0.00060815475],"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.000040937535,0.00005631462,0.0013701881,0.0001032452,0.000026296746,0.0003721667,0.00031278605,0.007883839,0.005742999,0.9630224,0.002117724,0.018950991],"study_design_scores_gemma":[0.000060450267,0.000054219057,0.0015336905,0.000031991964,0.00002186772,0.000631549,0.00017347402,0.13537769,0.0018218167,0.83955485,0.020702906,0.000035506022],"about_ca_topic_score_codex":0.0023912988,"about_ca_topic_score_gemma":0.0014137452,"teacher_disagreement_score":0.0036446238,"about_ca_system_score_codex":0.00081880967,"about_ca_system_score_gemma":0.0007986295,"threshold_uncertainty_score":0.012192428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05359915,0.00027547174,0.9422986,0.00025066303,0.000043202832,0.000065711174,0.0002995355,0.0010301125,0.002137488],"genre_scores_gemma":[0.76900935,0.00019707844,0.22588584,0.00013835302,0.0000818934,0.00017259775,0.0008872738,0.00022846088,0.0033991588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983169,0.0007300265,0.000082614795,0.00034272755,0.00041203058,0.00011576812],"domain_scores_gemma":[0.9932179,0.004825975,0.00034387445,0.0009498763,0.0005312554,0.00013112812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023480922,0.0007749626,0.0012954269,0.0019090598,0.0011911398,0.0014979844,0.0020788219,0.00095664023,0.0038339235],"category_scores_gemma":[0.010314924,0.0004937518,0.0014424332,0.001438784,0.0008721772,0.0024869873,0.0015560745,0.0013795629,0.0007206502],"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.00037788722,0.00013780492,0.0022629618,0.00015452875,0.00024370373,0.00014998109,0.000117260206,0.8232046,0.0041580126,0.05797522,0.0013796497,0.109838314],"study_design_scores_gemma":[0.0000055211062,0.000009392793,0.00009789812,0.0000023893729,0.00001149013,0.000009509006,0.00001054278,0.97595924,0.00077297364,0.02284721,0.00027049362,0.0000032815553],"about_ca_topic_score_codex":0.0038278277,"about_ca_topic_score_gemma":0.0064902892,"teacher_disagreement_score":0.0038339235,"about_ca_system_score_codex":0.0010708449,"about_ca_system_score_gemma":0.0014225804,"threshold_uncertainty_score":0.012825727},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003406119,0.0009960316,0.0018852742,0.053277317,0.93832314,0.000029218863,0.0009284607,0.00041943172,0.0038003933],"genre_scores_gemma":[0.045682438,0.0075867036,0.009314805,0.08703251,0.65484214,0.00024961907,0.0020287898,0.0010586933,0.19220436],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972907,0.0004173322,0.0005412786,0.0005500509,0.0008976967,0.0003028754],"domain_scores_gemma":[0.97197556,0.007397721,0.0013678771,0.0021801654,0.01568766,0.0013910708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021278872,0.0018101833,0.0018388901,0.003269001,0.0026263352,0.0037616235,0.0043088333,0.007291579,0.0594236],"category_scores_gemma":[0.057967477,0.0008202716,0.0014792088,0.0023963193,0.0029037364,0.0029215184,0.00158314,0.009011686,0.025840597],"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.000073080795,0.0000104677765,0.00015754622,0.00030370086,0.00003296722,0.0005745572,0.00006020028,0.00015673084,0.0001119211,0.0052876864,0.9816024,0.011628851],"study_design_scores_gemma":[0.000075479664,0.000026516507,0.0008969012,0.00017506821,0.000046462712,0.0016679514,0.000092943366,0.0009639903,0.0005173838,0.009091242,0.98639256,0.00005347499],"about_ca_topic_score_codex":0.008607781,"about_ca_topic_score_gemma":0.010481492,"teacher_disagreement_score":0.0594236,"about_ca_system_score_codex":0.0034423315,"about_ca_system_score_gemma":0.0035328835,"threshold_uncertainty_score":0.19879174},"labels":[],"label_agreement":null},{"id":"W3196448279","doi":"10.1007/s11047-021-09867-x","title":"Conjugate word blending: formal model and experimental implementation by XPCR","year":2021,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Word (group theory); Conjugate; Programming language; Linguistics; Mathematics; Philosophy","score_opus":0.012563575136313117,"score_gpt":0.29963643549953817,"score_spread":0.28707286036322505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196448279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011157379,0.000018262777,0.980029,0.00008585266,0.000041098265,0.00011585473,0.00016511203,0.0043885126,0.0039989064],"genre_scores_gemma":[0.31068224,0.00007023013,0.6801917,0.000099533114,0.000033192246,0.00040804857,0.00053277,0.0018409651,0.006141404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981002,0.00044508334,0.00013676292,0.000455101,0.0007157287,0.0001472378],"domain_scores_gemma":[0.9958682,0.0014736895,0.00018508972,0.0017487674,0.00061949686,0.00010484532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023965838,0.0006552338,0.0006948165,0.0008589845,0.0008941516,0.0027579986,0.0034644736,0.001750611,0.025174009],"category_scores_gemma":[0.008628749,0.00073542283,0.00097135303,0.0007959028,0.0022250155,0.004772436,0.002863231,0.0019245791,0.00436406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007194515,0.00043208562,0.0017469404,0.00038993583,0.0000527561,0.0003588742,0.0005750347,0.09147076,0.032013997,0.7333127,0.005215346,0.13371211],"study_design_scores_gemma":[0.00009964159,0.00009610177,0.00017027975,0.000031966585,0.000019251687,0.00014038951,0.00007650168,0.80033827,0.05574066,0.13436654,0.008876006,0.00004440606],"about_ca_topic_score_codex":0.001388879,"about_ca_topic_score_gemma":0.0008743065,"teacher_disagreement_score":0.025174009,"about_ca_system_score_codex":0.00069001125,"about_ca_system_score_gemma":0.0012787995,"threshold_uncertainty_score":0.08421552},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010481332,0.007592008,0.026876062,0.03868533,0.21204586,0.00055252813,0.011584216,0.0027673268,0.6988486],"genre_scores_gemma":[0.006796539,0.004023206,0.006228355,0.0058456184,0.030796785,0.0002693721,0.007736229,0.0018811636,0.93642277],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919397,0.00015155168,0.000045509445,0.00014410293,0.00040589293,0.000058946473],"domain_scores_gemma":[0.99342334,0.0011963929,0.00014667693,0.00069460104,0.003783465,0.00075550214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014145399,0.001006183,0.00067020074,0.0034605693,0.002918313,0.0042600953,0.001236948,0.00093179534,0.40683842],"category_scores_gemma":[0.012648979,0.00033941292,0.0006387715,0.0027056593,0.0008450461,0.0038998278,0.0020370705,0.0037029758,0.28281325],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020416777,0.000016263788,0.00005640781,0.000073749,0.000001534252,0.000019669333,0.00005413905,0.000052404557,0.00011454484,0.010453605,0.94983494,0.039302416],"study_design_scores_gemma":[0.0000032589858,0.00000740268,0.00015383368,0.00008366073,0.0000017760823,0.000029263092,0.00006188719,0.00005539729,0.00013023065,0.0066194413,0.99284816,0.000005654135],"about_ca_topic_score_codex":0.0053674057,"about_ca_topic_score_gemma":0.0067695393,"teacher_disagreement_score":0.40683842,"about_ca_system_score_codex":0.0022728203,"about_ca_system_score_gemma":0.0020161862,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09488336,0.0031354597,0.8494311,0.0038912413,0.00065224536,0.00017009734,0.000038198516,0.0010452181,0.04675306],"genre_scores_gemma":[0.70133066,0.0018392585,0.28666246,0.0010183966,0.00021400237,0.00021197421,0.000052541403,0.00019311483,0.008477583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991936,0.0002575068,0.000049400678,0.00012688723,0.0002876836,0.00008493577],"domain_scores_gemma":[0.99767977,0.0009181072,0.00029290677,0.0006589831,0.00031170872,0.00013852544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020454817,0.0006687295,0.0006992302,0.00064263435,0.00047828653,0.0028884916,0.0019764304,0.0020706838,0.007368974],"category_scores_gemma":[0.0062843845,0.00045771367,0.0007263273,0.0005979508,0.0013671545,0.0065793013,0.0020960884,0.0015526186,0.0012664807],"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.00032217355,0.0007747925,0.004345979,0.00067827734,0.00044090705,0.00027226206,0.00052693574,0.051241733,0.063701525,0.5713949,0.0021187912,0.30418172],"study_design_scores_gemma":[0.000389708,0.0019364562,0.0043564653,0.00047934166,0.00065597956,0.0012300691,0.00055624126,0.3773212,0.0468126,0.46081915,0.1052424,0.00020036529],"about_ca_topic_score_codex":0.0002448516,"about_ca_topic_score_gemma":0.00028973763,"teacher_disagreement_score":0.007368974,"about_ca_system_score_codex":0.00038121667,"about_ca_system_score_gemma":0.00078759994,"threshold_uncertainty_score":0.024651706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252243,0.005181812,0.44865486,0.0051485063,0.00026585677,0.000029012996,0.0011594446,0.0007718198,0.0135644255],"genre_scores_gemma":[0.98580235,0.0011958601,0.011190548,0.00016427443,0.00009256066,0.000015850295,0.00016665876,0.00010651198,0.0012654698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999853,0.000045951332,0.0000054446223,0.00005258839,0.0000306569,0.000012312735],"domain_scores_gemma":[0.9982869,0.0011390158,0.00023042336,0.0001398427,0.00009438942,0.0001094573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038435767,0.00039458464,0.00028860755,0.0010642598,0.00028133258,0.0016678111,0.0005043494,0.00083458115,0.002374765],"category_scores_gemma":[0.005746715,0.00032350956,0.00030101644,0.0010571142,0.0015585315,0.003959027,0.00082770124,0.0007268632,0.0002681904],"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.0003468602,0.000121825,0.052691456,0.00065949233,0.00051271066,0.00068459974,0.001694273,0.23654844,0.05921086,0.41463506,0.0063651376,0.22652927],"study_design_scores_gemma":[0.000016038523,0.000050507148,0.047456127,0.00006593924,0.00007285212,0.00035559153,0.0003533715,0.21611981,0.0039217602,0.7274793,0.004046547,0.00006226495],"about_ca_topic_score_codex":0.0016126281,"about_ca_topic_score_gemma":0.0013931713,"teacher_disagreement_score":0.002374765,"about_ca_system_score_codex":0.00048077223,"about_ca_system_score_gemma":0.00021946823,"threshold_uncertainty_score":0.007944405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030093415,0.0007111982,0.9491393,0.0015028594,0.00021261096,0.00018560553,0.00067147834,0.004249524,0.013234039],"genre_scores_gemma":[0.28322458,0.0006364021,0.69719124,0.0006376645,0.0003019795,0.00048602046,0.001709321,0.0023781925,0.013434553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954833,0.0009385623,0.00043268586,0.0016129519,0.0009132837,0.0006193023],"domain_scores_gemma":[0.9834953,0.010067735,0.00044872315,0.0042182817,0.0011157534,0.0006542172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043509193,0.0018505862,0.001965824,0.0030680979,0.0028862746,0.007929035,0.006311693,0.0026409808,0.02231616],"category_scores_gemma":[0.02369663,0.0019302932,0.004271833,0.004003125,0.0042563668,0.032745287,0.011001745,0.006309083,0.0040786145],"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.00046747868,0.00015816417,0.0009525358,0.000411802,0.00007604108,0.00004307595,0.0009768361,0.00869735,0.0022781873,0.82814556,0.009441114,0.14835183],"study_design_scores_gemma":[0.000055728382,0.00002047483,0.00010565237,0.000069354035,0.000067607776,0.00005528405,0.00020471837,0.029296586,0.0032236832,0.96111864,0.00575474,0.000027390932],"about_ca_topic_score_codex":0.0019151488,"about_ca_topic_score_gemma":0.003179035,"teacher_disagreement_score":0.02231616,"about_ca_system_score_codex":0.0038603183,"about_ca_system_score_gemma":0.002791379,"threshold_uncertainty_score":0.074655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18828847,0.0069578825,0.6591859,0.040780522,0.0012454789,0.00055752497,0.0022726646,0.002491218,0.09822043],"genre_scores_gemma":[0.8204208,0.0033295474,0.14254037,0.0046160375,0.0024302201,0.00066310936,0.0040703183,0.0010580719,0.020871667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98349667,0.0056386665,0.0012109258,0.0043274155,0.0030756933,0.0022506586],"domain_scores_gemma":[0.80715144,0.18090324,0.002537057,0.005430085,0.0023790863,0.0015990683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013973556,0.0020107545,0.0033733423,0.00302775,0.0058321566,0.012995158,0.009698102,0.007258416,0.012322873],"category_scores_gemma":[0.07456632,0.002895167,0.008585725,0.005265468,0.014257392,0.045360647,0.008733718,0.018361436,0.0011739597],"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.0005022851,0.00037601514,0.0015878229,0.00065017596,0.00014704687,0.00048078096,0.002033819,0.019376634,0.0012885584,0.94011337,0.007949659,0.025493896],"study_design_scores_gemma":[0.000059238355,0.00001711057,0.00011782683,0.000044849683,0.000041499316,0.00008929059,0.00016613696,0.018671473,0.0006747246,0.97873986,0.0013585804,0.000019476583],"about_ca_topic_score_codex":0.007078299,"about_ca_topic_score_gemma":0.007169676,"teacher_disagreement_score":0.013973556,"about_ca_system_score_codex":0.0076338467,"about_ca_system_score_gemma":0.0052565993,"threshold_uncertainty_score":0.073900044},"labels":[],"label_agreement":null},{"id":"W4411330187","doi":"10.1007/s11047-025-10024-x","title":"Inductive inference of Lindenmayer systems: algorithms and computational complexity","year":2025,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Theory of computation; Computer science; Algorithm; Inference; Computational complexity theory; Theoretical computer science; Artificial intelligence","score_opus":0.02763257918964659,"score_gpt":0.3179028382026179,"score_spread":0.2902702590129713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411330187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019353714,0.0012981775,0.9676936,0.002306165,0.00011505724,0.00004041756,0.00015782111,0.00034248378,0.008692547],"genre_scores_gemma":[0.52817947,0.0017038485,0.45878685,0.00085422455,0.00059526245,0.0001836831,0.0005952159,0.00019040988,0.008911064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964994,0.001801735,0.00020760075,0.0005559086,0.00075865176,0.00017661962],"domain_scores_gemma":[0.97118855,0.025687393,0.0006635849,0.0011319048,0.0010510192,0.00027758264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006378799,0.00056029484,0.0010558873,0.0022043262,0.0017517356,0.0040822616,0.0033115018,0.0016728897,0.0069919038],"category_scores_gemma":[0.03911548,0.000895736,0.0018646945,0.0017290653,0.004267884,0.01155694,0.0033532975,0.004104821,0.0009365001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035097346,0.000035725196,0.0005519174,0.00009559975,0.000032431213,0.000033814,0.00017733262,0.020247437,0.00021714736,0.95471674,0.0014806363,0.02237622],"study_design_scores_gemma":[0.0000059559516,0.0000024307326,0.00004546396,0.00001579344,0.00000752165,0.000013161536,0.00001877337,0.07628335,0.00024892637,0.9224554,0.0008965598,0.000006595115],"about_ca_topic_score_codex":0.0030564899,"about_ca_topic_score_gemma":0.0052697505,"teacher_disagreement_score":0.0069919038,"about_ca_system_score_codex":0.0032606344,"about_ca_system_score_gemma":0.0019600033,"threshold_uncertainty_score":0.03373474},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1223343,0.00041228268,0.8620449,0.0007656483,0.0000705465,0.00007986475,0.000091182315,0.00013281887,0.014068535],"genre_scores_gemma":[0.76964283,0.0003888638,0.2236141,0.0002610993,0.00007521574,0.00025574266,0.00014136845,0.0001558386,0.0054649385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996068,0.00017096776,0.000011997538,0.000054919277,0.000109389206,0.000045890716],"domain_scores_gemma":[0.9990922,0.0005518415,0.000072700524,0.00012281812,0.00006810305,0.000092313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007311218,0.00046836934,0.00057733903,0.0013195404,0.00081412337,0.0012033329,0.0010116373,0.0013992616,0.0034701282],"category_scores_gemma":[0.0021414754,0.0005703377,0.0008689877,0.00064504554,0.001667191,0.0014288457,0.0013260937,0.0011750959,0.00037167888],"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.00003602212,0.00006585248,0.00026143936,0.000070058035,0.00002418713,0.00011953834,0.00008800664,0.6081434,0.0067657116,0.37848884,0.0005513524,0.0053855185],"study_design_scores_gemma":[0.0000068132363,0.000012163735,0.00004347858,0.000004281424,0.0000020396383,0.000015804595,0.000013373194,0.93889123,0.00038464344,0.06025022,0.00037128408,0.0000046920336],"about_ca_topic_score_codex":0.001166063,"about_ca_topic_score_gemma":0.001592973,"teacher_disagreement_score":0.0034701282,"about_ca_system_score_codex":0.00090643537,"about_ca_system_score_gemma":0.00050603773,"threshold_uncertainty_score":0.01160872},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1149091,0.0015811691,0.83364135,0.011560582,0.00045087194,0.00029748143,0.0013132959,0.0013264236,0.034919724],"genre_scores_gemma":[0.79544985,0.0011051676,0.18824203,0.002280939,0.00093397894,0.0005710102,0.0023294026,0.0007425877,0.008345039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99129874,0.0026088413,0.0008783746,0.002085892,0.0019982858,0.0011299063],"domain_scores_gemma":[0.92313325,0.065931715,0.0015456835,0.0049893274,0.003346164,0.0010537993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0085286675,0.0009602682,0.0013505014,0.0015720984,0.0032617315,0.007185861,0.003144834,0.0025644263,0.0067256074],"category_scores_gemma":[0.04148904,0.0015167991,0.004410306,0.002155377,0.008810256,0.022585554,0.005017354,0.010602494,0.00066112005],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019991951,0.00019785587,0.0012713724,0.00025914598,0.000045885594,0.0002893012,0.0010102999,0.0042677387,0.0013697856,0.9670853,0.003384084,0.020619426],"study_design_scores_gemma":[0.00004961009,0.00001420296,0.00009909749,0.000025490417,0.000026642287,0.00014974379,0.00013767616,0.012419964,0.0014155875,0.984055,0.0015887695,0.000018367939],"about_ca_topic_score_codex":0.0030314068,"about_ca_topic_score_gemma":0.0028058966,"teacher_disagreement_score":0.0085286675,"about_ca_system_score_codex":0.0027550862,"about_ca_system_score_gemma":0.004034679,"threshold_uncertainty_score":0.045104444},"labels":[],"label_agreement":null}]}