{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"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":"c30f93655bca","filters":{"venue":"Emergence, complexity and computation"}},"results":[{"id":"W2490699745","doi":"10.1007/978-3-319-33924-5_4","title":"An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles","year":2016,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Computability, Logic, AI Algorithms","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":"McMaster University","funders":"","keywords":"Computer science; Turing machine; Turing; Computation; Turing machine examples; Description number; Theoretical computer science; Universal Turing machine; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05591443788604204,"gpt":0.2810422483651602,"spread":0.2251278104791181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002257414,0.0006391325,0.0008325432,0.0003340675,0.000292831,0.0002519342,0.0008506079,0.0001775186,0.00002048869],"category_scores_gemma":[0.00001088614,0.0005271845,0.0001840028,0.0002002914,0.0006065165,0.001205539,0.0004690831,0.0003196427,0.00001853739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000571076,"about_ca_system_score_gemma":0.0001615074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002470366,"about_ca_topic_score_gemma":0.00004182856,"domain_scores_codex":[0.9968075,0.00007336346,0.0007217339,0.00120226,0.000824107,0.0003710501],"domain_scores_gemma":[0.9977685,0.0001971363,0.0006176105,0.0006089982,0.0005701052,0.0002376888],"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.00007273384,0.000331376,0.0001811995,0.0002227484,0.0001664812,0.00001648465,0.001230533,0.1501844,0.00008071577,0.5693271,0.0001433542,0.2780429],"study_design_scores_gemma":[0.0002592869,0.0003332162,0.0004606039,0.00008972832,0.00002446423,0.00001976018,0.000008379527,0.6039304,0.0000143781,0.3943786,0.00005791075,0.000423309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01293012,0.000115237,0.9690082,0.0002501917,0.0002692447,0.000442229,0.0001499382,0.0003394579,0.01649539],"genre_scores_gemma":[0.9004583,0.00002186669,0.09753079,0.00005375312,0.0003608206,0.00001115762,0.0001820409,0.00005981824,0.001321453],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8875282,"threshold_uncertainty_score":0.999718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3172003993","doi":"10.1007/978-3-030-76928-4_9","title":"Robustness to Approximations and Model Learning in MDPs and POMDPs","year":2021,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Robustness (evolution); Convergence (economics); Mathematical optimization; Computer science; Optimal control; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04616066726937957,"gpt":0.2798371538038212,"spread":0.2336764865344416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002826674,0.0002745047,0.0003512431,0.0002900079,0.0003282667,0.0002126578,0.0001819874,0.0001312412,0.00001745311],"category_scores_gemma":[0.00002500581,0.0003071301,0.00003373592,0.0001625354,0.00007257604,0.000234547,0.0004386264,0.0004846712,0.000003143571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002017102,"about_ca_system_score_gemma":0.00006116922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004475908,"about_ca_topic_score_gemma":0.00006511181,"domain_scores_codex":[0.9984337,0.00007197747,0.0003449016,0.0006882406,0.0002487124,0.0002124561],"domain_scores_gemma":[0.9993641,0.00007425781,0.0001379775,0.0001723098,0.000105946,0.000145355],"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.000004341169,0.00002929744,0.0001228049,0.0001311028,0.00002407011,0.00001238458,0.001962509,0.4213338,0.000006358174,0.4666708,0.0001669519,0.1095356],"study_design_scores_gemma":[0.0001778885,0.00006860158,0.0009251403,0.000124279,0.00001079688,0.00002534322,0.00003637694,0.9584063,0.000001008978,0.03903609,0.0008605547,0.0003276664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008406205,0.0005915348,0.975939,0.001158948,0.0001541629,0.0002469402,0.000005221394,0.0001660052,0.01333195],"genre_scores_gemma":[0.1916244,0.0009323713,0.7603261,0.0004745966,0.0002434074,0.00004694641,0.0002004187,0.00007767754,0.04607402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5370725,"threshold_uncertainty_score":0.9999381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2547353811","doi":"10.1007/978-3-319-46376-6_6","title":"Descriptional Complexity of Error Detection","year":2016,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"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":"Neighbourhood (mathematics); Prefix; Automaton; Regular language; Computer science; String (physics); Algorithm; Finite-state machine; Mathematics; Theoretical computer science; Discrete mathematics; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.111376928887213,"gpt":0.2852576581418257,"spread":0.1738807292546127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003346549,0.0003646792,0.0004738464,0.0002761439,0.0002769336,0.00006151011,0.0005287621,0.000212243,0.0003580392],"category_scores_gemma":[0.00001397863,0.000336641,0.0001787819,0.0001063751,0.0006611536,0.0004306514,0.0003371978,0.000224456,0.00007624822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000497884,"about_ca_system_score_gemma":0.00006704622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003100391,"about_ca_topic_score_gemma":0.0000541279,"domain_scores_codex":[0.9978812,0.00007403367,0.000641317,0.0006440858,0.0005066363,0.000252759],"domain_scores_gemma":[0.9985691,0.00009829007,0.0005440583,0.000397945,0.0002680142,0.0001225428],"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.00002272753,0.00002881025,0.000007944035,0.00006664838,0.00004974692,0.000002675952,0.0001300974,0.00003097141,0.0004055045,0.9300004,0.0003856903,0.06886881],"study_design_scores_gemma":[0.0002822239,0.0001957349,0.001678351,0.0001643921,0.0000245561,0.00003233044,0.00001090909,0.05218887,0.0002095482,0.9396611,0.005138747,0.0004132598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001585156,0.0004464643,0.9252605,0.0004121817,0.001130948,0.0003099653,0.00009126368,0.000248056,0.07051541],"genre_scores_gemma":[0.9416138,0.0001936885,0.03755212,0.0002317605,0.0004309629,0.00001865638,0.0001168341,0.00005778277,0.01978438],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9400287,"threshold_uncertainty_score":0.9999086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2760174128","doi":"10.1007/978-3-319-77510-4_7","title":"Computing Shortest Paths with Cellular Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Cellular Automata and Applications","field":"Computer Science","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":"Shortest path problem; Cellular automaton; Combinatorics; Vertex (graph theory); Discrete mathematics; Distance; Mathematics; Computer science; Graph; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04104906656706336,"gpt":0.2571781149077312,"spread":0.2161290483406678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002573706,0.0005004687,0.0004693168,0.00021184,0.0006352582,0.0002849902,0.0008172147,0.0002023987,0.0002517446],"category_scores_gemma":[0.000004715305,0.0004879405,0.0001086783,0.0002096713,0.0003976412,0.0003187576,0.0005377935,0.0003252295,0.0002835171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003732193,"about_ca_system_score_gemma":0.0001175824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003468388,"about_ca_topic_score_gemma":0.00004827588,"domain_scores_codex":[0.9974411,0.00004071926,0.0005628308,0.001031507,0.0005583778,0.0003655102],"domain_scores_gemma":[0.9982625,0.00008050723,0.0004163036,0.0007764487,0.0002672689,0.0001969522],"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.00001021902,0.0001042419,0.00003626099,0.0001123967,0.0001299838,0.00004508457,0.001020558,0.0004296987,0.0001331141,0.9340125,0.009367512,0.0545984],"study_design_scores_gemma":[0.0004068497,0.0003204996,0.0006635588,0.0002368717,0.00008007641,0.0000916735,0.00003315179,0.742001,0.0001053594,0.1885104,0.06649919,0.001051322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001751755,0.0003143404,0.909076,0.0003460462,0.0003396942,0.0005095582,0.00003251713,0.0006673418,0.08696279],"genre_scores_gemma":[0.6503149,0.0002807972,0.2864959,0.000704938,0.001356138,0.00005237512,0.001772946,0.0002372597,0.05878477],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7455021,"threshold_uncertainty_score":0.9997572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125818116","doi":"10.1007/978-3-319-00254-5_6","title":"Two Conceptual Models for Aspects of Complex Systems Behavior","year":2013,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Conceptual model; Cognitive science; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.3991377792930946,"gpt":0.414169544634988,"spread":0.01503176534189332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00141827,0.0005806618,0.001619581,0.0006656802,0.0004458843,0.0003592382,0.0007420477,0.0002742315,0.001760348],"category_scores_gemma":[0.0001535273,0.0005082778,0.0004619527,0.0002225969,0.0006722825,0.0004312999,0.0003602339,0.0002606691,0.00017047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004930992,"about_ca_system_score_gemma":0.0001360826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003619715,"about_ca_topic_score_gemma":0.0001367041,"domain_scores_codex":[0.9934435,0.0001628829,0.002695943,0.001179815,0.002122036,0.0003957455],"domain_scores_gemma":[0.9933897,0.001445384,0.002041439,0.0007253126,0.002148581,0.0002495794],"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.00003702776,0.00003798063,0.0000135084,0.00005008621,0.0000491906,0.0000029783,0.0003222793,0.009878854,0.00004352722,0.9572944,0.0226928,0.009577392],"study_design_scores_gemma":[0.0005612274,0.0001814898,0.0002972161,0.0001272018,0.00006035618,0.00002244002,0.0004754907,0.3202754,0.00000182989,0.6507155,0.02686591,0.0004159447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002758321,0.00308128,0.5611569,0.0000710562,0.002676198,0.003381988,0.0007704273,0.0001237006,0.4259801],"genre_scores_gemma":[0.9300852,0.00002262335,0.008265571,0.00005791837,0.000470476,0.000129234,0.0001496669,0.00007139232,0.06074787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9273269,"threshold_uncertainty_score":0.9997369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W192439236","doi":"10.1007/978-3-642-41888-4_16","title":"Fitness Morphs and Nonlinear Projections of Agent-Case Embeddings to Characterize Fitness Landscapes","year":2013,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Evolutionary 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":"York University; University of Guelph","funders":"","keywords":"Fitness landscape; Cellular automaton; Set (abstract data type); Euclidean space; Computer science; Metric (unit); Fitness approximation; Representation (politics); Artificial intelligence; Theoretical computer science; Mathematics; Machine learning; Fitness function; Genetic algorithm; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.05144254749948868,"gpt":0.2812642816896747,"spread":0.229821734190186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001412268,0.0003065168,0.0003829736,0.000255139,0.0004244974,0.0001069425,0.0002870226,0.0001438585,0.000172236],"category_scores_gemma":[0.000008722632,0.0003162675,0.0000797902,0.0002082002,0.0001442924,0.0003759666,0.0003550486,0.0001977167,0.00005142708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001784073,"about_ca_system_score_gemma":0.00005683226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001901605,"about_ca_topic_score_gemma":0.00004297792,"domain_scores_codex":[0.998362,0.00002865713,0.0005109854,0.0006285567,0.0002603403,0.0002094562],"domain_scores_gemma":[0.9988073,0.00006933787,0.000311143,0.000311194,0.000327923,0.0001731536],"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.00002247247,0.000281674,0.0001224831,0.0004526988,0.0001937733,0.00006378914,0.002625479,0.00184648,0.0002684447,0.8973499,0.005746604,0.09102619],"study_design_scores_gemma":[0.0005550187,0.0003597854,0.007008791,0.0002804867,0.00009128325,0.0007518662,0.0001533112,0.8310593,0.00004699468,0.133774,0.02480998,0.001109167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08149862,0.0004186152,0.8964607,0.002161112,0.0007977677,0.001966604,0.0003903844,0.0003035676,0.01600265],"genre_scores_gemma":[0.3584187,0.001036954,0.5691968,0.0005898314,0.001069049,0.0005507079,0.001185426,0.000141725,0.06781086],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8292128,"threshold_uncertainty_score":0.999929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W853868720","doi":"10.1007/978-3-319-65558-1_10","title":"An Example of Computation of the Density of Ones in Probabilistic Cellular Automata by Direct Recursion","year":2018,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","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":"Brock University","funders":"","keywords":"Recursion (computer science); Cellular automaton; Probabilistic logic; Simple (philosophy); Set (abstract data type); Computation; Block (permutation group theory); Mathematics; Algorithm; Probabilistic automaton; Computer science; Construct (python library); Theoretical computer science; Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05078467912281573,"gpt":0.2640733069235046,"spread":0.2132886278006889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004278592,0.0002345497,0.0004847231,0.0001644542,0.0001258965,0.00002101494,0.0006263711,0.0001474835,0.00002850182],"category_scores_gemma":[0.00001386297,0.0002143655,0.0001040547,0.0002860169,0.0004674651,0.0001909974,0.0002606449,0.0001393179,0.000002943145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002713093,"about_ca_system_score_gemma":0.00009647077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008281986,"about_ca_topic_score_gemma":0.000241853,"domain_scores_codex":[0.9979511,0.0001358769,0.0007963765,0.0005313624,0.0004399123,0.0001453874],"domain_scores_gemma":[0.998059,0.0001016173,0.0008571952,0.0006104267,0.0003172448,0.0000545663],"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.00009090231,0.001455521,0.001392668,0.002056103,0.000155959,0.000002858685,0.007434822,0.007889508,0.02984922,0.8935933,0.004149002,0.05193016],"study_design_scores_gemma":[0.0004080308,0.0003401092,0.009651021,0.0004442953,0.00005748671,0.000004570352,0.00004017033,0.638747,0.007582254,0.3412076,0.001118308,0.0003991982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3264534,0.0004287822,0.6637666,0.0001540966,0.0004547487,0.001380798,0.0001485449,0.0001267215,0.007086224],"genre_scores_gemma":[0.9906003,0.00003830037,0.00866344,0.00001048977,0.00002335652,0.000007455956,0.0001882171,0.0000158797,0.0004525008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6641469,"threshold_uncertainty_score":0.8741573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2546781214","doi":"10.1007/978-3-319-46376-6_21","title":"Computational Approaches to Epigenetic Drug Discovery","year":2016,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Epigenetics and DNA Methylation","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":"Queen's University","funders":"","keywords":"Pharmacophore; Drug discovery; Epigenetics; Computational biology; Virtual screening; Drug development; Computer science; Bioinformatics; Drug; Biology; Pharmacology; Genetics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.09865060590944082,"gpt":0.2710491243292322,"spread":0.1723985184197914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001954011,0.0003539061,0.0002850901,0.0001343995,0.0002032599,0.0000684893,0.0001684242,0.0002033836,0.00007803468],"category_scores_gemma":[0.00001616794,0.0003404079,0.0001262224,0.00004275729,0.0001728252,0.00001077063,0.0002090235,0.0001127263,0.00005863128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001953989,"about_ca_system_score_gemma":0.00008025202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000897327,"about_ca_topic_score_gemma":0.00005774502,"domain_scores_codex":[0.998288,0.0000518009,0.0004282428,0.0007058302,0.0002973962,0.0002287105],"domain_scores_gemma":[0.9992539,0.00003355112,0.0002025423,0.000238274,0.0001158172,0.0001558689],"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.0004264057,0.0002214362,0.0009324797,0.0003829537,0.0007057975,0.00001012919,0.0007274392,0.07151609,0.00842849,0.7161236,0.01239779,0.1881274],"study_design_scores_gemma":[0.0008821964,0.0006533514,0.005897574,0.0002301256,0.0001271797,0.000009670442,0.00004409388,0.006010192,0.003096224,0.8271925,0.1540454,0.00181142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05258133,0.005762511,0.7717416,0.001550673,0.0009998902,0.001215958,0.0004242976,0.000063771,0.16566],"genre_scores_gemma":[0.8284472,0.0008406522,0.0127818,0.0002703333,0.001021157,0.00004155692,0.00193585,0.0001140894,0.1545474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7758659,"threshold_uncertainty_score":0.9999048,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2954952021","doi":"10.1007/978-3-030-15792-0_6","title":"From Parallelism to Nonuniversality: An Unconventional Trajectory","year":2019,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Slime Mold and Myxomycetes Research","field":"Engineering","cited_by":0,"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":"Parallelism (grammar); Computer science; Trajectory; Parallel computing; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.06733329559468068,"gpt":0.2837957006556817,"spread":0.216462405061001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008836237,0.00025003,0.000285389,0.0001761967,0.00008827574,0.00004683489,0.0001703238,0.0001668792,0.002139485],"category_scores_gemma":[0.000002602623,0.0002937814,0.00008654302,0.0000468318,0.00006361832,0.000136896,0.00006359239,0.0002698469,0.0003553727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005224122,"about_ca_system_score_gemma":0.00004466114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001876436,"about_ca_topic_score_gemma":0.0001644092,"domain_scores_codex":[0.9988293,0.00002515083,0.0002472358,0.0003668576,0.0003290115,0.0002024286],"domain_scores_gemma":[0.999458,0.00004512139,0.00003866736,0.0001919282,0.00008640679,0.0001798932],"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.0003264988,0.0001928871,0.001060088,0.0009401861,0.0016734,0.000100253,0.005940044,0.2104099,0.001916306,0.5118989,0.09459436,0.1709472],"study_design_scores_gemma":[0.001293095,0.0004872989,0.0308148,0.0003637339,0.0001484862,0.000009763877,0.0003258317,0.3437606,0.00006922494,0.2875835,0.333114,0.002029631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2743788,0.002546399,0.04294672,0.0005676067,0.006086436,0.002308491,0.001541279,0.001302469,0.6683218],"genre_scores_gemma":[0.9025067,0.0003595891,0.006985918,0.0002127582,0.001373452,0.00001683677,0.003243186,0.0001489945,0.08515257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6281279,"threshold_uncertainty_score":0.9999514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2547510902","doi":"10.1007/978-3-319-46376-6_8","title":"Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts","year":2016,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bishop's University","funders":"","keywords":"Computer science; Underspecification; Component (thermodynamics); Parsing; Reset (finance); Context (archaeology); Grammar; Synchronization (alternating current); Process (computing); Factor (programming language); Distributed computing; Programming language; Theoretical computer science; Artificial intelligence; Computer network; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04305922777302051,"gpt":0.2711279166614918,"spread":0.2280686888884713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004468365,0.0005630461,0.000675933,0.0001028416,0.0003744423,0.0001627174,0.0005635538,0.0004788456,0.00001764784],"category_scores_gemma":[0.00006854088,0.0003702871,0.0001414533,0.0000504713,0.0004165959,0.00003380453,0.0009449507,0.0003065698,0.000005050112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002167476,"about_ca_system_score_gemma":0.00003621871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001153378,"about_ca_topic_score_gemma":0.0007957529,"domain_scores_codex":[0.9972342,0.0002474364,0.0008567026,0.0009414132,0.0002865169,0.0004337403],"domain_scores_gemma":[0.9982763,0.0001103592,0.0006277123,0.0005808044,0.0002354162,0.0001694143],"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.002245533,0.0004889097,0.006823833,0.007300268,0.001682299,0.0002602973,0.00458857,0.001794487,0.04725775,0.6872494,0.002023657,0.238285],"study_design_scores_gemma":[0.02872106,0.009849009,0.02838775,0.06624881,0.001885496,0.001208865,0.09864203,0.2190179,0.01793018,0.2733647,0.2245385,0.03020576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8606221,0.07210699,0.03012301,0.002952641,0.005303602,0.006170965,0.001267331,0.0004895364,0.0209638],"genre_scores_gemma":[0.9900593,0.004490628,0.0006952303,0.0001204623,0.0003323435,0.00006341971,0.0003327633,0.00004181519,0.00386404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4138848,"threshold_uncertainty_score":0.9998749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2788443823","doi":"10.1007/978-3-319-73216-9_17","title":"Input-Position-Restricted Models of Language Acceptors","year":2018,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","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":"University of Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Position (finance); Computer science; Class (philosophy); Algorithm; Bounded function; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04461886384275267,"gpt":0.2730592200832295,"spread":0.2284403562404768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001529214,0.0003062932,0.0003934799,0.0002773279,0.0001747137,0.00007734259,0.0005910503,0.0001936608,0.0004658886],"category_scores_gemma":[0.000007472083,0.0003136767,0.0001215625,0.0001647698,0.0002642413,0.0004611556,0.0003530606,0.0001898367,0.00004936209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002465362,"about_ca_system_score_gemma":0.00006154484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006497149,"about_ca_topic_score_gemma":0.00001490271,"domain_scores_codex":[0.9983133,0.00005146281,0.0005124887,0.0005233628,0.0003930249,0.0002063624],"domain_scores_gemma":[0.9987808,0.00008120904,0.0004190696,0.0004079876,0.0002103669,0.0001005346],"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.00001594725,0.00004525647,0.00000316322,0.00008909743,0.00007823094,0.00000826734,0.002316041,0.0006314738,0.0001741399,0.9608166,0.005622313,0.0301995],"study_design_scores_gemma":[0.0002091014,0.0001602098,0.0002026178,0.0001371523,0.00002903373,0.00001317942,0.00005599292,0.3042754,0.0001571096,0.6934227,0.0009520034,0.0003855286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01192269,0.0009776377,0.891386,0.0001917851,0.0008423877,0.0003963183,0.00008873483,0.0003465282,0.09384787],"genre_scores_gemma":[0.9015602,0.0005014869,0.07302182,0.0005071579,0.0007351082,0.00002078199,0.000702304,0.00009223328,0.0228589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8896375,"threshold_uncertainty_score":0.9999315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409829874","doi":"10.1007/978-3-031-78757-7_1","title":"Solving the Initial Value Problem for Cellular Automata by Pattern Decomposition","year":2025,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","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":"Brock University","funders":"","keywords":"Cellular automaton; Decomposition; Value (mathematics); Mathematics; Computer science; Algorithm; Chemistry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03859784314250021,"gpt":0.3027714591920461,"spread":0.2641736160495459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003062357,0.0003522012,0.0003188156,0.0001341081,0.0008753068,0.0003063642,0.0007990418,0.0001799098,0.00003398147],"category_scores_gemma":[0.00000561903,0.0003273598,0.000165727,0.0001268129,0.0001513391,0.0002568693,0.0004001741,0.0002570204,0.00002466344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005154088,"about_ca_system_score_gemma":0.0001079108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007755631,"about_ca_topic_score_gemma":0.00002508604,"domain_scores_codex":[0.998081,0.00005776301,0.0005495278,0.0007082179,0.000327279,0.0002762221],"domain_scores_gemma":[0.9987146,0.0002046631,0.0003319097,0.0004994213,0.000169075,0.00008027587],"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.000004651075,0.00004940012,0.000002812443,0.0001571349,0.00006732299,0.000001495329,0.0002099765,0.0002659727,0.0002573888,0.8875548,0.02686236,0.08456668],"study_design_scores_gemma":[0.0002631192,0.00006793007,0.00003717464,0.0001167378,0.00006144297,0.000007174337,0.000008413224,0.5684887,0.0001792951,0.385942,0.04447663,0.0003514059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00008273148,0.0005213288,0.9699522,0.002020467,0.0004050478,0.001122756,0.0001743722,0.0002870535,0.025434],"genre_scores_gemma":[0.6297151,0.0006012755,0.2613854,0.003913236,0.001689861,0.001474018,0.01166178,0.0002745534,0.08928476],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7085668,"threshold_uncertainty_score":0.9999179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}