{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004116195,0.0002371892,0.0002585881,0.00007321465,0.0001585633,0.00005612649,0.0003399627,0.0001997217,0.000004464383],"category_scores_gemma":[0.0001818214,0.0001951079,0.0001283602,0.0002687165,0.00004118183,0.000004738548,0.0002217588,0.000372828,0.00001073174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002744536,"about_ca_system_score_gemma":0.00002326925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008610288,"about_ca_topic_score_gemma":0.000005542599,"domain_scores_codex":[0.9982749,0.0001095784,0.0003791334,0.0005248373,0.0001555329,0.0005560833],"domain_scores_gemma":[0.9994802,0.00005385555,0.0001170491,0.000209092,0.00006439837,0.00007535938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00009925798,0.0001733926,0.03437433,0.00002586581,0.00003470771,0.00007333833,0.0002322474,0.001663635,0.6028205,0.0004869472,0.0008777467,0.359138],"study_design_scores_gemma":[0.003868526,0.001934174,0.7600059,0.0004131301,0.00003097729,0.0003281208,0.0004743697,0.07741291,0.1393738,0.001557942,0.01215923,0.002440958],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9956164,0.001176585,0.0008656583,0.0003350701,0.0003516886,0.0001398245,9.075222e-7,0.00006592453,0.001447942],"genre_scores_gemma":[0.9947191,0.00001005545,0.003267147,0.001275103,0.0005893886,2.641203e-7,0.00005482808,0.00001105346,0.00007308762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7256316,"threshold_uncertainty_score":0.7956269,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003385962,0.00008459874,0.00008100033,0.000105758,0.0001268208,0.0000614724,0.00041567,0.00004044839,0.00000132166],"category_scores_gemma":[0.00001925286,0.00008151382,0.00003307106,0.000602893,0.00001338723,0.0001265759,0.0001843232,0.0002369178,0.00001007888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006093468,"about_ca_system_score_gemma":0.0000169695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007503098,"about_ca_topic_score_gemma":0.00003852164,"domain_scores_codex":[0.9989604,0.00002000133,0.0002473539,0.0002884208,0.0001590086,0.0003248556],"domain_scores_gemma":[0.999518,0.00008779925,0.00006445902,0.000228683,0.00005271626,0.00004833699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000001464928,0.00005736034,0.05161092,0.000009021281,0.000004260704,0.00005810968,0.000413021,0.0005687957,0.0005514001,0.00605952,0.00003226847,0.9406338],"study_design_scores_gemma":[0.0001883694,0.00001724434,0.63301,0.00003214265,9.464673e-7,0.00005052044,0.00003598341,0.3649648,0.0002828083,0.0003886286,0.0008821118,0.0001464483],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4747457,0.0002139039,0.5243247,0.0001746119,0.0001539588,0.0001070589,1.470021e-7,0.0001431295,0.000136846],"genre_scores_gemma":[0.784244,0.000001254844,0.2155439,0.00008825678,0.0000889251,0.000001519223,0.000002433702,0.000003795452,0.00002593834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9404874,"threshold_uncertainty_score":0.3324037,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331422,0.0001326461,0.0001389406,0.00006360465,0.0003466552,0.0003100884,0.001062953,0.00005677827,0.00001335742],"category_scores_gemma":[0.00002964593,0.00009821973,0.00005904919,0.000502263,0.00004275293,0.0003747719,0.0007625445,0.0004501937,0.000211614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005127743,"about_ca_system_score_gemma":0.00004532891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002607843,"about_ca_topic_score_gemma":0.00001521518,"domain_scores_codex":[0.9985757,0.00008502728,0.0002905834,0.0003724446,0.0003084924,0.0003677068],"domain_scores_gemma":[0.9989909,0.0002383408,0.0001016839,0.00053914,0.00007679824,0.00005315507],"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.000004489995,0.0006828651,0.006375078,0.0001399358,0.00007928471,0.00004221001,0.004034369,0.007744664,0.1982909,0.241999,0.01218227,0.528425],"study_design_scores_gemma":[0.000173867,0.000007280941,0.02040342,0.00003810244,0.00000219203,0.00001188185,0.00001403829,0.9711572,0.002065012,0.005363146,0.0006096186,0.0001542795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8918076,0.0007718662,0.09610461,0.007780883,0.0004285957,0.0008709482,7.630784e-7,0.0006690183,0.001565685],"genre_scores_gemma":[0.931075,9.067853e-7,0.06837104,0.0003646369,0.00009258995,0.00001327532,0.000006097946,0.000007163023,0.00006923264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9634125,"threshold_uncertainty_score":0.4005284,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001505624,0.0001345437,0.0001292503,0.00003085851,0.0001197436,0.00001465891,0.000347233,0.0001031541,0.000001276386],"category_scores_gemma":[0.00002399205,0.000098822,0.0001842902,0.0001781411,0.00007170776,0.000002696002,0.0001444131,0.0001118013,0.000001130881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002514714,"about_ca_system_score_gemma":0.00009388517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002092067,"about_ca_topic_score_gemma":0.00003503794,"domain_scores_codex":[0.9990927,0.00006238619,0.0001839542,0.0002750513,0.0001800457,0.0002058435],"domain_scores_gemma":[0.9992926,0.000003681371,0.0001109206,0.0004542811,0.00008742514,0.00005115803],"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.000008855493,0.00002238311,0.0003390956,0.000005073521,0.00002296828,4.354956e-7,0.00001694199,0.4319473,0.5667897,0.0000258217,0.00001345109,0.0008080188],"study_design_scores_gemma":[0.0004656029,0.00005642188,0.000909121,0.00001833835,0.00003551032,0.000002676595,0.000017642,0.289986,0.7082282,0.00006515461,0.00007053204,0.0001447771],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9766222,0.0006761152,0.02234151,0.0001052765,0.0001080397,0.00009318796,0.000002484848,0.00001248415,0.00003871595],"genre_scores_gemma":[0.9959216,0.000002695661,0.003569984,0.0003231115,0.00009686167,7.528542e-7,0.00003631698,0.00001790927,0.00003080361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1419613,"threshold_uncertainty_score":0.4029844,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005474965,0.0001753042,0.0001478566,0.0001391422,0.0004601118,0.0004541008,0.0005900366,0.00004920827,0.000006302325],"category_scores_gemma":[0.0001148756,0.0001095959,0.00003998476,0.0008576484,0.00008010437,0.0004732143,0.0001282822,0.0004426294,0.00003879786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001213636,"about_ca_system_score_gemma":0.0001467339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000253528,"about_ca_topic_score_gemma":0.00003719081,"domain_scores_codex":[0.9979388,0.0003004077,0.0002548007,0.0003878053,0.0007690572,0.0003492023],"domain_scores_gemma":[0.9984102,0.0006452051,0.0001746352,0.000362897,0.0003661634,0.0000409416],"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.00001799049,0.00004036126,0.0001352781,0.000007302392,0.0000155295,0.000007973301,0.0003878592,0.5139434,0.00005546758,0.4725319,0.0003795679,0.01247737],"study_design_scores_gemma":[0.0002881877,0.00008181493,0.01444397,0.00002912197,0.000003667291,0.000008674025,0.0001958212,0.9827935,0.000107582,0.001728665,0.00017051,0.0001484735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05377399,0.0001496136,0.9416684,0.0007054547,0.0002374414,0.0003231378,0.000001806271,0.0001888914,0.0029513],"genre_scores_gemma":[0.8978916,0.000001273398,0.1016599,0.00008370234,0.0001837827,0.000004866998,0.00001027891,0.00001016842,0.00015447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8441176,"threshold_uncertainty_score":0.4469192,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007515574,0.000186439,0.0002083509,0.0001399757,0.0003859438,0.000331029,0.00301267,0.0000652189,5.468265e-7],"category_scores_gemma":[0.0002614157,0.0001779814,0.00005846312,0.0004811126,0.00002252852,0.000660605,0.00124265,0.0004050449,0.000002530037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009471989,"about_ca_system_score_gemma":0.00006000567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005524078,"about_ca_topic_score_gemma":7.802248e-7,"domain_scores_codex":[0.997806,0.00005549258,0.0002652548,0.0008174137,0.0004147518,0.0006411485],"domain_scores_gemma":[0.9981526,0.0002928838,0.00009496393,0.001226156,0.0001372801,0.00009613753],"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.00001405277,0.00003386739,0.00001527821,0.00004561365,0.000008041865,0.000007640487,0.00009770853,0.1041771,0.001378455,0.0005144924,0.0001970642,0.8935106],"study_design_scores_gemma":[0.0004922723,0.00006079377,0.0001854121,0.00003687952,0.00000220189,0.00002056227,0.000009965728,0.9976449,0.0005033428,0.0002147373,0.0006046546,0.0002242873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007146102,0.0002570697,0.9970004,0.0005236362,0.0003575126,0.0003306958,0.000002690768,0.000440903,0.0003724908],"genre_scores_gemma":[0.4716772,3.745385e-7,0.5277918,0.0002908771,0.0001772488,0.000001448468,0.0000266423,0.000007985213,0.00002641066],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8934678,"threshold_uncertainty_score":0.7257869,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001487522,0.0001174098,0.0001197273,0.00002303592,0.00008603636,0.000020801,0.0001052453,0.0001379397,1.756519e-7],"category_scores_gemma":[0.0001164181,0.0001017722,0.00007883996,0.00007717172,0.00005350284,0.000001977722,0.00007498825,0.0001787264,0.000001369131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001271104,"about_ca_system_score_gemma":0.0000060018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002370596,"about_ca_topic_score_gemma":0.00000240708,"domain_scores_codex":[0.9992576,0.00004233807,0.0001476768,0.0002745484,0.00008110742,0.0001967626],"domain_scores_gemma":[0.9996144,0.00002372937,0.00008119681,0.000181626,0.00006091364,0.00003813389],"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.00001921396,0.000009996452,0.0001419845,0.00000453272,0.0000126775,9.064137e-7,0.00000357411,0.00004611732,0.8964139,0.00003959228,0.0002349275,0.1030726],"study_design_scores_gemma":[0.0002938756,0.0001262302,0.0009248769,0.00004674602,0.00003732095,0.00008520461,0.00002934439,0.1643076,0.8280541,0.00008815497,0.005585646,0.0004208951],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9611748,0.000135699,0.03766585,0.00006727779,0.0001930279,0.00005069661,4.373829e-7,0.00009031858,0.0006218399],"genre_scores_gemma":[0.9922749,0.000007431487,0.006512255,0.0003020036,0.0007582283,4.964134e-7,0.00006351709,0.00001231795,0.00006878631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1642615,"threshold_uncertainty_score":0.4150148,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519807,0.000213449,0.0002662183,0.00006186077,0.00008882262,0.00004092622,0.0002033883,0.0002254525,0.000006585178],"category_scores_gemma":[0.00003394059,0.0002075425,0.0002550971,0.000322992,0.00003484183,0.000005919029,0.0002032512,0.0002705642,0.00000607005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005131099,"about_ca_system_score_gemma":0.00002987202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002057628,"about_ca_topic_score_gemma":0.000001609828,"domain_scores_codex":[0.998551,0.00009983595,0.0002724977,0.0005069789,0.0001998891,0.0003698593],"domain_scores_gemma":[0.9992291,0.00001566076,0.0001733424,0.0003950915,0.000112833,0.00007397822],"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.00003159438,0.00001470462,0.002147699,0.00001174853,0.0001322547,0.000002756625,0.000004773129,0.05092305,0.9445137,0.00001380245,0.00005107975,0.002152821],"study_design_scores_gemma":[0.0004149676,0.00003062461,0.001128656,0.00002311856,0.0001139555,0.00004011691,0.0000251795,0.6975095,0.3000604,0.00002162457,0.0003015734,0.0003302797],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9858694,0.002081069,0.01134,0.00001690527,0.0003400237,0.0001363248,6.613427e-7,0.00003472421,0.0001808999],"genre_scores_gemma":[0.9957741,0.00001027621,0.003397369,0.0001124956,0.0005041376,7.389824e-7,0.000115647,0.00002766808,0.000057512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6465864,"threshold_uncertainty_score":0.8463337,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001508483,0.00009098249,0.00009307455,0.00009972152,0.000152641,0.00006745262,0.0001643475,0.00005146634,0.00000269169],"category_scores_gemma":[0.00004658608,0.0000884549,0.0000214195,0.0001167781,0.000005045667,0.0001247436,0.000004603451,0.0002062176,0.00001049604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007788658,"about_ca_system_score_gemma":0.000006836774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000101107,"about_ca_topic_score_gemma":0.0003327418,"domain_scores_codex":[0.9993607,0.00001975749,0.0002202287,0.0001380913,0.0001274501,0.0001338203],"domain_scores_gemma":[0.999648,0.00001306164,0.00003976455,0.0001992673,0.00005309668,0.00004678556],"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.000005055678,0.00002262154,0.0006964427,0.00002425133,0.000004739655,8.301996e-7,0.0009811197,0.9835584,0.0006291936,0.005796895,0.0001366365,0.008143794],"study_design_scores_gemma":[0.0001251392,0.00001314609,0.08011138,0.00003642242,0.000002409826,3.679718e-7,0.000232567,0.9192083,0.00002794416,0.00008781137,0.00005110466,0.0001034358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9527108,0.00005280927,0.04358251,0.00004388576,0.0008147515,0.0002020493,0.000005551239,0.0001512138,0.002436418],"genre_scores_gemma":[0.9981505,0.000003222869,0.001619438,0.00001283387,0.0000456746,0.000004886186,0.00009364339,0.00001308095,0.00005668902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07941493,"threshold_uncertainty_score":0.3607086,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140159,0.000211589,0.0002601312,0.0000322841,0.0001676034,0.00002802765,0.0002131977,0.0001988527,0.000005561557],"category_scores_gemma":[0.0004897426,0.0001620239,0.0001158128,0.0001286778,0.0000779106,0.000004471365,0.0001273794,0.0002432617,4.761287e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001235671,"about_ca_system_score_gemma":0.00006134687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004238809,"about_ca_topic_score_gemma":0.000003052016,"domain_scores_codex":[0.99874,0.00008369247,0.0002750558,0.0004085916,0.0001157294,0.000376917],"domain_scores_gemma":[0.9992371,0.0001215516,0.000224122,0.0001706388,0.0001858402,0.00006078511],"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.00004352861,0.00001892413,0.01400264,0.0000754588,0.00006516843,0.000002323013,0.00004880478,0.0001711204,0.9088913,0.0001074818,0.0001594087,0.07641391],"study_design_scores_gemma":[0.001739332,0.0005788153,0.01154038,0.0001065819,0.00003784455,0.000110717,0.0001851331,0.01178678,0.9674971,0.000769947,0.005005613,0.0006417966],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9946666,0.00110219,0.002662352,0.00002132785,0.000506231,0.0002422105,0.00002368159,0.00003262908,0.0007428033],"genre_scores_gemma":[0.9617271,0.000002172166,0.03764578,0.0002434583,0.0002009088,0.000001301056,0.00009116125,0.00001870588,0.000069439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07577211,"threshold_uncertainty_score":0.6607142,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001755238,0.0000729769,0.00007421461,0.0000108483,0.00005934194,0.000009023252,0.0001134964,0.00005504192,0.000002451101],"category_scores_gemma":[0.0002799262,0.00003184756,0.00003798804,0.00003527372,0.00005264195,0.000001174377,0.0001459794,0.00006564985,0.000001403087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003323166,"about_ca_system_score_gemma":0.000005409851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003966569,"about_ca_topic_score_gemma":8.951872e-7,"domain_scores_codex":[0.9995154,0.00004160812,0.00009584621,0.0001566559,0.00006632417,0.0001242391],"domain_scores_gemma":[0.9996122,0.0001738922,0.00006185233,0.0001017358,0.00003184145,0.00001848308],"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.00002190863,0.000007390197,0.003572137,0.0000045069,0.00001311946,8.447974e-7,0.000008427409,0.000002337219,0.9479377,0.003156447,0.0002262749,0.0450489],"study_design_scores_gemma":[0.0006567743,0.0006217783,0.07134007,0.0001657664,0.00001006146,0.00001897738,0.000179016,0.0004395293,0.9239113,0.0003713549,0.002003286,0.0002820232],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9978238,0.0004258034,0.0002473776,0.0003298029,0.00005082123,0.00004888447,0.000001651906,0.000009670336,0.001062192],"genre_scores_gemma":[0.9992715,0.000009577971,0.0001798364,0.0003030168,0.0001198135,2.395367e-7,0.00000189215,0.00000390004,0.0001102117],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06776793,"threshold_uncertainty_score":0.1298706,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002222462,0.000149775,0.0002093826,0.0001534441,0.00008321195,0.00006749948,0.0005497567,0.00009787076,0.00001528446],"category_scores_gemma":[0.00003325817,0.0001452569,0.0000533399,0.0007597409,0.00006177132,0.0003476622,0.0001363305,0.0002948777,0.00001366256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009149048,"about_ca_system_score_gemma":0.0001846052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002656295,"about_ca_topic_score_gemma":0.00002740566,"domain_scores_codex":[0.9986508,0.00007185701,0.000377531,0.0003415965,0.0003119915,0.0002462594],"domain_scores_gemma":[0.9991522,0.0000465557,0.0001401541,0.0004111854,0.0001499091,0.00009999209],"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.00009553834,0.002061879,0.0003577098,0.000571303,0.0001520401,0.0001447946,0.03577604,0.04352621,0.3021787,0.1766027,0.001681509,0.4368517],"study_design_scores_gemma":[0.001565137,0.00007492313,0.0003548705,0.00003530838,0.00000690793,0.00004167232,0.0001557935,0.980262,0.01411778,0.00294786,0.0002788592,0.0001589044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4765421,0.0001782884,0.5223562,0.0002233183,0.0001483504,0.0002006054,0.00001221865,0.0001434302,0.0001954403],"genre_scores_gemma":[0.9561866,2.988632e-7,0.04356253,0.00006627025,0.00006378836,0.000004155509,0.00009193204,0.00000935678,0.00001507267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9367357,"threshold_uncertainty_score":0.5923405,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522002,0.0001257245,0.0001472743,0.00002717775,0.000129749,0.00001600827,0.0001740413,0.0001200969,3.73269e-7],"category_scores_gemma":[0.00005358838,0.00007998171,0.00007972832,0.0001039311,0.0001696373,0.000003194321,0.0002316056,0.0001951859,6.357686e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002875372,"about_ca_system_score_gemma":0.00002579928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003490769,"about_ca_topic_score_gemma":0.0000535461,"domain_scores_codex":[0.9992583,0.00004522414,0.0001863866,0.0002497046,0.0001115944,0.0001487303],"domain_scores_gemma":[0.9994399,0.00001533491,0.0001431963,0.0002612979,0.0001054258,0.00003485386],"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.00001273595,0.000008541252,0.01158988,0.000009448666,0.0000196981,4.355596e-7,0.000009413664,0.000002617689,0.9800075,0.0001447363,0.0001174359,0.008077565],"study_design_scores_gemma":[0.0001589953,0.00003975387,0.005285,0.00002240793,0.00001669285,0.00005609046,0.00001622918,0.0010972,0.9891123,0.000316191,0.003715393,0.0001637429],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.998497,0.000242586,0.0006745082,0.0001080568,0.0001206807,0.00006133113,0.000003616273,0.0000238696,0.0002683607],"genre_scores_gemma":[0.9896604,0.00001011982,0.009736739,0.000264037,0.0001635747,6.876617e-7,0.00001409691,0.00001156678,0.0001387715],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009104813,"threshold_uncertainty_score":0.326156,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004374431,0.0001337567,0.0001498152,0.000175794,0.0001447298,0.0001952433,0.0006472486,0.0001097259,0.000006180771],"category_scores_gemma":[0.00003196811,0.0001209965,0.0000765533,0.0007769982,0.00004015887,0.000462931,0.0002175878,0.001015855,0.00002288283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001313962,"about_ca_system_score_gemma":0.00002198033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002823412,"about_ca_topic_score_gemma":0.00004415538,"domain_scores_codex":[0.9988346,0.00004814106,0.0003009549,0.0002314495,0.0002206243,0.0003642146],"domain_scores_gemma":[0.9993004,0.0001236857,0.0001117674,0.0003084276,0.00008009854,0.00007564689],"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.00001203553,0.00007684633,0.0149938,0.00003149846,0.00001308341,0.00003344736,0.002673355,0.001385083,0.001672179,0.8736911,0.000875881,0.1045417],"study_design_scores_gemma":[0.0002471944,0.00001107836,0.0133291,0.00001568014,6.75538e-7,0.00002547807,0.00004258991,0.9836826,0.0002113949,0.001664696,0.0005970882,0.0001723681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9002854,0.00004750077,0.09579232,0.0003259205,0.002051325,0.00009727248,2.639031e-7,0.000258266,0.001141764],"genre_scores_gemma":[0.9928418,0.000002351094,0.006389806,0.0006098715,0.0001434779,9.098726e-7,0.000002866364,0.000005086154,0.000003778728],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9822976,"threshold_uncertainty_score":0.4934095,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001604784,0.0001410493,0.0001816095,0.00008359645,0.00008950191,0.00006079504,0.0001034255,0.00005311769,9.87967e-7],"category_scores_gemma":[0.00001842315,0.0001268305,0.00003054742,0.000190387,0.00001204138,0.0001248929,0.00007385927,0.0003591606,0.000004556626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000047667,"about_ca_system_score_gemma":0.000005302005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001243055,"about_ca_topic_score_gemma":0.00002564288,"domain_scores_codex":[0.9991778,0.00001772642,0.0001899052,0.0001896631,0.0001170706,0.000307888],"domain_scores_gemma":[0.9997,0.00007009257,0.00002671069,0.0001130304,0.00003667206,0.00005345477],"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.00002289147,0.0003476286,0.1242943,0.001587852,0.0003216557,0.0003507469,0.03860824,0.2060217,0.0341271,0.02332109,0.00007085338,0.570926],"study_design_scores_gemma":[0.00007646771,0.00001863999,0.00932368,0.0001598261,0.000006959938,0.00001805193,0.0001593919,0.9893338,0.0005934537,0.000116828,0.00002002972,0.0001728669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9853805,0.003090482,0.01019937,0.000002515253,0.0004808538,0.0001695226,1.507462e-7,0.0003624528,0.0003141291],"genre_scores_gemma":[0.9898011,0.000008567959,0.01004465,0.000003944712,0.0001144291,0.000002864015,6.729775e-7,0.00002195587,0.000001808387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7833121,"threshold_uncertainty_score":0.5171996,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494698,0.0001795688,0.0002088571,0.0001935197,0.0002704251,0.0009886777,0.0006226882,0.00007124643,0.00000362768],"category_scores_gemma":[0.0002215961,0.0001616893,0.00007215538,0.0005529791,0.00003455349,0.001078791,0.0004712594,0.0002676467,0.00006459637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002143769,"about_ca_system_score_gemma":0.0000189631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001206428,"about_ca_topic_score_gemma":0.000002536731,"domain_scores_codex":[0.998629,0.00008381453,0.0002446006,0.0003334029,0.0003425943,0.0003665998],"domain_scores_gemma":[0.9989204,0.0002431549,0.0001321365,0.0003675917,0.0001589654,0.000177763],"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.00007272199,0.0001249398,0.006501818,0.0001401962,0.0001462495,0.00001488369,0.01124218,0.001797651,0.01099868,0.2092349,0.01701491,0.7427108],"study_design_scores_gemma":[0.0005730747,0.0002061502,0.03741562,0.00009158585,0.000007450442,0.00003966931,0.00004677524,0.9343167,0.0005337658,0.0007884027,0.02547247,0.0005083692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5570526,0.00009828838,0.4298895,0.009385298,0.0005110557,0.0003136414,0.000002018769,0.0005430598,0.002204566],"genre_scores_gemma":[0.8525757,0.000001670171,0.1441652,0.003029847,0.00009316739,0.000001261128,0.000003735067,0.00000762012,0.0001218031],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.932519,"threshold_uncertainty_score":0.9533842,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043309,0.0001689027,0.0002595127,0.0003772277,0.0003853002,0.0001178573,0.001499715,0.00006725215,0.00008617096],"category_scores_gemma":[0.0003303118,0.0001651311,0.00009622541,0.001943761,0.00002053905,0.0002012709,0.001480426,0.0009249722,0.00001865288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001689025,"about_ca_system_score_gemma":0.00008770947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003408206,"about_ca_topic_score_gemma":0.000001435847,"domain_scores_codex":[0.9971532,0.0002598989,0.000428746,0.0005823982,0.001204163,0.0003715946],"domain_scores_gemma":[0.9985086,0.0002152446,0.0002030147,0.0005400474,0.0004190617,0.000113996],"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.00001541999,0.00009465512,0.000006709423,0.00002011479,0.00003420369,0.00002129476,0.002396198,0.00745664,0.01800281,0.02588544,0.001705389,0.9443612],"study_design_scores_gemma":[0.0001501105,0.0001486678,0.0001852445,0.00001815776,0.00000291472,0.00001831936,0.00007879185,0.9525284,0.04463885,0.001431217,0.0006238474,0.0001755367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004593292,0.0002040394,0.9918208,0.001336772,0.001207779,0.0003633178,0.0000105811,0.0001524271,0.000311001],"genre_scores_gemma":[0.4991024,0.000001084579,0.4997677,0.0007830818,0.00003776187,0.000009988702,0.00000636996,0.000008710171,0.0002828561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9450717,"threshold_uncertainty_score":0.6733851,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003742535,0.0001485224,0.000218966,0.00002651458,0.000106213,0.00001819354,0.0001515932,0.0001296954,3.881792e-7],"category_scores_gemma":[0.000254985,0.0001043618,0.00008238228,0.0001439995,0.00007033058,0.000003027258,0.00005628055,0.0001086697,2.77648e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001297261,"about_ca_system_score_gemma":0.00006265016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002226491,"about_ca_topic_score_gemma":0.00002032976,"domain_scores_codex":[0.9989032,0.00006673268,0.000308341,0.0003527879,0.0001154823,0.000253525],"domain_scores_gemma":[0.9991604,0.00008154751,0.0002527376,0.0002048146,0.0002566719,0.0000438365],"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.002353352,0.0002843934,0.1064124,0.0004154324,0.0005944998,0.00003133687,0.0001119024,0.007825417,0.8612363,0.01133936,0.001840732,0.007554891],"study_design_scores_gemma":[0.01986187,0.009215884,0.1513583,0.001126476,0.0003812408,0.000477402,0.002298593,0.07692539,0.6444317,0.0006304203,0.08945987,0.003832855],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9867705,0.0006651335,0.0100978,0.00002187887,0.0002628884,0.0002834822,0.00001331304,0.0000312068,0.001853781],"genre_scores_gemma":[0.9967892,0.000003267117,0.002847206,0.00002460339,0.0001253822,0.000001159081,0.0001046074,0.000009779896,0.00009485307],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2168046,"threshold_uncertainty_score":0.4255751,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048677,0.0001321108,0.0001345072,0.00002755006,0.000189208,0.00001360288,0.0003027125,0.00009993671,0.000004848451],"category_scores_gemma":[0.0003428495,0.00008321281,0.0001172797,0.000154638,0.0001044036,0.000001447954,0.0002636572,0.0002588976,0.000003658878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001514579,"about_ca_system_score_gemma":0.00001580623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001431425,"about_ca_topic_score_gemma":0.000005772568,"domain_scores_codex":[0.9989517,0.00008996957,0.0002526055,0.0002589255,0.0001501374,0.0002966341],"domain_scores_gemma":[0.9991624,0.0003279197,0.0001601127,0.0002085236,0.0001006488,0.00004042723],"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.0003372187,0.0001345538,0.01753245,0.00004223932,0.000127739,0.00001801727,0.0002371454,0.001515113,0.8768215,0.02045724,0.002087233,0.08068958],"study_design_scores_gemma":[0.001780619,0.001574787,0.2303811,0.000310726,0.00004599281,0.00006954946,0.001493968,0.02368059,0.7264997,0.001619815,0.01132187,0.001221271],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9882561,0.0001693546,0.006121876,0.00012049,0.0002510931,0.00009913009,0.000001162928,0.00002405948,0.004956756],"genre_scores_gemma":[0.9978536,0.000001525858,0.001156018,0.0006042085,0.0002882979,5.041514e-8,0.00001358364,0.000007444567,0.00007522534],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2128487,"threshold_uncertainty_score":0.339332,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153563,0.0001839787,0.0002925474,0.0002766274,0.001007568,0.00004050126,0.0001376517,0.0002534003,0.000009447703],"category_scores_gemma":[0.0001803443,0.0001723109,0.00003419599,0.0006274473,0.00001145199,0.0001814756,0.00006959013,0.001075214,0.0000158808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002196095,"about_ca_system_score_gemma":0.001371081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001241842,"about_ca_topic_score_gemma":0.0006048218,"domain_scores_codex":[0.997332,0.0007552005,0.0006680371,0.0003522989,0.0003430424,0.0005494098],"domain_scores_gemma":[0.9986379,0.0003009004,0.0001614245,0.0002285867,0.0004842439,0.000187011],"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.0001744045,0.00008475089,0.04969466,0.0007469644,0.00001443714,0.00001229042,0.02490912,0.9010035,0.00001905605,0.02270696,0.00009081819,0.0005430268],"study_design_scores_gemma":[0.00144586,0.00005396362,0.0003895567,0.0006954261,0.000004122257,7.424995e-7,0.009604773,0.9871824,0.000003449511,0.0003540433,0.00009805999,0.0001675709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8402538,0.0003281665,0.1357691,0.01682259,0.002475414,0.001491158,0.000008035473,0.0008354776,0.002016254],"genre_scores_gemma":[0.9604763,0.000003043027,0.03601186,0.003077538,0.0002308637,0.00001072925,0.0001111773,0.00003238919,0.00004607241],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1202226,"threshold_uncertainty_score":0.7749497,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817415,0.0001086483,0.00012392,0.00001484687,0.0001002744,0.00005215528,0.00004962161,0.0001217008,1.163512e-7],"category_scores_gemma":[0.00005093978,0.00008698959,0.00005514094,0.00004017169,0.00005235104,0.000004623234,0.0000516768,0.0001027057,1.397492e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002065989,"about_ca_system_score_gemma":0.000005943255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003883192,"about_ca_topic_score_gemma":0.000003627106,"domain_scores_codex":[0.9992922,0.00002543982,0.0001655309,0.0002797657,0.00006330105,0.0001737958],"domain_scores_gemma":[0.9996186,0.0000274,0.00007541366,0.00013352,0.0001031903,0.00004183091],"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.00004279915,0.00001721284,0.0004527159,0.00002760177,0.00003425603,1.194259e-7,0.000007168038,0.00005244106,0.9756363,0.0000279905,0.0005372816,0.0231641],"study_design_scores_gemma":[0.001648219,0.0006190409,0.005595539,0.000161635,0.0001339643,0.00008766286,0.0003522367,0.4766267,0.5032777,0.0002935881,0.01018153,0.001022181],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9816608,0.0006302332,0.01712052,0.00007691015,0.0001242314,0.0002987699,0.000002039858,0.00003597466,0.00005046555],"genre_scores_gemma":[0.9961459,0.00002098532,0.003265426,0.00005250023,0.0003181601,0.000007245445,0.0001041133,0.000008299003,0.0000773801],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4765743,"threshold_uncertainty_score":0.3547333,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001784861,0.0001493837,0.0001452232,0.0000330514,0.0001459711,0.00004924463,0.00009549685,0.0001273346,8.482689e-7],"category_scores_gemma":[0.00009467074,0.00009821532,0.00003118783,0.000122589,0.00004523396,0.000008728386,0.0001183401,0.0001420099,0.000001177822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001176378,"about_ca_system_score_gemma":0.00001009438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001743323,"about_ca_topic_score_gemma":8.824793e-7,"domain_scores_codex":[0.9990717,0.00008891743,0.0001584098,0.000247732,0.0001140606,0.0003191739],"domain_scores_gemma":[0.9995866,0.00003704442,0.0000928295,0.0001375771,0.00007533669,0.00007054477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001687586,0.00006997282,0.02611072,0.00007639475,0.00009218108,0.000008599021,0.0001289163,0.0003422429,0.9425297,0.0007832107,0.0005293397,0.02915994],"study_design_scores_gemma":[0.004113514,0.001717224,0.6080287,0.0004506632,0.0001686815,0.0008896013,0.002618969,0.07166837,0.2915925,0.0000955621,0.01627252,0.002383774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898716,0.00714251,0.002227105,0.00005303938,0.0001151616,0.0001453805,0.00000125969,0.00004965674,0.0003943013],"genre_scores_gemma":[0.9968473,0.00002051602,0.002254499,0.00009554218,0.0005379139,0.000001799781,0.00006552638,0.00001204823,0.0001648688],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6509373,"threshold_uncertainty_score":0.4005105,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002275977,0.0001508768,0.0001497242,0.00003718391,0.0001461828,0.00004311449,0.000163063,0.0001267596,4.016282e-7],"category_scores_gemma":[0.00008118487,0.0001255644,0.000107701,0.0001015024,0.00002942413,0.000002803548,0.000128201,0.0001400355,0.000004874154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001910291,"about_ca_system_score_gemma":0.00001447679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006843823,"about_ca_topic_score_gemma":0.00001223865,"domain_scores_codex":[0.9990454,0.0000713483,0.0001742351,0.0003378379,0.0001210006,0.0002501947],"domain_scores_gemma":[0.9994923,0.00002224839,0.0001003096,0.0002412689,0.00009700278,0.00004689517],"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.00002288192,0.00003075604,0.001211735,0.00001084326,0.00005190772,0.000001798487,0.0000170144,0.000008826755,0.9688184,0.0001113132,0.0007083911,0.02900609],"study_design_scores_gemma":[0.0003543752,0.0001986714,0.002758255,0.000022653,0.00002963032,0.00002649493,0.00001688097,0.01453406,0.9641625,0.0001427986,0.01741204,0.000341623],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9919797,0.0001147148,0.006731167,0.0001507205,0.0001582429,0.00007245404,8.722482e-7,0.0001645559,0.0006275561],"genre_scores_gemma":[0.9746261,0.000008367719,0.02393259,0.0008115777,0.0004353414,8.021304e-7,0.00004485168,0.00001540916,0.0001249678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02866446,"threshold_uncertainty_score":0.5120369,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002294729,0.0001306602,0.0003051586,0.00006872659,0.00006115114,0.00009978653,0.000480749,0.00005407205,2.994399e-7],"category_scores_gemma":[0.000007920577,0.00008971793,0.00003716646,0.0002632291,0.00007499877,0.0001811795,0.0002911757,0.0001505118,0.000003153691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002105579,"about_ca_system_score_gemma":0.00004056859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001660454,"about_ca_topic_score_gemma":0.000002022837,"domain_scores_codex":[0.9987971,0.00006436191,0.0003284302,0.000305631,0.0003107618,0.000193724],"domain_scores_gemma":[0.9990845,0.00006440657,0.0002416271,0.0004721086,0.00009220676,0.00004516513],"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.00004624089,0.0001456475,0.01045349,0.002973713,0.0001830105,0.00001243371,0.002438216,0.01254095,0.7868478,0.1784243,0.00007981692,0.005854415],"study_design_scores_gemma":[0.000296649,0.00006800188,0.001395009,0.0003421622,0.000008400654,0.00003506665,0.0001071415,0.99391,0.003584449,0.0000110574,0.0001124429,0.0001296625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9402823,0.001869066,0.05681398,0.00006510979,0.0002117922,0.0004155865,0.000003011876,0.0001174064,0.0002217726],"genre_scores_gemma":[0.9973512,0.000002077783,0.002502215,0.000005809355,0.00002326397,0.000003329488,0.000004076593,0.000009454657,0.00009853476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.981369,"threshold_uncertainty_score":0.3658591,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002911118,0.0001310044,0.0001698421,0.00005324488,0.0001016701,0.00003166146,0.0001019279,0.00005416828,0.000001118562],"category_scores_gemma":[0.00007606783,0.00009868247,0.00005228147,0.0001976126,0.00003462443,0.0001613433,0.00009213218,0.0002504851,0.000004549252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009456969,"about_ca_system_score_gemma":0.00002322845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008977677,"about_ca_topic_score_gemma":0.00001111095,"domain_scores_codex":[0.9990944,0.00002975027,0.0002732869,0.0001224269,0.0002739743,0.0002061095],"domain_scores_gemma":[0.9994102,0.0001137683,0.00008459653,0.000114868,0.0002387764,0.00003778315],"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.000006187826,0.000005054258,0.002459443,0.00007492939,0.00004676642,0.000001402823,0.003737444,0.9826264,0.007925818,0.0008670157,0.0003995877,0.001849941],"study_design_scores_gemma":[0.0002720378,0.000006952748,0.001145248,0.00008467172,0.0000175583,0.000001061263,0.0001679885,0.9905376,0.007163621,0.0004687613,0.0000155859,0.00011892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9851234,0.0018085,0.01095907,0.0001149844,0.0003533078,0.0001289355,0.000002646216,0.0003156845,0.001193448],"genre_scores_gemma":[0.9974772,0.000005098292,0.002273358,0.00004617052,0.000147302,0.0000028133,0.000002588316,0.00002385108,0.00002157966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01235381,"threshold_uncertainty_score":0.4024155,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000314014,0.0001636847,0.0001503767,0.00002848416,0.0002391635,0.00004962871,0.000147194,0.0001326921,0.000001252283],"category_scores_gemma":[0.0004689346,0.0001346384,0.00007061999,0.00009425746,0.00004755229,0.000003655413,0.0001297857,0.000143376,0.000001686408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001234349,"about_ca_system_score_gemma":0.00002592682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003337791,"about_ca_topic_score_gemma":0.000002209815,"domain_scores_codex":[0.9989156,0.00003839635,0.0002097455,0.0004032263,0.00008277757,0.0003502325],"domain_scores_gemma":[0.9994386,0.0001616191,0.00009160149,0.0001178301,0.0001211443,0.00006914343],"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.0000154777,0.00002490139,0.002014223,0.00002737458,0.00001552822,0.000001335137,0.0000148632,0.0003630889,0.5437804,0.00007525978,0.0002365504,0.453431],"study_design_scores_gemma":[0.001494116,0.0006243224,0.01001975,0.00008215888,0.00002290372,0.00004812007,0.00004043754,0.8332238,0.1355203,0.0001497756,0.01815055,0.0006238259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9816096,0.001133822,0.01624393,0.0002299094,0.0002407598,0.0001954632,0.000004809255,0.00005785996,0.0002838951],"genre_scores_gemma":[0.9734858,0.000001779006,0.02435109,0.0008663938,0.001186127,0.000002370236,0.00005062811,0.00001429673,0.00004153409],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8328606,"threshold_uncertainty_score":0.5490397,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003354322,0.0003276026,0.000303296,0.0001309209,0.0002772684,0.0001212071,0.0003278546,0.0002900968,0.0000376768],"category_scores_gemma":[0.00008611688,0.0003273736,0.0002572787,0.0003929182,0.00003068701,0.000006745552,0.00009865188,0.0003103155,0.00003313676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007561317,"about_ca_system_score_gemma":0.00006333669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005478482,"about_ca_topic_score_gemma":0.00002814142,"domain_scores_codex":[0.9977695,0.000260452,0.0003523834,0.0008116395,0.0003055776,0.0005004726],"domain_scores_gemma":[0.9989382,0.00004745385,0.0001297323,0.0005194086,0.0001747325,0.0001904481],"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.0002336451,0.00004030347,0.001397474,0.000002892567,0.00006793743,0.00001337112,0.0001423466,0.003604654,0.9788992,5.667621e-7,0.0005499207,0.0150477],"study_design_scores_gemma":[0.0005279658,0.0004895973,0.09200879,0.00005175497,0.0001320358,0.00004044865,0.00006956277,0.00499978,0.8998195,0.00006967653,0.001185871,0.0006050319],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9948427,0.002624838,0.001724502,0.0002195236,0.0002491628,0.0002398262,0.00001272484,0.00005382705,0.00003288095],"genre_scores_gemma":[0.9971047,0.000009096691,0.00074114,0.0009670103,0.0006812396,0.000004113138,0.00004516547,0.00003404005,0.0004134728],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09061132,"threshold_uncertainty_score":0.9999178,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002043275,0.0001189292,0.0001847899,0.00004644238,0.000113248,0.00002691683,0.0001378641,0.0001191454,9.97942e-7],"category_scores_gemma":[0.0001625887,0.00009708813,0.00004384269,0.0001386305,0.0001585765,0.000003144871,0.000319312,0.0001773614,5.998384e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001055814,"about_ca_system_score_gemma":0.00004199333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003419771,"about_ca_topic_score_gemma":0.000002391399,"domain_scores_codex":[0.9991356,0.00008646806,0.0002454381,0.0002797301,0.00009445861,0.0001583449],"domain_scores_gemma":[0.9994481,0.0001083126,0.0001125487,0.00009440584,0.0002069798,0.00002961528],"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.0004364143,0.0004246796,0.2417518,0.000811698,0.00090135,0.00001448376,0.0005464057,0.02728263,0.3727562,0.0761744,0.001409057,0.2774909],"study_design_scores_gemma":[0.002557402,0.000723726,0.4265232,0.0005848329,0.00006667987,0.0000470347,0.0007919646,0.5303654,0.02555134,0.008646535,0.003161877,0.0009800062],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9725614,0.001426158,0.02470979,0.00006188647,0.0003182237,0.0001266835,0.000005673724,0.00001661486,0.0007735608],"genre_scores_gemma":[0.9926212,0.000005538058,0.007007459,0.0001359798,0.0001152705,7.950125e-7,0.00003982741,0.000003561865,0.000070393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5030828,"threshold_uncertainty_score":0.3959139,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001013421,0.00008494516,0.0001081026,0.00005204632,0.000136745,0.0001745162,0.0005074826,0.00005272384,0.00001427049],"category_scores_gemma":[0.00002942001,0.00007234881,0.00002686681,0.0003407545,0.00001955165,0.0004292676,0.000133248,0.0001366693,0.00002749638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002073484,"about_ca_system_score_gemma":0.00002468378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005155662,"about_ca_topic_score_gemma":0.000007389838,"domain_scores_codex":[0.9991825,0.0000343686,0.0002087841,0.0002756377,0.0001659997,0.0001327112],"domain_scores_gemma":[0.9991868,0.0001110195,0.0001449222,0.0003645519,0.0001582926,0.00003447237],"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":[7.111599e-7,0.00005092161,0.0003291113,0.000004883851,0.00002316394,2.488531e-7,0.0003977037,0.000122769,0.2549442,0.07083569,0.01243267,0.6608579],"study_design_scores_gemma":[0.0001011808,0.00001091939,0.03959621,0.00001416594,0.000003691079,0.000001511291,0.00002032874,0.9497842,0.007995626,0.001799382,0.0005816422,0.00009116162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3027301,0.0003791715,0.6943437,0.0008136738,0.0004738877,0.0001906998,0.00001094978,0.0001779485,0.0008799085],"genre_scores_gemma":[0.6214295,0.000001824499,0.3781925,0.00007131349,0.0001486965,0.000004183821,0.00008303341,0.000003080097,0.00006581853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9496614,"threshold_uncertainty_score":0.2950299,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000215236,0.0001534812,0.0001903841,0.0000355524,0.0003270568,0.00005545913,0.0002747654,0.000113397,6.27704e-7],"category_scores_gemma":[0.00008131531,0.0001146834,0.00008066514,0.00004427674,0.0001317409,0.000007946262,0.0001254993,0.0001441786,3.460714e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001041204,"about_ca_system_score_gemma":0.00002912062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005073377,"about_ca_topic_score_gemma":0.000006073784,"domain_scores_codex":[0.9991457,0.00003543626,0.0001753009,0.0002890674,0.0001376572,0.0002168336],"domain_scores_gemma":[0.999126,0.00001301713,0.0002633346,0.0004203748,0.0001350178,0.00004222793],"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.00008648862,0.00001295919,0.001551627,0.00001575677,0.00005586787,0.000008521951,0.00002146157,0.0001208257,0.9812751,0.00001222258,0.00002020786,0.0168189],"study_design_scores_gemma":[0.0003246895,0.0001870461,0.00220177,0.0001046414,0.00002818127,0.00001883637,0.00002608456,0.003855582,0.9930137,0.00003030524,0.00002227738,0.0001868609],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9382077,0.0003033151,0.06112331,0.00002335613,0.00005967022,0.00009787618,0.000002841799,0.0000343537,0.0001475262],"genre_scores_gemma":[0.9726094,0.00001954626,0.02713199,0.00004287413,0.0001303782,4.929348e-7,0.00001484436,0.0000166767,0.00003378678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03440167,"threshold_uncertainty_score":0.4676652,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001117497,0.0001802726,0.0001884664,0.0001722193,0.0003946208,0.0001847687,0.0002513831,0.00008289112,0.00004125069],"category_scores_gemma":[0.0003578759,0.0001680033,0.00008293183,0.0006682295,0.00002917297,0.0002089358,0.0002863741,0.0003996691,0.0001102745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001540598,"about_ca_system_score_gemma":0.0000352367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006579957,"about_ca_topic_score_gemma":0.00002006624,"domain_scores_codex":[0.9986809,0.00004249506,0.0002693004,0.0004468282,0.0002450423,0.0003154429],"domain_scores_gemma":[0.9991446,0.0004477169,0.00008393529,0.0001882796,0.00006936034,0.00006611565],"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.0008154463,0.0001369992,0.02665696,0.00005473688,0.00005299533,0.00007160481,0.0003554417,0.00369793,0.7325945,0.02943233,0.005195346,0.2009357],"study_design_scores_gemma":[0.0006592349,0.000215855,0.05662875,0.0001179902,0.0000358414,0.00001420143,0.00006382844,0.9229434,0.01671628,0.0009626641,0.001212789,0.0004291695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895188,0.00003519762,0.002101595,0.00105629,0.00222565,0.000222961,0.00001860371,0.0002818155,0.004539127],"genre_scores_gemma":[0.9940428,9.469288e-7,0.0004300405,0.003968465,0.000169792,0.00000219115,0.00003262846,0.00001306034,0.001340069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9192455,"threshold_uncertainty_score":0.6850975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004060807,0.0001200866,0.0001379401,0.00003997643,0.0002008744,0.0001981326,0.0004974472,0.00005666097,0.00000106278],"category_scores_gemma":[0.0001273376,0.0000849985,0.00002964331,0.0001938911,0.00005205367,0.0005755968,0.001077032,0.0002328026,0.00001333166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004122854,"about_ca_system_score_gemma":0.00005473102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000444283,"about_ca_topic_score_gemma":0.000002489553,"domain_scores_codex":[0.9988759,0.00007647663,0.0001600622,0.0003678093,0.0003021171,0.0002175968],"domain_scores_gemma":[0.9992393,0.00005940123,0.0000611226,0.0003467572,0.0001518933,0.0001415023],"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.00008250624,0.0001372849,0.03511255,0.0001180065,0.00003936143,0.0000763161,0.005287144,0.0005304534,0.002854027,0.01031406,0.02465542,0.9207929],"study_design_scores_gemma":[0.0004874122,0.00007302874,0.007981049,0.00006359043,0.000003282171,0.00005645195,0.0001063717,0.9846503,0.001019695,0.00144558,0.003888374,0.0002248413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9326764,0.00183432,0.06270368,0.0008725342,0.001087305,0.0001529829,8.490688e-7,0.0002759136,0.0003960223],"genre_scores_gemma":[0.9179614,0.000002746962,0.08160036,0.0002316487,0.0001510391,6.121592e-7,0.000001785996,0.000003957327,0.00004645743],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9841199,"threshold_uncertainty_score":0.3466138,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001183127,0.0001239156,0.000105547,0.00001187218,0.0001895578,0.00005477496,0.00007554427,0.00007658216,0.000007763156],"category_scores_gemma":[0.00001856432,0.0001091245,0.00004811641,0.00005116748,0.0000320688,0.000007648758,0.000328831,0.00011604,0.000001085858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001251931,"about_ca_system_score_gemma":0.00002078873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003793309,"about_ca_topic_score_gemma":0.000003403262,"domain_scores_codex":[0.9991241,0.00003718887,0.0001696922,0.0003081441,0.000081754,0.0002790882],"domain_scores_gemma":[0.9997446,0.00001294929,0.00006110605,0.00008132815,0.00004611432,0.00005390157],"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.00001996028,0.00001588178,0.0009763297,0.000005464038,0.0000160108,0.000002848619,0.00004498054,0.0001518085,0.9805374,0.0001247507,0.0006906429,0.01741395],"study_design_scores_gemma":[0.0007844572,0.000121831,0.0006420765,0.00001111764,0.000007721266,0.00004358647,0.0004800945,0.04051649,0.9548817,0.00005010923,0.002209815,0.0002509553],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9949173,0.002731575,0.001680016,0.00008891209,0.0001387617,0.00006895981,0.000006217,0.00002165895,0.0003465723],"genre_scores_gemma":[0.9961304,0.00001500847,0.002777999,0.0005308763,0.000140422,0.000001134264,0.0002595626,0.000008346903,0.0001362171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04036468,"threshold_uncertainty_score":0.4449966,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002139453,0.000126056,0.0001864829,0.000084655,0.0001390596,0.0001152251,0.000949063,0.00008186663,0.00000562098],"category_scores_gemma":[0.00009604484,0.0001140917,0.00006300203,0.0004577625,0.00002217247,0.0001796246,0.0003228534,0.0002909261,0.00005319525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002217794,"about_ca_system_score_gemma":0.00006570425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003581018,"about_ca_topic_score_gemma":0.00003029295,"domain_scores_codex":[0.9987729,0.0000314784,0.0003196071,0.0003640455,0.0003043374,0.0002076344],"domain_scores_gemma":[0.9987788,0.0001398978,0.0001576824,0.0006396229,0.0001957668,0.00008828425],"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.000007039208,0.0001835817,0.001458936,0.00006051287,0.00004439424,0.000004825258,0.003115133,0.001360506,0.5492696,0.2027229,0.0006124223,0.2411602],"study_design_scores_gemma":[0.0001417303,0.00002712067,0.01051368,0.00002905103,0.000007164119,0.000009936384,0.0001043106,0.9696793,0.01688517,0.0008223833,0.0016008,0.000179337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5024728,0.0001385713,0.4955815,0.0003600655,0.0005908713,0.0002764006,0.00001171295,0.0002014141,0.0003666618],"genre_scores_gemma":[0.943895,6.393159e-7,0.05577106,0.0000753784,0.0001911408,0.000009515217,0.00002362824,0.0000083757,0.00002525542],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9683188,"threshold_uncertainty_score":0.4652525,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005278022,0.0001822268,0.0001786792,0.00003808997,0.000244118,0.00008024939,0.0004406599,0.00008466224,0.000004208088],"category_scores_gemma":[0.0001739352,0.00009085998,0.00008562395,0.0001351026,0.00006754493,0.00005084246,0.00006999137,0.0007709821,0.00001581056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001607853,"about_ca_system_score_gemma":0.00001018801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001482519,"about_ca_topic_score_gemma":0.00004811717,"domain_scores_codex":[0.9990293,0.00004089467,0.0002577695,0.0001451852,0.0002642521,0.0002626061],"domain_scores_gemma":[0.9987859,0.0007288152,0.0000739234,0.0003306041,0.00004735725,0.00003339565],"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.00002125147,0.000006162067,0.0001800712,0.00006537911,0.00003856639,0.000001642642,0.0003868774,0.878751,0.06858515,0.003841961,0.0006832604,0.04743863],"study_design_scores_gemma":[0.00007847385,0.00005985029,0.0006796162,0.00003796572,0.00000943688,0.00000629168,0.00002093158,0.8806261,0.1180776,0.0001078962,0.0001975729,0.00009825055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9924178,0.0002873953,0.003347239,0.00005866834,0.001200947,0.0002160919,0.000001587319,0.0001281796,0.002342116],"genre_scores_gemma":[0.9990352,0.000006246469,0.0006388346,0.0000281961,0.0001387552,0.000004905122,0.000002501366,0.00002589754,0.0001194819],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04949243,"threshold_uncertainty_score":0.3705163,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008875097,0.00005966844,0.00007240837,0.00005699741,0.0005240666,0.00009942505,0.00009403544,0.00001403182,0.00003475431],"category_scores_gemma":[0.00001798934,0.00005306597,0.0000392334,0.00004754644,0.00008699222,0.0002785028,0.00001154739,0.00011754,0.00003833922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002909393,"about_ca_system_score_gemma":0.000006831546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000196928,"about_ca_topic_score_gemma":0.00002392494,"domain_scores_codex":[0.9994594,0.00001635049,0.0001168365,0.0001399802,0.0001522593,0.0001151005],"domain_scores_gemma":[0.9997658,0.0000215848,0.00006422234,0.00005254154,0.00007142762,0.0000243851],"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.00001389911,0.00003873415,0.00007690229,0.000007460586,0.000005871683,0.000007064479,0.04101047,0.0004554135,0.0005215886,0.6008407,0.005731292,0.3512906],"study_design_scores_gemma":[0.00153325,0.001082728,0.05394441,0.0002151528,0.00004621878,0.00004671641,0.004130786,0.2784823,0.000395773,0.533524,0.1254557,0.001142924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.710674,0.0002339651,0.0005323695,0.002979531,0.00195934,0.000133292,0.000001669075,0.0002980298,0.2831878],"genre_scores_gemma":[0.9972079,1.825527e-7,0.0005129289,0.0007426541,0.0007770115,1.356706e-7,0.00001046134,0.000002328459,0.0007464425],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3501477,"threshold_uncertainty_score":0.403075,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793995,0.0001037074,0.0001001044,0.00005038936,0.0001738435,0.0001538384,0.0006147126,0.00008293434,0.00001029809],"category_scores_gemma":[0.00006403525,0.00009123687,0.00004929413,0.0002410844,0.00002503652,0.0003077977,0.0002099348,0.0005410943,0.00005357749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001610325,"about_ca_system_score_gemma":0.00001785164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000159646,"about_ca_topic_score_gemma":0.000003358773,"domain_scores_codex":[0.9991053,0.00003672811,0.0001668654,0.0002764561,0.0001790423,0.0002356545],"domain_scores_gemma":[0.9993552,0.0001529157,0.00008678049,0.0003165615,0.0000375339,0.00005099453],"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.000006875315,0.00005863121,0.004208725,0.00001617948,0.0000225915,0.00002093392,0.001092788,0.00007053722,0.2445203,0.2057441,0.01003481,0.5342035],"study_design_scores_gemma":[0.0003617067,0.00002492365,0.01725801,0.00002310136,0.000003407117,0.00008275538,0.00001347861,0.9629468,0.006641084,0.00800477,0.004331586,0.0003083147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9247702,0.0001996346,0.07087763,0.0004547903,0.002429773,0.00006530459,5.066727e-7,0.0004002903,0.000801812],"genre_scores_gemma":[0.9729762,7.63085e-7,0.02638279,0.0003338055,0.0001628751,5.163123e-7,0.000006531369,0.000007051487,0.0001294819],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9628763,"threshold_uncertainty_score":0.3720531,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001608675,0.00009325722,0.000110835,0.00002908435,0.0001286302,0.00006253254,0.0001237796,0.00003979143,0.00006793014],"category_scores_gemma":[0.0002711277,0.00009014177,0.00005747074,0.0004015143,0.00001795888,0.0000800994,0.0001936362,0.0003421543,0.001660764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000705392,"about_ca_system_score_gemma":0.00004522941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006164318,"about_ca_topic_score_gemma":0.000007781905,"domain_scores_codex":[0.9990648,0.00007527039,0.0001303124,0.0002400477,0.0002196822,0.0002699113],"domain_scores_gemma":[0.9994515,0.0001035197,0.00005179526,0.0001858988,0.000161814,0.00004548551],"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.00004293153,0.0001402389,0.01831451,0.0000898166,0.0001507293,0.0005838737,0.001818963,0.003825589,0.7754669,0.008763892,0.04195509,0.1488475],"study_design_scores_gemma":[0.002509256,0.00004788762,0.1871326,0.000344302,0.00006588893,0.0009006595,0.0007597145,0.3353892,0.3550212,0.00131301,0.1150443,0.001472024],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9852242,0.002037711,0.0001577144,0.0001818051,0.0006781071,0.00004880639,0.000002313059,0.0003964973,0.01127287],"genre_scores_gemma":[0.9906732,4.556476e-7,0.007869893,0.0002271761,0.000236288,1.840587e-7,0.00001542536,0.00002888436,0.0009484526],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4204456,"threshold_uncertainty_score":0.9991165,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003745962,0.0002991724,0.0003364615,0.00008162487,0.000183547,0.0001167637,0.000415421,0.0002478863,0.00002857989],"category_scores_gemma":[0.0001823017,0.000243789,0.0001503227,0.0002332626,0.00007124925,0.0000115364,0.0005411,0.0004663407,0.00003537496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003567322,"about_ca_system_score_gemma":0.00003306063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002482296,"about_ca_topic_score_gemma":0.0000745109,"domain_scores_codex":[0.9979687,0.0001743068,0.0003604978,0.0006051566,0.0002003584,0.0006909554],"domain_scores_gemma":[0.9992293,0.00009167317,0.0002163599,0.0002684135,0.0000957123,0.00009859849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001076215,0.0001751234,0.3054289,0.0001035667,0.000088069,0.0000962305,0.0004501266,0.001485402,0.593735,0.00008702742,0.002214409,0.09602851],"study_design_scores_gemma":[0.00252634,0.0004624712,0.8155857,0.000375595,0.00002235866,0.0001116092,0.001971338,0.06534126,0.1097291,0.0002959682,0.002126277,0.001452005],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9954968,0.001997739,0.0004885935,0.0003122522,0.0003324781,0.0003110013,0.00000303954,0.00008252472,0.0009755387],"genre_scores_gemma":[0.9944284,0.000007699237,0.004048761,0.0006398392,0.0005808374,0.000002735056,0.00008355664,0.00002609345,0.0001820798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5101568,"threshold_uncertainty_score":0.9941426,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004185748,0.00008046214,0.0001187985,0.0001070543,0.0001708245,0.00007913465,0.0004497229,0.00004126045,0.000002051984],"category_scores_gemma":[0.0002403624,0.00006812471,0.00004805871,0.0004935055,0.00002667208,0.0002021901,0.0002376676,0.0001769662,0.00000347042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005352278,"about_ca_system_score_gemma":0.00004790917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003999731,"about_ca_topic_score_gemma":0.00001130681,"domain_scores_codex":[0.9991668,0.00007841409,0.0002419336,0.0002372248,0.0001377442,0.0001378876],"domain_scores_gemma":[0.9992236,0.0002956693,0.00004874577,0.0003066143,0.0001067083,0.00001864901],"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.000006798407,0.000113372,0.002000679,0.00008626308,0.00002002418,0.000001106656,0.0008865302,0.02170652,0.02837446,0.8110966,0.0002468245,0.1354608],"study_design_scores_gemma":[0.0001645055,0.00003116249,0.018962,0.0001860195,0.000002186434,0.000001076518,0.00002411207,0.9486299,0.007758367,0.02412728,0.00003263852,0.00008076481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8201538,0.0002887307,0.177856,0.000350168,0.000475566,0.0001338924,2.762148e-7,0.0001401816,0.0006013662],"genre_scores_gemma":[0.9841519,0.000001284717,0.0153695,0.0004158203,0.00001876943,0.00000173761,0.000001738443,0.000002338236,0.00003693181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9269234,"threshold_uncertainty_score":0.2778045,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002131158,0.00009911584,0.0001220455,0.00008237183,0.0002252071,0.0001620511,0.0004053265,0.00004571454,0.000001081599],"category_scores_gemma":[0.00003007485,0.00009030244,0.0000535982,0.0002021972,0.00003921231,0.0002043744,0.0003842161,0.0001280723,0.000001360008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002807748,"about_ca_system_score_gemma":0.00003036757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000105272,"about_ca_topic_score_gemma":9.32069e-7,"domain_scores_codex":[0.9992391,0.00002603081,0.0001228725,0.000294642,0.00008984834,0.0002274921],"domain_scores_gemma":[0.9995172,0.000191459,0.00004504154,0.0001614223,0.00005237619,0.00003248193],"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.00001328368,0.00001396249,0.0001040607,0.00003309631,0.00002619962,0.000008170324,0.0002018333,0.00003108049,0.0008594351,0.3546723,0.0009888472,0.6430477],"study_design_scores_gemma":[0.000693666,0.00003942278,0.001926589,0.0000521341,0.000008833927,0.00001679603,0.00004990131,0.9751585,0.0008585859,0.01676227,0.004278762,0.0001545078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09547505,0.0008065648,0.8999428,0.0007251803,0.001455859,0.0001624364,0.000001918016,0.0002619166,0.001168289],"genre_scores_gemma":[0.8620504,0.000001806432,0.1371239,0.0003620225,0.0001002427,7.533062e-7,0.000002653197,0.000003682125,0.0003546034],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9751275,"threshold_uncertainty_score":0.3682427,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002064527,0.0001949252,0.0001817521,0.00008487004,0.0003790258,0.0004118605,0.0007912773,0.0000688356,0.00000171826],"category_scores_gemma":[0.0000168734,0.000152982,0.00006611913,0.0006660239,0.00002689737,0.0003331773,0.0001302385,0.0004815267,0.00001684982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002767269,"about_ca_system_score_gemma":0.00003476781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002476252,"about_ca_topic_score_gemma":0.000001811722,"domain_scores_codex":[0.9985189,0.00003270589,0.0002375065,0.0004654496,0.0003134878,0.0004319155],"domain_scores_gemma":[0.9991317,0.0001001,0.0001286976,0.0004568559,0.00009090095,0.00009177868],"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.000006420667,0.00009783439,0.000457593,0.00001585716,0.00001960116,0.00002722408,0.001186342,0.05378184,0.0007494587,0.1008459,0.00008739661,0.8427246],"study_design_scores_gemma":[0.0001980523,0.00005023858,0.0006966392,0.00004493478,0.000005106782,0.00003626037,0.0000135413,0.9940324,0.0004408421,0.003438118,0.0008101008,0.0002337399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1875411,0.0003733243,0.8088741,0.001336742,0.00009302038,0.0001947025,2.80717e-7,0.0007696521,0.0008171321],"genre_scores_gemma":[0.6742193,9.461426e-7,0.32527,0.0003774439,0.00009140406,0.000001876989,0.000005603031,0.000007033616,0.00002641235],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9402506,"threshold_uncertainty_score":0.6238426,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465819,0.00008922349,0.0001126354,0.0000365449,0.0000834713,0.00001151077,0.0001621779,0.00007720115,4.09593e-7],"category_scores_gemma":[0.00005739822,0.00006038781,0.00006306492,0.000173729,0.00005908167,0.000002236469,0.000125025,0.0001118583,9.700562e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001046238,"about_ca_system_score_gemma":0.00001735574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001789068,"about_ca_topic_score_gemma":0.00002898856,"domain_scores_codex":[0.99932,0.00005166678,0.0001824147,0.0001864075,0.00009071779,0.0001687473],"domain_scores_gemma":[0.9995686,0.00002418685,0.0001042932,0.0001773187,0.0001097891,0.000015834],"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.00001308393,0.000014853,0.001472903,0.000003259116,0.00001709806,4.215185e-7,0.00005453222,0.0000126003,0.9790065,0.00002441983,0.00007468862,0.01930558],"study_design_scores_gemma":[0.00008226974,0.00008194448,0.001274655,0.00002239659,0.000007996729,0.000005881166,0.0001163248,0.00684293,0.9889224,0.0001541004,0.002398298,0.0000908526],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.998103,0.0006185462,0.0003908499,0.00005483158,0.00004206275,0.00006864244,9.738609e-7,0.00002863494,0.0006924701],"genre_scores_gemma":[0.9947121,0.00001112816,0.004860554,0.0001467153,0.0002356932,4.673476e-7,0.000007170872,0.000007581299,0.00001864589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01921473,"threshold_uncertainty_score":0.2462544,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406852,0.0001174516,0.0002544989,0.00004921922,0.00008258056,0.0001004939,0.0003637402,0.00003585937,1.384129e-7],"category_scores_gemma":[0.00003343826,0.00008617115,0.00003113452,0.0004159758,0.00004927714,0.0001372969,0.0002592828,0.0001529012,0.000001697984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123956,"about_ca_system_score_gemma":0.00003624511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001952469,"about_ca_topic_score_gemma":0.000003844301,"domain_scores_codex":[0.9989069,0.00006234297,0.0003030307,0.0003032292,0.0002677395,0.000156817],"domain_scores_gemma":[0.9993324,0.00006186203,0.0001783198,0.0002469723,0.00009424447,0.00008625015],"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.00009686052,0.0001087857,0.002674691,0.001731269,0.0001428003,0.0000161757,0.007505271,0.04576946,0.8990587,0.02665755,0.001154492,0.01508392],"study_design_scores_gemma":[0.0001757057,0.0001168029,0.0007163119,0.0002628221,0.000008798939,0.00002355066,0.0001524884,0.9921743,0.006083512,0.000002168985,0.0001699916,0.0001135633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.627946,0.0007810126,0.3698268,0.000355531,0.0004300725,0.0003816494,0.000002768542,0.0001720434,0.0001041103],"genre_scores_gemma":[0.9971529,0.000001179118,0.002717725,0.00002729387,0.00005157976,0.000004670797,0.000003473836,0.000008573013,0.00003265929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9464048,"threshold_uncertainty_score":0.3513957,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001648374,0.0001043405,0.0001284933,0.00004176256,0.0001431567,0.00001514984,0.0001787095,0.00008822808,3.951102e-8],"category_scores_gemma":[0.00007987916,0.00006551766,0.0001494126,0.0001683411,0.00004994489,0.000001495213,0.00009416294,0.00009080358,2.198799e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007275217,"about_ca_system_score_gemma":0.00002199051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005748193,"about_ca_topic_score_gemma":0.000004228792,"domain_scores_codex":[0.9993742,0.00002813841,0.0001671798,0.0002165104,0.00006743527,0.0001465691],"domain_scores_gemma":[0.9994968,0.00005444177,0.00009656413,0.0002091506,0.0001306133,0.00001238973],"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.00005694525,0.00002651984,0.0003398193,0.00004773451,0.0001956763,1.157583e-7,0.00002276502,0.0002653359,0.9763389,0.0005238861,0.0007566309,0.02142571],"study_design_scores_gemma":[0.000231494,0.00004442139,0.001279934,0.00001328448,0.0000639881,0.00000233734,0.00006404288,0.02398196,0.9723898,0.0001831787,0.001644453,0.0001011667],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8810712,0.00180097,0.1162393,0.0001348083,0.000139604,0.0003272537,0.000006603647,0.00006413447,0.0002160908],"genre_scores_gemma":[0.9201697,0.00002098871,0.07945699,0.0001719829,0.00008641611,0.000002704096,0.00003027583,0.000005616929,0.00005533679],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0390985,"threshold_uncertainty_score":0.2671733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}