{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Tânia Ambaram","is_ca":false},{"name":"Edwin Beggs","is_ca":false},{"name":"José Félix Costa","is_ca":false},{"name":"Diogo Poças","is_ca":true},{"name":"John V. Tucker","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007067066,0.0005666926,0.000615757,0.000770556,0.001023139,0.00532331,0.001381389,0.002533056,0.007154845],"category_scores_gemma":[0.002631412,0.0004189031,0.0005650104,0.0009688765,0.009065839,0.008666268,0.001717363,0.00337243,0.001467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001744941,"about_ca_system_score_gemma":0.0008156496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006181608,"about_ca_topic_score_gemma":0.0004572279,"domain_scores_codex":[0.9993957,0.0002495344,0.00002440022,0.0001010567,0.0001710037,0.00005831357],"domain_scores_gemma":[0.9993617,0.000370672,0.00002940079,0.0001461146,0.00005496915,0.00003721961],"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.000002746862,0.000002508169,0.000009185453,0.00001577779,8.525587e-7,0.000007060445,0.00003464035,0.0003069778,0.00006948919,0.9973756,0.0006344993,0.001540658],"study_design_scores_gemma":[0.000002657277,0.000002583058,0.00001185981,0.00001453317,0.000001197258,0.00002521017,0.00001337375,0.001815454,0.00007800432,0.9912047,0.006827675,0.000002751952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0174272,0.02310522,0.2951623,0.01078005,0.001594691,0.00006693679,0.0001705002,0.0003547592,0.6513384],"genre_scores_gemma":[0.8181577,0.01554656,0.07120498,0.00216538,0.00221172,0.0002250312,0.00017306,0.0001882826,0.09012739],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.007154845,"threshold_uncertainty_score":0.02393538,"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","authors":[{"name":"Ali̇ Devran Kara","is_ca":true},{"name":"Serdar Yüksel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004166753,0.001171613,0.002084142,0.001140679,0.0008269441,0.003786869,0.001942915,0.002340244,0.00361428],"category_scores_gemma":[0.03602632,0.001073558,0.001684516,0.001313619,0.005451103,0.005917399,0.003835734,0.005498552,0.0003388904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00326217,"about_ca_system_score_gemma":0.001417059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00397197,"about_ca_topic_score_gemma":0.001989909,"domain_scores_codex":[0.9967374,0.001603056,0.0001805948,0.0005696188,0.0007140241,0.0001953222],"domain_scores_gemma":[0.9656722,0.03049703,0.001146222,0.001692416,0.0006854841,0.0003065819],"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.00007309431,0.00002546049,0.000393126,0.0001843288,0.00005966244,0.0000702113,0.0001492367,0.4558901,0.0004086157,0.5230147,0.001386367,0.01834515],"study_design_scores_gemma":[0.00000704717,0.00001255575,0.00008447338,0.00002109391,0.000008272958,0.00001712411,0.00002210945,0.5272475,0.0001725381,0.4716639,0.0007338923,0.000009460863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.017756,0.001953296,0.9659035,0.001727737,0.0001244714,0.00003819422,0.0001501904,0.0002574926,0.0120892],"genre_scores_gemma":[0.8223984,0.003362675,0.1636188,0.0004974224,0.0003847353,0.0002846395,0.0004065756,0.0003330135,0.008713732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004166753,"threshold_uncertainty_score":0.02366889,"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","authors":[{"name":"Timothy Ng","is_ca":true},{"name":"David Rappaport","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003234061,0.0007357498,0.001145733,0.001516446,0.001293364,0.007130987,0.002330193,0.002397587,0.007801377],"category_scores_gemma":[0.02071113,0.0008607362,0.001460691,0.001890059,0.005354817,0.01213221,0.003040986,0.004705792,0.0009301876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003677132,"about_ca_system_score_gemma":0.00173362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303247,"about_ca_topic_score_gemma":0.0007856637,"domain_scores_codex":[0.9953001,0.001506014,0.0003688919,0.0006691581,0.001779678,0.0003761567],"domain_scores_gemma":[0.9821084,0.01355498,0.0005972575,0.002105189,0.001348212,0.0002860436],"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.00001310595,0.000007230641,0.0001214903,0.00005119755,0.000009155985,0.00002474616,0.0001012201,0.003702867,0.0001799818,0.9882273,0.001156576,0.006405117],"study_design_scores_gemma":[0.000002619152,0.000002590031,0.00004693701,0.000009227526,0.00000362739,0.00002813277,0.00001647492,0.01253842,0.0001268427,0.9860707,0.001148756,0.000005780785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06830201,0.007328944,0.8034899,0.01007259,0.0005005473,0.00008954851,0.0008937447,0.0004602414,0.1088625],"genre_scores_gemma":[0.8912647,0.004431999,0.08297016,0.0007129296,0.001065588,0.0002819924,0.0008133969,0.0002761084,0.01818327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007801377,"threshold_uncertainty_score":0.02667958,"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","authors":[{"name":"Selim G. Akl","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002641537,0.001045329,0.001101541,0.001033563,0.0005893582,0.00229122,0.001415809,0.0008675044,0.00729576],"category_scores_gemma":[0.002520448,0.0005749486,0.0009542965,0.002018224,0.0007308495,0.002819644,0.001503549,0.001382451,0.001811138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291745,"about_ca_system_score_gemma":0.0009014455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0024623,"about_ca_topic_score_gemma":0.003878321,"domain_scores_codex":[0.9996914,0.00005186552,0.0000260234,0.0000949442,0.00009685458,0.00003896023],"domain_scores_gemma":[0.9995164,0.0002707081,0.00002618425,0.00008947463,0.00007146061,0.00002569733],"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.00008241051,0.00004141083,0.0006094546,0.0004755819,0.00007707407,0.0000679804,0.0001470873,0.3856835,0.004177754,0.3534882,0.01115774,0.2439918],"study_design_scores_gemma":[0.00001079327,0.00001291626,0.0001052595,0.00004526281,0.00001608994,0.00004066008,0.00003676757,0.4491808,0.002035065,0.5352498,0.0132511,0.0000155889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02748046,0.002917602,0.9406067,0.0005750353,0.0003518667,0.00005896114,0.0005489461,0.001584503,0.02587589],"genre_scores_gemma":[0.3385355,0.004391874,0.6397653,0.0001763503,0.0001946105,0.0002089774,0.001651111,0.0004894616,0.01458692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00729576,"threshold_uncertainty_score":0.02440673,"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","authors":[{"name":"Burton Voorhees","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002276457,0.001295241,0.0008492934,0.002427301,0.001260933,0.006644577,0.002712645,0.003022925,0.007070856],"category_scores_gemma":[0.005463738,0.0006403939,0.001344615,0.001953514,0.008846737,0.01052935,0.002235467,0.004915788,0.0009263111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002993976,"about_ca_system_score_gemma":0.001898874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002107059,"about_ca_topic_score_gemma":0.002154405,"domain_scores_codex":[0.9988326,0.0004765276,0.00007457731,0.0001619877,0.0003470605,0.0001071808],"domain_scores_gemma":[0.9974514,0.001536914,0.0001955654,0.000344279,0.0002694261,0.0002023514],"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.000001865332,0.00000602036,0.00003333457,0.00001535515,0.000002099028,0.000009708482,0.0001595346,0.0004234645,0.00004212851,0.9968858,0.0005339024,0.001886646],"study_design_scores_gemma":[0.000004599689,0.000005226326,0.00008259587,0.00002638083,0.000003888538,0.00005387342,0.0001091684,0.004556525,0.00004762967,0.9884368,0.006667151,0.000006283859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01342867,0.01010056,0.7549411,0.02574989,0.0005945539,0.0001961199,0.0003238127,0.0002709068,0.1943945],"genre_scores_gemma":[0.5113692,0.01018891,0.4421989,0.00288209,0.001109731,0.001400309,0.0005081303,0.0001892314,0.03015349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007070856,"threshold_uncertainty_score":0.0236544,"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","authors":[{"name":"Daniel Ashlock","is_ca":true},{"name":"Justin Schonfeld","is_ca":true},{"name":"Wendy Ashlock","is_ca":true},{"name":"Colin Lee","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007523836,0.0005547654,0.000388494,0.001121896,0.000375177,0.001471044,0.000600774,0.0008160064,0.003134796],"category_scores_gemma":[0.005160514,0.0002650192,0.0005520475,0.000771838,0.001516733,0.00287125,0.00129318,0.001451509,0.0003306763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007643109,"about_ca_system_score_gemma":0.00027103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008093158,"about_ca_topic_score_gemma":0.0009108503,"domain_scores_codex":[0.9997421,0.0000983942,0.00001688614,0.00005256416,0.00006240427,0.00002754807],"domain_scores_gemma":[0.9987306,0.0006778943,0.0001498317,0.0001972081,0.0001397844,0.0001047915],"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.0001106826,0.00009317514,0.004774803,0.0001131092,0.00005325603,0.000165229,0.00052281,0.2080861,0.00605528,0.7093641,0.002356145,0.06830545],"study_design_scores_gemma":[0.000004522295,0.00002334393,0.001316963,0.00001665063,0.000007048385,0.0001084108,0.00009201849,0.6975648,0.0004565122,0.2993459,0.001050123,0.00001374013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2228451,0.000821759,0.7576059,0.0006160815,0.000067333,0.00008150721,0.0002762681,0.0002079076,0.01747824],"genre_scores_gemma":[0.8823976,0.0004415776,0.1105254,0.0000735644,0.00005457793,0.00009861802,0.0003819584,0.0001434955,0.005883182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003134796,"threshold_uncertainty_score":0.0104869,"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","authors":[{"name":"Henryk Fukś","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005840159,0.0004298626,0.000794174,0.0008476134,0.001411194,0.001945601,0.001067217,0.001680357,0.006305279],"category_scores_gemma":[0.003849082,0.0004884015,0.001051546,0.001080639,0.002911092,0.002799815,0.001349748,0.001966396,0.0006709593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127274,"about_ca_system_score_gemma":0.0004809311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002135159,"about_ca_topic_score_gemma":0.001907557,"domain_scores_codex":[0.9995764,0.0001587808,0.00002240666,0.00007533735,0.0001222167,0.00004486414],"domain_scores_gemma":[0.999007,0.000708463,0.00002656292,0.0001275876,0.00008763971,0.00004268421],"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.000006207666,0.000004354421,0.00003991711,0.00002436777,0.000003978138,0.0000409529,0.00008171352,0.002530324,0.0005162482,0.9932306,0.0006826867,0.002838679],"study_design_scores_gemma":[0.000006333189,0.000003920309,0.00005114981,0.000008364196,0.00000375644,0.0000570514,0.00001417115,0.02245085,0.0003328983,0.9739968,0.003066743,0.000007932735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05147611,0.003352399,0.7809688,0.002359497,0.0005877148,0.00007440268,0.0002819517,0.000865992,0.1600331],"genre_scores_gemma":[0.6976901,0.001908065,0.2736391,0.0004842279,0.0002831647,0.0001507514,0.0001544242,0.000343989,0.02534609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006305279,"threshold_uncertainty_score":0.02109325,"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","authors":[{"name":"Emese E. Somogyvari","is_ca":true},{"name":"Selim G. Akl","is_ca":true},{"name":"Louise M. Winn","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137427,0.0006911383,0.001104746,0.0008561682,0.0005187318,0.001838393,0.001745131,0.00107585,0.004735144],"category_scores_gemma":[0.004474402,0.000611664,0.0009831768,0.00104555,0.001789049,0.002058874,0.001772635,0.00194958,0.0004640945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001137463,"about_ca_system_score_gemma":0.001171114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00230096,"about_ca_topic_score_gemma":0.003418965,"domain_scores_codex":[0.999526,0.0002242643,0.00002548031,0.00006252583,0.0001260522,0.00003564401],"domain_scores_gemma":[0.9977775,0.001878938,0.00006943926,0.000140534,0.00008200231,0.00005163773],"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.0000497736,0.00004753263,0.0004762541,0.0002782812,0.0001226673,0.00005386893,0.00005889964,0.4657875,0.0004215307,0.4767256,0.003821044,0.05215709],"study_design_scores_gemma":[0.00001430056,0.000007836679,0.00005805933,0.0000203117,0.00001135198,0.00001578223,0.00001420895,0.5184012,0.0001555625,0.4779296,0.003364854,0.000006871155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01943025,0.01398307,0.9247741,0.006893374,0.0003161235,0.00006752016,0.0004965225,0.0005550051,0.033484],"genre_scores_gemma":[0.4737316,0.01390641,0.4978003,0.0009015918,0.0007287341,0.0004856467,0.0008060343,0.0001997656,0.01143978],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004735144,"threshold_uncertainty_score":0.01584065,"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","authors":[{"name":"Selim G. Akl","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350685,0.00056628,0.0007993642,0.0009980586,0.001819419,0.006756062,0.001058263,0.002355939,0.006646872],"category_scores_gemma":[0.002273257,0.000426987,0.0004392019,0.0009116633,0.01750109,0.01694922,0.003253654,0.007291738,0.001666739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003010934,"about_ca_system_score_gemma":0.001869722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001458717,"about_ca_topic_score_gemma":0.001643864,"domain_scores_codex":[0.9993974,0.0002025601,0.00002043184,0.0001410387,0.000180243,0.00005832457],"domain_scores_gemma":[0.99888,0.0006874891,0.00003831335,0.0002001594,0.000108428,0.00008553035],"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.00000472793,0.000005188586,0.00001796764,0.00002701523,0.000001412883,0.000009575187,0.000198589,0.0001546719,0.0001103202,0.9920505,0.002438928,0.004981135],"study_design_scores_gemma":[0.000002760058,0.000004569737,0.00003297262,0.00003919597,7.803864e-7,0.00002445557,0.000102364,0.0004630962,0.0000716228,0.9679363,0.03131776,0.000004111173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02274514,0.07340739,0.1040668,0.08717635,0.003098756,0.00007025243,0.0002195419,0.0004239613,0.7087918],"genre_scores_gemma":[0.6524461,0.07447539,0.06424413,0.01190372,0.00453442,0.0003852459,0.0002967116,0.0008130607,0.1909013],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.006756062,"threshold_uncertainty_score":0.02223599,"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","authors":[{"name":"Stefan D. Bruda","is_ca":true},{"name":"Mary Sarah Ruth Wilkin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985422,0.0003192505,0.0005532417,0.0003742242,0.0009449761,0.002663131,0.0008041533,0.001278782,0.002379656],"category_scores_gemma":[0.004524073,0.0004227085,0.0006790668,0.0005464642,0.005946836,0.007622942,0.001864389,0.003835731,0.0004800452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008131035,"about_ca_system_score_gemma":0.0007640892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007173869,"about_ca_topic_score_gemma":0.0005876855,"domain_scores_codex":[0.9994648,0.0001588127,0.00002784002,0.0001285691,0.0001463334,0.00007360473],"domain_scores_gemma":[0.9984336,0.001049141,0.00007813346,0.0002493846,0.0001001223,0.00008959771],"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.0000211117,0.00000970334,0.0002261243,0.00005291288,0.000009485832,0.000060553,0.0007015652,0.003490411,0.001327279,0.9728309,0.001654086,0.01961591],"study_design_scores_gemma":[0.000004259562,0.000004404185,0.00008723221,0.00001009909,0.000002990946,0.00004001181,0.00005541454,0.005022573,0.0003498188,0.9912668,0.003149321,0.000007072082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2390243,0.01106152,0.5323822,0.02349991,0.001098464,0.00009503507,0.0002406942,0.001304313,0.1912936],"genre_scores_gemma":[0.899995,0.003247929,0.08033406,0.001103755,0.0004869973,0.0001200588,0.0001522167,0.000469217,0.01409076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002663131,"threshold_uncertainty_score":0.007960737,"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","authors":[{"name":"Óscar H. Ibarra","is_ca":false},{"name":"Ian McQuillan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001340453,0.0007348351,0.0007918284,0.0006432183,0.001038934,0.0049174,0.00185621,0.001805251,0.009569744],"category_scores_gemma":[0.004907408,0.0006294007,0.001262442,0.0006727861,0.003397326,0.006283021,0.001986943,0.00378535,0.002459765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001426202,"about_ca_system_score_gemma":0.0008413422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006295504,"about_ca_topic_score_gemma":0.0006646338,"domain_scores_codex":[0.9988056,0.0004472149,0.0000801495,0.0002094607,0.0003005974,0.0001569149],"domain_scores_gemma":[0.9976192,0.001327971,0.0001088543,0.0005216433,0.000287392,0.0001348852],"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.0000138044,0.000006872861,0.00003884506,0.00002057311,0.000002475474,0.00003391353,0.0001435705,0.001838987,0.0004952195,0.9953607,0.0004769572,0.001568098],"study_design_scores_gemma":[0.000007205108,0.000004642124,0.00001787558,0.000008312823,0.000003080791,0.00003064538,0.00002201091,0.01444441,0.0003475592,0.9836826,0.001426925,0.000004810015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1053982,0.001218394,0.7427412,0.002701666,0.0004118618,0.00009834841,0.0006016397,0.001269381,0.1455593],"genre_scores_gemma":[0.8982266,0.0008014872,0.06218683,0.0003368927,0.0002957257,0.0002020749,0.0005759245,0.0004807279,0.03689374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009569744,"threshold_uncertainty_score":0.03201395,"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","authors":[{"name":"Henryk Fukś","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005997604,0.00071906,0.001146803,0.0005030828,0.0005835498,0.001933044,0.001453369,0.0013673,0.005688198],"category_scores_gemma":[0.003479778,0.0006455819,0.001275892,0.0007556616,0.001326145,0.0026775,0.001543297,0.002503073,0.0008885958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007959028,"about_ca_system_score_gemma":0.0009690006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001811368,"about_ca_topic_score_gemma":0.002060136,"domain_scores_codex":[0.999723,0.00008042534,0.00001813705,0.00006050218,0.00007010396,0.00004782325],"domain_scores_gemma":[0.9989442,0.000832118,0.00003352537,0.00008768326,0.00007519427,0.00002725588],"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.00005509629,0.0000459847,0.0003590184,0.0002829586,0.00003802857,0.0001086462,0.0001894465,0.1749133,0.002700389,0.7449853,0.006085363,0.07023654],"study_design_scores_gemma":[0.0000127935,0.000007433034,0.00003572364,0.00001556829,0.000007011838,0.00002358414,0.00003199216,0.2826888,0.0007327091,0.7143854,0.002052938,0.000006004886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01924631,0.0004393131,0.9642611,0.0004787413,0.00007220286,0.00004863715,0.0001298587,0.0001841039,0.01513969],"genre_scores_gemma":[0.3105323,0.001271539,0.6693612,0.0001942723,0.0001447275,0.0003127961,0.0005315236,0.0003956467,0.017256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005688198,"threshold_uncertainty_score":0.0190289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}