{"meta":{"query_hash":"c30f93655bca","filters":{"venue":"Emergence, complexity and computation"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/c30f93655bca","api":"https://metacan.xera.ac/api/v1/cohort?venue=Emergence%2C+complexity+and+computation"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05144254749948868,"score_gpt":0.28126428168967466,"score_spread":0.22982173419018598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192439236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081498615,0.00041861518,0.8964607,0.0021611124,0.0007977677,0.0019666045,0.00039038443,0.0003035676,0.01600265],"genre_scores_gemma":[0.3584187,0.0010369543,0.56919676,0.00058983144,0.0010690489,0.0005507079,0.001185426,0.00014172502,0.067810856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998362,0.00002865713,0.0005109854,0.0006285567,0.00026034028,0.00020945621],"domain_scores_gemma":[0.99880725,0.00006933787,0.00031114303,0.00031119396,0.000327923,0.0001731536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014122677,0.0003065168,0.00038297355,0.00025513896,0.00042449735,0.00010694249,0.00028702256,0.00014385846,0.00017223596],"category_scores_gemma":[0.000008722632,0.0003162675,0.000079790196,0.00020820025,0.00014429244,0.00037596657,0.0003550486,0.00019771674,0.000051427076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002247247,0.00028167403,0.00012248312,0.00045269876,0.00019377333,0.00006378914,0.002625479,0.0018464797,0.00026844474,0.8973499,0.0057466044,0.091026194],"study_design_scores_gemma":[0.0005550187,0.00035978542,0.0070087914,0.00028048674,0.000091283255,0.0007518662,0.00015331124,0.8310593,0.000046994675,0.13377404,0.024809979,0.001109167],"about_ca_topic_score_codex":0.00019016046,"about_ca_topic_score_gemma":0.000042977917,"teacher_disagreement_score":0.8292128,"about_ca_system_score_codex":0.000017840732,"about_ca_system_score_gemma":0.000056832258,"threshold_uncertainty_score":0.99992895},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Conceptual model; Cognitive science; Psychology","score_opus":0.39913777929309463,"score_gpt":0.41416954463498795,"score_spread":0.015031765341893322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125818116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002758321,0.0030812798,0.5611569,0.0000710562,0.0026761976,0.003381988,0.0007704273,0.00012370058,0.4259801],"genre_scores_gemma":[0.93008524,0.000022623348,0.008265571,0.00005791837,0.00047047602,0.00012923403,0.00014966688,0.00007139232,0.06074787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99344355,0.00016288286,0.0026959435,0.0011798147,0.0021220357,0.00039574548],"domain_scores_gemma":[0.9933897,0.0014453835,0.0020414386,0.0007253126,0.0021485812,0.00024957937],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00141827,0.00058066176,0.001619581,0.0006656802,0.0004458843,0.00035923815,0.0007420477,0.00027423145,0.001760348],"category_scores_gemma":[0.00015352733,0.0005082778,0.00046195267,0.00022259691,0.0006722825,0.0004312999,0.00036023394,0.00026066907,0.00017047004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003702776,0.000037980633,0.0000135083965,0.00005008621,0.000049190603,0.0000029783002,0.00032227935,0.009878854,0.00004352722,0.9572944,0.022692796,0.009577392],"study_design_scores_gemma":[0.0005612274,0.00018148984,0.00029721615,0.00012720177,0.000060356182,0.000022440025,0.00047549067,0.32027543,0.0000018298898,0.6507155,0.026865909,0.00041594473],"about_ca_topic_score_codex":0.00036197153,"about_ca_topic_score_gemma":0.00013670413,"teacher_disagreement_score":0.9273269,"about_ca_system_score_codex":0.000049309918,"about_ca_system_score_gemma":0.00013608264,"threshold_uncertainty_score":0.9997369},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05591443788604204,"score_gpt":0.2810422483651602,"score_spread":0.22512781047911812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490699745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129301185,0.00011523697,0.9690082,0.00025019175,0.00026924475,0.00044222904,0.00014993823,0.00033945794,0.016495386],"genre_scores_gemma":[0.9004583,0.000021866694,0.09753079,0.000053753116,0.00036082056,0.000011157616,0.00018204094,0.00005981824,0.0013214529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680746,0.00007336346,0.0007217339,0.0012022597,0.000824107,0.00037105015],"domain_scores_gemma":[0.99776846,0.00019713625,0.00061761047,0.00060899823,0.0005701052,0.0002376888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022574143,0.00063913246,0.0008325432,0.00033406747,0.00029283098,0.0002519342,0.00085060793,0.00017751855,0.000020488695],"category_scores_gemma":[0.000010886136,0.00052718446,0.00018400283,0.00020029143,0.0006065165,0.0012055386,0.00046908314,0.00031964266,0.000018537394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007273384,0.00033137604,0.00018119955,0.00022274836,0.00016648123,0.000016484653,0.0012305335,0.15018438,0.00008071577,0.5693271,0.00014335422,0.27804288],"study_design_scores_gemma":[0.00025928687,0.00033321616,0.00046060386,0.00008972832,0.000024464232,0.000019760184,0.000008379527,0.60393035,0.000014378102,0.39437863,0.000057910747,0.000423309],"about_ca_topic_score_codex":0.000024703659,"about_ca_topic_score_gemma":0.000041828556,"teacher_disagreement_score":0.8875282,"about_ca_system_score_codex":0.000057107598,"about_ca_system_score_gemma":0.00016150736,"threshold_uncertainty_score":0.99971795},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09865060590944082,"score_gpt":0.27104912432923217,"score_spread":0.17239851841979137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546781214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052581325,0.005762511,0.77174157,0.0015506732,0.0009998902,0.0012159576,0.00042429758,0.000063770996,0.16566],"genre_scores_gemma":[0.82844716,0.0008406522,0.012781803,0.00027033326,0.0010211573,0.00004155692,0.0019358495,0.000114089366,0.1545474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828804,0.0000518009,0.00042824278,0.00070583017,0.0002973962,0.00022871049],"domain_scores_gemma":[0.9992539,0.000033551125,0.00020254229,0.00023827399,0.0001158172,0.00015586893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019540105,0.0003539061,0.00028509012,0.00013439948,0.0002032599,0.0000684893,0.00016842422,0.00020338364,0.00007803468],"category_scores_gemma":[0.000016167942,0.0003404079,0.00012622244,0.00004275729,0.00017282517,0.000010770633,0.00020902349,0.00011272631,0.000058631278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042640572,0.00022143622,0.0009324797,0.00038295373,0.00070579746,0.00001012919,0.00072743924,0.07151609,0.00842849,0.71612364,0.012397788,0.18812737],"study_design_scores_gemma":[0.0008821964,0.0006533514,0.0058975737,0.00023012565,0.00012717972,0.000009670442,0.00004409388,0.0060101915,0.003096224,0.82719254,0.15404543,0.0018114202],"about_ca_topic_score_codex":0.00000897327,"about_ca_topic_score_gemma":0.000057745023,"teacher_disagreement_score":0.77586585,"about_ca_system_score_codex":0.000019539888,"about_ca_system_score_gemma":0.000080252015,"threshold_uncertainty_score":0.9999048},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11137692888721303,"score_gpt":0.2852576581418257,"score_spread":0.17388072925461268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547353811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015851557,0.00044646428,0.92526054,0.00041218172,0.0011309478,0.00030996525,0.00009126368,0.00024805602,0.07051541],"genre_scores_gemma":[0.9416138,0.0001936885,0.037552122,0.00023176051,0.00043096291,0.000018656383,0.000116834075,0.000057782767,0.01978438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978812,0.00007403367,0.00064131705,0.00064408575,0.0005066363,0.000252759],"domain_scores_gemma":[0.99856913,0.000098290075,0.00054405833,0.00039794503,0.00026801418,0.00012254278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003346549,0.0003646792,0.00047384642,0.00027614392,0.00027693363,0.00006151011,0.00052876206,0.00021224296,0.0003580392],"category_scores_gemma":[0.000013978633,0.00033664098,0.0001787819,0.00010637507,0.00066115364,0.00043065145,0.00033719777,0.00022445605,0.00007624822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022727534,0.000028810247,0.000007944035,0.00006664838,0.000049746923,0.000002675952,0.00013009743,0.000030971412,0.00040550448,0.93000036,0.0003856903,0.06886881],"study_design_scores_gemma":[0.00028222392,0.00019573495,0.0016783511,0.0001643921,0.000024556099,0.000032330445,0.0000109090915,0.052188873,0.00020954822,0.9396611,0.0051387474,0.00041325975],"about_ca_topic_score_codex":0.000031003914,"about_ca_topic_score_gemma":0.0000541279,"teacher_disagreement_score":0.94002867,"about_ca_system_score_codex":0.000049788396,"about_ca_system_score_gemma":0.00006704622,"threshold_uncertainty_score":0.99990857},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04305922777302051,"score_gpt":0.27112791666149183,"score_spread":0.22806868888847132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547510902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8606221,0.072106995,0.03012301,0.002952641,0.005303602,0.006170965,0.0012673314,0.00048953644,0.020963797],"genre_scores_gemma":[0.9900593,0.0044906284,0.0006952303,0.00012046227,0.00033234348,0.00006341971,0.0003327633,0.000041815194,0.00386404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723417,0.00024743643,0.00085670257,0.00094141316,0.0002865169,0.00043374026],"domain_scores_gemma":[0.9982763,0.000110359215,0.0006277123,0.00058080436,0.00023541623,0.00016941428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004468365,0.00056304614,0.000675933,0.00010284159,0.00037444232,0.0001627174,0.00056355377,0.0004788456,0.000017647835],"category_scores_gemma":[0.00006854088,0.00037028713,0.00014145332,0.000050471295,0.0004165959,0.000033804532,0.0009449507,0.00030656977,0.000005050112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022455333,0.0004889097,0.006823833,0.007300268,0.0016822986,0.00026029727,0.0045885704,0.0017944868,0.04725775,0.6872494,0.0020236566,0.23828499],"study_design_scores_gemma":[0.02872106,0.009849009,0.02838775,0.06624881,0.0018854963,0.0012088654,0.09864203,0.21901791,0.01793018,0.27336466,0.22453849,0.030205756],"about_ca_topic_score_codex":0.00011533785,"about_ca_topic_score_gemma":0.0007957529,"teacher_disagreement_score":0.41388476,"about_ca_system_score_codex":0.000021674763,"about_ca_system_score_gemma":0.000036218706,"threshold_uncertainty_score":0.9998749},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041049066567063364,"score_gpt":0.2571781149077312,"score_spread":0.21612904834066782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760174128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017517552,0.00031434043,0.909076,0.00034604617,0.0003396942,0.0005095582,0.00003251713,0.0006673418,0.08696279],"genre_scores_gemma":[0.6503149,0.00028079716,0.28649586,0.000704938,0.001356138,0.00005237512,0.0017729456,0.00023725974,0.05878477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744105,0.00004071926,0.00056283077,0.001031507,0.00055837777,0.00036551018],"domain_scores_gemma":[0.9982625,0.00008050723,0.00041630364,0.0007764487,0.00026726886,0.0001969522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025737062,0.00050046865,0.0004693168,0.00021183999,0.00063525815,0.00028499018,0.0008172147,0.00020239872,0.00025174455],"category_scores_gemma":[0.0000047153053,0.00048794053,0.00010867827,0.00020967129,0.00039764124,0.00031875758,0.0005377935,0.00032522946,0.00028351712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010219023,0.00010424188,0.000036260994,0.00011239669,0.00012998379,0.000045084565,0.0010205582,0.00042969867,0.00013311414,0.93401253,0.009367512,0.0545984],"study_design_scores_gemma":[0.00040684972,0.00032049956,0.00066355884,0.00023687173,0.00008007641,0.0000916735,0.000033151795,0.742001,0.00010535937,0.18851045,0.06649919,0.0010513217],"about_ca_topic_score_codex":0.000034683882,"about_ca_topic_score_gemma":0.000048275877,"teacher_disagreement_score":0.7455021,"about_ca_system_score_codex":0.00003732193,"about_ca_system_score_gemma":0.0001175824,"threshold_uncertainty_score":0.99975723},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Position (finance); Computer science; Class (philosophy); Algorithm; Bounded function; Mathematics; Artificial intelligence","score_opus":0.044618863842752675,"score_gpt":0.27305922008322947,"score_spread":0.2284403562404768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788443823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011922691,0.0009776377,0.89138603,0.0001917851,0.00084238773,0.0003963183,0.00008873483,0.00034652825,0.09384787],"genre_scores_gemma":[0.9015602,0.0005014869,0.07302182,0.00050715794,0.00073510816,0.00002078199,0.00070230395,0.00009223328,0.022858895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983133,0.00005146281,0.00051248865,0.0005233628,0.00039302494,0.0002063624],"domain_scores_gemma":[0.99878085,0.000081209044,0.00041906963,0.00040798757,0.00021036694,0.00010053458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015292138,0.0003062932,0.00039347986,0.00027732793,0.00017471373,0.000077342585,0.0005910503,0.00019366085,0.00046588862],"category_scores_gemma":[0.0000074720833,0.0003136767,0.000121562516,0.00016476976,0.00026424133,0.0004611556,0.0003530606,0.00018983666,0.000049362094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015947246,0.000045256475,0.0000031632198,0.00008909743,0.000078230936,0.0000082673405,0.0023160407,0.0006314738,0.00017413993,0.96081656,0.005622313,0.030199502],"study_design_scores_gemma":[0.00020910136,0.00016020985,0.00020261783,0.00013715232,0.000029033728,0.000013179422,0.000055992918,0.3042754,0.00015710956,0.6934227,0.0009520034,0.00038552858],"about_ca_topic_score_codex":0.000064971486,"about_ca_topic_score_gemma":0.00001490271,"teacher_disagreement_score":0.88963753,"about_ca_system_score_codex":0.000024653618,"about_ca_system_score_gemma":0.000061544844,"threshold_uncertainty_score":0.9999315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Parallelism (grammar); Computer science; Trajectory; Parallel computing; Physics","score_opus":0.06733329559468068,"score_gpt":0.2837957006556817,"score_spread":0.21646240506100103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954952021","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2743788,0.0025463994,0.04294672,0.00056760665,0.0060864356,0.0023084907,0.0015412794,0.0013024693,0.6683218],"genre_scores_gemma":[0.9025067,0.00035958906,0.0069859177,0.00021275824,0.0013734518,0.000016836768,0.003243186,0.0001489945,0.08515257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988293,0.00002515083,0.0002472358,0.00036685757,0.00032901153,0.00020242858],"domain_scores_gemma":[0.99945796,0.000045121393,0.00003866736,0.0001919282,0.00008640679,0.00017989324],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000088362365,0.00025002996,0.00028538896,0.00017619673,0.000088275745,0.000046834888,0.00017032384,0.00016687917,0.0021394854],"category_scores_gemma":[0.0000026026232,0.0002937814,0.00008654302,0.0000468318,0.00006361832,0.00013689601,0.000063592386,0.00026984693,0.00035537273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032649882,0.00019288715,0.0010600878,0.0009401861,0.0016733999,0.00010025302,0.0059400443,0.2104099,0.0019163056,0.5118989,0.09459436,0.1709472],"study_design_scores_gemma":[0.0012930953,0.00048729885,0.030814797,0.00036373394,0.00014848619,0.000009763877,0.0003258317,0.34376064,0.00006922494,0.28758353,0.33311397,0.0020296308],"about_ca_topic_score_codex":0.00018764356,"about_ca_topic_score_gemma":0.00016440915,"teacher_disagreement_score":0.6281279,"about_ca_system_score_codex":0.000052241216,"about_ca_system_score_gemma":0.00004466114,"threshold_uncertainty_score":0.9999514},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Robustness (evolution); Convergence (economics); Mathematical optimization; Computer science; Optimal control; Mathematics","score_opus":0.04616066726937957,"score_gpt":0.2798371538038212,"score_spread":0.23367648653444162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172003993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008406205,0.0005915348,0.97593904,0.0011589484,0.00015416289,0.00024694015,0.0000052213936,0.00016600516,0.013331952],"genre_scores_gemma":[0.19162445,0.0009323713,0.7603261,0.00047459657,0.00024340741,0.000046946407,0.00020041865,0.00007767754,0.04607402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984337,0.00007197747,0.0003449016,0.0006882406,0.00024871237,0.00021245607],"domain_scores_gemma":[0.99936414,0.00007425781,0.00013797753,0.00017230978,0.00010594604,0.00014535498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028266737,0.00027450465,0.00035124307,0.0002900079,0.0003282667,0.0002126578,0.00018198736,0.00013124125,0.000017453107],"category_scores_gemma":[0.000025005813,0.0003071301,0.000033735923,0.00016253542,0.00007257604,0.000234547,0.00043862642,0.00048467115,0.0000031435713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043411687,0.000029297444,0.00012280486,0.0001311028,0.000024070112,0.000012384584,0.0019625092,0.4213338,0.0000063581742,0.4666708,0.00016695193,0.109535575],"study_design_scores_gemma":[0.00017788855,0.00006860158,0.0009251403,0.00012427899,0.000010796876,0.000025343217,0.000036376936,0.95840627,0.0000010089776,0.03903609,0.0008605547,0.00032766638],"about_ca_topic_score_codex":0.000044759083,"about_ca_topic_score_gemma":0.00006511181,"teacher_disagreement_score":0.5370725,"about_ca_system_score_codex":0.000020171023,"about_ca_system_score_gemma":0.00006116922,"threshold_uncertainty_score":0.9999381},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Cellular automaton; Decomposition; Value (mathematics); Mathematics; Computer science; Algorithm; Chemistry; Statistics","score_opus":0.03859784314250021,"score_gpt":0.3027714591920461,"score_spread":0.2641736160495459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409829874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008273148,0.0005213288,0.9699522,0.0020204673,0.0004050478,0.0011227556,0.00017437218,0.0002870535,0.025433997],"genre_scores_gemma":[0.62971514,0.00060127553,0.26138538,0.0039132363,0.0016898614,0.0014740183,0.011661776,0.00027455343,0.089284755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808097,0.000057763005,0.0005495278,0.0007082179,0.00032727903,0.0002762221],"domain_scores_gemma":[0.9987146,0.00020466311,0.00033190975,0.00049942126,0.00016907498,0.000080275866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003062357,0.0003522012,0.0003188156,0.00013410812,0.0008753068,0.00030636424,0.00079904177,0.00017990975,0.000033981472],"category_scores_gemma":[0.00000561903,0.0003273598,0.00016572705,0.00012681293,0.00015133915,0.0002568693,0.00040017412,0.00025702035,0.00002466344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046510745,0.000049400118,0.0000028124427,0.00015713488,0.00006732299,0.000001495329,0.00020997648,0.00026597275,0.0002573888,0.8875548,0.026862357,0.084566675],"study_design_scores_gemma":[0.00026311917,0.00006793007,0.000037174643,0.000116737836,0.00006144297,0.0000071743366,0.000008413224,0.56848866,0.00017929508,0.38594204,0.044476632,0.00035140588],"about_ca_topic_score_codex":0.00007755631,"about_ca_topic_score_gemma":0.000025086041,"teacher_disagreement_score":0.70856684,"about_ca_system_score_codex":0.00005154088,"about_ca_system_score_gemma":0.00010791081,"threshold_uncertainty_score":0.99991786},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05078467912281573,"score_gpt":0.2640733069235046,"score_spread":0.21328862780068888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W853868720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32645345,0.00042878216,0.6637666,0.00015409657,0.00045474872,0.0013807982,0.00014854486,0.00012672145,0.007086224],"genre_scores_gemma":[0.99060035,0.00003830037,0.00866344,0.00001048977,0.00002335652,0.0000074559557,0.00018821715,0.000015879703,0.00045250083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979511,0.00013587691,0.0007963765,0.0005313624,0.00043991226,0.00014538737],"domain_scores_gemma":[0.998059,0.000101617334,0.00085719523,0.00061042665,0.00031724476,0.000054566295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042785922,0.00023454972,0.00048472307,0.00016445416,0.00012589648,0.000021014945,0.00062637107,0.0001474835,0.000028501823],"category_scores_gemma":[0.000013862975,0.00021436554,0.00010405467,0.0002860169,0.00046746508,0.00019099735,0.00026064494,0.00013931785,0.0000029431453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090902315,0.0014555211,0.0013926682,0.002056103,0.00015595903,0.0000028586853,0.007434822,0.007889508,0.02984922,0.89359325,0.004149002,0.051930163],"study_design_scores_gemma":[0.0004080308,0.00034010923,0.009651021,0.0004442953,0.000057486708,0.000004570352,0.000040170333,0.638747,0.007582254,0.3412076,0.0011183076,0.00039919818],"about_ca_topic_score_codex":0.0008281986,"about_ca_topic_score_gemma":0.00024185296,"teacher_disagreement_score":0.6641469,"about_ca_system_score_codex":0.000027130935,"about_ca_system_score_gemma":0.00009647077,"threshold_uncertainty_score":0.8741573},"labels":[],"label_agreement":null}]}