{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":45,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":45,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"000eb500a2c0","filters":{"venue":"Natural Computing"}},"results":[{"id":"W2132853600","doi":"10.1007/s11047-009-9131-2","title":"Watson–Crick palindromes in DNA computing","year":2009,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Palindrome; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Catenation; Context (archaeology); Set (abstract data type); Mathematics; Combinatorics; Watson; Theory of computation; DNA computing; Sequence (biology); Discrete mathematics; Algebra over a field; Pure mathematics; DNA; Computer science; Base pair; Genome; Algorithm; Genetics; Biology","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Kalpana Mahalingam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009755713941148563,"gpt":0.2680295968948341,"spread":0.2582738829536856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005070516,0.0002930019,0.000513942,0.0007102509,0.000934784,0.001614448,0.001010557,0.001044901,0.002945762],"category_scores_gemma":[0.003255399,0.0003804495,0.0002251249,0.001239099,0.002501273,0.00281018,0.0005899803,0.001712908,0.0006865934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007828041,"about_ca_system_score_gemma":0.0005303207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001265558,"about_ca_topic_score_gemma":0.0007608562,"domain_scores_codex":[0.9995356,0.0001554975,0.00003517071,0.00008444308,0.0001458146,0.00004350718],"domain_scores_gemma":[0.999185,0.0004834996,0.0000600165,0.0001267941,0.0001006274,0.00004393205],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002808311,0.00001355651,0.00006232015,0.00006365617,0.000002687327,0.00008109312,0.0001009196,0.003849432,0.001545413,0.9778845,0.000854533,0.01551384],"study_design_scores_gemma":[0.000008091985,0.00001470634,0.00004209455,0.00002368349,0.0000035572,0.0001076273,0.00004483651,0.01414223,0.002423082,0.972403,0.01077548,0.00001164002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1926569,0.03757422,0.552388,0.008200251,0.002563151,0.0001518611,0.0002649658,0.0008715566,0.2053291],"genre_scores_gemma":[0.8620683,0.006165114,0.1131674,0.0005505192,0.0006935323,0.0001212,0.0001059153,0.0001402149,0.01698781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002945762,"threshold_uncertainty_score":0.009854496,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"William B. Langdon","is_ca":false},{"name":"Wolfgang Banzhaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00966252290649453,"gpt":0.264951589042624,"spread":0.2552890661361294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058045,0.0002775587,0.0005918248,0.000652731,0.0006048367,0.001272649,0.001227752,0.001447082,0.003617412],"category_scores_gemma":[0.009708064,0.0004135049,0.0004791734,0.001450841,0.002498311,0.002740946,0.001271221,0.001992594,0.000458231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006330974,"about_ca_system_score_gemma":0.0004139143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001231772,"about_ca_topic_score_gemma":0.00115734,"domain_scores_codex":[0.9990776,0.0004401944,0.00004015325,0.0001606589,0.0002269207,0.00005454939],"domain_scores_gemma":[0.9969699,0.002122489,0.0001774956,0.0004246271,0.0002152853,0.00009033641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003702044,0.00003344078,0.0007903363,0.00008327025,0.00003441974,0.0001825334,0.0003803342,0.04729818,0.0009273553,0.884747,0.001246605,0.0642394],"study_design_scores_gemma":[0.00001085726,0.0000174136,0.0001333222,0.00001590836,0.00001010947,0.00009688685,0.00003605491,0.06597924,0.0002964551,0.930917,0.002479486,0.000007215303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0829298,0.0022428,0.8860911,0.001406867,0.000299232,0.00005333967,0.00004094042,0.0002286374,0.02670716],"genre_scores_gemma":[0.7196604,0.001306016,0.2568395,0.0003978124,0.0002836445,0.0001858984,0.00009175085,0.0002244523,0.02101052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003617412,"threshold_uncertainty_score":0.01210141,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Heather Betel","is_ca":true},{"name":"Pedro P. B. de Oliveira","is_ca":false},{"name":"Paola Flocchini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0147556519904048,"gpt":0.2299582503591558,"spread":0.215202598368751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000582239,0.0003262031,0.0009172942,0.0003212108,0.0006512738,0.001512592,0.001139386,0.001357279,0.003374939],"category_scores_gemma":[0.005996853,0.0002999018,0.0006269861,0.0003371636,0.001354684,0.001963954,0.001429738,0.001229236,0.0002861515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005346761,"about_ca_system_score_gemma":0.0007879643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002280973,"about_ca_topic_score_gemma":0.001967941,"domain_scores_codex":[0.9996413,0.0001315651,0.00002283509,0.00007312673,0.00006520191,0.00006598169],"domain_scores_gemma":[0.9972487,0.002174511,0.0001023011,0.0002288381,0.0001648565,0.00008065943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002039004,0.00009287657,0.002070821,0.0003095339,0.0000409506,0.0003204873,0.0003335157,0.3953675,0.006392476,0.5344819,0.002880554,0.05750554],"study_design_scores_gemma":[0.00003355939,0.00002600649,0.0001068782,0.0000101713,0.00001054099,0.00004254873,0.00006526911,0.6838639,0.001807505,0.3132755,0.0007464933,0.00001174494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3927111,0.0003535266,0.5834138,0.001760466,0.000223148,0.0000553132,0.0001793627,0.0004672188,0.02083604],"genre_scores_gemma":[0.9348655,0.0001468689,0.06105768,0.0001400265,0.00003617147,0.00005682929,0.0001258474,0.00006950019,0.003501508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003374939,"threshold_uncertainty_score":0.01129025,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Christian Jacob","is_ca":true},{"name":"Ian Burleigh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.011513166261984,"gpt":0.2489266793904669,"spread":0.2374135131284829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002391678,0.0003321698,0.0005738384,0.0003102586,0.000530939,0.0009897377,0.001108105,0.001088304,0.002012109],"category_scores_gemma":[0.0007827705,0.0002789316,0.0005562927,0.0003986284,0.001024988,0.0008168743,0.000634751,0.0005659258,0.0002217153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006720748,"about_ca_system_score_gemma":0.0007063791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0083776,"about_ca_topic_score_gemma":0.003379404,"domain_scores_codex":[0.9998678,0.00005525881,0.000005586837,0.00002649901,0.00003047232,0.00001432123],"domain_scores_gemma":[0.999743,0.0001330757,0.00004009237,0.00001753519,0.00002713826,0.00003913773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004662961,0.00002954853,0.0004394465,0.00002460864,0.00002051179,0.0001024598,0.00005351834,0.9495673,0.002592768,0.04472477,0.0003249953,0.002073353],"study_design_scores_gemma":[0.00001215614,0.00000882431,0.00006375433,0.000001226654,0.000003356285,0.000008590016,0.000006941158,0.9922401,0.0001371599,0.007139506,0.0003753482,0.000002993851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4088552,0.0008276937,0.55936,0.002403216,0.0002186669,0.0001015716,0.0004254146,0.0004551126,0.02735315],"genre_scores_gemma":[0.9485736,0.0003789146,0.04371233,0.0000846967,0.00004018738,0.0001179209,0.0001086311,0.00004349633,0.006940295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0083776,"threshold_uncertainty_score":0.01665771,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Dirk V. Arnold","is_ca":true},{"name":"Hans-Georg Beyer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02355873132136673,"gpt":0.276807817577272,"spread":0.2532490862559053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001286501,0.0004738652,0.0008846641,0.0005828142,0.0004375851,0.0008579571,0.001314036,0.001541423,0.001291163],"category_scores_gemma":[0.004122089,0.0005430823,0.0006812013,0.0004988665,0.001142478,0.001068776,0.001429227,0.001057046,0.0002657786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007432856,"about_ca_system_score_gemma":0.0006213099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002386771,"about_ca_topic_score_gemma":0.001628751,"domain_scores_codex":[0.9996736,0.0001513924,0.00001395524,0.00004414665,0.00008618291,0.00003081424],"domain_scores_gemma":[0.9990969,0.0005173943,0.00007886068,0.00009143481,0.000155102,0.00006040118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006628791,0.00003977674,0.0004574415,0.00003616454,0.00004904667,0.00006580423,0.0000862306,0.9281135,0.002385881,0.04736114,0.0005501384,0.02078866],"study_design_scores_gemma":[0.000006689203,0.00001281325,0.00003747187,0.000002399111,0.000003318183,0.000006020377,0.000003467802,0.9957218,0.0001128268,0.003946715,0.000142831,0.000003602372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06272367,0.0003570459,0.9304913,0.0004016424,0.00007555106,0.00004626945,0.00001943849,0.0001281904,0.005756929],"genre_scores_gemma":[0.8052862,0.0002968737,0.1837872,0.0002322317,0.00008238375,0.0001812478,0.00004454377,0.0001212297,0.009968101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002386771,"threshold_uncertainty_score":0.006803751,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Abbas Ahmadi","is_ca":false},{"name":"Fakhri Karray","is_ca":true},{"name":"Mohamed S. Kamel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0709870533393512,"gpt":0.3606660983964147,"spread":0.2896790450570635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001699983,0.0007072415,0.001509876,0.00391337,0.002014264,0.00114393,0.002385685,0.001561461,0.002596368],"category_scores_gemma":[0.005182086,0.0004705577,0.001478227,0.002882161,0.001095075,0.001931071,0.001697236,0.001501089,0.0007621138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00133367,"about_ca_system_score_gemma":0.001024536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006989289,"about_ca_topic_score_gemma":0.007150676,"domain_scores_codex":[0.9985745,0.0003851134,0.00009481851,0.000320956,0.0005300054,0.00009458677],"domain_scores_gemma":[0.9981561,0.0006617058,0.0001289398,0.0003497469,0.0006138454,0.00008956667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003485145,0.0002572472,0.002894684,0.0005285127,0.0004106577,0.0002556814,0.0008503103,0.2502554,0.02131745,0.1217935,0.01085062,0.5902375],"study_design_scores_gemma":[0.00002142241,0.0001123521,0.001090636,0.00003833893,0.00005364423,0.000254866,0.0001240426,0.9450967,0.003612828,0.04332045,0.00623745,0.00003732292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00535459,0.0002548346,0.9931467,0.00008780608,0.00005975846,0.00008611967,0.00004376595,0.0001758174,0.0007904557],"genre_scores_gemma":[0.14284,0.0004936921,0.8498669,0.0001924894,0.0001240218,0.0003451483,0.0004378137,0.0001188184,0.005581049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006989289,"threshold_uncertainty_score":0.01389724,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Doty","is_ca":false},{"name":"Monir Hajiaghayi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007386190529155033,"gpt":0.2662505977330152,"spread":0.2588644072038602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009988729,0.0006397716,0.001232012,0.0006490153,0.0007164215,0.0014075,0.002016705,0.001765411,0.00553433],"category_scores_gemma":[0.005408132,0.0006001539,0.000658276,0.0006187977,0.001817281,0.001629682,0.001500206,0.001308395,0.0006547262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001446317,"about_ca_system_score_gemma":0.00114573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002337881,"about_ca_topic_score_gemma":0.002069666,"domain_scores_codex":[0.9991309,0.0002523589,0.00003400834,0.000270237,0.0001867819,0.0001256395],"domain_scores_gemma":[0.9946452,0.00388263,0.0005364853,0.0003461307,0.0003410401,0.0002484241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000145673,0.00006152192,0.0006015705,0.0001107303,0.00003935747,0.0001825945,0.00008627193,0.7769353,0.003241374,0.2071861,0.001136848,0.0102727],"study_design_scores_gemma":[0.00002633635,0.00002510412,0.00007519784,0.000003481287,0.000007615165,0.00002605287,0.000009193461,0.948615,0.0005656087,0.05012383,0.0005128048,0.000009714944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1366634,0.0004389844,0.8430169,0.001442325,0.0001939764,0.0001396211,0.0005493297,0.0006776773,0.01687792],"genre_scores_gemma":[0.9518855,0.000372095,0.03000229,0.0002225826,0.00006163007,0.0002392654,0.000175376,0.00005825332,0.01698299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00553433,"threshold_uncertainty_score":0.01851416,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Anne Condon","is_ca":true},{"name":"Monir Hajiaghayi","is_ca":true},{"name":"David Kirkpatrick","is_ca":true},{"name":"Ján Maňuch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01556693118391587,"gpt":0.2939392384567327,"spread":0.2783723072728168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348092,0.0007749626,0.001295427,0.00190906,0.00119114,0.001497984,0.002078822,0.0009566402,0.003833923],"category_scores_gemma":[0.01031492,0.0004937518,0.001442433,0.001438784,0.0008721772,0.002486987,0.001556074,0.001379563,0.0007206502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001070845,"about_ca_system_score_gemma":0.00142258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003827828,"about_ca_topic_score_gemma":0.006490289,"domain_scores_codex":[0.9983169,0.0007300265,0.0000826148,0.0003427276,0.0004120306,0.0001157681],"domain_scores_gemma":[0.9932179,0.004825975,0.0003438744,0.0009498763,0.0005312554,0.0001311281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003778872,0.0001378049,0.002262962,0.0001545288,0.0002437037,0.0001499811,0.0001172602,0.8232046,0.004158013,0.05797522,0.00137965,0.1098383],"study_design_scores_gemma":[0.000005521106,0.000009392793,0.00009789812,0.000002389373,0.00001149013,0.000009509006,0.00001054278,0.9759592,0.0007729736,0.02284721,0.0002704936,0.000003281555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05359915,0.0002754717,0.9422986,0.000250663,0.00004320283,0.00006571117,0.0002995355,0.001030113,0.002137488],"genre_scores_gemma":[0.7690094,0.0001970784,0.2258858,0.000138353,0.0000818934,0.0001725977,0.0008872738,0.0002284609,0.003399159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003833923,"threshold_uncertainty_score":0.01282573,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Junwei Wang","is_ca":false},{"name":"Hongfeng Wang","is_ca":false},{"name":"Yaoming Zhou","is_ca":false},{"name":"Yunkai Wang","is_ca":false},{"name":"Wenjun Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01631111053294668,"gpt":0.2745996637157482,"spread":0.2582885531828015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008744331,0.0007404439,0.0007066372,0.0008793909,0.001078912,0.002660665,0.001766758,0.0009411891,0.008383461],"category_scores_gemma":[0.002222934,0.0004149363,0.001194001,0.0008085273,0.0009878837,0.004248987,0.003991289,0.001750738,0.0008967223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008205519,"about_ca_system_score_gemma":0.001221585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004183515,"about_ca_topic_score_gemma":0.006021692,"domain_scores_codex":[0.9991785,0.0001930394,0.00005742834,0.0001789091,0.0002754361,0.0001167552],"domain_scores_gemma":[0.9994352,0.0001632798,0.00003242772,0.0001470069,0.0001455861,0.00007647501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000246416,0.0003946026,0.002062183,0.0002982888,0.0002333795,0.0004343059,0.0008296106,0.3515979,0.01103842,0.4470456,0.007559326,0.1782598],"study_design_scores_gemma":[0.00001963487,0.0001119327,0.0004181435,0.00006553752,0.0000836701,0.00008352635,0.000292063,0.858857,0.002163513,0.1206021,0.017282,0.00002098578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01155748,0.0002876362,0.9741711,0.0007022136,0.0001454087,0.0001006547,0.00006805584,0.0004065818,0.0125609],"genre_scores_gemma":[0.4303825,0.0009793241,0.553848,0.0003914635,0.0001890627,0.0002577984,0.0003306277,0.0002471923,0.01337398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008383461,"threshold_uncertainty_score":0.02804542,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mirela Andronescu","is_ca":true},{"name":"Danielle Dees","is_ca":false},{"name":"Laura Slaybaugh","is_ca":false},{"name":"Yinglei Zhao","is_ca":true},{"name":"Anne Condon","is_ca":true},{"name":"Barry H Cohen","is_ca":false},{"name":"Steven Skiena","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02839865559342692,"gpt":0.2862824322705501,"spread":0.2578837766771232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005833226,0.001942707,0.001293845,0.002031161,0.001484479,0.002486986,0.004092928,0.004335195,0.007320127],"category_scores_gemma":[0.03873212,0.0008050707,0.002216019,0.001937895,0.002633203,0.007594242,0.003178396,0.002126618,0.002098303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001159234,"about_ca_system_score_gemma":0.003129848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001494105,"about_ca_topic_score_gemma":0.002232882,"domain_scores_codex":[0.9938142,0.001720815,0.0007256093,0.002003529,0.001327861,0.0004079655],"domain_scores_gemma":[0.9325448,0.0562123,0.002239935,0.0048351,0.003255085,0.0009128163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003010079,0.001621766,0.04239597,0.0008977585,0.0006629525,0.000450204,0.0006062572,0.110574,0.02070988,0.03870533,0.01636473,0.7640011],"study_design_scores_gemma":[0.0005089277,0.0007271012,0.003387698,0.0001176752,0.0002329716,0.000693963,0.0004822332,0.8433852,0.02707624,0.1193332,0.003984986,0.00006988068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2570553,0.0003773904,0.7181547,0.001831311,0.0002481662,0.0009254001,0.002358143,0.01095744,0.008092275],"genre_scores_gemma":[0.4551848,0.000124204,0.5330997,0.0007770758,0.0001680786,0.001174759,0.005834093,0.0004929375,0.003144334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007320127,"threshold_uncertainty_score":0.0308494,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Srujan Kumar Enaganti","is_ca":true},{"name":"Óscar H. Ibarra","is_ca":false},{"name":"Lila Kari","is_ca":true},{"name":"Steffen Kopecki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008136046411732654,"gpt":0.2525398961503987,"spread":0.244403849738666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342681,0.0005422085,0.0008901835,0.001640333,0.002208897,0.002390838,0.001358661,0.001223167,0.008469668],"category_scores_gemma":[0.01169219,0.0007668673,0.0009702853,0.001546797,0.003491143,0.006791161,0.004478743,0.002088551,0.00131316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008968598,"about_ca_system_score_gemma":0.0007019396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002587882,"about_ca_topic_score_gemma":0.002608925,"domain_scores_codex":[0.9983845,0.0005092906,0.00009727803,0.0002921781,0.0004969051,0.0002199291],"domain_scores_gemma":[0.9938775,0.003997539,0.0003294157,0.0008206948,0.0006053129,0.000369643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005992397,0.00001710296,0.0003496376,0.00004697278,0.000007108921,0.0001092496,0.00036658,0.005868452,0.0009715242,0.9757608,0.001372931,0.01506972],"study_design_scores_gemma":[0.000009394282,0.0000192537,0.0002443935,0.00002790091,0.000006533196,0.00009939146,0.000130214,0.05149622,0.0009614182,0.9414002,0.005593026,0.00001197127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1719296,0.001145477,0.7441522,0.001982988,0.000301811,0.00008686373,0.0002444699,0.0007147209,0.07944186],"genre_scores_gemma":[0.7810902,0.0009147261,0.1810571,0.0006173038,0.0003898774,0.0002581761,0.001003876,0.0008848964,0.03378382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008469668,"threshold_uncertainty_score":0.02833384,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Henryk Fukś","is_ca":true},{"name":"Nazim Fatès","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01155192586772738,"gpt":0.2612157051740527,"spread":0.2496637793063253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009492872,0.0003079661,0.0007709779,0.0007100195,0.0005633219,0.0009724786,0.0009062212,0.001024571,0.001839865],"category_scores_gemma":[0.006842504,0.0003741978,0.0003574079,0.0003358235,0.001135005,0.001185159,0.0007625816,0.001376958,0.0002011069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008042391,"about_ca_system_score_gemma":0.0007110199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003821054,"about_ca_topic_score_gemma":0.004272738,"domain_scores_codex":[0.9998412,0.00005890792,0.000005570314,0.00003187539,0.00002922092,0.00003318087],"domain_scores_gemma":[0.9956375,0.003341987,0.0003136543,0.0001743745,0.0003094554,0.0002230791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001845854,0.00008942156,0.004578273,0.00007438583,0.00003368739,0.0001091721,0.0001766066,0.906432,0.004480063,0.07411906,0.0007642496,0.008958435],"study_design_scores_gemma":[0.000002158357,0.00000459399,0.00009732302,0.000001758984,0.000001388399,0.000002788597,0.000003357005,0.9957295,0.0001533774,0.003981298,0.00002058632,0.000001816389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6370847,0.000438345,0.35799,0.0005722126,0.0001087256,0.00003009294,0.0001134304,0.0006463237,0.003016115],"genre_scores_gemma":[0.9921685,0.00007061594,0.006697587,0.00003409622,0.00001655286,0.0000171005,0.00005027067,0.00004220211,0.000903094],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003821054,"threshold_uncertainty_score":0.007597625,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ján Maňuch","is_ca":true},{"name":"Chris Thachuk","is_ca":true},{"name":"Ladislav Stacho","is_ca":true},{"name":"Anne Condon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00552984760293051,"gpt":0.2457833701513412,"spread":0.2402535225484107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541608,0.001348163,0.002712464,0.001049443,0.002249577,0.004205889,0.004437041,0.00410447,0.01460072],"category_scores_gemma":[0.01999876,0.001638262,0.003024467,0.0022326,0.003618973,0.008821535,0.003429678,0.006403503,0.001231218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002298236,"about_ca_system_score_gemma":0.002971791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00619086,"about_ca_topic_score_gemma":0.004975695,"domain_scores_codex":[0.9967109,0.00116907,0.000176208,0.0007430085,0.0005884257,0.0006123945],"domain_scores_gemma":[0.9731336,0.02326894,0.0008080715,0.001305313,0.0008646825,0.0006193047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009079453,0.000397807,0.001285156,0.001378364,0.0002281003,0.0006785194,0.0006126279,0.6452349,0.00249369,0.2934233,0.02187588,0.03148364],"study_design_scores_gemma":[0.0001999167,0.00006628669,0.0003072725,0.00008495339,0.00005670861,0.0002535682,0.0002064388,0.332474,0.001293243,0.6609784,0.004039749,0.00003954733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2417187,0.002147575,0.6671362,0.01458677,0.0005430374,0.0007454868,0.006949199,0.001667255,0.06450567],"genre_scores_gemma":[0.756529,0.001401603,0.211438,0.001745828,0.0003915722,0.0009831195,0.004685947,0.0009279432,0.02189698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01460072,"threshold_uncertainty_score":0.04884428,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Naya Nagy","is_ca":true},{"name":"Marius Nagy","is_ca":true},{"name":"Selim G. Akl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005907398961053407,"gpt":0.2353426685347871,"spread":0.2294352695737337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222597,0.0002070679,0.0006094812,0.0005861938,0.0008615317,0.001562877,0.0006461029,0.001062595,0.002168152],"category_scores_gemma":[0.003556054,0.0002594524,0.0002619097,0.0008372419,0.002874397,0.003665448,0.001138915,0.00141904,0.0002064435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00133061,"about_ca_system_score_gemma":0.0007430005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001063523,"about_ca_topic_score_gemma":0.000656737,"domain_scores_codex":[0.9992791,0.0002913588,0.0000273406,0.00008412782,0.0002428904,0.00007511475],"domain_scores_gemma":[0.9984067,0.0009938353,0.0001466803,0.0002037044,0.0001726736,0.00007649932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003255999,0.0000193182,0.0001423996,0.00006368144,0.000007882442,0.00002795331,0.00008131561,0.01961112,0.001222475,0.9673982,0.001591751,0.009801218],"study_design_scores_gemma":[0.00001030999,0.00001216359,0.0001226024,0.00001664449,0.000004069086,0.00003022875,0.0000392119,0.1108569,0.000454929,0.8848212,0.003621528,0.00001002874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.164522,0.0174962,0.7359989,0.01656207,0.001177256,0.0001175563,0.0002221312,0.0002159321,0.06368792],"genre_scores_gemma":[0.9586323,0.00506385,0.02744081,0.0003718613,0.0004977605,0.00007809107,0.00005167577,0.00002843782,0.007835134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002168152,"threshold_uncertainty_score":0.009654343,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Navneet Bhalla","is_ca":true},{"name":"Peter J. Bentley","is_ca":false},{"name":"Peter D. Vize","is_ca":true},{"name":"Christian Jacob","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02138716639666881,"gpt":0.236014054624359,"spread":0.2146268882276901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004402299,0.0002864439,0.0004117129,0.0003037697,0.0005470226,0.0007338036,0.0007286692,0.0005228362,0.00144376],"category_scores_gemma":[0.001363751,0.00030333,0.0004427259,0.0003325662,0.001506596,0.000716045,0.0007835365,0.0005549177,0.0001020497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004784103,"about_ca_system_score_gemma":0.0003469039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001628634,"about_ca_topic_score_gemma":0.002093702,"domain_scores_codex":[0.9998778,0.00004070003,0.000007799841,0.00002144864,0.00003689492,0.0000153443],"domain_scores_gemma":[0.9995204,0.0003020469,0.00005298175,0.0000402957,0.00004879586,0.00003542392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003050419,0.00004332007,0.0005344831,0.00007625405,0.00002078617,0.0000815726,0.000258231,0.8531747,0.005863464,0.1192153,0.0005414124,0.02015981],"study_design_scores_gemma":[0.00001655819,0.00002116624,0.0001139361,0.00000459102,0.000003930583,0.00001540044,0.00003604428,0.9562603,0.0006746703,0.0420555,0.0007922388,0.000005556841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2721217,0.000309578,0.7161769,0.0004200715,0.00007060208,0.00006496829,0.00002869277,0.0002911885,0.01051647],"genre_scores_gemma":[0.8086615,0.0002179487,0.1867822,0.00007652033,0.00002383769,0.0001467268,0.0000393698,0.00008306765,0.003968868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001628634,"threshold_uncertainty_score":0.004829884,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ivan Damgård","is_ca":false},{"name":"Thomas B. Pedersen","is_ca":false},{"name":"Louis Salvail","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01230791371011372,"gpt":0.2228048829865899,"spread":0.2104969692764762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233954,0.001101503,0.001308676,0.0004326457,0.001549045,0.002857139,0.001760785,0.001982168,0.01133833],"category_scores_gemma":[0.008763823,0.0007822635,0.001302605,0.000762381,0.001655383,0.009987143,0.002413099,0.002804501,0.006136742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008179168,"about_ca_system_score_gemma":0.00375219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001191241,"about_ca_topic_score_gemma":0.001921853,"domain_scores_codex":[0.9973304,0.0006647014,0.0001989615,0.0007132772,0.0005077653,0.0005849188],"domain_scores_gemma":[0.9949042,0.00154353,0.0001776572,0.002806609,0.0004046613,0.0001633569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002941781,0.0007062978,0.003431557,0.0009391917,0.0003395806,0.0006123636,0.0007905401,0.07263241,0.05136681,0.1347301,0.04600732,0.6855019],"study_design_scores_gemma":[0.0004654241,0.0003620337,0.0008403567,0.0001503993,0.0002699532,0.001348514,0.001136992,0.3224923,0.07446177,0.5688168,0.02947259,0.0001829648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1429344,0.0009291627,0.7999071,0.007837445,0.0009435375,0.0004399485,0.000697103,0.007766078,0.03854511],"genre_scores_gemma":[0.590107,0.0004545324,0.3866522,0.0006423139,0.0001545644,0.0002567016,0.0005379206,0.001237728,0.019957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01133833,"threshold_uncertainty_score":0.03793049,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marios Thymianis","is_ca":false},{"name":"Alexandros Tzanetos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01548477435461291,"gpt":0.3239023054742745,"spread":0.3084175311196616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045482,0.0006687295,0.0006992302,0.0006426343,0.0004782865,0.002888492,0.00197643,0.002070684,0.007368974],"category_scores_gemma":[0.006284385,0.0004577137,0.0007263273,0.0005979508,0.001367155,0.006579301,0.002096088,0.001552619,0.001266481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003812167,"about_ca_system_score_gemma":0.0007875999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002448516,"about_ca_topic_score_gemma":0.0002897376,"domain_scores_codex":[0.9991936,0.0002575068,0.00004940068,0.0001268872,0.0002876836,0.00008493577],"domain_scores_gemma":[0.9976798,0.0009181072,0.0002929068,0.0006589831,0.0003117087,0.0001385254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003221736,0.0007747925,0.004345979,0.0006782773,0.0004409071,0.0002722621,0.0005269357,0.05124173,0.06370153,0.5713949,0.002118791,0.3041817],"study_design_scores_gemma":[0.000389708,0.001936456,0.004356465,0.0004793417,0.0006559796,0.001230069,0.0005562413,0.3773212,0.0468126,0.4608192,0.1052424,0.0002003653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09488336,0.00313546,0.8494311,0.003891241,0.0006522454,0.0001700973,0.00003819852,0.001045218,0.04675306],"genre_scores_gemma":[0.7013307,0.001839258,0.2866625,0.001018397,0.0002140024,0.0002119742,0.0000525414,0.0001931148,0.008477583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007368974,"threshold_uncertainty_score":0.02465171,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mihai Ionescu","is_ca":false},{"name":"Carlos Martı́n-Vide","is_ca":false},{"name":"Andrei Păun","is_ca":true},{"name":"Gheorghe Pǎun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01635541717707765,"gpt":0.2524889441129755,"spread":0.2361335269358979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017749,0.0006853473,0.0009992165,0.001734849,0.002223567,0.003624348,0.001569413,0.002134894,0.003884598],"category_scores_gemma":[0.00532882,0.0006782409,0.00126072,0.0009770176,0.004797045,0.004177334,0.002788026,0.00204296,0.0003609413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009787444,"about_ca_system_score_gemma":0.0005847039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004643436,"about_ca_topic_score_gemma":0.0003919983,"domain_scores_codex":[0.9990212,0.0001102265,0.00007937667,0.0003075136,0.0002128777,0.0002688843],"domain_scores_gemma":[0.996541,0.001317397,0.0004640751,0.001015364,0.0002249894,0.0004372384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009508275,0.00005736042,0.002241513,0.0001211075,0.00003056859,0.0004243437,0.0003889409,0.001465526,0.01013475,0.9761563,0.001925886,0.006958519],"study_design_scores_gemma":[0.00005030296,0.00005124537,0.001863493,0.00001804801,0.000038802,0.001061574,0.000134678,0.01921858,0.005133014,0.9694265,0.002952659,0.00005126781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8273199,0.00172282,0.1185233,0.001980098,0.0003714985,0.0001272072,0.0006188717,0.002262389,0.04707393],"genre_scores_gemma":[0.9895591,0.0002081831,0.008623373,0.0001670461,0.0001502498,0.00006440423,0.0001516488,0.0001049311,0.0009710607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003884598,"threshold_uncertainty_score":0.01299524,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Helmut Jürgensen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01272942273059178,"gpt":0.2637773171614402,"spread":0.2510478944308484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003033458,0.0004715048,0.001092066,0.001288233,0.001983105,0.002765142,0.001630141,0.00155939,0.003634904],"category_scores_gemma":[0.01244986,0.0005563935,0.0009541743,0.0009951873,0.01425903,0.01171407,0.003149551,0.004107832,0.0004339501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001620186,"about_ca_system_score_gemma":0.0007882276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001118371,"about_ca_topic_score_gemma":0.0007054224,"domain_scores_codex":[0.9983491,0.0004731884,0.00009654428,0.0004145696,0.0004116401,0.0002549529],"domain_scores_gemma":[0.9881763,0.008776549,0.0002943887,0.001812292,0.0006274399,0.0003130072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000128598,0.000007084013,0.00008331129,0.00003063227,0.000004505304,0.00002594332,0.00007391023,0.001595075,0.0002054525,0.9939377,0.0004770011,0.003546519],"study_design_scores_gemma":[0.000003151188,0.000004118293,0.00004024307,0.000008605661,0.00000174371,0.00001638642,0.000008112963,0.002421173,0.000120206,0.9959859,0.001386032,0.000004205378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.165389,0.02348221,0.5748082,0.02479582,0.002132786,0.00009086129,0.0003046964,0.000712236,0.2082841],"genre_scores_gemma":[0.9386342,0.005283317,0.04424171,0.002139816,0.001860578,0.00008678785,0.0001123215,0.0001770664,0.007464212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003634904,"threshold_uncertainty_score":0.01604265,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Autonomy; Service (business); Computer science; Affect (linguistics); Health care; Healthcare service; Psychology; Business; Marketing","authors":[{"name":"Li Tao","is_ca":false},{"name":"Jiming Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.171772017553253,"gpt":0.4010684242582836,"spread":0.2292964067050306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001059033,0.0003884812,0.0004056264,0.0007446894,0.0004833639,0.001333433,0.0008461367,0.000506689,0.0009750633],"category_scores_gemma":[0.004418691,0.0003220399,0.0007536422,0.0007545527,0.001334902,0.001780274,0.0008763966,0.0007653076,0.00009625457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002240413,"about_ca_system_score_gemma":0.001956161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03239637,"about_ca_topic_score_gemma":0.02006641,"domain_scores_codex":[0.9993401,0.0002451092,0.00003982571,0.0001411016,0.0001032991,0.0001305663],"domain_scores_gemma":[0.9972988,0.001474533,0.0005534894,0.000235314,0.0001857389,0.0002521918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003762164,0.00008400388,0.01828526,0.00003023456,0.00005390203,0.00009697323,0.000654883,0.9088117,0.0007987915,0.065986,0.0003321588,0.004828465],"study_design_scores_gemma":[0.000003809061,0.00001190468,0.00232041,0.000003335729,0.000005567829,0.00001022601,0.0001451861,0.9749622,0.00006296479,0.02217896,0.0002897916,0.000005591967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6265086,0.0001956104,0.3638542,0.001161561,0.00003091048,0.000105594,0.0003296178,0.0001613285,0.00765257],"genre_scores_gemma":[0.9843228,0.00008810782,0.01485776,0.00003312581,0.0000114765,0.00004933477,0.00009478632,0.00001836187,0.0005241761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03239637,"threshold_uncertainty_score":0.06441563,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Anne Condon","is_ca":true},{"name":"Bonnie Kirkpatrick","is_ca":true},{"name":"Ján Maňuch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006002088872680025,"gpt":0.2604919660045394,"spread":0.2544898771318594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659723,0.001651629,0.001185185,0.002516158,0.001378189,0.003413356,0.002336488,0.001922098,0.009672546],"category_scores_gemma":[0.01816481,0.0007295308,0.001841031,0.002293203,0.003376415,0.007601239,0.003331512,0.005161572,0.0009843047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003909823,"about_ca_system_score_gemma":0.001882466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005251288,"about_ca_topic_score_gemma":0.004486465,"domain_scores_codex":[0.9969772,0.0006411001,0.0001524093,0.0006926691,0.00102249,0.0005142303],"domain_scores_gemma":[0.9729435,0.02307272,0.001244692,0.0008621407,0.001134743,0.000742051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002123509,0.00008297369,0.0007593257,0.0005131631,0.00008332728,0.0002091739,0.0003241992,0.3165839,0.003563594,0.6511799,0.00314073,0.02334739],"study_design_scores_gemma":[0.00001842829,0.00003517045,0.0001812423,0.000058109,0.00003130811,0.00005963202,0.00003913614,0.3726069,0.001202984,0.6236107,0.002135998,0.00002043137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06844439,0.00446982,0.8773872,0.003376713,0.0001863866,0.0001368377,0.001495195,0.001497503,0.04300589],"genre_scores_gemma":[0.8492911,0.004231185,0.1281139,0.0008333214,0.0003741559,0.0004646307,0.002389435,0.0005115161,0.01379066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009672546,"threshold_uncertainty_score":0.03235793,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Sears","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009170351526350288,"gpt":0.2609547408258283,"spread":0.2517843892994781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293585,0.0005040625,0.0005865088,0.000725089,0.000994685,0.002641277,0.002071357,0.001292148,0.01050864],"category_scores_gemma":[0.0052263,0.0006357142,0.0007775775,0.0006942787,0.002327271,0.003749973,0.002529656,0.001741627,0.002475996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009799723,"about_ca_system_score_gemma":0.001202266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008802653,"about_ca_topic_score_gemma":0.0007740536,"domain_scores_codex":[0.9985994,0.000421411,0.0001345622,0.0003268833,0.0002911667,0.0002266456],"domain_scores_gemma":[0.9969458,0.001095096,0.0002303736,0.001038228,0.000455482,0.0002350246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001792099,0.00006554946,0.0003525241,0.00006726629,0.00001608153,0.0004245504,0.0003842161,0.01248404,0.01053625,0.961711,0.001158206,0.01262108],"study_design_scores_gemma":[0.00008053852,0.00005866202,0.00009701774,0.00001645059,0.00001484347,0.000212605,0.0001130445,0.1151783,0.01526214,0.862489,0.00640621,0.00007105162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1804839,0.0002041368,0.7683882,0.000643653,0.0001610476,0.0001696389,0.0004204464,0.003455844,0.0460732],"genre_scores_gemma":[0.8700827,0.0001006399,0.1127515,0.0002910336,0.00005081675,0.0002264614,0.000305245,0.000719072,0.01547253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01050864,"threshold_uncertainty_score":0.03515488,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Steffen Kopecki","is_ca":true},{"name":"Shinnosuke Seki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00472871023997638,"gpt":0.2573590489517277,"spread":0.2526303387117513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005927419,0.0002926423,0.0001807196,0.0002418491,0.0002989775,0.0005994136,0.0004302391,0.0004030669,0.004692033],"category_scores_gemma":[0.0001305814,0.0002312675,0.0002145493,0.0001394096,0.0003815841,0.0002371351,0.0005465992,0.0002745455,0.001224308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003332108,"about_ca_system_score_gemma":0.0002072854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004512085,"about_ca_topic_score_gemma":0.0008353024,"domain_scores_codex":[0.9998848,0.00001145911,0.000004185816,0.00002615242,0.00004310974,0.00003015294],"domain_scores_gemma":[0.9999177,0.00001475534,0.00001114029,0.00002051884,0.00001449644,0.00002131999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001459972,0.00007273758,0.0004586965,0.0001155826,0.00001591734,0.0004860293,0.0001266565,0.0192852,0.8736539,0.08024364,0.00253894,0.02285667],"study_design_scores_gemma":[0.0000735124,0.0001963457,0.001652318,0.00003013857,0.00002071808,0.0006303065,0.00009323018,0.3130054,0.628731,0.0334083,0.02207791,0.0000808089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6512095,0.0005384963,0.24696,0.0003889838,0.0003155755,0.00008561023,0.0003819195,0.002500786,0.09761906],"genre_scores_gemma":[0.9209184,0.0001512,0.05921023,0.0001839127,0.00001402013,0.00008733509,0.0002009823,0.0002097115,0.01902422],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004692033,"threshold_uncertainty_score":0.01569647,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Roderick Edwards","is_ca":true},{"name":"Aude Maignan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008713007467321114,"gpt":0.2073030927396991,"spread":0.198590085272378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002689837,0.0003861346,0.0007220939,0.0008057038,0.001128123,0.002314784,0.0005635832,0.0007946543,0.003644624],"category_scores_gemma":[0.002002226,0.0001867838,0.0006707748,0.0007783314,0.001188368,0.001471374,0.001020292,0.0008654374,0.0006081547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008188097,"about_ca_system_score_gemma":0.0007986295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002391299,"about_ca_topic_score_gemma":0.001413745,"domain_scores_codex":[0.999685,0.00005513881,0.0000210263,0.000107115,0.00008025495,0.00005153922],"domain_scores_gemma":[0.9987256,0.0005415715,0.0002295346,0.0001663258,0.0002104013,0.0001265245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004093754,0.00005631462,0.001370188,0.0001032452,0.00002629675,0.0003721667,0.0003127861,0.007883839,0.005742999,0.9630224,0.002117724,0.01895099],"study_design_scores_gemma":[0.00006045027,0.00005421906,0.00153369,0.00003199196,0.00002186772,0.000631549,0.000173474,0.1353777,0.001821817,0.8395548,0.02070291,0.00003550602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3178045,0.001716475,0.588518,0.001855039,0.0002087118,0.0002325774,0.001431239,0.00104201,0.08719139],"genre_scores_gemma":[0.9379882,0.0006194176,0.04877149,0.0003517806,0.0002214239,0.0002319133,0.0005775942,0.00006170636,0.01117639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003644624,"threshold_uncertainty_score":0.01219243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jenna Butler","is_ca":true},{"name":"Frances Mackay","is_ca":true},{"name":"Colin Denniston","is_ca":true},{"name":"Mark Daley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03039639798256568,"gpt":0.2577887319160594,"spread":0.2273923339334937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003380663,0.0003463302,0.0008472496,0.0004115498,0.0006778399,0.001352556,0.001600615,0.001602874,0.00345441],"category_scores_gemma":[0.002129772,0.0003191138,0.0007875549,0.00041522,0.0015721,0.001025561,0.0007688078,0.001252014,0.0002770387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144996,"about_ca_system_score_gemma":0.00158979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0183671,"about_ca_topic_score_gemma":0.01126096,"domain_scores_codex":[0.9998477,0.00004600213,0.000005798868,0.00002784893,0.00002735478,0.00004526557],"domain_scores_gemma":[0.9991593,0.0005029863,0.00007531605,0.00006630139,0.00008446782,0.0001116545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000114334,0.00005658001,0.001089475,0.00003605875,0.00002599568,0.0001763899,0.0001398142,0.8551162,0.002249357,0.1374761,0.001090299,0.002429332],"study_design_scores_gemma":[0.0000266868,0.00001425796,0.00009859247,0.000002562804,0.000007993445,0.00001060554,0.00001987491,0.979268,0.0002303628,0.02003473,0.0002788307,0.000007513674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8042039,0.0007288454,0.1545255,0.004722772,0.0003913323,0.00006399344,0.0005873289,0.0004240328,0.03435227],"genre_scores_gemma":[0.9881109,0.0001528416,0.005780981,0.0001276941,0.00002268235,0.00004251286,0.0000627515,0.00003285785,0.00566676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0183671,"threshold_uncertainty_score":0.03652042,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Amardeep Singh","is_ca":false},{"name":"Lalit M. Bharadwaj","is_ca":false},{"name":"Singh Harpreet","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03375845069028024,"gpt":0.2860651276631899,"spread":0.2523066769729096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000919795,0.0004525934,0.0006407003,0.0009642439,0.0006304326,0.001469715,0.001503936,0.001382468,0.005975208],"category_scores_gemma":[0.006629559,0.0002643969,0.0005145577,0.001157467,0.002597241,0.003422816,0.001064458,0.001463518,0.000580887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001695425,"about_ca_system_score_gemma":0.0008563481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001557814,"about_ca_topic_score_gemma":0.001913298,"domain_scores_codex":[0.9990221,0.0003727322,0.00004284669,0.0001364859,0.0003506559,0.00007519878],"domain_scores_gemma":[0.9976864,0.001604667,0.0001055177,0.0003038414,0.0002382137,0.00006140496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001016248,0.00003200466,0.0002153131,0.00009132177,0.00001764924,0.00003530792,0.00006528913,0.03193279,0.002491985,0.8803328,0.003013417,0.08167046],"study_design_scores_gemma":[0.00002092722,0.00002259473,0.0001249279,0.00001827043,0.000007037887,0.00003443156,0.00001703693,0.09919946,0.001378406,0.8936083,0.005556477,0.0000121089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03356018,0.003999286,0.9320763,0.003441154,0.0004952583,0.00008721925,0.0001620961,0.0004710453,0.02570736],"genre_scores_gemma":[0.5820428,0.002246467,0.3941203,0.0008304187,0.0005635331,0.0002267823,0.000230108,0.0001467753,0.01959282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005975208,"threshold_uncertainty_score":0.01998907,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sangram Bagh","is_ca":true},{"name":"David R. McMillen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005791972433579648,"gpt":0.2280615160182967,"spread":0.222269543584717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106116,0.0001831349,0.0001352907,0.0001339059,0.0001270154,0.000255183,0.0003427462,0.0003059066,0.001205418],"category_scores_gemma":[0.000676183,0.00009806181,0.0001343591,0.0001248467,0.0002768085,0.0002030503,0.0001647172,0.0002752925,0.0001638286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002449917,"about_ca_system_score_gemma":0.0001887296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002640784,"about_ca_topic_score_gemma":0.0002317595,"domain_scores_codex":[0.9999136,0.00001508806,0.0000046824,0.00002969832,0.00002613485,0.00001087621],"domain_scores_gemma":[0.9998063,0.00007144747,0.00003876967,0.00002381197,0.00002536696,0.00003435225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001503466,0.00005472581,0.0003923699,0.0000847503,0.00001585558,0.0001182445,0.00003390997,0.01378316,0.9626468,0.01255242,0.000355479,0.009812063],"study_design_scores_gemma":[0.00006647928,0.0003615589,0.00129643,0.00001299176,0.00003238878,0.0004004215,0.0000153488,0.271642,0.7147541,0.005983768,0.005400247,0.00003424541],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7811238,0.0001741773,0.2097009,0.0007186413,0.0002364115,0.0000690812,0.0002779503,0.00202939,0.005669647],"genre_scores_gemma":[0.968722,0.00005105214,0.02913877,0.0001042738,0.000009004058,0.00002796952,0.00005855519,0.00006261043,0.001825734],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001205418,"threshold_uncertainty_score":0.004032493,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Christopher Duffy","is_ca":false},{"name":"Sam Hillis","is_ca":false},{"name":"Muhammad Umer Khan","is_ca":false},{"name":"Ian McQuillan","is_ca":true},{"name":"Sonja Linghui Shan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02763257918964659,"gpt":0.3179028382026179,"spread":0.2902702590129713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006378799,0.0005602948,0.001055887,0.002204326,0.001751736,0.004082262,0.003311502,0.00167289,0.006991904],"category_scores_gemma":[0.03911548,0.000895736,0.001864695,0.001729065,0.004267884,0.01155694,0.003353297,0.004104821,0.0009365001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003260634,"about_ca_system_score_gemma":0.001960003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00305649,"about_ca_topic_score_gemma":0.00526975,"domain_scores_codex":[0.9964994,0.001801735,0.0002076008,0.0005559086,0.0007586518,0.0001766196],"domain_scores_gemma":[0.9711885,0.02568739,0.0006635849,0.001131905,0.001051019,0.0002775826],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003509735,0.0000357252,0.0005519174,0.00009559975,0.00003243121,0.000033814,0.0001773326,0.02024744,0.0002171474,0.9547167,0.001480636,0.02237622],"study_design_scores_gemma":[0.000005955952,0.000002430733,0.00004546396,0.00001579344,0.00000752165,0.00001316154,0.00001877337,0.07628335,0.0002489264,0.9224554,0.0008965598,0.000006595115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01935371,0.001298178,0.9676936,0.002306165,0.0001150572,0.00004041756,0.0001578211,0.0003424838,0.008692547],"genre_scores_gemma":[0.5281795,0.001703848,0.4587868,0.0008542245,0.0005952624,0.0001836831,0.0005952159,0.0001904099,0.008911064],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006991904,"threshold_uncertainty_score":0.03373474,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pedro Barahona","is_ca":false},{"name":"Gemma Bel-Enguix","is_ca":false},{"name":"Verónica Dahl","is_ca":true},{"name":"M. Dolores Jiménez‐López","is_ca":false},{"name":"Ludwig Krippahl","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03415689047719922,"gpt":0.2655480904786237,"spread":0.2313912000014245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006987719,0.0004937139,0.0007142615,0.001312465,0.0005029222,0.0008084748,0.001158793,0.0008790696,0.002793476],"category_scores_gemma":[0.004344545,0.0003672015,0.001023739,0.001181431,0.0002695935,0.001072034,0.0008318321,0.001203064,0.001250015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004402066,"about_ca_system_score_gemma":0.0009736092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001187735,"about_ca_topic_score_gemma":0.002460804,"domain_scores_codex":[0.9995226,0.0000856712,0.00003754111,0.000125253,0.0001699898,0.00005896957],"domain_scores_gemma":[0.9980627,0.0009761859,0.0001008738,0.0002444501,0.0005590201,0.0000567158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003352923,0.0002531684,0.004956946,0.0002686726,0.0001009608,0.0004723629,0.0002548347,0.08851472,0.02566887,0.01257726,0.01729952,0.8492974],"study_design_scores_gemma":[0.00003482495,0.00008857363,0.001029624,0.00003184314,0.000054653,0.0001588002,0.00006800891,0.9541559,0.008707437,0.03163926,0.004018128,0.00001296739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06635781,0.0002312002,0.9266537,0.0003393436,0.0001219525,0.0002403827,0.0008682926,0.002988228,0.002199058],"genre_scores_gemma":[0.3573184,0.0001708833,0.6348016,0.0001223537,0.00006400341,0.0003151809,0.004166872,0.0003187296,0.00272191],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002793476,"threshold_uncertainty_score":0.009345055,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Anne Condon","is_ca":true},{"name":"Bonnie Kirkpatrick","is_ca":true},{"name":"Ján Maňuch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01358274131398561,"gpt":0.266408005919903,"spread":0.2528252646059174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485549,0.0003914564,0.000432134,0.0003252677,0.0005091912,0.0006493807,0.0005974495,0.0005388835,0.00190129],"category_scores_gemma":[0.0008656955,0.0003835985,0.0002898031,0.0003045793,0.0005392434,0.0007603517,0.0006665228,0.0007441893,0.0008159046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006347274,"about_ca_system_score_gemma":0.0007221737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002350623,"about_ca_topic_score_gemma":0.00040332,"domain_scores_codex":[0.9998455,0.0000348577,0.00001335853,0.00003506876,0.00004102011,0.00003017713],"domain_scores_gemma":[0.9995436,0.0001113454,0.0001051216,0.000070279,0.00006207479,0.0001075625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003830989,0.0002661905,0.0009728223,0.0006011605,0.00005085246,0.0003912311,0.0002021439,0.2145305,0.6547645,0.09551471,0.001117294,0.03120548],"study_design_scores_gemma":[0.0001922741,0.00109324,0.0003280608,0.00006079845,0.00004593077,0.0002041674,0.00009624975,0.4461495,0.4993496,0.03019104,0.02219862,0.00009046372],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7679483,0.001710194,0.2155546,0.0006023956,0.0001986973,0.0001959884,0.0001876018,0.0006677384,0.01293453],"genre_scores_gemma":[0.8855457,0.0008891404,0.1093602,0.0001091275,0.00002181421,0.0003163685,0.0001603871,0.00009252688,0.003504619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00190129,"threshold_uncertainty_score":0.006360471,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jacob Morra","is_ca":false},{"name":"Kaitlyn E. Fouke","is_ca":false},{"name":"Eva A. Naumann","is_ca":false},{"name":"Mark Daley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01235053524293868,"gpt":0.2627605480436669,"spread":0.2504100128007283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003843577,0.0003945846,0.0002886076,0.00106426,0.0002813326,0.001667811,0.0005043494,0.0008345812,0.002374765],"category_scores_gemma":[0.005746715,0.0003235096,0.0003010164,0.001057114,0.001558532,0.003959027,0.0008277012,0.0007268632,0.0002681904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004807722,"about_ca_system_score_gemma":0.0002194682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001612628,"about_ca_topic_score_gemma":0.001393171,"domain_scores_codex":[0.999853,0.00004595133,0.000005444622,0.00005258839,0.0000306569,0.00001231273],"domain_scores_gemma":[0.9982869,0.001139016,0.0002304234,0.0001398427,0.00009438942,0.0001094573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003468602,0.000121825,0.05269146,0.0006594923,0.0005127107,0.0006845997,0.001694273,0.2365484,0.05921086,0.4146351,0.006365138,0.2265293],"study_design_scores_gemma":[0.00001603852,0.00005050715,0.04745613,0.00006593924,0.00007285212,0.0003555915,0.0003533715,0.2161198,0.00392176,0.7274793,0.004046547,0.00006226495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5252243,0.005181812,0.4486549,0.005148506,0.0002658568,0.000029013,0.001159445,0.0007718198,0.01356443],"genre_scores_gemma":[0.9858024,0.00119586,0.01119055,0.0001642744,0.00009256066,0.0000158503,0.0001666588,0.000106512,0.00126547],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002374765,"threshold_uncertainty_score":0.007944405,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Da-Jung Cho","is_ca":false},{"name":"Yo-Sub Han","is_ca":false},{"name":"Shindong Kang","is_ca":false},{"name":"Hwee Kim","is_ca":false},{"name":"Sang‐Ki Ko","is_ca":false},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04490257803118486,"gpt":0.2500547357206244,"spread":0.2051521576894395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008528668,0.0009602682,0.001350501,0.001572098,0.003261731,0.007185861,0.003144834,0.002564426,0.006725607],"category_scores_gemma":[0.04148904,0.001516799,0.004410306,0.002155377,0.008810256,0.02258555,0.005017354,0.01060249,0.0006611201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002755086,"about_ca_system_score_gemma":0.004034679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003031407,"about_ca_topic_score_gemma":0.002805897,"domain_scores_codex":[0.9912987,0.002608841,0.0008783746,0.002085892,0.001998286,0.001129906],"domain_scores_gemma":[0.9231333,0.06593172,0.001545683,0.004989327,0.003346164,0.001053799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001999195,0.0001978559,0.001271372,0.000259146,0.00004588559,0.0002893012,0.0010103,0.004267739,0.001369786,0.9670853,0.003384084,0.02061943],"study_design_scores_gemma":[0.00004961009,0.00001420296,0.00009909749,0.00002549042,0.00002664229,0.0001497438,0.0001376762,0.01241996,0.001415587,0.984055,0.001588769,0.00001836794],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1149091,0.001581169,0.8336414,0.01156058,0.0004508719,0.0002974814,0.001313296,0.001326424,0.03491972],"genre_scores_gemma":[0.7954499,0.001105168,0.188242,0.002280939,0.0009339789,0.0005710102,0.002329403,0.0007425877,0.008345039],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008528668,"threshold_uncertainty_score":0.04510444,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Word (group theory); Conjugate; Programming language; Linguistics; Mathematics; Philosophy","authors":[{"name":"Francesco Bellamoli","is_ca":false},{"name":"Giuditta Franco","is_ca":false},{"name":"Lila Kari","is_ca":true},{"name":"Silvia Lampis","is_ca":false},{"name":"Timothy Ng","is_ca":false},{"name":"Zihao Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01256357513631312,"gpt":0.2996364354995382,"spread":0.287072860363225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002396584,0.0006552338,0.0006948165,0.0008589845,0.0008941516,0.002757999,0.003464474,0.001750611,0.02517401],"category_scores_gemma":[0.008628749,0.0007354228,0.000971353,0.0007959028,0.002225016,0.004772436,0.002863231,0.001924579,0.00436406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006900112,"about_ca_system_score_gemma":0.001278799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001388879,"about_ca_topic_score_gemma":0.0008743065,"domain_scores_codex":[0.9981002,0.0004450833,0.0001367629,0.000455101,0.0007157287,0.0001472378],"domain_scores_gemma":[0.9958682,0.001473689,0.0001850897,0.001748767,0.0006194969,0.0001048453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007194515,0.0004320856,0.00174694,0.0003899358,0.0000527561,0.0003588742,0.0005750347,0.09147076,0.032014,0.7333127,0.005215346,0.1337121],"study_design_scores_gemma":[0.00009964159,0.00009610177,0.0001702797,0.00003196659,0.00001925169,0.0001403895,0.00007650168,0.8003383,0.05574066,0.1343665,0.008876006,0.00004440606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01115738,0.00001826278,0.980029,0.00008585266,0.00004109826,0.0001158547,0.000165112,0.004388513,0.003998906],"genre_scores_gemma":[0.3106822,0.00007023013,0.6801917,0.00009953311,0.00003319225,0.0004080486,0.00053277,0.001840965,0.006141404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02517401,"threshold_uncertainty_score":0.08421552,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eugen Czeizler","is_ca":false},{"name":"Lila Kari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01216487232534999,"gpt":0.2656995747712098,"spread":0.2535347024458597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611437,0.0003115572,0.00113225,0.0006893783,0.001315223,0.001669357,0.001550099,0.0008881395,0.005979236],"category_scores_gemma":[0.004908404,0.0005724713,0.00153048,0.0007838928,0.002906389,0.004105254,0.002771167,0.002180652,0.0007707723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009908656,"about_ca_system_score_gemma":0.0007553491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003520774,"about_ca_topic_score_gemma":0.004793493,"domain_scores_codex":[0.9993316,0.0001984822,0.00004392739,0.0001819964,0.0001584064,0.00008557587],"domain_scores_gemma":[0.9973072,0.001178599,0.0001590106,0.0009317273,0.0002905432,0.0001330176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003720529,0.00002240737,0.0003531795,0.00007080646,0.0000148245,0.00006979552,0.0003200832,0.03203825,0.001560175,0.9446281,0.002250011,0.01863517],"study_design_scores_gemma":[0.00001033674,0.00001812598,0.0001688079,0.00001173697,0.00001179713,0.00004380767,0.00006975934,0.1048827,0.001062519,0.888786,0.004922365,0.00001196364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0880636,0.0004490016,0.8865622,0.0008212368,0.000128733,0.00005246643,0.0002479198,0.0004845101,0.02319034],"genre_scores_gemma":[0.7425047,0.0007029332,0.2401202,0.0004525574,0.0002388822,0.0001433608,0.0006626763,0.0005336517,0.014641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005979236,"threshold_uncertainty_score":0.02000254,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ya Meng","is_ca":true},{"name":"Navin Kashyap","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006886428977592003,"gpt":0.2375674614558993,"spread":0.2306810324783073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009425904,0.0007043775,0.0007965416,0.0005491059,0.0009310158,0.001549034,0.001328413,0.001544685,0.004260475],"category_scores_gemma":[0.006236594,0.0008125249,0.0007955749,0.0003929278,0.002490887,0.002048955,0.001474013,0.00101018,0.0004018444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007691826,"about_ca_system_score_gemma":0.0006558666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003344467,"about_ca_topic_score_gemma":0.002237821,"domain_scores_codex":[0.9995568,0.0001336029,0.00001886246,0.0000575814,0.0001272912,0.0001058619],"domain_scores_gemma":[0.9974446,0.00122192,0.0004493837,0.0003713721,0.0002408882,0.0002718295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001455352,0.00004026462,0.0003806233,0.00003999753,0.00001250948,0.0001925944,0.000057796,0.9658808,0.006373046,0.02474204,0.0002913207,0.001843486],"study_design_scores_gemma":[0.00002075964,0.00005066726,0.0003714825,0.000004515394,0.00001136183,0.00003585196,0.00003207106,0.9880732,0.001670296,0.009543801,0.0001698257,0.00001621826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7534558,0.0005837477,0.2065192,0.001104781,0.0004261926,0.00006298384,0.0001404726,0.0004483415,0.03725851],"genre_scores_gemma":[0.991128,0.000128999,0.005075104,0.00007085183,0.00002203492,0.00002372028,0.00003487045,0.00007999285,0.003436528],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004260475,"threshold_uncertainty_score":0.01425272,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lev Goldfarb","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04148601961744935,"gpt":0.2802184240897505,"spread":0.2387324044723011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001087073,0.0008461084,0.0008050484,0.001167255,0.00217309,0.005783124,0.001214561,0.002168757,0.04316406],"category_scores_gemma":[0.005074955,0.0007495918,0.001060807,0.001797298,0.007278461,0.01338498,0.002578216,0.005090184,0.01199692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002858994,"about_ca_system_score_gemma":0.001684756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004403763,"about_ca_topic_score_gemma":0.002833663,"domain_scores_codex":[0.9981488,0.0006844932,0.0001037188,0.0005254609,0.0003804456,0.0001570479],"domain_scores_gemma":[0.9979044,0.0008451011,0.00006043828,0.0008575528,0.0002722412,0.00006025779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000502706,0.000002460028,0.00001354895,0.00002343102,0.000001982877,0.000005088816,0.00007195771,0.000143474,0.0000542454,0.9876832,0.004518957,0.007476655],"study_design_scores_gemma":[0.000003522702,0.000003583077,0.00001769962,0.00002395035,0.000004939556,0.00001937501,0.00002156487,0.0007973902,0.0002328946,0.9403344,0.05853583,0.000004775197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005175241,0.008450187,0.5524719,0.02757637,0.004170486,0.00007280939,0.0007981671,0.001674609,0.3996102],"genre_scores_gemma":[0.4782501,0.007852509,0.1626487,0.007374499,0.004686929,0.0003281553,0.00174911,0.002883984,0.334226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9978269,"threshold_uncertainty_score":0.1443981,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mark Daley","is_ca":true},{"name":"Kalpana Mahalingam","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003322139141418642,"gpt":0.2198957880571712,"spread":0.2165736489157526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009309274,0.000595629,0.0009224245,0.001790906,0.00395749,0.004841013,0.0009828134,0.001662645,0.01079742],"category_scores_gemma":[0.003105877,0.0009148747,0.00141607,0.00209438,0.003848793,0.01209191,0.002879632,0.002657441,0.003429698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009804579,"about_ca_system_score_gemma":0.0007404421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006846332,"about_ca_topic_score_gemma":0.0007111229,"domain_scores_codex":[0.9983455,0.0004339485,0.0001657541,0.0006245007,0.0002358192,0.0001944755],"domain_scores_gemma":[0.997252,0.001488157,0.0001687917,0.0005449514,0.0003279159,0.000218157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004206104,0.00001734073,0.00008963451,0.00003212506,0.000005653692,0.00009748774,0.0005855304,0.00009236681,0.001772957,0.9896708,0.0009739524,0.006620148],"study_design_scores_gemma":[0.0000183061,0.00003242834,0.00009967524,0.00001823118,0.000018177,0.0003245409,0.000239119,0.001103532,0.002097391,0.9752465,0.02078406,0.00001803104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2580061,0.003055642,0.5342191,0.004149304,0.001849884,0.0002227125,0.0006651365,0.001893094,0.195939],"genre_scores_gemma":[0.8258294,0.0009955302,0.1157466,0.001104737,0.0009400579,0.0002421599,0.0004990705,0.0006649817,0.05397733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01079742,"threshold_uncertainty_score":0.03612095,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science","authors":[{"name":"Ian McQuillan","is_ca":true},{"name":"Shinnosuke Seki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01369554282814917,"gpt":0.2836078491481283,"spread":0.2699123063199791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141454,0.001006183,0.0006702007,0.003460569,0.002918313,0.004260095,0.001236948,0.0009317953,0.4068384],"category_scores_gemma":[0.01264898,0.0003394129,0.0006387715,0.002705659,0.0008450461,0.003899828,0.00203707,0.003702976,0.2828133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00227282,"about_ca_system_score_gemma":0.002016186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005367406,"about_ca_topic_score_gemma":0.006769539,"domain_scores_codex":[0.999194,0.0001515517,0.00004550945,0.0001441029,0.0004058929,0.00005894647],"domain_scores_gemma":[0.9934233,0.001196393,0.0001466769,0.000694601,0.003783465,0.0007555021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002041678,0.00001626379,0.00005640781,0.000073749,0.000001534252,0.00001966933,0.00005413905,0.00005240456,0.0001145448,0.01045361,0.9498349,0.03930242],"study_design_scores_gemma":[0.000003258986,0.00000740268,0.0001538337,0.00008366073,0.000001776082,0.00002926309,0.00006188719,0.00005539729,0.0001302306,0.006619441,0.9928482,0.000005654135],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.001048133,0.007592008,0.02687606,0.03868533,0.2120459,0.0005525281,0.01158422,0.002767327,0.6988486],"genre_scores_gemma":[0.006796539,0.004023206,0.006228355,0.005845618,0.03079678,0.0002693721,0.007736229,0.001881164,0.9364228],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.4068384,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Nicolae Sântean","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01113627193867799,"gpt":0.2531903348998224,"spread":0.2420540629611444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100129,0.0008284091,0.001106212,0.001227049,0.001095219,0.005110739,0.001332136,0.001196552,0.006862608],"category_scores_gemma":[0.007740821,0.0009115057,0.001976731,0.001684554,0.002146007,0.01097437,0.00265983,0.002322965,0.001271538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001064181,"about_ca_system_score_gemma":0.001008818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001118879,"about_ca_topic_score_gemma":0.002188947,"domain_scores_codex":[0.9982629,0.0001812265,0.0001736572,0.0005952342,0.0004513342,0.0003356012],"domain_scores_gemma":[0.9949889,0.003333695,0.0003488516,0.0004955793,0.0005195054,0.0003135366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001718007,0.0005987654,0.005882139,0.001637944,0.0002448011,0.001230491,0.005564993,0.02702971,0.06530769,0.7489547,0.007226679,0.1346041],"study_design_scores_gemma":[0.00007916403,0.0001383294,0.0006413696,0.0001092211,0.0001260566,0.0003807448,0.001301045,0.03059643,0.02836626,0.9306186,0.007565251,0.00007755272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5813738,0.0005460904,0.3947558,0.001189362,0.0001696851,0.0001507675,0.001629502,0.003179197,0.01700589],"genre_scores_gemma":[0.8283541,0.0002707059,0.1611541,0.0002143476,0.0001014056,0.00009769949,0.00278684,0.0007923768,0.006228272],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.006862608,"threshold_uncertainty_score":0.02295774,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Óscar H. Ibarra","is_ca":false},{"name":"Ian McQuillan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008204423882996022,"gpt":0.2557424299032091,"spread":0.247538006020213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01397356,0.002010755,0.003373342,0.00302775,0.005832157,0.01299516,0.009698102,0.007258416,0.01232287],"category_scores_gemma":[0.07456632,0.002895167,0.008585725,0.005265468,0.01425739,0.04536065,0.008733718,0.01836144,0.00117396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007633847,"about_ca_system_score_gemma":0.005256599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007078299,"about_ca_topic_score_gemma":0.007169676,"domain_scores_codex":[0.9834967,0.005638666,0.001210926,0.004327415,0.003075693,0.002250659],"domain_scores_gemma":[0.8071514,0.1809032,0.002537057,0.005430085,0.002379086,0.001599068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005022851,0.0003760151,0.001587823,0.000650176,0.0001470469,0.000480781,0.002033819,0.01937663,0.001288558,0.9401134,0.007949659,0.0254939],"study_design_scores_gemma":[0.00005923835,0.00001711057,0.0001178268,0.00004484968,0.00004149932,0.00008929059,0.000166137,0.01867147,0.0006747246,0.9787399,0.00135858,0.00001947658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1882885,0.006957883,0.6591859,0.04078052,0.001245479,0.000557525,0.002272665,0.002491218,0.09822043],"genre_scores_gemma":[0.8204208,0.003329547,0.1425404,0.004616037,0.00243022,0.0006631094,0.004070318,0.001058072,0.02087167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01397356,"threshold_uncertainty_score":0.07390004,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"John Alajaji","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01066938325092859,"gpt":0.2648285221914973,"spread":0.2541591389405687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004350919,0.001850586,0.001965824,0.003068098,0.002886275,0.007929035,0.006311693,0.002640981,0.02231616],"category_scores_gemma":[0.02369663,0.001930293,0.004271833,0.004003125,0.004256367,0.03274529,0.01100175,0.006309083,0.004078615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003860318,"about_ca_system_score_gemma":0.002791379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001915149,"about_ca_topic_score_gemma":0.003179035,"domain_scores_codex":[0.9954833,0.0009385623,0.0004326859,0.001612952,0.0009132837,0.0006193023],"domain_scores_gemma":[0.9834953,0.01006773,0.0004487231,0.004218282,0.001115753,0.0006542172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004674787,0.0001581642,0.0009525358,0.000411802,0.00007604108,0.00004307595,0.0009768361,0.00869735,0.002278187,0.8281456,0.009441114,0.1483518],"study_design_scores_gemma":[0.00005572838,0.00002047483,0.0001056524,0.00006935404,0.00006760778,0.00005528405,0.0002047184,0.02929659,0.003223683,0.9611186,0.00575474,0.00002739093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03009341,0.0007111982,0.9491393,0.001502859,0.000212611,0.0001856055,0.0006714783,0.004249524,0.01323404],"genre_scores_gemma":[0.2832246,0.0006364021,0.6971912,0.0006376645,0.0003019795,0.0004860205,0.001709321,0.002378192,0.01343455],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02231616,"threshold_uncertainty_score":0.074655,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Mark Daley","is_ca":true},{"name":"Ian McQuillan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01001756640748301,"gpt":0.2427780060689295,"spread":0.2327604396614465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907458,0.000570056,0.0005211052,0.0005450132,0.0006728018,0.001386447,0.001317793,0.001006871,0.004764823],"category_scores_gemma":[0.002566139,0.000418483,0.001038962,0.000562441,0.001638228,0.001851382,0.0009550906,0.0007793174,0.0006754118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001090566,"about_ca_system_score_gemma":0.0007443527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003730602,"about_ca_topic_score_gemma":0.003869356,"domain_scores_codex":[0.9994813,0.0001563819,0.00003325387,0.0001524518,0.00009106273,0.00008569707],"domain_scores_gemma":[0.999231,0.0003637106,0.00007681458,0.000152213,0.0001299906,0.00004632624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000158498,0.0000482741,0.0005958456,0.0001232594,0.00003319064,0.0003528591,0.0004019872,0.3103292,0.01261119,0.6438903,0.001178007,0.03027738],"study_design_scores_gemma":[0.00002575618,0.00005239509,0.0001442773,0.00001900453,0.00002074402,0.00007651898,0.00008308742,0.6236662,0.008796059,0.3601359,0.006954749,0.00002525974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06151771,0.0001996952,0.9290573,0.0001322902,0.0001248093,0.00005298345,0.000140008,0.0007569445,0.008018171],"genre_scores_gemma":[0.7888184,0.0002648978,0.2031951,0.00006426308,0.00005357167,0.0001517939,0.0003114279,0.000238652,0.006901859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004764823,"threshold_uncertainty_score":0.01593995,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Amirhossein Simjour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00574507942632478,"gpt":0.276728104713421,"spread":0.2709830252870962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004488458,0.0004999518,0.0003580866,0.000237862,0.0004119027,0.000985234,0.000812345,0.0006051671,0.003401274],"category_scores_gemma":[0.002563474,0.0002670804,0.0003482311,0.0002479484,0.00102683,0.001458951,0.001250293,0.001088109,0.0009537702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003003642,"about_ca_system_score_gemma":0.0004254319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003694593,"about_ca_topic_score_gemma":0.0007279526,"domain_scores_codex":[0.9996542,0.00008580194,0.0000205935,0.00006641106,0.0001062046,0.00006681804],"domain_scores_gemma":[0.9991025,0.0004250943,0.00005843528,0.0003047847,0.00006179075,0.00004743611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007502342,0.0001730862,0.001080012,0.0003709485,0.00002833842,0.0003684723,0.0004423348,0.1139573,0.3942702,0.412102,0.001779915,0.07467731],"study_design_scores_gemma":[0.000104412,0.0004299474,0.000383558,0.00005277271,0.00003623271,0.0002208023,0.0001438279,0.610515,0.2463195,0.1275927,0.01415569,0.00004557995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2293832,0.0004803368,0.7415342,0.0006333637,0.0003085927,0.00006751017,0.00008095358,0.00137742,0.02613435],"genre_scores_gemma":[0.8973082,0.0002464273,0.09707045,0.0002060749,0.00004445773,0.00006520445,0.00006168113,0.0002942446,0.004703148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003401274,"threshold_uncertainty_score":0.01137841,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Roderick Edwards","is_ca":true},{"name":"Aude Maignan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01384802963133833,"gpt":0.217348694863998,"spread":0.2035006652326597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127887,0.001810183,0.00183889,0.003269001,0.002626335,0.003761624,0.004308833,0.007291579,0.0594236],"category_scores_gemma":[0.05796748,0.0008202716,0.001479209,0.002396319,0.002903736,0.002921518,0.00158314,0.009011686,0.0258406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003442331,"about_ca_system_score_gemma":0.003532883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008607781,"about_ca_topic_score_gemma":0.01048149,"domain_scores_codex":[0.9972907,0.0004173322,0.0005412786,0.0005500509,0.0008976967,0.0003028754],"domain_scores_gemma":[0.9719756,0.007397721,0.001367877,0.002180165,0.01568766,0.001391071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000730808,0.00001046778,0.0001575462,0.0003037009,0.00003296722,0.0005745572,0.00006020028,0.0001567308,0.0001119211,0.005287686,0.9816024,0.01162885],"study_design_scores_gemma":[0.00007547966,0.00002651651,0.0008969012,0.0001750682,0.00004646271,0.001667951,0.00009294337,0.0009639903,0.0005173838,0.009091242,0.9863926,0.00005347499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"editorial","genre_gemma":"empirical","genre_scores_codex":[0.0003406119,0.0009960316,0.001885274,0.05327732,0.9383231,0.00002921886,0.0009284607,0.0004194317,0.003800393],"genre_scores_gemma":[0.04568244,0.007586704,0.009314805,0.08703251,0.6548421,0.0002496191,0.00202879,0.001058693,0.1922044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0594236,"threshold_uncertainty_score":0.1987917,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Simona Bonvicini","is_ca":false},{"name":"Margherita Maria Ferrari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007652141324352391,"gpt":0.2838431991067564,"spread":0.276191057782404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007311218,0.0004683693,0.000577339,0.00131954,0.0008141234,0.001203333,0.001011637,0.001399262,0.003470128],"category_scores_gemma":[0.002141475,0.0005703377,0.0008689877,0.0006450455,0.001667191,0.001428846,0.001326094,0.001175096,0.0003716789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009064354,"about_ca_system_score_gemma":0.0005060377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001166063,"about_ca_topic_score_gemma":0.001592973,"domain_scores_codex":[0.9996068,0.0001709678,0.00001199754,0.00005491928,0.0001093892,0.00004589072],"domain_scores_gemma":[0.9990922,0.0005518415,0.00007270052,0.0001228181,0.00006810305,0.000092313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003602212,0.00006585248,0.0002614394,0.00007005803,0.00002418713,0.0001195383,0.00008800664,0.6081434,0.006765712,0.3784888,0.0005513524,0.005385519],"study_design_scores_gemma":[0.000006813236,0.00001216373,0.00004347858,0.000004281424,0.000002039638,0.0000158046,0.00001337319,0.9388912,0.0003846434,0.06025022,0.0003712841,0.000004692034],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1223343,0.0004122827,0.8620449,0.0007656483,0.0000705465,0.00007986475,0.00009118232,0.0001328189,0.01406853],"genre_scores_gemma":[0.7696428,0.0003888638,0.2236141,0.0002610993,0.00007521574,0.0002557427,0.0001413685,0.0001558386,0.005464938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003470128,"threshold_uncertainty_score":0.01160872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}