{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22284506,0.000821759,0.75760585,0.0006160815,0.000067333,0.000081507205,0.00027626805,0.0002079076,0.017478235],"genre_scores_gemma":[0.8823976,0.00044157758,0.110525385,0.0000735644,0.000054577933,0.00009861802,0.0003819584,0.00014349548,0.0058831824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997421,0.0000983942,0.000016886144,0.00005256416,0.00006240427,0.00002754807],"domain_scores_gemma":[0.9987306,0.0006778943,0.00014983171,0.00019720811,0.00013978443,0.00010479149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007523836,0.0005547654,0.00038849402,0.001121896,0.00037517704,0.0014710439,0.00060077396,0.0008160064,0.0031347957],"category_scores_gemma":[0.0051605143,0.00026501925,0.0005520475,0.000771838,0.0015167334,0.00287125,0.0012931796,0.0014515091,0.00033067627],"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.00011068263,0.00009317514,0.004774803,0.00011310918,0.000053256026,0.00016522898,0.00052281003,0.20808606,0.0060552796,0.70936406,0.0023561446,0.06830545],"study_design_scores_gemma":[0.0000045222946,0.000023343926,0.0013169631,0.000016650632,0.000007048385,0.00010841084,0.00009201849,0.6975648,0.0004565122,0.2993459,0.0010501232,0.000013740134],"about_ca_topic_score_codex":0.00080931577,"about_ca_topic_score_gemma":0.0009108503,"teacher_disagreement_score":0.0031347957,"about_ca_system_score_codex":0.00076431094,"about_ca_system_score_gemma":0.00027103003,"threshold_uncertainty_score":0.010486901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013428669,0.010100556,0.7549411,0.025749892,0.0005945539,0.00019611992,0.00032381274,0.0002709068,0.19439447],"genre_scores_gemma":[0.5113692,0.010188909,0.4421989,0.0028820902,0.001109731,0.0014003086,0.0005081303,0.0001892314,0.030153487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883264,0.00047652764,0.00007457731,0.00016198773,0.00034706053,0.000107180844],"domain_scores_gemma":[0.99745136,0.0015369143,0.00019556542,0.000344279,0.00026942612,0.00020235144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022764574,0.0012952412,0.0008492934,0.002427301,0.001260933,0.006644577,0.0027126446,0.0030229248,0.0070708557],"category_scores_gemma":[0.0054637375,0.0006403939,0.001344615,0.0019535136,0.0088467365,0.010529349,0.0022354673,0.0049157883,0.0009263111],"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.0000018653319,0.00000602036,0.000033334567,0.000015355152,0.0000020990278,0.000009708482,0.00015953463,0.00042346452,0.00004212851,0.99688584,0.0005339024,0.0018866461],"study_design_scores_gemma":[0.000004599689,0.0000052263263,0.00008259587,0.000026380827,0.000003888538,0.00005387342,0.00010916836,0.004556525,0.00004762967,0.98843676,0.006667151,0.0000062838585],"about_ca_topic_score_codex":0.0021070594,"about_ca_topic_score_gemma":0.0021544052,"teacher_disagreement_score":0.0070708557,"about_ca_system_score_codex":0.0029939758,"about_ca_system_score_gemma":0.0018988738,"threshold_uncertainty_score":0.023654401},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017427202,0.023105215,0.2951623,0.010780048,0.0015946912,0.00006693679,0.00017050024,0.00035475925,0.6513384],"genre_scores_gemma":[0.8181577,0.0155465575,0.071204975,0.00216538,0.0022117204,0.0002250312,0.00017305996,0.00018828257,0.09012739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993957,0.00024953444,0.000024400224,0.00010105668,0.00017100375,0.000058313573],"domain_scores_gemma":[0.9993617,0.00037067203,0.000029400793,0.00014611463,0.000054969154,0.00003721961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007067066,0.00056669256,0.000615757,0.000770556,0.0010231395,0.0053233104,0.001381389,0.0025330563,0.0071548447],"category_scores_gemma":[0.0026314124,0.00041890307,0.00056501036,0.00096887647,0.009065839,0.008666268,0.0017173634,0.0033724303,0.0014670003],"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.000002746862,0.0000025081688,0.000009185453,0.00001577779,8.525587e-7,0.0000070604447,0.000034640354,0.00030697777,0.000069489186,0.9973756,0.0006344993,0.0015406583],"study_design_scores_gemma":[0.0000026572773,0.000002583058,0.000011859809,0.000014533174,0.000001197258,0.00002521017,0.000013373746,0.0018154536,0.00007800432,0.9912047,0.0068276753,0.0000027519518],"about_ca_topic_score_codex":0.0006181608,"about_ca_topic_score_gemma":0.00045722787,"teacher_disagreement_score":0.0071548447,"about_ca_system_score_codex":0.0017449405,"about_ca_system_score_gemma":0.00081564963,"threshold_uncertainty_score":0.023935378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019430252,0.013983072,0.92477405,0.006893374,0.00031612354,0.00006752016,0.00049652247,0.0005550051,0.033484004],"genre_scores_gemma":[0.47373164,0.013906415,0.4978003,0.00090159185,0.0007287341,0.0004856467,0.00080603425,0.00019976562,0.0114397835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999526,0.00022426428,0.00002548031,0.000062525825,0.00012605221,0.000035644014],"domain_scores_gemma":[0.9977775,0.0018789377,0.00006943926,0.00014053402,0.00008200231,0.000051637733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011374267,0.00069113827,0.0011047459,0.0008561682,0.0005187318,0.001838393,0.0017451306,0.0010758498,0.0047351443],"category_scores_gemma":[0.004474402,0.000611664,0.0009831768,0.0010455501,0.0017890494,0.002058874,0.0017726355,0.0019495803,0.00046409448],"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.000049773604,0.000047532634,0.00047625406,0.00027828122,0.00012266729,0.00005386893,0.00005889964,0.4657875,0.0004215307,0.4767256,0.0038210438,0.052157093],"study_design_scores_gemma":[0.000014300558,0.000007836679,0.000058059333,0.000020311703,0.000011351978,0.000015782229,0.000014208946,0.5184012,0.00015556252,0.4779296,0.0033648536,0.0000068711547],"about_ca_topic_score_codex":0.0023009595,"about_ca_topic_score_gemma":0.003418965,"teacher_disagreement_score":0.0047351443,"about_ca_system_score_codex":0.001137463,"about_ca_system_score_gemma":0.0011711138,"threshold_uncertainty_score":0.01584065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068302006,0.007328944,0.80348986,0.01007259,0.0005005473,0.000089548514,0.0008937447,0.00046024137,0.10886248],"genre_scores_gemma":[0.8912647,0.0044319993,0.082970165,0.00071292964,0.0010655881,0.0002819924,0.0008133969,0.0002761084,0.018183269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530005,0.0015060144,0.00036889192,0.0006691581,0.0017796784,0.00037615674],"domain_scores_gemma":[0.98210835,0.013554979,0.0005972575,0.0021051895,0.0013482119,0.0002860436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032340612,0.00073574984,0.0011457327,0.001516446,0.0012933636,0.0071309865,0.0023301933,0.002397587,0.007801377],"category_scores_gemma":[0.020711126,0.0008607362,0.0014606905,0.0018900593,0.005354817,0.012132211,0.0030409864,0.0047057923,0.0009301876],"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.000013105954,0.0000072306407,0.00012149027,0.000051197552,0.000009155985,0.000024746163,0.000101220074,0.0037028666,0.00017998181,0.9882273,0.0011565761,0.0064051165],"study_design_scores_gemma":[0.0000026191522,0.0000025900308,0.000046937006,0.000009227526,0.0000036273896,0.00002813277,0.000016474916,0.012538424,0.00012684273,0.9860707,0.0011487555,0.000005780785],"about_ca_topic_score_codex":0.0013032474,"about_ca_topic_score_gemma":0.0007856637,"teacher_disagreement_score":0.007801377,"about_ca_system_score_codex":0.0036771318,"about_ca_system_score_gemma":0.0017336196,"threshold_uncertainty_score":0.026679575},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23902434,0.011061516,0.5323822,0.023499906,0.0010984645,0.00009503507,0.00024069421,0.0013043126,0.19129357],"genre_scores_gemma":[0.899995,0.003247929,0.08033406,0.0011037546,0.0004869973,0.00012005877,0.00015221671,0.000469217,0.01409076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.00015881269,0.00002784002,0.00012856913,0.00014633343,0.00007360473],"domain_scores_gemma":[0.99843365,0.0010491406,0.00007813346,0.00024938458,0.00010012234,0.000089597714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985422,0.00031925045,0.0005532417,0.0003742242,0.00094497605,0.0026631309,0.00080415333,0.0012787818,0.0023796558],"category_scores_gemma":[0.0045240726,0.0004227085,0.0006790668,0.0005464642,0.0059468364,0.007622942,0.0018643892,0.0038357307,0.00048004524],"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.000021111697,0.00000970334,0.00022612435,0.000052912877,0.000009485832,0.000060553004,0.00070156524,0.0034904105,0.0013272789,0.9728309,0.0016540858,0.019615913],"study_design_scores_gemma":[0.000004259562,0.0000044041853,0.000087232205,0.000010099093,0.0000029909459,0.00004001181,0.000055414544,0.005022573,0.0003498188,0.9912668,0.003149321,0.0000070720816],"about_ca_topic_score_codex":0.0007173869,"about_ca_topic_score_gemma":0.0005876855,"teacher_disagreement_score":0.0026631309,"about_ca_system_score_codex":0.0008131035,"about_ca_system_score_gemma":0.0007640892,"threshold_uncertainty_score":0.007960737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02748046,0.0029176017,0.9406067,0.0005750353,0.00035186668,0.000058961145,0.00054894615,0.0015845029,0.025875885],"genre_scores_gemma":[0.33853546,0.004391874,0.63976526,0.00017635025,0.00019461047,0.00020897739,0.0016511108,0.00048946164,0.014586923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969137,0.00005186552,0.000026023397,0.000094944204,0.00009685458,0.000038960232],"domain_scores_gemma":[0.99951637,0.00027070814,0.00002618425,0.00008947463,0.000071460614,0.000025697325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026415373,0.0010453291,0.0011015413,0.0010335634,0.0005893582,0.0022912202,0.0014158087,0.0008675044,0.0072957603],"category_scores_gemma":[0.0025204483,0.0005749486,0.0009542965,0.0020182242,0.00073084945,0.0028196443,0.0015035486,0.001382451,0.0018111382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00008241051,0.000041410833,0.00060945464,0.0004755819,0.00007707407,0.0000679804,0.0001470873,0.3856835,0.004177754,0.35348824,0.01115774,0.24399176],"study_design_scores_gemma":[0.0000107932665,0.000012916259,0.00010525946,0.00004526281,0.000016089944,0.000040660085,0.000036767568,0.44918075,0.0020350653,0.5352498,0.013251096,0.0000155889],"about_ca_topic_score_codex":0.0024623005,"about_ca_topic_score_gemma":0.0038783206,"teacher_disagreement_score":0.0072957603,"about_ca_system_score_codex":0.0012917449,"about_ca_system_score_gemma":0.00090144546,"threshold_uncertainty_score":0.024406731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10539824,0.0012183938,0.74274117,0.002701666,0.00041186175,0.00009834841,0.00060163974,0.0012693811,0.1455593],"genre_scores_gemma":[0.89822656,0.00080148724,0.062186826,0.00033689273,0.00029572565,0.00020207492,0.0005759245,0.00048072793,0.036893737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880564,0.00044721493,0.0000801495,0.00020946075,0.00030059743,0.00015691492],"domain_scores_gemma":[0.9976192,0.001327971,0.0001088543,0.00052164326,0.00028739197,0.00013488518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013404526,0.0007348351,0.0007918284,0.0006432183,0.0010389339,0.0049174004,0.00185621,0.0018052515,0.009569744],"category_scores_gemma":[0.004907408,0.0006294007,0.0012624424,0.00067278615,0.003397326,0.006283021,0.001986943,0.0037853497,0.0024597652],"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.0000138044,0.0000068728614,0.00003884506,0.000020573107,0.000002475474,0.000033913526,0.0001435705,0.0018389873,0.0004952195,0.9953607,0.0004769572,0.0015680977],"study_design_scores_gemma":[0.0000072051075,0.0000046421237,0.000017875584,0.0000083128225,0.0000030807912,0.00003064538,0.000022010905,0.014444406,0.0003475592,0.9836826,0.001426925,0.0000048100146],"about_ca_topic_score_codex":0.00062955037,"about_ca_topic_score_gemma":0.0006646338,"teacher_disagreement_score":0.009569744,"about_ca_system_score_codex":0.0014262024,"about_ca_system_score_gemma":0.0008413422,"threshold_uncertainty_score":0.032013953},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022745142,0.07340739,0.10406683,0.087176345,0.0030987563,0.000070252434,0.00021954191,0.00042396135,0.7087918],"genre_scores_gemma":[0.6524461,0.074475385,0.06424413,0.011903717,0.0045344196,0.00038524592,0.0002967116,0.00081306073,0.1909013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993974,0.00020256011,0.000020431837,0.0001410387,0.00018024302,0.00005832457],"domain_scores_gemma":[0.99887997,0.00068748905,0.00003831335,0.00020015935,0.00010842799,0.00008553035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013506854,0.00056628004,0.00079936424,0.0009980586,0.0018194191,0.0067560617,0.0010582635,0.002355939,0.006646872],"category_scores_gemma":[0.0022732571,0.00042698704,0.0004392019,0.00091166334,0.017501093,0.016949218,0.003253654,0.0072917384,0.0016667388],"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.0000047279304,0.000005188586,0.00001796764,0.000027015227,0.0000014128831,0.000009575187,0.00019858904,0.00015467191,0.000110320194,0.99205047,0.0024389275,0.0049811355],"study_design_scores_gemma":[0.0000027600584,0.000004569737,0.000032972624,0.00003919597,7.8038636e-7,0.00002445557,0.000102363985,0.00046309622,0.000071622795,0.9679363,0.03131776,0.000004111173],"about_ca_topic_score_codex":0.0014587174,"about_ca_topic_score_gemma":0.0016438641,"teacher_disagreement_score":0.0067560617,"about_ca_system_score_codex":0.0030109345,"about_ca_system_score_gemma":0.0018697218,"threshold_uncertainty_score":0.02223599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017755996,0.001953296,0.96590346,0.0017277375,0.00012447138,0.000038194215,0.0001501904,0.00025749265,0.012089202],"genre_scores_gemma":[0.8223984,0.0033626754,0.16361879,0.0004974224,0.00038473526,0.0002846395,0.00040657562,0.00033301348,0.0087137325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967374,0.0016030564,0.00018059478,0.00056961883,0.00071402406,0.00019532222],"domain_scores_gemma":[0.9656722,0.030497026,0.001146222,0.0016924159,0.0006854841,0.00030658187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041667526,0.0011716125,0.0020841416,0.0011406787,0.0008269441,0.0037868693,0.001942915,0.0023402437,0.0036142801],"category_scores_gemma":[0.036026318,0.0010735583,0.001684516,0.0013136187,0.0054511027,0.005917399,0.0038357344,0.005498552,0.00033889042],"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.000073094314,0.000025460491,0.000393126,0.0001843288,0.000059662445,0.0000702113,0.00014923672,0.45589012,0.00040861566,0.52301466,0.0013863675,0.018345147],"study_design_scores_gemma":[0.00000704717,0.000012555752,0.00008447338,0.00002109391,0.000008272958,0.000017124108,0.000022109452,0.52724755,0.00017253814,0.4716639,0.00073389226,0.000009460863],"about_ca_topic_score_codex":0.0039719697,"about_ca_topic_score_gemma":0.0019899085,"teacher_disagreement_score":0.0041667526,"about_ca_system_score_codex":0.0032621704,"about_ca_system_score_gemma":0.0014170591,"threshold_uncertainty_score":0.023668885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019246314,0.00043931312,0.9642611,0.00047874133,0.00007220286,0.00004863715,0.00012985873,0.00018410395,0.015139691],"genre_scores_gemma":[0.3105323,0.0012715387,0.66936123,0.0001942723,0.00014472753,0.00031279607,0.0005315236,0.00039564667,0.017255997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999723,0.00008042534,0.000018137052,0.00006050218,0.00007010396,0.00004782325],"domain_scores_gemma":[0.9989442,0.00083211804,0.000033525368,0.000087683264,0.00007519427,0.000027255881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059976045,0.00071906,0.0011468033,0.0005030828,0.00058354985,0.0019330436,0.0014533686,0.0013672997,0.0056881984],"category_scores_gemma":[0.0034797778,0.00064558187,0.0012758924,0.0007556616,0.0013261448,0.0026774995,0.0015432972,0.0025030726,0.00088859576],"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.000055096287,0.000045984696,0.00035901845,0.00028295856,0.000038028567,0.00010864618,0.00018944654,0.17491329,0.0027003894,0.7449853,0.0060853628,0.07023654],"study_design_scores_gemma":[0.000012793499,0.000007433034,0.000035723642,0.000015568286,0.0000070118376,0.000023584138,0.000031992156,0.28268883,0.0007327091,0.71438545,0.0020529376,0.000006004886],"about_ca_topic_score_codex":0.0018113677,"about_ca_topic_score_gemma":0.002060136,"teacher_disagreement_score":0.0056881984,"about_ca_system_score_codex":0.0007959028,"about_ca_system_score_gemma":0.0009690006,"threshold_uncertainty_score":0.019028902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05147611,0.0033523988,0.78096884,0.0023594967,0.00058771484,0.00007440268,0.0002819517,0.00086599204,0.1600331],"genre_scores_gemma":[0.6976901,0.0019080652,0.27363914,0.00048422793,0.00028316467,0.00015075135,0.00015442421,0.000343989,0.025346095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995764,0.00015878076,0.00002240666,0.00007533735,0.00012221675,0.00004486414],"domain_scores_gemma":[0.99900705,0.000708463,0.000026562919,0.00012758763,0.00008763971,0.00004268421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058401586,0.00042986256,0.000794174,0.0008476134,0.0014111942,0.0019456011,0.0010672173,0.0016803568,0.0063052787],"category_scores_gemma":[0.003849082,0.0004884015,0.0010515462,0.0010806394,0.0029110915,0.002799815,0.0013497479,0.0019663956,0.0006709593],"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.000006207666,0.000004354421,0.00003991711,0.000024367771,0.0000039781376,0.000040952902,0.00008171352,0.0025303243,0.00051624817,0.9932306,0.00068268675,0.002838679],"study_design_scores_gemma":[0.0000063331886,0.000003920309,0.000051149807,0.000008364196,0.00000375644,0.0000570514,0.000014171154,0.022450851,0.00033289831,0.9739968,0.0030667433,0.000007932735],"about_ca_topic_score_codex":0.0021351592,"about_ca_topic_score_gemma":0.0019075569,"teacher_disagreement_score":0.0063052787,"about_ca_system_score_codex":0.0011272739,"about_ca_system_score_gemma":0.00048093108,"threshold_uncertainty_score":0.02109325},"labels":[],"label_agreement":null}]}